jackfoxy’s gists

jackfoxy / simpleForceReveal.fs

Created November 14, 2012 23:30

simplified forced door reveal for let's make a deal

	let forcedReveal doorWithPrize fstChoice =
	match (doorWithPrize + fstChoice) with
	\|3 -> 3
	\|4 -> 2
	\|_ -> 1

jackfoxy / ForcedReveal.fs

Created November 13, 2012 00:33

forced door reveal for Monty Hall problem

	let forcedReveal doorWithPrize fstChoice =
	match doorWithPrize with
	\|1 -> if fstChoice = 2 then 3
	else 2
	\|2 -> if fstChoice = 1 then 3
	else 1
	\|_ -> if fstChoice = 1 then 2
	else 1

jackfoxy / RandomReveal.fs

Created November 13, 2012 00:31

random reveal of a door for Monty Hall problem

	let rndReveal doorWithPrize =
	let rnd = seedRnd.Next(1,3)
	match doorWithPrize with
	\|1 -> (rnd + 1)
	\|2 -> if rnd = 1 then 1
	else 3
	\|_ -> rnd

jackfoxy / LetsMakeADealGame.fs

Created November 13, 2012 00:30

game type for Monty Hall problem

	type game(doorWithPrize: int, fstChoice: int, revealedDoor: int) =
	member x.winFstChoice = (doorWithPrize = fstChoice)
	member x.winSwitch = (not(doorWithPrize = fstChoice)&&(not(doorWithPrize = revealedDoor)))
	member x.revealed = revealedDoor
	member x.ToString = "Prize Door: " + doorWithPrize.ToString() + "; "
	+ "First Choice: " + fstChoice.ToString() + "; "
	+ "Revealed Door: " + revealedDoor.ToString() + "; "
	+ "Wins 1st Choice: " + x.winFstChoice.ToString() + "; "
	+ "Wins Switch: " + x.winSwitch.ToString()

jackfoxy / genBinomialHeap.fs

Created November 4, 2012 18:17

generate example BinomialHeap internals in order

	let f = (fun acc -> ("b" :: (acc \|> (fun acc -> ("c" :: (acc \|> (fun acc -> ("a" :: (acc \|> (fun acc -> acc)))) \|> (fun acc -> acc) \|> (fun x -> x)))\|> (fun acc -> acc) ))) \|> (fun acc -> acc) )

	f []

jackfoxy / BinomialHeap fold step 4.fs

Created November 3, 2012 17:36

Step four in creating a fold over a BinomialHeap

	static member private foldHeapStep4 nodeF leafV (h : list<BinomialTree<'a>>) =

	let rec loop (h : list<BinomialTree<'a>>) cont =
	match h with
	\| Node(_, a, [])::[] -> loop [] (fun lacc ->
	loop [] (fun racc ->
	cont (nodeF a lacc racc)))
	\| Node(_, a, h')::[] -> loop h' (fun lacc ->
	loop [] (fun racc ->
	cont (nodeF a lacc racc)))

jackfoxy / BinomialHeap fold.fs

Created November 2, 2012 22:04

fold over a BinomialHeap

	static member private foldHeap nodeF leafV (h : list<BinomialTree<'a>>) =

	let rec loop (h : list<BinomialTree<'a>>) cont =
	match h with
	\| Node(_, a, h')::tl -> loop h' (fun lacc ->
	loop tl (fun racc ->
	cont (nodeF a lacc racc)))
	\| _ -> cont leafV

	loop h (fun x -> x)

jackfoxy / BinomialHeap fold step 3.fs

Created November 2, 2012 21:22

Step three in creating a fold over a BinomialHeap

	static member private foldHeapStep3 nodeF leafV (h : list<BinomialTree<'a>>) =

	let rec loop (h : list<BinomialTree<'a>>) cont =
	match h with
	\| Node(_, a, [])::[] -> loop [] (fun lacc ->
	loop [] (fun racc ->
	cont (nodeF a lacc racc)))
	\| Node(_, a, h')::[] -> loop h' (fun lacc ->
	loop [] (fun racc ->
	cont (nodeF a lacc racc)))

jackfoxy / BinomialHeap fold step 2.fs

Created November 2, 2012 20:10

Step two in creating a fold over a BinomialHeap

	static member private foldHeapStep2 c1 c2 c3 (t : list<BinomialTree<'a>>) =

	let rec loop (h : list<BinomialTree<'a>>) cont =
	match t with
	\| Node(_, a, [])::[] -> cont (c1 [a])
	\| Node(_, a, h')::[] -> loop h' (fun acc -> cont (c2 a acc))
	\| Node(_, a, [])::tl -> loop tl (fun acc -> cont (c2 a acc))
	\| Node(_, a, h')::tl -> loop h' (fun lacc ->
	loop tl (fun racc ->
	cont (c3 a lacc racc)))

jackfoxy / BinomialHeap fold step 1.fs

Created November 2, 2012 19:51

Step one in creating a fold over a BinomialHeap

	static member private foldHeapStep1 (h : list<BinomialTree<'a>>) =

	let rec loop (h : list<BinomialTree<'a>>) cont =
	match h with
	\| Node(_, a, [])::[] -> cont [a]
	\| Node(_, a, h')::[] -> loop h' (fun acc -> cont (a :: acc))
	\| Node(_, a, [])::tl -> loop tl (fun acc -> cont (a :: acc))
	\| Node(_, a, h')::tl -> loop h' (fun lacc -> loop tl (fun racc -> cont (a :: racc @ lacc)))
	\| _ -> failwith "can't get here"

Jack Fox jackfoxy