Spuffynism

function Node (name) {
	this.name = name;
	this.left = null;
	this.right = null;
}

function BinaryTree (node) {
	this.node = node;
	
	this.visit = function(fn) {

Spuffynism

const COMMAND = {
	next: '>',
	prev: '<',
	
	increment: '+',
	decrement: '-',
	
	print: '.',
	accept: ',',
	

Spuffynism

var hasComplement = function (array, sum) {
	if (sum < 0)
		throw "sum must be bigger than 0";

	var complements = [];

	for (var i = 0, complement; i < array.length; i++, complement = sum - array[i]) { 	
		if (array.indexOf(complement) != -1) // if (complement.indexOf(array[i]) != -1)
			return true;
		else

Spuffynism

var binarySearch = function (a, x) {
	var low = 0,
		high = a.length - 1,
		mid;

	while (low <= high) {
		mid = Math.floor((low + high) / 2);		

		if (a[mid] < x)
			low = mid + 1;

Spuffynism

// converted from C code from p.6 of the btc whitepaper
// tested with p.7's provided sample inputs
// q being the probability the attacker finds the next block
// z being the number of blocks the attacker is behind
var AttackerSuccessProbability = function(q, z) {
	var p = 1.0 - q;
	var lambda = z * (q / p);
	var sum = 1.0;
	var poisson;

Spuffynism

package com.springmvc.model;

import org.springframework.util.concurrent.ListenableFuture;

import java.util.concurrent.CompletableFuture;

/**
 * Converts a listenable future to a completable future, mapping the listenable futures' callbacks
 * to the completable futures' equivalents.
 */