adnils

/*
  d3.phylogram.js
  Wrapper around a d3-based phylogram (tree where branch lengths are scaled)
  Also includes a radial dendrogram visualization (branch lengths not scaled)
  along with some helper methods for building angled-branch trees.

  Copyright (c) 2013, Ken-ichi Ueda

  All rights reserved.

adnils

// Given a number, find the next higher number which has the exact same set of digits as the original number
// http://stackoverflow.com/questions/9368205/given-a-number-find-the-next-higher-number-which-has-the-exact-same-set-of-digi

function nextUp(iNumber){

	var sDigitsSorted = iNumber.toString().split('').sort().join('');

	var aPermutations = (function(){
		var i = parseInt(iNumber.toString().split('').sort().reverse().join(''),10) + 1,
			a = [];

adnils

To run this, you can try:

curl -ks https://gist.github.com/nicerobot/2697848/raw/uninstall-node.sh | bash

I haven't tested this script doing it this way but i run a lot of my Gists like this so maybe this one'll work too.

Alternatively,

curl -ksO https://gist.github.com/nicerobot/2697848/raw/uninstall-node.sh

chmod +x ./uninstall-node.sh

adnils

M[16],X=16,W,k;main(){T(system("stty cbreak")
);puts(W&1?"WIN":"LOSE");}K[]={2,3,1};s(f,d,i
,j,l,P){for(i=4;i--;)for(j=k=l=0;k<4;)j<4?P=M
[w(d,i,j++)],W|=P>>11,l*P&&(f?M[w(d,i,k)]=l<<
(l==P):0,k++),l=l?P?l-P?P:0:l:P:(f?M[w(d,i,k)
]=l:0,++k,W|=2*!l,l=0);}w(d,i,j){return d?w(d
-1,j,3-i):4*i+j;}T(i){for(i=X+rand()%X;M[i%X]
*i;i--);i?M[i%X]=2<<rand()%2:0;for(W=i=0;i<4;
)s(0,i++);for(i=X,puts("\e[2J\e[H");i--;i%4||
puts(""))printf(M[i]?"%4d|":"    |",M[i]);W-2

adnils

J=1;exec'''z="";b=-1.6;
exec'x=y=0;exec"x,y=2*x
*y+J,y*y-x*x+b;"*20;z+=
" O"[x*x+y*y<2];b+=.04;
'*60;print z;J-=.1;'''.
replace('\n','')*20#Jay

adnils

#define _+o[$&1][O
o[2][1024],$;main(
O){for(;getchar(),
puts("\e[2J");$++)
for(O=32;O++<992;)
O&31&&printf(~O&31
?(o[~$&1][O]=$?(_-
33]_-32]_-31]_-1]_
+1]_+31]_+32]_+33]
|_])==3:rand()&1)?

adnils

var cluster = require('cluster');
var http = require('http');
var numCPUs = require('os').cpus().length;

if (cluster.isMaster) {
  // Fork workers.
  for (var i = 0; i < numCPUs; i++) {
    cluster.fork();
  }
  cluster.on('exit', function(worker, code, signal) {

adnils

function Y(le) {
  return (function (f) {
    return f(f);
  }(function (f) {
    return le(function (x) {
      return f(f)(x);
    });
  }));
}

adnils

This runs a build for a small elixir (phoenix) project in about 40 seconds by caching as much of the compiled files as possible. It's not been run for very long so I don't know if it caches too much or of there is any other issues.

It should be generic enough to work on any elixir app using mix.

adnils

# to generate your dhparam.pem file, run in the terminal
openssl dhparam -out /etc/nginx/ssl/dhparam.pem 2048