Chris Wong lambda-fairy

That's hotter than an iron refinery.

Your reasoning is tighter than a whore on her first night.

Sexy, sexy non sequitur.

If a crystal grows to exactly 1609.344 meters in length... is it a milestone?

You shoot yourself in the foot, but the compiler notices you're already dead inside and optimizes it away.

	module Names (renderName) where

	import Data.List (genericIndex)

	-- \| Map a non-negative integer to a valid Python identifier.
	renderName :: Integer -> String
	renderName
	= ('_':) -- Prevent conflict with Python keywords
	. map (genericIndex chars)
	. digitify (fromIntegral $ length chars)

	# ~/.bashrc: executed by bash(1) for non-login shells.
	# see /usr/share/doc/bash/examples/startup-files (in the package bash-doc)
	# for examples

	# Include the default .bashrc
	. /etc/skel/.bashrc

	# Don't save command history on the VM
	if [ "$(hostname)" == 'bonbon' ]; then
	unset HISTFILE

	-- \| A simple parser combinator library.

	module Text.Comb
	( Parser(runParser)
	, parse
	, next
	, satisfy
	, match
	, matches
	) where

	#!/usr/bin/env python3

	"""
	I go around, knocking on people's doors, until I find someone with two
	children, at least one of which is a boy.

	What is the probability that they are both boys?

	(The answer should approximate 1/3.)

	"""
	A simple mixin that counts the number of comparisons performed. Each
	class it is mixed into keeps its own counter, which can be retrieved and
	reset at whim. The code is written generically, and will work with any
	orderable type.

	In the COSC122 (first year computer science) course at the University of
	Canterbury, one of the assignments is to implement a binary search. To
	verify the algorithm, students have to manually increment a counter
	every time they compare two values. This is annoying and error-prone,

	jQuery.fn.extend({
	fuzzyCheckboxes: function (selector) {
	this.on('click', selector, function () {
	$(this).find(':checkbox').click()
	})
	this.on('click', selector + ' :checkbox', function (e) {
	e.stopPropagation()
	})
	}
	})

	module Sleepsort (sleepsort) where

	import Control.Applicative
	import Control.Concurrent
	import Control.Monad
	import System.IO.Unsafe (unsafeInterleaveIO)

	sleepsort :: [Int] -> IO [Int]
	sleepsort xs = do
	ronald <- newChan