lsmith

// Step 1. global definition
function Map(config) {
    this._init(config);
}

Map.prototype = {
    _container: null,

    _init: function (config) {
        this._container = document.getElementById(config.container);

pepijndevos

(ns lazy-sort)

(defn qsort [[head & tail]]
  (when head
    (lazy-cat (qsort (filter #(< % head) tail))
              [head]
              (qsort (remove #(< % head) tail)))))

(defn merge*
  [[f1 & r1 :as l1] [f2 & r2 :as l2]]

swannodette

(ns logic.y
  (:refer-clojure :exclude [== reify inc])
  (:use [clojure.core.logic minikanren prelude 
         nonrel match]))

(defna findo [x l o]
  ([_ [[?y :- o] . _] _] 
    (project [x ?y] (== (= x ?y) true)))
  ([_ [_ . ?c] _] (findo x ?c o)))

ordnungswidrig

(ns state-is-a-fold
  (:use clojure.test))

;;; After all, state is a fold of events. For example let's say the events are a sequence of numbers
;;; and we are folding by addition:

(deftest simple
  (let [events [1 5 2 4 3]
	state (reduce + events)]
    (is (= 15 state))))

stuartsierra

;; Adapted from "An empirical comparison of C, C++, Java, Perl,
;; Python, Rexx, and Tcl for a search/string-processing program"
;; by Lutz Prechelt


;; This was a 15-minute effort while listening to a talk. It's *not*
;; well thought-out or designed.

;; By Stuart Sierra,
;; @stuartsierra on Twitter

alandipert

(ns ded
  "Structural Data EDitor for Clojure with zippers.  Inspired by Interlisp: http://larry.masinter.net/interlisp-ieee.pdf"
  (:require [clojure.zip :as z])
  (:use [clojure.pprint :only (with-pprint-dispatch code-dispatch pprint)]
        [clojure.repl :only (source-fn)]))

(defn print-hr
  "Prints 30 dashes and a newline."
  [c]
  (println (apply str (repeat 30 c))))

sritchie

(ns monad-explore.core
  (:use clojure.algo.monads))

(defmacro let?
  "Almost the same as let. If you add the :ensure keyword paired with
  some predicate as a var in the let form, let? will not continue
  unless the predicate evaluates to true. (The predicate will have
  access to all bindings above.)"
  [bindings & body]
  (let [[bind [kwd pred & more]] (split-with (complement #{:ensure}) bindings)]

panuta

Command Line Tools for Xcode

Command line tools comes bundle with Xcode prior to 4.3 version. After 4.3, you need to install a separated command line tools yourself.

First, go to this url and login using Apple Developer account (Free to register)

https://developer.apple.com/downloads/index.action

jboner

Latency Comparison Numbers (~2012)
----------------------------------
L1 cache reference                           0.5 ns
Branch mispredict                            5   ns
L2 cache reference                           7   ns                      14x L1 cache
Mutex lock/unlock                           25   ns
Main memory reference                      100   ns                      20x L2 cache, 200x L1 cache
Compress 1K bytes with Zippy             3,000   ns        3 us
Send 1K bytes over 1 Gbps network       10,000   ns       10 us
Read 4K randomly from SSD*             150,000   ns      150 us          ~1GB/sec SSD

hellerbarde

Latency numbers every programmer should know

L1 cache reference ......................... 0.5 ns
Branch mispredict ............................ 5 ns
L2 cache reference ........................... 7 ns
Mutex lock/unlock ........................... 25 ns
Main memory reference ...................... 100 ns             
Compress 1K bytes with Zippy ............. 3,000 ns  =   3 µs
Send 2K bytes over 1 Gbps network ....... 20,000 ns  =  20 µs
SSD random read ........................ 150,000 ns  = 150 µs

Read 1 MB sequentially from memory ..... 250,000 ns = 250 µs