Index of values


A
add [Set.S]
add [Set.Make]
add [Hashtbl.S]
add [Hashtbl.Make]
add [Hashtbl]
astar [PathVisual.PathFinding]
astar' [PathVisual.PathFinding]
astar'' [PathVisual.PathFinding]

B
bal [Set.Make]
bubbledown [PathVisual.MutBinHeap]
bubbleup [PathVisual.MutBinHeap]

C
cardinal [Set.S]
cardinal [Set.Make]
cave0 [PathVisual.Cave]
cave1 [PathVisual.Cave]
cave2 [PathVisual.Cave]
caveify [PathVisual.Cave]
choose [Set.S]
choose [Set.Make]
clear [Hashtbl.S]
clear [Hashtbl.Make]
clear [Hashtbl]
compare [Set.S]
compare [Set.OrderedType]
compare [Set.Make]
compare_aux [Set.Make]
concat [Set.Make]
connect_cave [PathVisual.Cave]
connect_cave' [PathVisual.Cave]
connected [PathVisual.Cave]
cons_enum [Set.Make]
copy [PathVisual.Cave]
copy [Hashtbl.S]
copy [Hashtbl.Make]
copy [Hashtbl]
create [Set.Make]
create [Hashtbl.S]
create [Hashtbl.Make]
create [Hashtbl]
curses_keys [PathVisual.UI]

D
debug_opt [PathVisual.UI]
debug_opt_legend [PathVisual.UI]
debug_path [PathVisual.UI]
debug_path_legend [PathVisual.UI]
diff [Set.S]
diff [Set.Make]
dig_tunnel [PathVisual.Cave]
dijkstra [PathVisual.PathFinding]
dijkstra' [PathVisual.PathFinding]
dijkstra'' [PathVisual.PathFinding]
dist_euclid [PathVisual.PathFinding]
dist_simple [PathVisual.PathFinding]
draw_path [PathVisual.UI]

E
elements [Set.S]
elements [Set.Make]
elements_aux [Set.Make]
empty [Set.S]
empty [Set.Make]
equal [Set.S]
equal [Set.Make]
equal [Hashtbl.HashedType]
exists [PathVisual.IntPairHash]
Check if elt exists in hash.
exists [Set.S]
exists [Set.Make]

F
filter [Set.S]
filter [Set.Make]
find [Hashtbl.S]
find [Hashtbl.Make]
find [Hashtbl]
find_all [Hashtbl.S]
find_all [Hashtbl.Make]
find_all [Hashtbl]
find_connected [PathVisual.Cave]
find_rec [Hashtbl]
find_unconnected [PathVisual.Cave]
fold [Set.S]
fold [Set.Make]
fold [Hashtbl.S]
fold [Hashtbl.Make]
fold [Hashtbl]
fold_right [PathVisual.Cave]
for_all [Set.S]
for_all [Set.Make]

G
get [PathVisual.Cave]
get [PathVisual.MutBinHeap]
get_dist_alg [PathVisual.UI]
get_dist_alg_name [PathVisual.UI]
get_map_type [PathVisual.UI]
get_map_type_name [PathVisual.UI]
get_path_opt_alg [PathVisual.UI]
get_path_opt_alg_name [PathVisual.UI]
get_pathfinding [PathVisual.UI]
get_pathfinding_name [PathVisual.UI]
getch [PathVisual.UI]
getch' [PathVisual.UI]
getpos [PathVisual.MutBinHeap]
Get element with given pos
getvalidxy [PathVisual.Cave]
greedy_astar [PathVisual.PathFinding]
greedy_astar' [PathVisual.PathFinding]
greedy_astar'' [PathVisual.PathFinding]

H
hash [Hashtbl.HashedType]
hash [Hashtbl]
hash_param [Hashtbl]
height [Set.Make]

