gist:948828

Ozymandias

I met a traveller from an antique land
Who said: "Two vast and trunkless legs of stone
Stand in the desert. Near them on the sand,
Half sunk, a shattered visage lies, whose frown
And wrinkled lip and sneer of cold command
Tell that its sculptor well those passions read
Which yet survive, stamped on these lifeless things,
The hand that mocked them and the heart that fed.

sstephenson

# Extend jQuery objects with Underscore collection methods.
#
# Each collection method comes in two flavors: one prefixed
# with _, which yields a bare DOM element, and one prefixed
# with $, which yields a jQuery-wrapped element.
#
# So if `this` is a jQuery object, instead of:
#
#   _.max @, (el) -> $(el).height()
#

danwrong

function JsonFile(path) {
  this.path = path;
}

JsonFile.prototype = new loadrunner.Dependency;

JsonFile.prototype.start = function() {
  var me = this;

  $.get(this.path, function(data) {

coreyhaines

churn number and file name
git log --all -M -C --name-only | grep -E '^(app|lib)/' | sort | uniq -c | sort | awk 'BEGIN {print "count,file"} {print $1 "," $2}'

churn number and file name w/ limiting to last n commits
git log --all -n 5000 -M -C --name-only | grep -E '^spec/models' | sort | uniq -c | sort | awk 'BEGIN {print "count,file"} {print $1 "," $2}'

graph of churn number and frequency
git log --all -M -C --name-only | grep -E '^(app|lib)/' | sort | uniq -c | sort | awk '{print $1}' | uniq -c | sort | awk 'BEGIN { print "frequency,churn_count"} { print $1,$2}'

denmarkin

--type-add=ruby=.haml,.rake,.feature
--type-add=objc=.pch
--type-set=xcode=.pbxproj,.pbxuser,.perspectivev3
--type-set=ragel=.rl
--type-set=nib=.xib
--type-set=plist=.plist
--type-set=tmstuff=.tmproj,.tm_build_errors
--type-set=ignorables=.log,.tmp,.pdf
--noignorables
--nonib

veganstraightedge

require "date"
require "time"


# converts base10 integers into NewBase60
def num_to_sxg(num=nil)
  sxg        = ""
  vocabulary = "0123456789ABCDEFGHJKLMNPQRSTUVWXYZ_abcdefghijkmnopqrstuvwxyz"

  return 0 if num.nil? || num.zero?

trptcolin

(ns primeFactors)

(defn square [n] (* n n))

(defn divisible-by? [n candidate]
  (= 0 (rem n candidate)))

(defn of [n]
  (loop [factors [] n n candidate 2]
    (cond