dvberkel

// return list of pairs of [1 .. 2*n] where every pair sums to a prime.
function prime_pairs(n)
    if n eq 0 then
        return [];
    else
        N := 2 * n;
        p := NextPrime(N);
        m := p - N;
        result := [ <m + i, N - i> : i in [0 .. ((N - m) div 2)]];
        return prime_pairs(m div 2) cat result; 

dvberkel

dvberkel

"use strict";

(function(){
    var db = openDatabase("demo", "1.0", "demonstration of webSQL", 2 * 1024 * 1024);

    db.transaction(function(tx){
	tx.executeSql("create table if not exists entries (timestamp, description, value)");
    });

    db.transaction(function(tx){

dvberkel

Contributions

I have the following ideas about contributing to an open source project.

• hg [scm provider][3] for [Chef][2].
• [peg][4] task for [grunt][5] is done. Go check out [grunt-peg][6].
• [Chrome extension][7] to throw dice is done. Go check out [GURPS dice][8]

dvberkel

Links to Datomic

The following give a thorough introduction to datamic.

• [Datomic Homepage][1]
• [Datamic Documentation][2]
• [Datomic YouTube channel][3]

InfoQ

dvberkel

/**
 * The first commented line is your dabblet’s title
 */

background: #f06;
background: linear-gradient(45deg, #f06, yellow);
min-height: 100%;
font-size: 200%;
font-family: sans-serif;

dvberkel

/rrand { rand 16#7FFFFFFF div } def

dvberkel

/*
  RegisterDisplay.cpp - Library for 74HC545 controlled 7-segment display
  Created by Daan van Berkel, May 30, 2012.
  Released into the public domain.
*/

#include "Arduino.h"
#include "RegisterDisplay.h"

RegisterDisplay::RegisterDisplay(int numberOfSegments, int clockPin, int latchPin, int dataPin) {

dvberkel

package nl.tdd.enigma;

import java.util.HashMap;
import java.util.Map;

public class Reflector {
	
	private final Map<String, String> reflections = new HashMap<String, String>();
	
	{

dvberkel

#! /usr/bin/env bash

# This script downloads the Android SDK.
# It depends on the following
#
# * curl
# * tar

BASE_DIR=`pwd`