addisaden

var worker_clb = function(name, clb) {
  var d = new Date();
  for(var i = 0; i < 100000000; i++) {
    i+i;
  }
  clb(name + "_clb returns after " + ((new Date()) - d) + " ms.");
}

var a_lot_to_do = function(name, clb) {

netologist

After upgrading to Mountain Lion : 10.8 I noticed that I was getting Python errors which prevented me from starting vim:

Traceback (most recent call last):
File "/System/Library/Frameworks/Python.framework/Versions/2.7/lib/python2.7/site.py", line 565, in <module>
File "/System/Library/Frameworks/Python.framework/Versions/2.7/lib/python2.7/site.py", line 547, in main
File "/System/Library/Frameworks/Python.framework/Versions/2.7/lib/python2.7/site.py", line 278, in addusersitepackages
File "/System/Library/Frameworks/Python.framework/Versions/2.7/lib/python2.7/site.py", line 253, in getusersitepackages
File "/System/Library/Frameworks/Python.framework/Versions/2.7/lib/python2.7/site.py", line 243, in getuserbase
File "/System/Library/Frameworks/Python.framework/Versions/2.7/lib/python2.7/sysconfig.py", line 523, in get_config_var
File "/System/Library/Frameworks/Python.framework/Versions/2.7/lib/python2.7/sysconfig.py", line 419, in get_config_vars

madrobby

function isRetina(){
  return (('devicePixelRatio' in window && devicePixelRatio > 1) ||
    ('matchMedia' in window && matchMedia("(min-resolution:144dpi)").matches))
}

shesek

# The common one, converted to CoffeeScript
y = (f) -> ((y)-> y y) (y) -> f (n) -> (y y) n

# My version
y = ((y)->y y) (y) -> (f) -> (n) -> (f (y y) f) n

fact = y (f) -> (n) -> if n is 0 then 1 else n * f n-1

# And a simpler way, requires a different `fact` that passes itself to itself
y = (f) -> (n) -> (f f) n

drewlesueur

How to Generate the Y-Combinator in CoffeeScript

Problem

For fun, let's say you are programming in a language that doesn't allow variable assignments and you still want to make a recursive function. Although you can't assign variables, you can use functions (and enclosed function arguments). Can you make a function recursive without calling it by name?

Lets try implementing the factorial function. First with a function calling itself by name, then with a funtion that never calls itself by name

Here is the implementation of factorial that calls itself by name. It's a simple recursive function

getify

/*

To see a demo of these in use, check out: http://test.getify.com/test-canvas-clear-alt.html

Example uses:
*/

clearCircle(context,/*x=*/120,/*y=*/80,/*radius=*/60);
clearLineSquared(context,/*x1=*/10,/*y1=*/10,/*x2=*/53,/*y2=*/67,/*thickness=*/5);
clearLineRounded(context,/*x1=*/15,/*y1=*/100,/*x2=*/90,/*y2=*/170,/*thickness=*/10);

jlong

var parser = document.createElement('a');
parser.href = "http://example.com:3000/pathname/?search=test#hash";

parser.protocol; // => "http:"
parser.hostname; // => "example.com"
parser.port;     // => "3000"
parser.pathname; // => "/pathname/"
parser.search;   // => "?search=test"
parser.hash;     // => "#hash"
parser.host;     // => "example.com:3000"

Me1000

transitionViewControllers(vc1, vc2, 0.15, nil, function(){
    view.frame = CGRectMake(100,100,100,100);
}, function(){
    view.removeFromSuperview();
});

thelonecabbage

Data.Model = Backbone.Model.extend({
			toJSON: function(){
				var clone = _.clone(this.attributes);
				_.each(clone, function (attr, idx) {
					if(attr.toJSON){
						clone[idx] = attr.toJSON();
					}
				});
				return clone;
			}

ry

var http = require('http')
var fork = require('child_process').fork;

function fib(n) {
  if (n < 2) {
    return 1;
  } else {
    return fib(n - 2) + fib(n - 1);
  }
}