Instantly share code, notes, and snippets.

View 1.js
console.log('Start') // Will execute first
setTimeout(1000, function thisWillHappenLater () {
console.log('After Timeout') // Will execute third (after 1 second)
})
console.log('Keep going') // Will execute second
View pull-image.sh
function pull_image () {
echo $1
devdocker_image="devdocker.mulesoft.com:18078/mulesoft/$1"
apiserver_image="apiserver:5000/mulesoft/$1"
docker pull $devdocker_image
docker tag $devdocker_image $apiserver_image
docker push $apiserver_image
}
View gist:73d4ae8077dce91528b5bcc907d5f9b0
FROM ubuntu:latest
RUN useradd --uid 2000 -ms /bin/bash example
RUN mkdir -p /etc/example
RUN chown -Rv 2000 /etc/example
RUN ls -la /etc | grep example
USER 2000
CMD ["sh", "-c ls -la /etc | grep example"]
View install-mongo.sh
apt-key adv --keyserver hkp://keyserver.ubuntu.com:80 --recv 0C49F3730359A14518585931BC711F9BA15703C6
echo "deb [ arch=amd64 ] http://repo.mongodb.org/apt/ubuntu trusty/mongodb-org/3.4 multiverse" | tee /etc/apt/sources.list.d/mongodb-org-3.4.list
apt-get update -y
apt-get install -y mongodb-org
View 1-fixed.py
import requests
import xlwt
import datetime
from bs4 import BeautifulSoup
# Turn lines of code used multiples times into functions
def fetch_soup(uri):
response = requests.get(uri)
# Add "html.paser" so beautiful soup doesn't complain
return BeautifulSoup(response.content, "html.parser")
View keybase.md

Keybase proof

I hereby claim:

  • I am thejsj on github.
  • I am hiphipjorge (https://keybase.io/hiphipjorge) on keybase.
  • I have a public key whose fingerprint is 8470 BA42 28BE A599 BD6D 629E 0B0E 77B6 4B7B BD88

To claim this, I am signing this object:

View pearson-hashing.js
'use strict'
// Ideally, this table would be shuffled...
// 256 will be the highest value provided by this hashing function
let table = [...new Array(256)].map((_, i) => i)
const hash8 = (message, table) => {
return message.split('').reduce((hash, c) => {
return table[(hash + c.charCodeAt(0)) % (table.length - 1)]
}, message.length % (table.length - 1))
View sieve.js
function sieve (n) {
let all = [...Array(n).keys()].map(x => true)
for (let i = 2; i <= Math.sqrt(n); i += 1) {
if (all[i]) {
for (let j = i * i; j < n; j += i) {
all[j] = false
}
}
}
return all.map((x, i) => {
View permutate.js
// http://stackoverflow.com/a/22063440/2684055
function allPermutations (arr) {
function permutate (res, value, key, arr) {
if (arr.length <= 1) return [value]
// Eliminate current value
let result = arr.slice(0, key).concat(arr.slice(key + 1))
.reduce(permutate, [])
.map(perm => [value].concat(perm))
return res.concat(result)
}
View index.js
var a = [1, 2, 3]
var b = a // b now points to the same array as a
a === b // true
var c = [...a] // Makes a shallow copy of the array
c === a // false
a.push(4)
b // [1, 2, 3, 4]
c // [1, 2, 3]
a = null
b // [1, 2, 3, 4] Still point to the same array