Index of values

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

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

Performs initialization, fixpoint analysis and descending, and measures the global analysis time.

Same as analysis, but with the technique of Gopan and Reps published in Static Anlaysis Symposium, SAS'2007.

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 number of elements of a set.

Return the number of elements of a set.

Decomposition of the graph into Strongly Connected Components,

idem, but with a filtering of dependencies

idem, but from several initial vertices.

idem, but with a priority of dependencies.

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.

Empty a hash table.

Total ordering between sets.

Total ordering between sets.

Flatten the recursive list and converts it to a list

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 n data creates an hypergraph, using n for the initial size of internal hashtables, and data for the user information

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

Return the (maximal) depth of the list.

descend manager graph sinit strategy performs several descending steps, depending on the option manager.widening_descend.

Set difference.

Union, intersection and set difference.

Return the list of all elements of the given set.

Return the list of all elements of the given set.

The empty set.

The empty set.

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.

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

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.

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.

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

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

fixpoint manager graph strategy computes a fixpoint (or a postfixpoint in case of widening) of the system of equation represented by graph.

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

Hashtbl.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 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.

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.

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

Print an hashtable

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

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

init manager inputgraph sinit creates an internal graph and initializes it.

Set intersection.

Is the graph empty ?

Test whether a set is empty or not.

Test whether a set is empty or not.

Ordinary iteration function.

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

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.

Recursive iteration function, rather complex.

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

Return the ength of the list.

Hashtbl.length tbl returns the number of bindings in tbl.

Create a list element from a list.

Print a list

Ordinary map function.

Hashtbl.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.

Return the set of vertices without successor hyperedges

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.

Membership test.

Hashtbl.mem tbl x checks if x is bound in tbl.

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

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

Return the set of vertices without predecessor hyperedges

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.

Create a recursive list from a list

Getting the result of the analysis.

Print a pair

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.

Predecessor vertices of a vertex by any hyperedge

Predecessor hyperedges of a vertex

Predecessor vertices of an hyperedge

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

Printing function.

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

Prints internal graph.

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

Prints the result of an analysis.

Prints statistics

print_strategy_vertex man fmt sv prints an object of type strategy, using the manager man for printing vertices and hyperedges.

print_strategy_vertex man fmt sv prints an object of type strategy_vertex, using the manager man for printing vertices and hyperedges.

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

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

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.

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

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 with a filtering of dependencies

idem, but from several initial vertices.

idem, but with a priority of dependencies.

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.

Build a "default" strategy, with the following options:

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

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.

Successor vertices of a vertex by any hyperedge

Successor hyperedges of a vertex

Successor vertices of an hyperedge

Return the tail of the list.

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

Variant of the previous function, where the Boolean function f hedge succ tells whether the given dependency should be taken into account or not in the sort.

Topological sort from a set of root vertices.

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

Set union.

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

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.