netroy

const co = require('co')
const Benchmark = require('benchmark')
const suite = new Benchmark.Suite

const Generate = () => new Promise(resolve => {
  // resolve(1)
  setImmediate(() => resolve(1))
  // setTimeout(() => resolve(1), 10)
})

netroy

(function(i) {
    function q(e) {
        var j = e.originalEvent.changedTouches[0],
            f = "";
        switch (e.type) {
            case "touchmove":
                f = "mousemove";
                break;
            case "touchend":
                f = "mouseup";

netroy

[].forEach.call(document.all,function(e){-1!==e.constructor.name.indexOf("-")&&(e.style.border="3px solid red")});

netroy

var primes = [2];

var n = 3;  // The number we are testing. Will be incremented.

function checkNextNumber() {
	// It's sufficient to check if there are any prime factors up to sqrt(n)

	n++;

	var limitForChecking = Math.floor(Math.sqrt(n));

netroy

Here are a list of some good git tutorials i have came across. Hope it helps somebody.

• Pro Git
• Git Ready
• Think Like (a) Git
• Help.Github
• Github Cheat-sheets
• Git-fu
• Git Immersion
• Git is simpler

netroy

/**
 * A `tail -f` implementation in Node.js.
 *
 * Original author : Bratish Goswami <bratishgoswami AT gmail DOT com>
 * Modified by : Michel Bartz <michel.bartz AT manwin DOT com>
 * 
 */

var sys = require("sys"),
    fs = require('fs'),

netroy

IMPORTANT: this is outdated, go to https://github.com/netroy/Lockets


"npm install socket-io" & you are ready to go