git clone git@github.com:YOUR-USERNAME/YOUR-FORKED-REPO.git
cd into/cloned/fork-repo
git remote add upstream git://github.com/ORIGINAL-DEV-USERNAME/REPO-YOU-FORKED-FROM.git
git fetch upstream
| brew update | |
| brew versions FORMULA | |
| cd `brew --prefix` | |
| git checkout HASH Library/Formula/FORMULA.rb # use output of "brew versions" | |
| brew install FORMULA | |
| brew switch FORMULA VERSION | |
| git checkout -- Library/Formula/FORMULA.rb # reset formula | |
| ## Example: Using Subversion 1.6.17 | |
| # |
L1 cache reference ......................... 0.5 ns
Branch mispredict ............................ 5 ns
L2 cache reference ........................... 7 ns
Mutex lock/unlock ........................... 25 ns
Main memory reference ...................... 100 ns
Compress 1K bytes with Zippy ............. 3,000 ns = 3 µs
Send 2K bytes over 1 Gbps network ....... 20,000 ns = 20 µs
SSD random read ........................ 150,000 ns = 150 µs
Read 1 MB sequentially from memory ..... 250,000 ns = 250 µs
| import SimpleHTTPServer | |
| class CORSHTTPRequestHandler(SimpleHTTPServer.SimpleHTTPRequestHandler): | |
| def send_head(self): | |
| """Common code for GET and HEAD commands. | |
| This sends the response code and MIME headers. | |
| Return value is either a file object (which has to be copied | |
| to the outputfile by the caller unless the command was HEAD, | |
| and must be closed by the caller under all circumstances), or |
| #!/bin/bash | |
| # bash generate random alphanumeric string | |
| # | |
| # bash generate random 32 character alphanumeric string (upper and lowercase) and | |
| NEW_UUID=$(cat /dev/urandom | tr -dc 'a-zA-Z0-9' | fold -w 32 | head -n 1) | |
| # bash generate random 32 character alphanumeric string (lowercase only) | |
| cat /dev/urandom | tr -dc 'a-z0-9' | fold -w 32 | head -n 1 |
| "U2" has a concert that starts in 17 minutes and they must all | |
| cross a bridge to get there. They stand on the same side of the | |
| bridge. It is night. There is one flashlight. A maximum of two | |
| people can cross at one time, and they must have the flashlight | |
| with them. The flashlight must be walked back and forth. A | |
| pair walk together at the rate of the slower man's pace: | |
| Bono 1 minute to cross | |
| Edge 2 minutes to cross | |
| Adam 5 minutes to cross |
| // Usage: mongo {Server without mongodb:// example 127.0.0.1:27017}/{DbName} [-u {Username}] [-p {Password}] < ./mongo-ls.js | |
| var collections = db.getCollectionNames(); | |
| print('Collections inside the db:'); | |
| for(var i = 0; i < collections.length; i++){ | |
| var name = collections[i]; | |
| if(name.substr(0, 6) != 'system') | |
| print(name + ' - ' + db[name].count() + ' records'); |
| def write(path: String, txt: String): Unit = { | |
| import java.nio.file.{Paths, Files} | |
| import java.nio.charset.StandardCharsets | |
| Files.write(Paths.get(path), txt.getBytes(StandardCharsets.UTF_8)) | |
| } | |
| def read(path: String): String = | |
| scala.io.Source.fromFile(path, "UTF-8").getLines.mkString |