lykkin

   42 def pre(f, preds):
   43 
   44     @wraps(f)
   45     def inner(*args, **kwargs):
   46         for pred in preds:
   47             assert pred(*args, **kwargs)
   48         return f(*args, **kwargs)
   49 
   50     return inner
   51 

lykkin

from functools import wraps
from datetime import datetime


def memo(f):
    cache = {}

    @wraps(f)
    def inner(*args, **kwargs):
        key = str(args) + str(kwargs)

lykkin

data BExp = TRUE 
          | FALSE 
          | AND BExp BExp 
          | OR BExp BExp
          | NOT BExp
          | QUANT QExp

beval :: BExp -> Bool

beval TRUE = True

lykkin

asyncMap = function(fn, list, callback){
    var counter = 0;
    var result = list.slice();
    list.forEach(function(elem, index){
        setTimeout(function(){
            if(++counter === result.length){
                callback(result);
            }
            result[index] = fn(elem);
        },

lykkin

#include <stdio.h>
int main(int argc, char *argv[]){
    int x = 1;
    x += x++ + ++x;
    printf("%i", x);
}

lykkin

// +build darwin
package plugins

import (
	"os/exec"
    "log"
    "strconv"
)

type Cpu struct {

lykkin

from random import random

envs = [1, 2]

swapping = 0
staying = 0

for x in xrange(100000000):
    if random() <= .5:
        envs.reverse()

lykkin

from random import random

from math import pi, fabs

accuracies = {
    '10': 0,
    '100': 0,
    '1000': 0,
    '10000': 0,
    '100000': 0,

lykkin

from random import random

value = 0
acc = 0

payout = 2

for n in xrange(1, 1000001):
    for x in xrange(10000000):
        if random() <= .5:

lykkin

from functools import wraps
from datetime import datetime


def time(f):
    @wraps(f)
    def inner(*args, **kwargs):
        start = datetime.now()
        res = f(*args, **kwargs)
        delta = datetime.now() - start