Index of values

Add an element to the universe (initially belonging to its singleton)

Returns the symbol associated to the given string, after having possibly registered the string if it wasn't (in this case, the symbol is fresh symbol).

add x s returns a multiset containing all elements of s, plus x.

add x s returns a multiset containing all elements of s, plus x.

add x s returns a set containing all elements of s, plus x.

add x s returns a set containing all elements of s, plus x.

Add a new binding to the table.

Add a new binding to the current map and return the new map.

add tbl x y adds a binding of x to y in table tbl.

add x y m returns a map containing the same bindings as m, plus a binding of x to y.

add x s returns a set containing all elements of s, plus x.

add x s returns a set containing all elements of s, plus x.

add x s returns a set containing all elements of s, plus x.

Add an hyperedge.

Add a vertex

addmap m1 m2 merges the two maps m1 and m2.

Append two lists

Print an array

Create a list element from a single element.

attrhedge graph hedge returns the information associated to the hyperedge hedge

attrvertex graph vertex returns the information associated to the vertex vertex

Return the list of all bindings of the given map.

Return the number of elements of a multiset.

Return the number of elements of a multiset.

Return the number of elements of a set.

Return the number of elements of a set.

Return the number of bindings.

Return the number of bindings.

Number of keys of a map

Return the number of elements of a set.

Return the number of elements of a set.

Return the number of elements of a set.

Decomposition of the graph into Strongly Connected Components,

idem, but from several initial vertices.

Return one element of the given multiset, or raise Not_found if the multiset is empty.

Return one element of the given multiset, or raise Not_found if the multiset is empty.

Return one element of the given set, or raise Not_found if the set is empty.

Return one element of the given set, or raise Not_found if the set is empty.

Returns a binding, or raise Not_found if empty

Return one element of the given set, or raise Not_found if the set is empty.

Return one element of the given set, or raise Not_found if the set is empty.

Return one element of the given set, or raise Not_found if the set is empty.

Remove all vertices and hyperedges of the graph.

Clear a table

Empty a hash table.

Return the common bindings.

common commondata a b returns a map the keys of which must be keys in both a and in b, and those keys are bound to interdata d1 d2.

Same as common, but the function receives as arguments the key (of the first map)

Comparison (do not correspond at all to alphabetic order, depend on the registration order of names in the module)

Total ordering between multisets.

Total ordering between multisets.

Total ordering between sets.

Total ordering between sets.

Total ordering between sets.

Total ordering between sets.

Total ordering between sets.

Comparison function between maps, total if the comparison function for data is total

Adding a new list element at the begining of the list

Copy an hypergraph, using the given functions to duplicate the attributes associated to the elements of the graph.

Return a copy of the given hashtable.

Create a new universe set

create n data creates an hypergraph, using n for the initial size of internal hashtables, and data for the user information

Create a new table, with the specified initial size

create n creates a new, empty hash table, with initial size n.

Return the (maximal) depth of the list.

Union, intersection and multiset difference.

Union, intersection and multiset difference.

Union, intersection and set difference.

Union, intersection and set difference.

Union, intersection and set difference.

Set difference.

Union, intersection and set difference.

Union, intersection and multiset difference with a set.

Union, intersection and multiset difference with a set.

interset map set removes the bindings of a whose key belongs to set.

Remove the two-way bindings x <->y with x in the set

Remove the two-way bindings x <->y with y in the set

Return the list of all elements of the given multiset.

Return the list of all elements of the given multiset.

Return the list of all elements of the given set.

Return the list of all elements of the given set.

Return the list of all elements of the given set.

Return the list of all elements of the given set.

Return the list of all elements of the given set.

The empty multiset.

The empty multiset.

The empty set.

The empty set.

Empty map

The empty map.

The empty set.

The empty set.

The empty set.

Equality test

equal s1 s2 tests whether the multisets s1 and s2 are equal, that is, contain equal elements with equal occurence numbers.

equal s1 s2 tests whether the multisets s1 and s2 are equal, that is, contain equal elements with equal occurence numbers.

equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

The equality predicate used to compare keys.

equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

equality between maps

Escape a string, replacing line breaks by linebreak (default '\n').

Is the string already registered ?

Existence test

exists p s checks if at least one element of the set satisfies the predicate p.

exists p s checks if at least one element of the set satisfies the predicate p.

exists p s checks if at least one element of the set satisfies the predicate p.

