benjamn

(gdb) break Functor.h:197
Breakpoint 14 at 0x113ebdb9: file Functor.h, line 197.
Breakpoint 15 at 0x113ebdd4: file Functor.h, line 197.
Breakpoint 16 at 0x113ee771: file Functor.h, line 197.
Breakpoint 17 at 0x113ee78c: file Functor.h, line 197.
Breakpoint 18 at 0x1155ed34: file Functor.h, line 197.
Breakpoint 19 at 0x1155ed48: file Functor.h, line 197.
Note: breakpoint 18 also set at pc 0x1155ed34.
Breakpoint 20 at 0x1155ed34: file Functor.h, line 197.
Note: breakpoint 19 also set at pc 0x1155ed48.

benjamn

/**
** Macro: CS{0,1,2,...,15}({COMMA,NOCOMMA},P)
* ===========================================
* This integer-parameterized comma-separated list-generating pseudo-recursive
* macro supports lists of up to 15 elements (and as few as 0), with and without
* initial commas.  Examples:
*
*   CS5(NOCOMMA, P) => P1, P2, P3, P4, P5
*   CS3(COMMA, typename T) => , typename T1, typename T2, typename T3
*   CS0(NOCOMMA, T) => 

benjamn

template <typename Callable, typename ResultPtr>
class nsRunnableFunctor
  : public nsARunnableFunctor
{
  Callable mCallable;
  ResultPtr mResultPtr;

public:

  nsRunnableFunctor(Callable callable, ResultPtr resultPtr)

benjamn

var empty = function() {
    this.foo = 0;
}
empty.prototype = { foo: 42 };
var obj = new empty;
print(obj.foo);
obj.foo = window.undefined;
print(obj.foo);
delete obj.foo;
print(obj.foo);

benjamn

if (!window.console || !console.firebug) {
    var names = ["log", "debug", "info", "warn", "error", "assert", "dir", "dirxml", "group", "groupEnd", "time", "timeEnd", "count", "trace", "profile", "profileEnd"];
    window.console = {};
    for (var i = 0; i < names.length; ++i) {
        window.console[names[i]] = function() {}
    }
}
function _(C, A) {
    if (twttr.i18n) {
        var B = twttr.i18n[C];

benjamn

(function() {
    try {
        $("textarea").unbind();
        $("#chars_left_notice").remove();
    } catch (ex) { alert(ex); }
})();

benjamn

package org.bonetown.core;

import java.util.Iterator;
import org.bonetown.services.Bonetown;

abstract class Guy implements Iterator<Girl> {
  private boolean bone(Girl g) {
    if (g.toDouble() < 0.5)
      return false;
    synchronized {

benjamn

def mean(*xs):
    return sum(xs) / float(len(xs))

def naive(*xs):
    m = mean(*xs)
    return sum((x-m)**2 for x in xs) / float(len(xs))

def update(x, prior):
    s, n, m = prior
    m_ = float(m*n + x) / (n + 1)

benjamn

#!/usr/bin/env python

def foo():
    return 0

print foo()

def foo():
    return 1

benjamn

from random import choice

print choice(set([':(', ':)', ':*', 'lolololololol', '>>:(', '>>:)', ':<', ':>', ':?', ":'D", 'hah', '<:o)', '<:o(', 'heheheheheh', '$-(', '$-)', 'B-(', 'B-)', 'O:(', 'O:)', ':o', 'b-(', ':b', '(O_O)', ':|', 'lololol', ':x', 'hehehehehehe', 'hehehehe', '=)', '=(', ':s', ':O', 'hahahahah', ':D', 'B(', 'B)', ':B', ':\\', ':X', ':T', ':P', ':S', '8(', '8)', '(o.O)', ':S', ':-S', ':-D', '!!!!', 'heheheheh', ':-X', 'lolololol', ':-\\', '!!!!!', ':-S', ':-P', ':-T', ';P', ':-o', ':-b', 'hehe', ';-P', ':-x', '/:-(', '/:-)', ':-|', ':-s', 'heheheh', '(O.o)', 'hahahahaha', ':O', ':-o', '8(|)', ';)', 'P)', ':@)', ':@(', ':-(', ':-)', '8-(', '8-)', 'X-D', ':-#', '>:-)', '>:-(', ':-&', ':->', ':-?', ':-<', 'hahahah', '!!', 'hehehe', '!!!!!!!', ':^O', 'P(', '!!!!!!!!!!', ';(', 'heheh', '>:)', '>:(', '//:|', 'lol', '!!!!!!', ':-B', ':^o', ':-*', '$(', '$)', 'x-D', 'haha', 'ha', '|-(', '|-)', '(O.O)', ':(|)', 'heh', '>:o', 'hahaha', '<:-P', 'lololololol', '/:(', '/:)', '!!!!!!!!!', 'lolol', 'hahah