I
inrangexy [PathVisual.Cave]
insert [PathVisual.MutBinHeap]
Insert element into heap
inter [Set.S]
inter [Set.Make]
intpairset_neighbours [PathVisual.Cave]
is_empty [Set.S]
is_empty [Set.Make]
is_valid_coor [PathVisual.Cave]
isfloor [PathVisual.Cave]
iter [PathVisual.Cave]
Iterate over cave elements.
iter [Set.S]
iter [Set.Make]
iter [Hashtbl.S]
iter [Hashtbl.Make]
iter [Hashtbl]

J
join [Set.Make]

L
left_child [PathVisual.MutBinHeap]
Get array index of left child
length [Hashtbl.S]
length [Hashtbl.Make]
length [Hashtbl]
line [PathVisual.Geometry]
Bresenham's line algorithm
lineofsight [PathVisual.PathFinding]
loop [PathVisual.UI]

M
main [PathVisual.UI]
make [PathVisual.Cave]
Make a new cave of dimensions initialized to consist of WALLs
make [PathVisual.MutBinHeap]
Make a new binary heap.
makecave1 [PathVisual.Cave]
makecave2 [PathVisual.Cave]
makecave3 [PathVisual.Cave]
makeinit [PathVisual.Cave]
Make a new cave initialized to init
map [PathVisual.Cave]
mapi [PathVisual.Cave]
max_elt [Set.S]
max_elt [Set.Make]
mem [Set.S]
mem [Set.Make]
mem [Hashtbl.S]
mem [Hashtbl.Make]
mem [Hashtbl]
merge [Set.Make]
min_elt [Set.S]
min_elt [Set.Make]
my_draw [PathVisual.UI]

N
neighbour_coords [PathVisual.Cave]
neighbour_coords' [PathVisual.Cave]
new_map [PathVisual.UI]

O
of_list [PathVisual.IntPairSet]

P
parent [PathVisual.MutBinHeap]
Get array index of parent
partition [Set.S]
partition [Set.Make]
path [PathVisual.PathFinding]
path_opt [PathVisual.PathFinding]
path_opt' [PathVisual.PathFinding]
path_opt'' [PathVisual.PathFinding]
path_opt_fast [PathVisual.PathFinding]
path_opt_fast_foundf [PathVisual.PathFinding]
path_opt_good [PathVisual.PathFinding]
path_opt_good_foundf [PathVisual.PathFinding]
pathfindingloop [PathVisual.PathFinding]
pop [PathVisual.MutBinHeap]
Returns the minimum element and removes it from the heap.
print [PathVisual.Cave]
printcave [PathVisual.UI]
printf [PathVisual.UI]

R
refresh [PathVisual.UI]
remove [PathVisual.MutBinHeap]
Remove element 
((x,y),cost,dist)
where 
(x,y) = pos
remove [Set.S]
remove [Set.Make]
remove [Hashtbl.S]
remove [Hashtbl.Make]
remove [Hashtbl]
remove_min_elt [Set.Make]
replace [PathVisual.MutBinHeap]
Insert new element or replace existing element with matching first.
replace [Hashtbl.S]
replace [Hashtbl.Make]
replace [Hashtbl]
resize [Hashtbl]
right_child [PathVisual.MutBinHeap]
Get array index of right child

S
set [PathVisual.Cave]
set_cursor_ifvalid [PathVisual.UI]
set_path [PathVisual.UI]
singleton [Set.S]
singleton [Set.Make]
split [Set.S]
split [Set.Make]
sprintf [PathVisual.UI]
string_of_cave [PathVisual.Cave]
string_of_char [PathVisual.UI]
string_of_path [PathVisual.PathFinding]
string_of_wall [PathVisual.Cave]
subset [Set.S]
subset [Set.Make]
swap [PathVisual.MutBinHeap]
Swaps 2 array indexes

T
to_list [PathVisual.IntPairHash]
Convert a IntPairHash to a list of (key,value) tuples.

U
union [Set.S]
union [Set.Make]

W
waddstr [PathVisual.UI]
wall_neighbours [PathVisual.Cave]