exists p s checks if at least one element of the set satisfies the predicate p.

exists p s checks if at least one element of the set satisfies the predicate p.

Extract the list of sets

filter p l returns all the elements of the multiset l that satisfy the predicate p.

filter p l returns all the elements of the multiset l that satisfy the predicate p.

filter p s returns the set of all elements in s that satisfy predicate p.

filter p s returns the set of all elements in s that satisfy predicate p.

filter p m returns the map of all bindings in m that satisfy predicate p.

filter p s returns the set of all elements in s that satisfy predicate p.

filter p s returns the set of all elements in s that satisfy predicate p.

filter p s returns the set of all elements in s that satisfy predicate p.

find tbl x returns the current binding of x in tbl, or raises Not_found if no such binding exists.

find x m returns the current binding of x in m, or raises Not_found if no such binding exists.

find_all tbl x returns the list of all data associated with x in tbl.

Flatten the recursive list, but only starting from the given depth.

fold f s a computes (f (xN,On) ... (f (x2,O2) (f (x1,o1) a))...), where (x1,o1) ... (xN,oN) are pairs of elements of s with their occurence number.

fold f s a computes (f (xN,On) ... (f (x2,O2) (f (x1,o1) a))...), where (x1,o1) ... (xN,oN) are pairs of elements of s with their occurence number.

fold f s a computes (f xN ... (f x2 (f x1 a))...), where x1 ... xN are the elements of s.

fold f s a computes (f xN ... (f x2 (f x1 a))...), where x1 ... xN are the elements of s.

Iterate on bindings and accumulating a result.

Iterate on bindings and accumulating a result.

fold f tbl init computes (f kN dN ... (f k1 d1 init)...), where k1 ... kN are the keys of all bindings in tbl, and d1 ... dN are the associated values.

fold f m a computes (f kN dN ... (f k1 d1 a)...), where k1 ... kN are the keys of all bindings in m, and d1 ... dN are the associated data.

fold f s a computes (f xN ... (f x2 (f x1 a))...), where x1 ... xN are the elements of s.

fold f s a computes (f xN ... (f x2 (f x1 a))...), where x1 ... xN are the elements of s.

fold f s a computes (f xN ... (f x2 (f x1 a))...), where x1 ... xN are the elements of s.

Ordinary fold function, from left to right.

Idem as List.fold_X functions

Idem as List.fold_X functions

Idem as List.fold_X functions

Idem as List.fold_X functions

Ordinary fold function, from right to left.

for_all p s checks if all elements of the set satisfy the predicate p.

for_all p s checks if all elements of the set satisfy the predicate p.

for_all p s checks if all elements of the set satisfy the predicate p.

for_all p s checks if all elements of the set satisfy the predicate p.

for_all p s checks if all elements of the set satisfy the predicate p.

A hashing function on keys.

hash x associates a positive integer to any value of any type.

Print an hashtable

hash_param n m x computes a hash value for x, with the same properties as for hash.

Return the correspondance hashtable resp.

Return the head of the list.

A dummy (never used) value for hyperedge identifiers (used for the functions XXX_multi)

info g returns the user-information attached to the graph g

Set intersection.

interset map set selects the bindings in a whose key belongs to set.

Select the two-way bindings x <->y with x in the set

Select the two-way bindings x <->y with y in the set

Is the graph empty ?

Test whether a multiset is empty or not.

Test whether a multiset is empty or not.

Test whether a set is empty or not.

Test whether a set is empty or not.

Is the map empty ?

Test whether a set is empty or not.

Test whether a set is empty or not.

Test whether a set is empty or not.

Ordinary iteration function.

iter f s applies f in turn to all elements of s, with their occurence number.

iter f s applies f in turn to all elements of s, with their occurence number.

iter f s applies f in turn to all elements of s.

iter f s applies f in turn to all elements of s.

Iterate on bindings.

Iterate on bindings.

iter f tbl applies f to all bindings in table tbl.

iter f m applies f to all bindings in map m.

iter f s applies f in turn to all elements of s.

iter f s applies f in turn to all elements of s.

iter f s applies f in turn to all elements of s.

Iterates the function f hedge attrhedge succvertices predvertices to all hyperedges of the graph.

Iterates the function f vertex attrvertex succhedges predhedges to all vertices of the graph.

Return the ength of the list.

length tbl returns the number of bindings in tbl.

