rampion’s gists

rampion / StringCollapse.hs

Created April 9, 2012 21:34

	{-# LANGUAGE TupleSections #-}
	module Main where
	-- see https://plus.google.com/u/0/105746006385940131491/posts/9Uev6KVRUgK for
	-- context

	-- what we essentially have is a non-associative operation (represented by
	-- concatenation):
	--
	-- ab = ba = c
	-- bc = cb = a

rampion / fb_interview_question.hs

Created April 7, 2012 00:09

alternate solution to https://b7j0c.org/blog/fb_interview_question.html

	module Main where

	import Data.Bits

	{- Note that, once completely reduced according to the rules,
	- the string will be homogeneous. If it did contain two different
	- characters, there would be a place where two touched, and
	- they could be reduced.
	-
	- In fact, the order in which the reductions are done doesn't really matter,

rampion / Coiterable.hs

Created April 4, 2012 11:13

	{-# LANGUAGE RankNTypes #-}
	module Temp where

	type Yielding a b = (a, PassiveIterable a b)
	data PassiveIterable a b = Yield (Yielding a b) \| End b
	type ActiveIterable a b c = PassiveCoiterable a b -> c

	type Awaiting a b = a -> PassiveCoiterable a b
	data PassiveCoiterable a b = Await (Awaiting a b) \| Return b
	type ActiveCoiterable a b c = PassiveIterable a b -> c

rampion / Rational.scala

Created March 24, 2012 16:58

	class Rational(n: Int, d: Int) extends Ordered[Rational] {
	require( d != 0 )

	private val g = Rational.gcd(n.abs, d.abs)
	val numer: Int = n/g * d.signum
	val denom: Int = d.abs/g

	def this(n: Int) = this(n, 1)

	override def toString = numer + (if (denom == 1) "" else ("/"+denom))

rampion / ChurchList.hs

Created March 23, 2012 23:10

	{-# LANGUAGE RankNTypes #-}
	module ChurchList where

	import Data.Monoid
	import Prelude hiding (zipWith)

	-- church encoding for pairs
	newtype ChurchPair a b = CP { runCP :: forall c. (a -> b -> c) -> c }

	comma :: a -> b -> ChurchPair a b

rampion / Levenshtein.hs

Created March 22, 2012 13:44 — forked from jberryman/med.hs

an optimized haskell Levenshtein distance, using the vector library

	module Main where

	import qualified Data.List as L
	import qualified Data.Vector.Unboxed.Safe as V
	import Control.Monad (replicateM)
	import System.Random (randomRIO)
	import Criterion.Main

	med :: String -> String -> Int
	med s1 = V.last . V.ifoldl' scanS1 costs_i . V.fromList

rampion / hide-overflow.html

Created March 12, 2012 20:41

	<html>
	<head>
	<style>
	.container > div {
	color: transparent; /* don't show the text-overflow content */
	overflow: hidden;
	height: 1em;
	width: 100%;
	}
	.container {

rampion / Example.html

Created March 4, 2012 14:46

	<html>
	<head>
	<style>
	.land:hover { fill: red; }
	</style>
	</head>
	<body>
	<!-- svg taken from http://upload.wikimedia.org/wikipedia/commons/f/f9/BlankMap-Africa.svg -->
	<svg xmlns:cc="http://web.resource.org/cc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://www.w3.org/2000/svg" xmlns:svg="http://www.w3.org/2000/svg" version="1.1" height="1000" width="1000">
	<metadata id="metadata24111">

rampion / Ringing.hs

Created February 23, 2012 18:41

	{-# LANGUAGE TupleSections #-}
	module Ringing where

	import Data.List (group, sort, find, intercalate)
	import Data.Maybe (catMaybes, fromJust)

	data Edge = (Int -> Maybe Int) :> Node
	data Node = Node { nid :: Int, exit :: Bool, edges :: [Edge] }

	instance Eq Node where

rampion / SetTrie.hs

Created February 23, 2012 11:44

	module SetTrie where

	import Prelude hiding (lookup)
	import Data.List (intercalate)
	import Data.Set hiding (empty, insert, map, fromList)
	import qualified Data.Set as S

	data SetTrie k v = SetTrie { count :: Int, leaf :: Maybe v, branches :: [(k,SetTrie k v)] }

	prefixThenIndent :: String -> [String] -> [String]

Noah Luck Easterly rampion