A | |
add [Plugin.GEN_STRING_SET] |
Add a string to the string set option.
|
add [Components.Components] | |
add [Map.S] | add x y m returns a map containing the same bindings as
m , plus a binding of x to y .
|
add [Components.Todolist] | |
add_choice [Plugin.INDEXED_VAL] |
adds a new choice for the option.
|
add_from_deep [Components.Component] | |
B | |
backward [Components.Component] | |
bindings [Map.S] |
Return the list of all bindings of the given map.
|
C | |
cardinal [Map.S] |
Return the number of bindings of a map.
|
check_and_add [Components.Component] |
Returns
found, new_already with: found is true iff elt was previously added for kind , new_already is already updated with elt and its (new) associated
value.
|
choose [Map.S] |
Return one binding of the given map, or raise
Not_found if
the map is empty.
|
compare [Map.S] |
Total ordering between maps.
|
copy [Datatype.S] |
Deep copy: no possible sharing between
x and copy x .
|
D | |
direct [Components.Component] | |
E | |
empty [Map.S] |
The empty map.
|
equal [Map.S] | equal cmp m1 m2 tests whether the maps m1 and m2 are
equal, that is, contain equal keys and associate them with
equal data.
|
exists [Plugin.GEN_STRING_SET] |
Checks if at least one element of the set satisfies the predicate.
|
exists [Map.S] | exists p m checks if at least one binding of the map
satisfy the predicate p .
|
F | |
filter [Map.S] | filter p m returns the map with all the bindings in m
that satisfy predicate p .
|
find [Plugin.STRING_HASHTBL] | |
find [Components.Components] | |
find [Map.S] | find x m returns the current binding of x in m ,
or raises Not_found if no such binding exists.
|
fold [Map.S] | fold f m a computes (f kN dN ... (f k1 d1 a)...) ,
where k1 ... kN are the keys of all bindings in m
(in increasing order), and d1 ... dN are the associated data.
|
fold_fold [Components.Components] | |
fold_left [State_builder.List_ref] | |
for_all [Map.S] | for_all p m checks if all the bindings of the map
satisfy the predicate p .
|
forward [Components.Component] | |
forward_caller [Components.Component] | |
G | |
get_component [Components.Component] | |
get_direct_component [Components] | |
get_forward_component [Components] | |
get_indirect_backward_component [Components] | |
get_node_stmt [Components] | |
get_possible_values [Plugin.STRING] |
What are the acceptable values for this parameter.
|
get_range [Plugin.INT] |
What is the possible range of values for this parameter.
|
get_set [Plugin.GEN_STRING_SET] |
Get a string which concatenates each string in the set with a
separator.
|
get_val [Plugin.INDEXED_VAL] |
the currently selected value.
|
I | |
impact_analysis [Components] | |
incr [Plugin.INT] |
Increment the integer.
|
init [Components.Memo] | |
initial_nodes [Components.Component] | |
is_direct [Components.Component] | |
is_empty [Plugin.GEN_STRING_SET] |
Check if the set is empty.
|
is_empty [Map.S] |
Test whether a map is empty or not.
|
is_forward [Components.Component] | |
is_indirect_backward [Components.Component] | |
iter [Plugin.GEN_STRING_SET] |
Iter on each string in the set.
|
iter [State_builder.List_ref] | |
iter [Map.S] | iter f m applies f to all bindings in map m .
|
iter [Components.Component] | |
M | |
main [Register_gui] | |
map [Map.S] | 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 .
|
mapi [Map.S] |
Same as
Map.S.map , but the function receives as arguments both the
key and the associated value for each binding of the map.
|
max_binding [Map.S] |
Same as
Map.S.min_binding , but returns the largest binding
of the given map.
|
mem [Map.S] | mem x m returns true if m contains a binding for x ,
and false otherwise.
|
memo [Components.Memo] | |
merge [Map.S] | merge f m1 m2 computes a map whose keys is a subset of keys of m1
and of m2 .
|
min_binding [Map.S] |
Return the smallest binding of the given map
(with respect to the
Ord.compare ordering), or raise
Not_found if the map is empty.
|
mk_init [Components.Todolist] | |
O | |
off [Plugin.BOOL] |
Set the boolean to
false .
|
on [Plugin.BOOL] |
Set the boolean to
true .
|
one_step_related_nodes [Components.Component] | |
P | |
partition [Map.S] | partition p m returns a pair of maps (m1, m2) , where
m1 contains all the bindings of s that satisfy the
predicate p , and m2 is the map with all the bindings of
s that do not satisfy p .
|
pop_function [Components.Memo] | |
pretty_kind [Components] |
Debugging purpose only
|
push_function [Components.Memo] | |
R | |
register [Components] | |
related_nodes_of_nodes [Components.Component] | |
remove [Plugin.GEN_STRING_SET] |
Remove a string from the option.
|
remove [Map.S] | remove x m returns a map containing the same bindings as
m , except for x which is unbound in the returned map.
|
S | |
search_input [Components.Component] | |
security_highlighter [Register_gui] | |
security_selector [Register_gui] | |
self [Components.Components] | |
set_possible_values [Plugin.STRING] |
Set what are the acceptable values for this parameter.
|
set_range [Plugin.INT] |
Set what is the possible range of values for this parameter.
|
singleton [Map.S] | singleton x y returns the one-element map that contains a binding y
for x .
|
split [Map.S] | split x m returns a triple (l, data, r) , where
l is the map with all the bindings of m whose key
is strictly less than x ;
r is the map with all the bindings of m whose key
is strictly greater than x ;
data is None if m contains no binding for x ,
or Some v if m binds v to x .
|
W | |
whole [Components.Component] |