Function to call on line returns in lexer

Create a list element from a list.

Print a list

Internal, do not use

Ordinary map function.

map f tbl applies f to all bindings in table tbl and creates a new hashtable associating the results of f to the same key type.

map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a.

Same as map, but the function receives as arguments both the key and the associated value for each binding of the map.

mapofset f s returns the map associating f key to key, for each element key of the set s

maptoset m returns the set of the keys in the association table

Return the correspondance map resp.

Return the set of vertices without successor hyperedges

Return an element with the maximum occurence number, or raise Not_found if the multiset is empty.

Return an element with the maximum occurence number, or raise Not_found if the multiset is empty.

Same as min_elt, but returns the largest element of the given multiset.

Same as min_elt, but returns the largest element of the given multiset.

Same as min_elt, but returns the largest element of the given set.

Same as min_elt, but returns the largest element of the given set.

Same as min_elt, but returns the largest element of the given set.

Same as Sette.S.min_elt, but returns the largest element of the given set.

Same as min_elt, but returns the largest element of the given set.

Same as min_elt, but returns the largest key of the given map.

Return the set of elements with the maximum occurence number, or raise Not_found if the multiset is empty.

Return the set of elements with the maximum occurence number, or raise Not_found if the multiset is empty.

Returns the mean of the array.

Membership test.

mem x s tests whether x belongs to the multiset s.

mem x s tests whether x belongs to the multiset s.

mem x s tests whether x belongs to the set s.

mem x s tests whether x belongs to the set s.

mem tbl x checks if x is bound in tbl.

mem x m returns true if m contains a binding for m, and false otherwise.

mem x s tests whether x belongs to the set s.

mem x s tests whether x belongs to the set s.

mem x s tests whether x belongs to the set s.

Is the object registered ?

Is the object in the map ?

Is the object registered ?

Is the object in the map ?

Merge the two double associations.

merge mergedata a b is similar to addmap a b, but if a key k is bound to d1 in m1 and to d2 in m2, the key k is bound to mergedata d1 d2 in the result

Same as merge, but the function receives as arguments the key (of the first map)

Return the set of vertices without predecessor hyperedges

Return an element with the minimum occurence number, or raise Not_found if the multiset is empty.

Return an element with the minimum occurence number, or raise Not_found if the multiset is empty.

Return the smallest element of the given multiset (with respect to the Pervasives.compare ordering), or raise Not_found if the multiset is empty.

Return the smallest element of the given multiset (with respect to the Pervasives.compare ordering), or raise Not_found if the multiset is empty.

Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

Return the smallest element of the given set (with respect to the Pervasives.compare ordering), or raise Not_found if the set is empty.

Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

Return the smallest key of the given map or raise Not_found if the set is empty.

Return the set of elements with the minimum occurence number, or raise Not_found if the multiset is empty.

Return the set of elements with the minimum occurence number, or raise Not_found if the multiset is empty.

mult elt mset returns the number of occurences of the element elt in the multiset mset.

mult elt mset returns the number of occurences of the element elt in the multiset mset.

Create a recursive list from a list

Conversion from a list (unsafe operation)

Conversion from a list (unsafe operation)

Conversion from sets of module SetList.

Conversion from sets of module SetList.

Returns the existing symbol associated to the (registered) string.

Print an optional element

Print a pair

Same as before, but create itself a lexbuf from the given filename.

Takes as input a lexer, a parser compatible with the lexer (ie, they share the same type for tokens), and a lexbuf,

Same as before, but create itself a lexbuf from the given string.

partition p l returns a pair of multisets (l1, l2), where l1 is the multiset of all the elements of l that satisfy the predicate p, and l2 is the multiset of all the elements of l that do not satisfy p.

partition p l returns a pair of multisets (l1, l2), where l1 is the multiset of all the elements of l that satisfy the predicate p, and l2 is the multiset of all the elements of l that do not satisfy p.

partition p s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate p, and s2 is the set of all the elements of s that do not satisfy p.

partition p s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate p, and s2 is the set of all the elements of s that do not satisfy p.

partition p m returns a pair of maps (m1, m2), where m1 is the map of all the bindings of m that satisfy the predicate p, and m2 is the map of all the bindings of m that do not satisfy p.

partition p s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate p, and s2 is the set of all the elements of s that do not satisfy p.

partition p s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate p, and s2 is the set of all the elements of s that do not satisfy p.

