A | |
add [State_builder.Hashtbl] |
Add a new binding.
|
add [Set.S] | add x s returns a set containing all elements of s ,
plus x .
|
add_path_bounds [Slevel_analysis.Specific] | |
after [Region_analysis.Make] | |
all_nodes [Region_analysis_sig.Node.Graph] | |
analyze [Register] | |
analyze [Slevel_analysis] | |
analyze [Loop_analysis] | |
analyze [LoopAnalysis.Loop_analysis] | |
C | |
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.
|
choose_opt [Set.S] |
Return one element of the given set, or
None if
the set is empty.
|
clear [State_builder.Hashtbl] |
Clear the table.
|
cmp_kf_by_name [Slevel_analysis] | |
compare [Set.S] |
Total ordering between sets.
|
compile_node [Slevel_analysis.SpecificNoBranches] | |
compile_node [Slevel_analysis.Specific] | |
compile_node [Region_analysis_stmt.M] | |
compile_node [Region_analysis_sig.Node] | |
copy [Region_analysis_sig.Node.Dict] | |
create [Region_analysis_sig.Node.Edge_Dict] | |
create [Region_analysis_sig.Node.Dict] | |
D | |
diff [Set.S] |
Set difference.
|
display_results [Slevel_analysis] | |
dominates [Region_analysis_sig.Node.DomTree] | |
domtree_postfix_iter [Region_analysis_sig.Node.DomTree] | |
E | |
elements [Set.S] |
Return the list of all elements of the given set.
|
empty [Set.S] |
The empty set.
|
entry_node [Region_analysis_sig.Node.Graph] | |
equal [Set.S] | equal s1 s2 tests whether the sets s1 and s2 are
equal, that is, contain equal elements.
|
exists [Set.S] | exists p s checks if at least one element of
the set satisfies the predicate p .
|
exit_nodes [Region_analysis_sig.Node.Graph] | |
F | |
filter [Set.S] | filter p s returns the set of all elements in s
that satisfy predicate p .
|
find [State_builder.Hashtbl] |
Return the current binding of the given key.
|
find [Set.S] | find x s returns the element of s equal to x (according
to Ord.compare ), or raise Not_found if no such element
exists.
|
find_all [State_builder.Hashtbl] |
Return the list of all data associated with the given key.
|
find_first [Set.S] | find_first f s , where f is a monotonically increasing function,
returns the lowest element e of s such that f e ,
or raises Not_found if no such element exists.
|
find_first_opt [Set.S] | find_first_opt f s , where f is a monotonically increasing function,
returns an option containing the lowest element e of s such that
f e , or None if no such element exists.
|
find_last [Set.S] | find_last f s , where f is a monotonically decreasing function,
returns the highest element e of s such that f e ,
or raises Not_found if no such element exists.
|
find_last_opt [Set.S] | find_last_opt f s , where f is a monotonically decreasing function,
returns an option containing the highest element e of s such that
f e , or None if no such element exists.
|
find_opt [Set.S] | find_opt x s returns the element of s equal to x (according
to Ord.compare ), or None if no such element
exists.
|
fold [State_builder.Hashtbl] | |
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.
|
fold_bounds [Loop_analysis] | |
fold_bounds [LoopAnalysis.Loop_analysis] | |
fold_sorted [State_builder.Hashtbl] | |
for_all [Set.S] | for_all p s checks if all elements of the set
satisfy the predicate p .
|
G | |
get [Region_analysis_sig.Node.Edge_Dict] | |
get [Region_analysis_sig.Node.Dict] | |
get_bounds [Loop_analysis] | |
get_bounds [LoopAnalysis.Loop_analysis] | |
get_range [Parameter_sig.Int] |
What is the possible range of values for this parameter.
|
I | |
incr [Parameter_sig.Int] |
Increment the integer.
|
inter [Set.S] |
Set intersection.
|
is_empty [Set.S] |
Test whether a set is empty or not.
|
iter [State_builder.Hashtbl] | |
iter [Region_analysis_sig.Node.Edge_Dict] | |
iter [Set.S] | iter f s applies f in turn to all elements of s .
|
iter [Region_analysis_sig.Node.Dict] | |
iter_preds [Region_analysis_sig.Node.Graph] | |
iter_sorted [State_builder.Hashtbl] | |
iter_succs [Region_analysis_sig.Node.Graph] | |
J | |
join [Slevel_analysis.SpecificNoBranches] | |
join [Slevel_analysis.Specific] | |
join [Region_analysis_stmt.M] | |
join [Region_analysis_sig.Node] | |
join2 [Slevel_analysis.SpecificNoBranches] | |
join2 [Slevel_analysis.Specific] | |
join2_stmts [Slevel_analysis.SpecificNoBranches] | |
join2_stmts [Slevel_analysis.Specific] | |
K | |
kf [Slevel_analysis.SpecificNoBranches] | |
kf [Slevel_analysis.Specific] | |
kf [Region_analysis_stmt.M] | |
L | |
length [State_builder.Hashtbl] |
Length of the table.
|
M | |
main [Register] | |
map [Set.S] | map f s is the set whose elements are f a0 ,f a1 ...
|
max_elt [Set.S] |
Same as
Set.S.min_elt , but returns the largest element of the
given set.
|
max_elt_opt [Set.S] |
Same as
Set.S.min_elt_opt , but returns the largest element of the
given set.
|
max_slevel_encountered [Slevel_analysis] | |
mem [State_builder.Hashtbl] | |
mem [Set.S] | mem x s tests whether x belongs to the set s .
|
memo [State_builder.Hashtbl] |
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.
|
min_elt_opt [Set.S] |
Return the smallest element of the given set
(with respect to the
Ord.compare ordering), or None
if the set is empty.
|
mu [Slevel_analysis.SpecificNoBranches] | |
mu [Slevel_analysis.Specific] | |
mu [Region_analysis_stmt.M] | |
mu [Region_analysis_sig.Node] | |
O | |
of_list [Set.S] | of_list l creates a set from a list of elements.
|
off [Parameter_sig.Bool] |
Set the boolean to
false .
|
on [Parameter_sig.Bool] |
Set the boolean to
true .
|
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 .
|
pretty [Region_analysis_sig.Node] | |
R | |
remove [State_builder.Hashtbl] | |
remove [Set.S] | remove x s returns a set containing all elements of s ,
except x .
|
replace [State_builder.Hashtbl] |
Add a new binding.
|
S | |
set [Region_analysis_sig.Node.Edge_Dict] | |
set [Region_analysis_sig.Node.Dict] | |
set_range [Parameter_sig.Int] |
Set what is the possible range of values for this parameter.
|
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 .
|
U | |
union [Set.S] |
Set union.
|
update_max_slevel_encountered [Slevel_analysis] |