tj

if foo
  if bar
    something
  else
      something_else
else
  baz

bryanl

Surround these with :  e.g. :calling:

+1
-1
bulb
calling
clap
cop
email
feet

pbailis

A friend asked me for a few pointers to interesting, mostly recent papers on data warehousing and "big data" database systems, with an eye towards real-world deployments. I figured I'd share the list. It's biased and rather incomplete but maybe of interest to someone. While many are obvious choices (I've omitted several, like MapReduce), I think there are a few underappreciated gems.

###Dataflow Engines:

Dryad--general-purpose distributed parallel dataflow engine
http://research.microsoft.com/en-us/projects/dryad/eurosys07.pdf

Spark--in memory dataflow
http://www.cs.berkeley.edu/~matei/papers/2012/nsdi_spark.pdf

schacon

README.ext
http://svn.ruby-lang.org/cgi-bin/viewvc.cgi/tags/v1_8_6/README.EXT?revision=12055

Extending Ruby - Pickaxe
http://ruby-doc.org/docs/ProgrammingRuby/html/ext_ruby.html

Extending Ruby on O'Reilly
http://onlamp.com/pub/a/onlamp/2004/11/18/extending_ruby.html

Ruby C Extensions - Mark Volkman

funny-falcon

This are parts of falcon patch for ruby-1.9.3-p327

• 01-backport-speedup-require.diff - backport of Greg Price's patch for speedup require.

  For a long time my patch were famous cause of require speedup. ruby-core prefers slightly simpler patches from Greg Price, and I wish not to compete with ruby-core, so that I just backport accepted changes.

• 02-st_opt.diff - speedup of Hash

This patch contains:

ryandotsmith

Process Partitioning

The Problem

When working with large, high volume, low latency systems, it is often the case that processing data sequentially becomes detrimental to the system's health. If we only allow 1 process to work on our data we run into several challenges:

• Our process may fall behind resulting in a situation which it is impossible for our process to catch up.
• Our singleton process could crash and leave our system in a degraded state.
• The average latency of data processing could be dramatically affected by outlying cases.

thezerobit

:- use_module(library(clpfd)).

peano(N,z) :- N #= 0.
peano(N,s(PDec)) :-
        N #> 0,
        N - 1 #= NDec,
        peano(NDec, PDec).

% ?- peano(4, Q).
% Q = s(s(s(s(z)))) ;

lkuper

(load "mkprelude.scm")

(define peanoo
  (lambda (n out)
    (conde
      [(== n (build-num 0)) (== '(O) out)]
      [(fresh (n1 res)
         (-o n (build-num 1) n1)
         (conso 'S res out)
         (peanoo n1 res))])))

bryanwoods

The Verificationist - Donald Antrim
what purpose did i serve in your life - Marie Calloway
The Last Samurai - Helen DeWitt
The White Album - Joan Didion
The Orphan Master's Son - Adam Johnson
Taipei - Tao Lin
The Twelve Tribes of Hattie - Ayana Mathis
The Road - Cormac McCarthy
Swamplandia! - Karen Russell
Journalism - Joe Sacco

aphyr

(ns knossos.redis
  (:use knossos.core))

;; System state

(defn node
  "A node consists of a register, a primary it replicates from, whether it is
  isolated from all other nodes, a local replication offset, and if it is a
  primary, a map of node names to known replication offsets."
  [name]