petermarks’s gists

petermarks / JSONParse.hs

Created March 2, 2012 23:53

JSON QuasiQuoting

	--------------------------------------------------------------------
	-- \|
	-- Module : Text.JSON.Parsec
	-- Copyright : (c) Galois, Inc. 2007-2009
	--
	-- Maintainer: Sigbjorn Finne <[email protected]>
	-- Stability : provisional
	-- Portability: portable
	--
	-- Parse JSON values using the Parsec combinators.

petermarks / EnumLogfile.hs

Created November 23, 2011 23:25 — forked from commandodev/Automata.hs

EnumLogfile

	module Automata where

	import Control.Applicative
	import Control.Monad.Trans
	import qualified Data.ByteString as BS
	import qualified Data.ByteString.Char8 as C
	import qualified Data.Map as M
	import Data.List
	import Data.Word
	import System.Environment

petermarks / Automata.hs

Created November 6, 2011 18:20

Automata


	module Automata where

	import Prelude hiding (id, (.))
	import Control.Category
	import Control.Arrow
	import qualified Data.Map as M
	import Data.List (sort)

	data Automaton b c = Automaton (b -> (c, Automaton b c))

petermarks / Visualizer.hs

Created May 16, 2011 16:32

Visualizer

	module Visualiser where

	import Numeric.FFT
	import Data.Complex

	test :: [Complex Double]
	test = concat $ replicate 16 (replicate 8 1.0 ++ replicate 8 (-1.0))

	freqs :: [Complex Double] -> [Double]
	freqs samples = take (n `div` 2) . map (/ fromIntegral n) . map magnitude $ fft samples

petermarks / gist:974782

Created May 16, 2011 16:30

Pulse test

	module Main where

	import Sound.Pulse.Simple

	main=do
	s<-simpleNew Nothing "example" Play Nothing "this is an example application"
	(SampleSpec (F32 LittleEndian) 44100 1) Nothing Nothing
	simpleWrite s (take 44100 (test 440) ++ take 44100 (test 330) )
	simpleDrain s
	simpleFree s

petermarks / gist:868042

Created March 13, 2011 11:53

JSON Zipper

petermarks / chat.html

Created February 9, 2011 23:34

Chat client


	<html><head>
	<title>WebSocket Chat</title>
	<script type='text/javascript'>

	if (!window.WebSocket)
	alert("WebSocket not supported by this browser");

	function $() { return document.getElementById(arguments[0]); }
	function $F() { return document.getElementById(arguments[0]).value; }

petermarks / gist:791274

Created January 22, 2011 17:27

Theme Park (Optimized)

	-- This program solves the Theme Park Google CodeJam problem at
	-- http://code.google.com/codejam/contest/dashboard?c=433101#s=p2
	--
	-- I've tried to make the code clear whilst employing a selection of Haskell library
	-- functions and idioms. I've also gone for efficiency, probably over optimizing in
	-- places in order to demonstrate some techniques.

	module Main where

	import Data.List

petermarks / gist:782199

Created January 16, 2011 22:13

Theme Park (Naive)

	module Main where

	import Text.Printf

	profit :: Integer -> Integer -> [Integer] -> Integer

	profit cap rides groups
	\| sum groups <= cap = rides * sum groups
	\| otherwise = profit' cap rides (cycle groups)
	where

petermarks / gist:736615

Created December 10, 2010 18:57

Chess boards