Up
Index of values
A
age
[
Setoid_test.Person
]
age_db
[
Trie_test
]
age_next_year
[
Functor_test
]
age_next_year_either
[
Functor_test
]
and_
[
Wire
]
array_of_string
[
Levenshtein_test
]
assoc
[
Wire
]
assoc
[
Trie
]
B
binary_op
[
Wire
]
build_dictionary
[
Huffman_coding
]
C
code_tree
[
Huffman_coding
]
compare
[
Red_black_tree_test.Int
]
compare
[
Red_black_tree_test.Person
]
compare
[
Ord.S
]
constant
[
Wire
]
crowd
[
Setoid_test
]
D
decode
[
Huffman_coding
]
dequeue
[
Myqueue
]
deriv
[
Algebra
]
div
[
Wire
]
E
empty
[
Myqueue
]
empty_tree
[
Binary_search_tree.BSTPassThruFields
]
encode
[
Huffman_coding
]
enqueue
[
Myqueue
]
equals
[
Setoid_test.Person
]
equals
[
Setoid.Setoid
]
explode
[
Trie
]
extract
[
Binary_heap.S
]
extract
[
Binary_heap.BinaryHeap
]
extract_acc
[
Binary_heap_test
]
F
f
[
Setoid_test.Uniq
]
find
[
Binary_search_tree.BST
]
find
[
Binary_search_tree.Make
]
fmap
[
Functor_test.Either
]
fmap
[
Functor_test.Maybe
]
fmap
[
Functor.Functor
]
fmap
[
Mystack
]
frequency
[
Huffman_coding
]
G
get_age
[
Functor_test
]
get_age_either
[
Functor_test
]
H
height
[
Binary_search_tree.BST
]
height
[
Binary_search_tree.Make
]
I
insert
[
Binary_search_tree.BSTPassThruFields
]
insert
[
Trie
]
J
jo_matches
[
Trie_test
]
L
left
[
Binary_search_tree.InputBST
]
lev
[
Levenshtein
]
list_of_stack
[
Mystack
]
lookup
[
Trie
]
M
make
[
Setoid_test.Person
]
match_prefix
[
Trie
]
member
[
Setoid_test.Uniq
]
min3
[
Levenshtein
]
minus
[
Wire
]
N
name
[
Setoid_test.Person
]
not_
[
Wire
]
O
or_
[
Wire
]
P
peek
[
Binary_heap.S
]
peek
[
Binary_heap.BinaryHeap
]
peek
[
Mystack
]
plus
[
Wire
]
pop
[
Mystack
]
push
[
Mystack
]
Q
q
[
Myqueue_test
]
R
range
[
Red_black_tree_test
]
right
[
Binary_search_tree.InputBST
]
root
[
Trie
]
S
show
[
Red_black_tree_test.Int
]
show
[
Red_black_tree_test.Person
]
show
[
Ord.S
]
simplify
[
Algebra
]
stack
[
Functor_test
]
stack_of_list
[
Mystack
]
string_of_age
[
Functor_test
]
string_of_age_either
[
Functor_test
]
string_of_expression
[
Algebra
]
string_of_tree
[
Binary_search_tree.BST
]
string_of_tree
[
Binary_search_tree.Make
]
T
tap
[
Wire
]
times
[
Wire
]
transition
[
Finite_state_machine_test.HAPlusRegex
]
transition
[
Finite_state_machine_test.Turnstile
]
transition
[
Finite_state_machine_test.TrafficLight
]
transition
[
Finite_state_machine.S
]
traverse
[
Trie
]
tree
[
Binary_search_tree_test
]
trie_from_char_list
[
Trie
]
trie_from_string_list
[
Trie
]
U
unique_members
[
Setoid_test
]
V
value
[
Binary_search_tree.InputBST
]
W
walk
[
Trie
]
weight
[
Huffman_coding
]