Index of values


A
add [Ptset]
add [Store_intf.STORE]
add el s
add [Pomap_intf.POMAP]
add k el pm
add_find [Pomap_intf.POMAP]
add_find k el pm similar to add, but if the binding did already exist, then Found (ix, node) will be returned to indicate the index and node under which key k is bound.
add_fun [Pomap_intf.POMAP]
add_fun k el f pm similar to add, but if the binding already existed, then function f will be applied to the previously bound data.
add_node [Pomap_intf.POMAP]
add_node node pm

B
bot_attr [Display_hasse_intf.DEFAULT_SPEC]
Node attribute string for bottom nodes

C
cardinal [Ptset]
cardinal [Store_intf.STORE]
cardinal s
cardinal [Pomap_intf.POMAP]
cardinal pm
center [Display_hasse_intf.DEFAULT_SPEC]
chain_fold [Pomap_intf.POMAP]
chain_fold f pm a computes (f cN ... (f c1 a) ...), where c1 ... cN are the ascending chaines of nodes in map pm.
chain_foldi [Pomap_intf.POMAP]
chain_foldi f pm a same as Pomap_intf.POMAP.chain_fold, but function f receives chains including the index associated with the nodes.
choose [Ptset]
choose [Store_intf.STORE]
choose s
choose [Pomap_intf.POMAP]
choose pm
compare [Ptset]
compare [Pomap_intf.PARTIAL_ORDER]
create_node [Pomap_intf.POMAP]
create_node k el sucs prds

D
diff [Ptset]
diff [Pomap_intf.POMAP]
diff pm1 pm2 removes all elements of pm2 from pm1.

E
edge_attr [Display_hasse_intf.DEFAULT_SPEC]
Edge attribute string, e.g.
elements [Ptset]
empty [Ptset]
empty [Store_intf.STORE]
The empty store
empty [Pomap_intf.POMAP]
The empty partially ordered map.
eq_classes [Store_intf.STORE]
eq_classes eq s
equal [Ptset]
exists [Ptset]

F
filter [Ptset]
filter [Store_intf.STORE]
filter p s
filter [Pomap_intf.POMAP]
filter p pm
find [Ptset]
find [Store_intf.STORE]
find ix s
find [Pomap_intf.POMAP]
find k pm
find_ix [Pomap_intf.POMAP]
find_ix ix pm
fold [Ptset]
fold [Store_intf.STORE]
fold f s a computes (f eN ... (f e1 a) ...), where e1 ... eN are the elements of all bindings in store s.
fold [Pomap_intf.POMAP]
fold f pm a computes (f nN ... (f n1 a) ...), where n1 ... nN are the nodes in map pm.
fold_eq_classes [Pomap_intf.POMAP]
fold_eq_classes eq f pm a factorizes pm into maximal equivalence classes of partial orders: all bindings in each class have equivalent data elements as identified by eq and are connected in the original Hasse-diagram.
fold_split_eq_classes [Pomap_intf.POMAP]
fold_split_eq_classes eq f pm a same as Pomap_intf.POMAP.fold_eq_classes, but the equivalence classes are split further so that no element of other classes would fit between its bottom and top elements.
foldi [Store_intf.STORE]
foldi f s a same as fold, but function f also receives the index associated with the elements.
foldi [Pomap_intf.POMAP]
foldi f pm a same as Pomap_intf.POMAP.fold, but function f also receives the index associated with the nodes.
for_all [Ptset]
fprintf [Display_hasse_intf.DISPLAY_HASSE]
fprintf ppf pm prints partially ordered map pm to the pretty-printer ppf.

G
get_bot [Pomap_intf.POMAP]
get_bot pm
get_el [Pomap_intf.POMAP]
get_el n
get_ix_map [Store_intf.STORE]
get_ix_map s
get_key [Pomap_intf.POMAP]
get_key n
get_nodes [Pomap_intf.POMAP]
get_nodes pm
get_prds [Pomap_intf.POMAP]
get_prds n
get_sucs [Pomap_intf.POMAP]
get_sucs n
get_top [Pomap_intf.POMAP]
get_top pm

I
int_of_ix [Store_intf.INDEX]
int_of_ix ix converts index ix to an integer.
inter [Ptset]
inter [Pomap_intf.POMAP]
inter pm1 pm2 intersects pm1 and pm2, preserving the bindings of pm1.
intersect [Ptset]
is_empty [Ptset]
is_empty [Store_intf.STORE]
is_empty s
is_empty [Pomap_intf.POMAP]
is_empty pm tests whether partially ordered map pm is empty.
iter [Ptset]
iter [Store_intf.STORE]
iter f s applies f to all stored elements in store s.
iter [Pomap_intf.POMAP]
iter f pm applies f to all bound nodes in map pm.
iteri [Store_intf.STORE]
iter f s applies f to all indexes and their related elements in store s.
iteri [Pomap_intf.POMAP]
iteri f pm same as Pomap_intf.POMAP.iter, but function f also receives the index associated with the nodes.

L
label [Display_hasse_intf.DEFAULT_SPEC]

M
map [Ptset]
map [Store_intf.STORE]
map f s
map [Pomap_intf.POMAP]
map f pm
mapi [Store_intf.STORE]
mapi f s same as map, but function f also receives the index associated with the elements.
mapi [Pomap_intf.POMAP]
mapi f pm same as Pomap_intf.POMAP.map, but function f also receives the index associated with the nodes.
max_elt [Ptset]
mem [Ptset]
mem [Pomap_intf.POMAP]
mem k pm
mem_ix [Pomap_intf.POMAP]
mem el pm
min_elt [Ptset]

