A | |
add [Set.S] | add x s returns a set containing all elements of s ,
plus x .
|
add [Computation.QUEUE] | |
C | |
callgraph [Register] | |
cardinal [Set.S] |
Return the number of elements of a set.
|
choose [Set.S] |
Return one element of the given set, or raise
Not_found if
the set is empty.
|
compare [Set.S] |
Total ordering between sets.
|
compare [Project.Datatype.S] | |
compute [Service_graph.Make] | |
compute [Register] | |
compute_services [Service_graph.Make] | |
contain_project [Project.Datatype.S] | |
D | |
diff [Set.S] |
Set difference.
|
dump [Register] | |
E | |
elements [Set.S] |
Return the list of all elements of the given set.
|
empty [Set.S] |
The empty set.
|
equal [Set.S] | equal s1 s2 tests whether the sets s1 and s2 are
equal, that is, contain equal elements.
|
equal [Project.Datatype.S] | |
exists [Set.S] | exists p s checks if at least one element of
the set satisfies the predicate p .
|
F | |
filter [Set.S] | filter p s returns the set of all elements in s
that satisfy predicate p .
|
fold [Set.S] | fold f s a computes (f xN ... (f x2 (f x1 a))...) ,
where x1 ... xN are the elements of s , in increasing order.
|
for_all [Set.S] | for_all p s checks if all elements of the set
satisfy the predicate p .
|
G | |
get [Register] | |
get_init_funcs [Register] | |
get_option [Computation.OPTION_REF_OUTPUT] | |
H | |
hash [Project.Datatype.S] | |
I | |
inter [Set.S] |
Set intersection.
|
is_comparable_set [Project.Datatype.S] | |
is_empty [Set.S] |
Test whether a set is empty or not.
|
is_empty [Computation.QUEUE] | |
iter [Set.S] | iter f s applies f in turn to all elements of s .
|
iter [Computation.QUEUE] | |
M | |
map [Computation.OPTION_REF_OUTPUT] | |
max_elt [Set.S] |
Same as
Set.S.min_elt , but returns the largest element of the
given set.
|
may [Computation.OPTION_REF_OUTPUT] | |
mem [Set.S] | mem x s tests whether x belongs to the set s .
|
memo [Computation.OPTION_REF_OUTPUT] |
Memoization.
|
min_elt [Set.S] |
Return the smallest element of the given set
(with respect to the
Ord.compare ordering), or raise
Not_found if the set is empty.
|
N | |
name [Options] | |
O | |
output_graph [Service_graph.Make] | |
output_services [Service_graph.Make] | |
P | |
partition [Set.S] | 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 .
|
physical_hash [Project.Datatype.S] | |
R | |
register_comparable [Project.Datatype.S] |
Allow to register a specific
compare , equal , hash and
physical_hash functions for the datatype.
|
remove [Set.S] | remove x s returns a set containing all elements of s ,
except x .
|
S | |
singleton [Set.S] | singleton x returns the one-element set containing only x .
|
split [Set.S] | split x s returns a triple (l, present, r) , where
l is the set of elements of s that are
strictly less than x ;
r is the set of elements of s that are
strictly greater than x ;
present is false if s contains no element equal to x ,
or true if s contains an element equal to x .
|
subset [Set.S] | subset s1 s2 tests whether the set s1 is a subset of
the set s2 .
|
T | |
topologically_iter_on_functions [Register] | |
U | |
union [Set.S] |
Set union.
|