Index of values

apply s m the state created by executing the move m in state s

given a list of characters, build an optimal Huffman tree for encoding that list.

randomly select an element from a list

comparator q returns the comparator that q is ordered by

decode tree bits decodes bits using the encoding scheme specified for the encode function.

constructs an empty priority queue, ordered by the given comparator

encode tree chars produces the bit list representing chars using the Huffman tree tree.

returns true if two states are equal

the solved cube

Compares two states based on how close to the goal they are.

initialize a new window for drawing on

insert x q yields a queue containing x and the elements of q

is_empty q returns true if q is empty

returns true if the given state is a goal state

max q returns the maximum element of q (according to comparator q) returns None if the queue is empty.

Gives the list of all possible moves from a given state

Given a size n and a list l of size (n*n), creates a sliding tile puzzle.

rand_list n l returns a random list of l integers between 0 and n

remove q returns the maximum element of q (according to comparator q) and another queue q' containing the remaining elements

render astate state (Some(percent, move)) draws the given state of the puzzle on the window defined by astate, with move partially applied.

Given an initial state s and a list of moves, loop an animation of the application of those moves to the initial state.

randomly shuffle a list.

size q returns the number of elements of q

Given an initial state s, output a sequence [m1; m2; ...] that when applied to s in order, produces a goal state.

see List.sort

string_of_list f l returns a pretty joining of f invoked on every element of l.

time f x runs f x and returns the time it takes to run (in seconds).