mdub

$ ruby --version
ruby 2.0.0dev (2012-03-20 trunk 35094) [x86_64-darwin11.3.0]

$ ruby pipeline_bench.rb 
IMPLEMENTATION                    take(10)   take(100)  take(1000)        to_a
conventional (eager)               0.01416     0.01407     0.01422     0.01411
enumerating                        0.00003     0.00007     0.00063     0.03140
lazing                             0.00004     0.00011     0.00098     0.04759
ruby2 Enumerable#lazy              0.00004     0.00013     0.00112     0.05304
facets Enumerable#defer            0.00005     0.00018     0.00162     0.07108

erikh

#!/usr/bin/env sh

##
# This is script with usefull tips taken from:
#   https://github.com/mathiasbynens/dotfiles/blob/master/.osx
#
# install it:
#   curl -sL https://raw.github.com/gist/2108403/hack.sh | sh
#

sinc

CMRotationMatrix rotationMatrixFromGravity(float x, float y, float z)
{	
	// The Z axis of our rotated frame is opposite gravity
	vec3f_t zAxis = vec3f_normalize(vec3f_init(-x, -y, -z));
	
	// The Y axis of our rotated frame is an arbitrary vector perpendicular to gravity
	// Note that this convention will have problems as zAxis.x approaches +/-1 since the magnitude of
	// [0, zAxis.z, -zAxis.y] will approach 0
	vec3f_t yAxis = vec3f_normalize(vec3f_init(0, zAxis.z, -zAxis.y));
	

stuarthalloway

;; Datomic example code
(use '[datomic.api :only (db q) :as d])

;; ?answer binds a scalar
(q '[:find ?answer :in ?answer]
   42)

;; of course you can bind more than one of anything
(q '[:find ?last ?first :in ?last ?first]
   "Doe" "John")

kachayev

// Channels-driven concurrency with Go
// Code examples from Rob Pike's talk on Google I/O 2012:
// http://www.youtube.com/watch?v=f6kdp27TYZs&feature=youtu.be
//
// Concurrency is the key to designing high performance network services. 
// Go's concurrency primitives (goroutines and channels) provide a simple and efficient means 
// of expressing concurrent execution. In this talk we see how tricky concurrency 
// problems can be solved gracefully with simple Go code.

// (1) Generator: function that returns the channel

kachayev

;; Channels-driven concurrency with Clojure
;; Clojure variant for code examples from this gist:
;; https://gist.github.com/3124594
;; Primarily taken from Rob Pike's talk on Google I/O 2012:
;; http://www.youtube.com/watch?v=f6kdp27TYZs&feature=youtu.be
;;
;; Concurrency is the key to designing high performance network services. 
;; Clojure provides several concurrency primitives, like futures/promises, atom, agent etc.
;; There is no implementation for "Go channels" in core, but we can use
;; 3rd-party library Lamina to do the same things.

BekeJ

"""
Module for IPython to display code with TeX representation.

This makes for example the following workflow possible:

.. sourcecode:: ipython

In [1]: %load_ext py2tex

In [2]: from math import *

candera

A little Clojure configuration reader

This is a handy bit of code I've written more than once. I thought I'd throw it in here so I can refer back to it later. Basically, it lets you read a config file to produce a Clojure map. The config files themselves can contain one or more forms, each of which can be either a map or a list. Maps are simply merged. Lists correspond to invocations of extension points, which in turn produces a map, which is merged along with everything else.

An Example

Consider the following files:

names.edn

mtnygard

(ns rxjava-datomic.query
  (:require [datomic.api :as d])
  (:use     [clojure.repl :only [pst]])
  (:import  [rx Observable]
            datomic.Peer))

(defn query [qry & inputs]
  (Observable/toObservable
   (Peer/q qry (object-array inputs))))

ztellman

;; let's create a simple protocol that just returns a number
user> (defprotocol NumberP (number [_]))
NumberP

;; now we'll create an implementation that always returns '1'
user> (deftype One [] NumberP (number [_] 1))
user.One

;; unsurprisingly, this type only has a single static value, which wraps the '1'
> (-> One .getDeclaredFields seq)