staltz

The introduction to Reactive Programming you've been missing

(by @andrestaltz)

---

This tutorial as a series of videos

If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.

---

CodaFi

% Introduce reflexive equality
refl(X, X).

% Introduce symmetrical equality
sym(X, Y) :- 
	refl(X, Y),
	refl(Y, X).

% Identity of addition by zero
add_zero(N) :- 

williame

public final class IntrusiveList<T> {
	
	/** private constructor used by makeList() */
	private IntrusiveList() {
		t = null; // is null so we know this must be the head/tail
		prev = next = this; // cyclic
	}

	/** returns a new head/tail pointer */
	public static <T> IntrusiveList<T> makeList() {

gatlin

-- This is going to be on Hackage soon! https://github.com/gatlin/surely

{-# LANGUAGE BangPatterns #-}

-- |
-- Module           : AI.Surely
-- Copyright        : 2012 Gatlin Johnson
-- License          : LGPL 3.0
-- Maintainer       : [email protected]
-- Stability        : experimental

rgov

def deBruijn(n, k):
   '''
   An implementation of the FKM algorithm for generating the de Bruijn
   sequence containing all k-ary strings of length n, as described in
   "Combinatorial Generation" by Frank Ruskey.
   '''
 
   a = [ 0 ] * (n + 1)
   
   def gen(t, p):

mblondel

"""
(C) Mathieu Blondel - 2010
License: BSD 3 clause

Implementation of the collapsed Gibbs sampler for
Latent Dirichlet Allocation, as described in

Finding scientifc topics (Griffiths and Steyvers)
"""

Arachnid

import bisect

class NFA(object):
  EPSILON = object()
  ANY = object()
  
  def __init__(self, start_state):
    self.transitions = {}
    self.final_states = set()
    self._start_state = start_state