This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| object Graph { | |
| const val ROOT = "root_graph" | |
| const val AUTHENTICATION = "auth_graph" | |
| const val MAIN = "main_graph" | |
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Handler(Looper.myLooper()!!).postDelayed({ | |
| // codigo a ser executado depois de 1 segundo (1000ms) | |
| }, 1000) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Handler(Looper.myLooper()!!).postDelayed({ | |
| // codigo a ser executado depois de 1 segundo (1000ms) | |
| }, 1000) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Handler(Looper.myLooper()!!).postDelayed({ | |
| // codigo a ser executado depois de 1 segundo (1000ms) | |
| }, 1000) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Handler(Looper.myLooper()!!).postDelayed({ | |
| // codigo a ser executado depois de 1 segundo (1000ms) | |
| }, 1000) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| name: Android Pull Request & Master CI | |
| on: | |
| pull_request: | |
| branches: | |
| - 'master' | |
| push: | |
| branches: | |
| - 'master' |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| name: Android Feature Branch CI | |
| on: | |
| push: | |
| branches: | |
| - '*' | |
| - '!master' | |
| - '!release*' | |
| jobs: |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| package br.com.neon.helpcenter.ui.chat | |
| import android.content.Context | |
| import android.content.Intent | |
| import android.os.Bundle | |
| import android.widget.EditText | |
| import android.widget.ImageView | |
| import androidx.constraintlayout.widget.ConstraintLayout | |
| import androidx.recyclerview.widget.LinearLayoutManager | |
| import androidx.recyclerview.widget.RecyclerView |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| public void printArray(int array[][]) { | |
| for (int i = 0; i < array.length; i++) { | |
| for (int j = 0; j < array[i].length; j++) { | |
| System.out.print(array[i][j] + " "); | |
| } | |
| System.out.println(); | |
| } | |
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| boolean search(int numbers[], int x) { | |
| for (int i = 0; i < numbers.length; i++) | |
| if (numbers[i] == x) { | |
| return true; | |
| } | |
| return false; | |
| } |