N
name [Display_hasse_intf.DEFAULT_SPEC]
next [Store_intf.INDEX]
next gen
next_ix [Store_intf.INDEX]
next_ix gen
next_ix [Store_intf.STORE]
next_ix s

O
of_list [Ptset]

P
partition [Ptset]
partition [Store_intf.STORE]
partition p s
partition [Pomap_intf.POMAP]
partition p pm
pp_node_attr [Display_hasse_intf.SPEC]
pp_node_attr ppf node prints attributes of node to the pretty-printer ppf.
pp_node_attr [Display_hasse_impl.DefaultSpec]
preorder_eq_classes [Pomap_intf.POMAP]
preorder_eq_classes eq pm
printf [Display_hasse_intf.DISPLAY_HASSE]
printf ppf pm prints partially ordered map pm to stdout.

R
ratio [Display_hasse_intf.DEFAULT_SPEC]
remove [Ptset]
remove [Store_intf.STORE]
remove ix s removes the binding of index ix of store s, and returns the resulting store.
remove [Pomap_intf.POMAP]
remove k pm
remove_eq_prds [Pomap_intf.POMAP]
remove_eq_prds eq pm
remove_ix [Store_intf.INDEX]
remove_ix gen ix
remove_ix [Pomap_intf.POMAP]
remove_ix ix pm
remove_node [Pomap_intf.POMAP]
remove_node node pm
rev_chain_fold [Pomap_intf.POMAP]
rev_chain_fold f pm a computes (f cN ... (f c1 a) ...), where c1 ... cN are the descending chaines of nodes in map pm.
rev_chain_foldi [Pomap_intf.POMAP]
rev_chain_foldi f pm a same as Pomap_intf.POMAP.rev_chain_fold, but function f receives chains including the index associated with the nodes.
rev_topo_fold [Pomap_intf.POMAP]
rev_topo_fold f pm a computes (f nN ... (f n1 a) ...), where n1 ... nN are the nodes in map pm sorted in descending topological order.
rev_topo_fold_ix [Pomap_intf.POMAP]
rev_topo_fold_ix f pm a same as Pomap_intf.POMAP.rev_topo_fold, but function f only receives the index associated with the nodes.
rev_topo_foldi [Pomap_intf.POMAP]
rev_topo_foldi f pm a same as Pomap_intf.POMAP.rev_topo_fold, but function f also receives the index associated with the nodes.
rotation [Display_hasse_intf.DEFAULT_SPEC]

S
set_el [Pomap_intf.POMAP]
set_el n el sets the data element of node n to el and returns new node.
set_key [Pomap_intf.POMAP]
set_key n k sets the key of node n to k and returns new node.
set_prds [Pomap_intf.POMAP]
set_prds n prds set the predecessors of node n to prds and returns new node.
set_sucs [Pomap_intf.POMAP]
set_sucs n sucs set the successors of node n to sucs and returns new node.
singleton [Ptset]
singleton [Store_intf.STORE]
singleton el
singleton [Pomap_intf.POMAP]
singleton k el
size_x [Display_hasse_intf.DEFAULT_SPEC]
size_y [Display_hasse_intf.DEFAULT_SPEC]
split [Ptset]
start [Store_intf.INDEX]
The start state of the index generator
subset [Ptset]

T
take [Pomap_intf.POMAP]
take k pm
take_ix [Pomap_intf.POMAP]
take_ix ix pm
to_list [Store_intf.STORE]
to_list s converts s to an association list of indices and elements.
top_attr [Display_hasse_intf.DEFAULT_SPEC]
Node attribute string for top nodes, e.g.
top_bot_attr [Display_hasse_intf.DEFAULT_SPEC]
Node attribute string for top/bottom nodes
topo_fold [Pomap_intf.POMAP]
topo_fold f pm a computes (f nN ... (f n1 a) ...), where n1 ... nN are the nodes in map pm sorted in ascending topological order.
topo_fold_ix [Pomap_intf.POMAP]
topo_fold_ix f pm a same as Pomap_intf.POMAP.topo_fold, but function f only receives the index associated with the nodes.
topo_fold_reduced [Pomap_intf.POMAP]
topo_fold_reduced eq f pm a computes (f nN ... (f n1 a) ...), where n1 ... nN are those nodes in map pm sorted in ascending topological order, whose data element is equivalent as defined by eq to the one of lower elements if there are no intermediate elements that violate this equivalence.
topo_foldi [Pomap_intf.POMAP]
topo_foldi f pm a same as Pomap_intf.POMAP.topo_fold, but function f also receives the index associated with the nodes.

U
union [Ptset]
union [Pomap_intf.POMAP]
union pm1 pm2 merges pm1 and pm2, preserving the bindings of pm1.
unsafe_set_bot [Pomap_intf.POMAP]
unsafe_set_bot pm set updates the index of bottom nodes in map pm with set.
unsafe_set_nodes [Pomap_intf.POMAP]
unsafe_set_nodes pm s updates the node store associated with map pm with s.
unsafe_set_top [Pomap_intf.POMAP]
unsafe_set_top pm set updates the index of top nodes in map pm with set.
unsafe_update [Pomap_intf.POMAP]
unsafe_update pm ix node updates the node associated with node index ix in map pm with node.
update [Store_intf.STORE]
update ix el s rebinds index ix in store s to point to el, and returns the resulting store.