partition p s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate p, and s2 is the set of all the elements of s that do not satisfy p.

Expensive operation, requires iterations on all vertices

Predecessor vertices of a vertex by any hyperedge

Predecessor hyperedges of a vertex

Predecessor vertices of an hyperedge

Prints the symbol (its associated string).

Print a graph in textual format on the given formatter, using the given functions to resp.

Printing function.

Printing function

Printing function

Printing function

Printing function

Print the set of bindings.

Print the set of bindings.

Print a map.

Output the graph in DOT format on the given formatter, using the given functions to resp print:

Prints hashtables on symbols.

Prints maps on symbols.

Transforms a conversion-to-string function to a printing function.

Prints sets of symbols.

Returns the set of vertices and hyperedges that are *NOT* reachable from the given root vertex.

remove x s returns a multiset containing all elements of s, with the occurence number of x decremented.

remove x s returns a multiset containing all elements of s, with the occurence number of x decremented.

remove x s returns a set containing all elements of s, except x.

remove x s returns a set containing all elements of s, except x.

Remove a binding defined by its first element and return the new map.

remove tbl x removes the current binding of x in tbl, restoring the previous binding if it exists.

remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map.

remove x s returns a set containing all elements of s, except x.

remove x s returns a set containing all elements of s, except x.

remove x s returns a set containing all elements of s, except x.

Remove the hyperedge from the graph.

Remove the vertex from the graph, as well as all related hyperedges.

Expensive operation, requires iterations on all vertices

Remove a binding defined by its first element.

Remove a binding defined by its second element.

replace tbl x y replaces the current binding of x in tbl by a binding of x to y.

Change the attribute of an existing hyperedge

Change the attribute of an existing vertex

Recursively reverse the recursive list rev [a;[b;[c];d];e;[f]] = [[f];e;[d;[c];b];a]

Decomposition of the graph into Strongly Connected Sub-Components,

idem, but from several initial vertices.

Return the set of all objects in the first place of bindings.

Return the set of all objects in the second place of bindings.

singleton x returns the one-element multiset containing only x.

singleton x returns the one-element multiset containing only x.

singleton x returns the one-element set containing only x.

singleton x returns the one-element set containing only x.

singleton x returns the one-element set containing only x.

singleton x returns the one-element set containing only x.

singleton x returns the one-element set containing only x.

size graph returns (nbvertex,nbhedge,nbedgevh,nbedgehv)

Number of edges (hyperedge,vertex) in the hypergraph

Number of edges (vertex,hyperedge) in the hypergraph

Number of hyperedges in the hypergraph

Number of vertices in the hypergraph

Meant to be internal, but exporting needed for Mappe.maptoset.

Better sprintf function than Format.sprintf, as it takes the same kind of formatters as other Format.Xprintf functions.

Given the mean, returns the standard deviation of the array.

Transforms a printing function into a conversion-to-string function.

subset s1 s2 tests whether the multiset s1 is a subset of the multiset s2.

subset s1 s2 tests whether the multiset s1 is a subset of the multiset s2.

subset s1 s2 tests whether the set s1 is a subset of the set s2.

subset s1 s2 tests whether the set s1 is a subset of the set s2.

subset s1 s2 tests whether the set s1 is a subset of the set s2.

subset s1 s2 tests whether the set s1 is a subset of the set s2.

subset s1 s2 tests whether the set s1 is a subset of the set s2.

subset between maps

Test two two-way association for equality and inclusion.

Successor vertices of a vertex by any hyperedge

Successor hyperedges of a vertex

Successor vertices of an hyperedge

Return the tail of the list.

Conversion to a list

Conversion to a list

to_set m returns the set of elements in the multiset m.

to_set m returns the set of elements in the multiset m.

Returns the string represented by the symbol.

Topological sort of the vertices of the hypergraph starting from a root vertex.

Topological sort from a set of root vertices.

Similar to copy, but hyperedges are reversed: successor vertices and predecessor vertices are exchanged.

Computes the union of two sets and returns the resulting set

Set union.

Given the mean, returns the variance of the array.

A dummy (never used) value for vertex identifiers (used for the functions XXX_multi)

Print a weak pointer array

wrap_duration duration f executes the function f and stores into !duration the time spent in f, in seconds.

Similar to wrap_duration, but here the time spent in f is added to the value !duration.

Inverse association.

Inverse association

Association.

Association