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
| /** @format */ | |
| hero-image { | |
| background-image: linear-gradient( | |
| rgba($color: #483a36, $alpha: 0.5), | |
| rgba($color: #483a36, $alpha: 0.5) | |
| ), | |
| url('/images/hero-image_4-small.jpg'); | |
| background-size: cover; |
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
| # | |
| # To learn more about a Podspec see http://guides.cocoapods.org/syntax/podspec.html. | |
| # Run `pod lib lint jitsi_meet.podspec' to validate before publishing. | |
| # | |
| Pod::Spec.new do |s| | |
| s.name = 'jitsi_meet' | |
| s.version = '0.0.1' | |
| s.summary = 'Jitsi Meet Plugin' | |
| s.description = <<-DESC | |
| Jitsi Meet Plugin |
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
| find /proc/*/fd -user "$USER" -lname anon_inode:inotify -printf '%hinfo/%f\n' 2>/dev/null | xargs cat | grep -c '^inotify' | |
| https://stackoverflow.com/questions/62206460/jest-watch-error-enospc-system-limit-for-number-of-file-watchers-reached | |
| echo fs.inotify.max_user_watches=524288 | sudo tee -a /etc/sysctl.conf | |
| sudo sysctl -p | |
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
| var value = '675-805-714'; | |
| var numberPattern = /\d+/g; | |
| value = value.match( numberPattern ).join([]); | |
| alert(value); | |
| //Show: 675805714 | |
| //https://stackoverflow.com/a/37817760 |
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
| const sleep = ms => { | |
| return new Promise(resolve => setTimeout(resolve, ms)) | |
| } |
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
| function biggest(input) { | |
| //spit into 2 array | |
| input = input.split('-'); | |
| //split each of the 2 array into part of number that still has type of string each | |
| let first = input[0].split(' '); | |
| let second = input[1].split(' '); | |
| //initiate empty array and total var | |
| let intFirst = [], | |
| intSecond = [], | |
| total = 0; |
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
| const assert = require('assert') | |
| function ubahkata(first,second) { | |
| let sameWord=0; | |
| tempFirst=first.split('').sort().join('') | |
| tempSecond=second.split('').sort().join('') | |
| for (let j=0;j<second.length;j++) { | |
| for( let i=0; i<first.length; i++) { | |
| if( tempFirst[i] == tempSecond[j] ) { | |
| tempFirst=tempFirst.slice(0,i)+tempFirst.slice(i+1,tempFirst.length) |
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
| const assert = require('assert') | |
| function crossLine(line) { | |
| sumbu=line.split("-") /*memisahkan sumbu X dan Y*/ | |
| let total=0; | |
| if (sumbu[0].length>=sumbu[1].length) { /*menyimpan sumbu mana yang isinya lebih sedikit untuk kemudian dijadikan parameter untuk loop */ | |
| more=sumbu[0].split(" "); | |
| less=sumbu[1].split(" "); | |
| } else { | |
| more=sumbu[1].split(" "); |
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
| const assert = require('assert') | |
| function minesweeper(deret) { | |
| let deretInt= (deret.split(" ")) | |
| let bomb=0 | |
| if (deretInt[0]=="1" && deretInt[1]=="0" || deretInt[0]==2 ) { bomb++; //untuk pertama apabila 1 kemudian 0 berati R 1 0 juga saat kotak pertama = 2, maka pasti ada Ranjau di paling depan | |
| } | |
| for (let i=1;i<deretInt.length;i++) { | |
| if (deretInt[i] == "1" && deretInt[i-1] == "1" ) { |
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
| const assert = require('assert') | |
| function checkdate(str) { | |
| //split to arr | |
| newDate= str.split(/[ /-]+/); | |
| valid=false; | |
| dateValid=false; | |
| //check tahun valid 4 karakter | |
| for (let i=0;i<newDate.length;i++) { |
NewerOlder