Attention: if you attempt to fork this gist, github will think that you are a spammer and you will have to confirm that you are human with them. Apparantly there are too many links in this list. Also I update it rather frequently (see revisions on the left), so it's probably wise to not fork it anyway.
This file contains 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
#define lambda(return_type, function_body) \ | |
({ \ | |
return_type __fn__ function_body \ | |
__fn__; \ | |
}) | |
// Use like this: | |
int (*max)(int, int) = lambda (int, (int x, int y) { return x > y ? x : y; }); |
This file contains 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
L1 cache reference 0.5 ns | |
Branch mispredict 5 ns | |
L2 cache reference 7 ns 14x L1 cache | |
Mutex lock/unlock 25 ns | |
Main memory reference 100 ns 20x L2 cache, 200x L1 cache | |
Compress 1K bytes with Zippy 3,000 ns | |
Send 1K bytes over 1 Gbps network 10,000 ns 0.01 ms | |
Read 4K randomly from SSD 150,000 ns 0.15 ms | |
Read 1 MB sequentially from memory 250,000 ns 0.25 ms | |
Round trip within same datacenter 500,000 ns 0.5 ms |
This file contains 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
/** | |
* A "Left-leaning Red-Black Tree" | |
* | |
* http://www.cs.princeton.edu/~rs/talks/LLRB/LLRB.pdf | |
*/ | |
public class LLRB<K extends Comparable<K>, V> { | |
public static void main(String[] args) { | |
LLRB<String, String> llrb = new LLRB<String, String>(); | |
This file contains 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
#!/usr/bin/env bash | |
# Check for jdk | |
if test ! $(which javac) | |
then | |
echo " x JDK not found. Please install it:" | |
echo " http://goo.gl/7mdf0" | |
echo | |
echo " Or check PATH" | |
exit |
This file contains 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
yes 'c=(╱ ╲);printf ${c[RANDOM%2]}'|bash |
This file contains 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
int is_urlschemechar(int first_flag, int ch) | |
{ | |
/* | |
* The set of valid URL schemes, as per STD66 (RFC3986) is | |
* '[A-Za-z][A-Za-z0-9+.-]*'. But use sightly looser check | |
* of '[A-Za-z0-9][A-Za-z0-9+.-]*' because earlier version | |
* of check used '[A-Za-z0-9]+' so not to break any remote | |
* helpers. | |
*/ | |
int alphanumeric, special; |
ror, scala, jetty, erlang, thrift, mongrel, comet server, my-sql, memchached, varnish, kestrel(mq), starling, gizzard, cassandra, hadoop, vertica, munin, nagios, awstats
The glory of the disconnect key sequence: a newline followed by ~.
. It works like a charm.
This file contains 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
node_modules/**/*.node | |
node_modules/**/*.o | |
node_modules/**/*.a | |
node_modules/**/*.mk | |
node_modules/**/*.gypi | |
node_modules/**/*.target | |
node_modules/**/.deps/ | |
node_modules/**/build/Makefile | |
node_modules/**/**/build/Makefile |
OlderNewer