(--) [GenLabels_intf.S.Infix] |
Synonym for
int_range ~by:1
|
(--) [GenLabels_intf.S] |
Synonym for
int_range ~by:1
|
(--) [Gen_intf.S.Infix] |
Synonym for
int_range ~by:1
|
(--) [Gen_intf.S] |
Synonym for
int_range ~by:1
|
(>>=) [GenM_intf.S.Infix] | |
(>>=) [GenM_intf.MONAD] | |
(>>=) [GenLabels_intf.S.Infix] |
Monadic bind operator
|
(>>=) [GenLabels_intf.S] |
Monadic bind operator
|
(>>=) [Gen_intf.S.Infix] |
Monadic bind operator
|
(>>=) [Gen_intf.S] |
Monadic bind operator
|
(>>|) [GenLabels_intf.S.Infix] |
Infix map operator
|
(>>|) [GenLabels_intf.S] |
Infix map operator
|
(>>|) [Gen_intf.S.Infix] |
Infix map operator
|
(>>|) [Gen_intf.S] |
Infix map operator
|
(>|=) [GenM_intf.S.Infix] | |
(>|=) [GenM_intf.MONAD] | |
(>|=) [GenLabels_intf.S.Infix] |
Infix map operator
|
(>|=) [GenLabels_intf.S] |
Infix map operator
|
(>|=) [Gen_intf.S.Infix] |
Infix map operator
|
(>|=) [Gen_intf.S] |
Infix map operator
|
A | |
append [GenLabels_intf.S] |
Append the two gens; the result contains the elements of the first,
then the elements of the second gen.
|
append [Gen_intf.S] |
Append the two gens; the result contains the elements of the first,
then the elements of the second gen.
|
C | |
chunks [GenLabels_intf.S] | chunks n e returns a generator of arrays of length n , composed
of successive elements of e .
|
chunks [Gen_intf.S] | chunks n e returns a generator of arrays of length n , composed
of successive elements of e .
|
combinations [GenLabels_intf.S] |
Combinations of given length.
|
combinations [Gen_intf.S] |
Combinations of given length.
|
compare [GenLabels_intf.S] |
Synonym for
GenLabels_intf.S.lexico
|
compare [Gen_intf.S] |
Synonym for
Gen_intf.S.lexico
|
cycle [GenLabels.Restart] |
Cycle through the enum, endlessly.
|
cycle [Gen.Restart] |
Cycle through the enum, endlessly.
|
D | |
drop [GenLabels_intf.S] |
Drop n elements
|
drop [Gen_intf.S] |
Drop n elements
|
drop_while [GenLabels_intf.S] |
Drop elements while they satisfy the predicate.
|
drop_while [Gen_intf.S] |
Drop elements while they satisfy the predicate.
|
E | |
empty [GenLabels_intf.S] |
Empty generator, with no elements
|
empty [Gen_intf.S] |
Empty generator, with no elements
|
eq [GenLabels_intf.S] |
Equality of generators.
|
eq [Gen_intf.S] |
Equality of generators.
|
exists [GenLabels_intf.S] |
Is the predicate true for at least one element?
|
exists [Gen_intf.S] |
Is the predicate true for at least one element?
|
exists2 [GenLabels_intf.S] |
Succeeds if some pair of elements satisfy the predicate.
|
exists2 [Gen_intf.S] |
Succeeds if some pair of elements satisfy the predicate.
|
F | |
filter [GenLabels_intf.S] |
Filter out elements that do not satisfy the predicate.
|
filter [Gen_intf.S] |
Filter out elements that do not satisfy the predicate.
|
filter_map [GenLabels_intf.S] |
Maps some elements to 'b, drop the other ones
|
filter_map [Gen_intf.S] |
Maps some elements to 'b, drop the other ones
|
find [GenLabels_intf.S] | find p e returns the first element of e to satisfy p ,
or None.
|
find [Gen_intf.S] | find p e returns the first element of e to satisfy p ,
or None.
|
flat_map [GenM_intf.S] | |
flat_map [GenLabels_intf.S] |
Monadic bind; each element is transformed to a sub-gen
which is then iterated on, before the next element is processed,
and so on.
|
flat_map [Gen_intf.S] |
Monadic bind; each element is transformed to a sub-gen
which is then iterated on, before the next element is processed,
and so on.
|
flatten [GenLabels_intf.S] |
Flatten the generator of generators
|
flatten [Gen_intf.S] |
Flatten the generator of generators
|
fold [GenM_intf.S] | |
fold [GenLabels_intf.S] |
Fold on the generator, tail-recursively.
|
fold [Gen_intf.S] |
Fold on the generator, tail-recursively.
|
fold2 [GenLabels_intf.S] |
Fold the common prefix of the two iterators
|
fold2 [Gen_intf.S] |
Fold the common prefix of the two iterators
|
fold_m [GenM_intf.S] | |
fold_map [GenLabels_intf.S] |
Lazy fold and map.
|
fold_map [Gen_intf.S] |
Lazy fold and map.
|
fold_while [GenLabels_intf.S] |
Fold elements until (
'a, `Stop ) is indicated by the accumulator.
|
fold_while [Gen_intf.S] |
Fold elements until (
'a, `Stop ) is indicated by the accumulator.
|
for_all [GenLabels_intf.S] |
Is the predicate true for all elements?
|
for_all [Gen_intf.S] |
Is the predicate true for all elements?
|
for_all2 [GenLabels_intf.S] |
Succeeds if all pairs of elements satisfy the predicate.
|
for_all2 [Gen_intf.S] |
Succeeds if all pairs of elements satisfy the predicate.
|
G | |
get [GenLabels] |
Get the next value
|
get [Gen] |
Get the next value
|
get_exn [GenLabels] |
Get the next value, or fails
|
get_exn [Gen] |
Get the next value, or fails
|
group [GenLabels_intf.S] |
Group equal consecutive elements together.
|
group [Gen_intf.S] |
Group equal consecutive elements together.
|
I | |
init [GenLabels_intf.S] |
Calls the function, starting from 0, on increasing indices.
|
init [Gen_intf.S] |
Calls the function, starting from 0, on increasing indices.
|
int_range [GenLabels_intf.S] | int_range ~step a b generates integers between a and b , included,
with steps of length step (1 if omitted).
|
int_range [Gen_intf.S] | int_range ~step a b generates integers between a and b , included,
with steps of length step (1 if omitted).
|
interleave [GenLabels_intf.S] | interleave a b yields an element of a , then an element of b ,
and so on.
|
interleave [Gen_intf.S] | interleave a b yields an element of a , then an element of b ,
and so on.
|
intersection [GenLabels_intf.S] |
Intersection of two sorted sequences.
|
intersection [Gen_intf.S] |
Intersection of two sorted sequences.
|
intersperse [GenLabels_intf.S] |
Put the separator element between all elements of the given gen
|
intersperse [Gen_intf.S] |
Put the separator element between all elements of the given gen
|
is_empty [GenLabels_intf.S] |
Check whether the gen is empty.
|
is_empty [Gen_intf.S] |
Check whether the gen is empty.
|
iter [GenM_intf.S] | |
iter [GenLabels_intf.S] |
Iterate on the gen, consumes it.
|
iter [Gen_intf.S] |
Iterate on the gen, consumes it.
|
iter2 [GenLabels_intf.S] |
Iterate on the two sequences.
|
iter2 [Gen_intf.S] |
Iterate on the two sequences.
|
iter_p [GenM_intf.S] | |
iter_s [GenM_intf.S] | |
iterate [GenLabels_intf.S] | iterate x f is [x; f x; f (f x); f (f (f x)); ...]
|
iterate [Gen_intf.S] | iterate x f is [x; f x; f (f x); f (f (f x)); ...]
|
iteri [GenLabels_intf.S] |
Iterate on elements with their index in the gen, from 0, consuming it.
|
iteri [Gen_intf.S] |
Iterate on elements with their index in the gen, from 0, consuming it.
|
J | |
junk [GenLabels] |
Drop the next value, discarding it.
|
junk [Gen] |
Drop the next value, discarding it.
|
L | |
length [GenLabels_intf.S] |
Length of an gen (linear time), consuming it
|
length [Gen_intf.S] |
Length of an gen (linear time), consuming it
|
lexico [GenLabels_intf.S] |
Lexicographic comparison of generators.
|
lexico [Gen_intf.S] |
Lexicographic comparison of generators.
|
lift [GenLabels.Restart] | |
lift [Gen.Restart] | |
lift2 [GenLabels.Restart] | |
lift2 [Gen.Restart] | |
lines [GenLabels_intf.S] |
Group together chars belonging to the same line
|
lines [Gen_intf.S] |
Group together chars belonging to the same line
|
M | |
map [GenM_intf.S] | |
map [GenClone] | |
map [GenLabels_intf.S] |
Lazy map.
|
map [Gen_intf.S] |
Lazy map.
|
map2 [GenLabels_intf.S] |
Map on the two sequences.
|
map2 [Gen_intf.S] |
Map on the two sequences.
|
mapi [GenLabels_intf.S] |
Lazy map with indexing starting from 0.
|
mapi [Gen_intf.S] |
Lazy map with indexing starting from 0.
|
max [GenLabels_intf.S] |
Maximum element, see
GenLabels_intf.S.min
|
max [Gen_intf.S] |
Maximum element, see
Gen_intf.S.min
|
mem [GenLabels_intf.S] |
Is the given element, member of the gen?
|
mem [Gen_intf.S] |
Is the given element, member of the gen?
|
merge [GenLabels_intf.S] |
Pick elements fairly in each sub-generator.
|
merge [Gen_intf.S] |
Pick elements fairly in each sub-generator.
|
min [GenLabels_intf.S] |
Minimum element, according to the given comparison function.
|
min [Gen_intf.S] |
Minimum element, according to the given comparison function.
|
N | |
next [GenLabels] |
Synonym for
GenLabels.get
|
next [Gen] |
Synonym for
Gen.get
|
nth [GenLabels_intf.S] |
n-th element, or Not_found
|
nth [Gen_intf.S] |
n-th element, or Not_found
|
O | |
of_array [GenLabels_intf.S] |
Iterate on (a slice of) the given array
|
of_array [Gen_intf.S] |
Iterate on (a slice of) the given array
|
of_gen [GenMList] | of_gen g consumes g to build a mlist
|
of_gen [Gen.Restart] |
Use
Gen.persistent_lazy to convert a one-shot generator into a
restartable one.
|
of_gen_lazy [GenMList] | of_gen_lazy g makes a mlist that will read from g as required,
until g is exhausted.
|
of_list [GenLabels_intf.S] |
Enumerate elements of the list
|
of_list [Gen_intf.S] |
Enumerate elements of the list
|
of_string [GenLabels_intf.S] |
Iterate on bytes of the string
|
of_string [Gen_intf.S] |
Iterate on bytes of the string
|
P | |
partition [GenLabels_intf.S] | partition p l returns the elements that satisfy p ,
and the elements that do not satisfy p
|
partition [Gen_intf.S] | partition p l returns the elements that satisfy p ,
and the elements that do not satisfy p
|
peek [GenLabels] | peek g transforms the generator g into a generator
of x, Some next if x was followed by next in g , or x, None if x
was the last element of g
|
peek [Gen] | peek g transforms the generator g into a generator
of x, Some next if x was followed by next in g , or x, None if x
was the last element of g
|
peek_n [GenLabels] | peek_n ~n g iterates on g , returning along with each element
the array of the (at most) n elements that follow it immediately
|
peek_n [Gen] | peek_n n g iterates on g , returning along with each element
the array of the (at most) n elements that follow it immediately
|
permutations [GenLabels_intf.S] |
Permutations of the gen.
|
permutations [Gen_intf.S] |
Permutations of the gen.
|
permutations_heap [GenLabels_intf.S] |
Permutations of the gen, using Heap's algorithm.
|
permutations_heap [Gen_intf.S] |
Permutations of the gen, using Heap's algorithm.
|
persistent [GenLabels] |
Store content of the transient generator in memory, to be able to iterate
on it several times later.
|
persistent [Gen] |
Store content of the transient generator in memory, to be able to iterate
on it several times later.
|
persistent_lazy [GenLabels] |
Same as
GenLabels.persistent , but consumes the generator on demand (by chunks).
|
persistent_lazy [Gen] |
Same as
Gen.persistent , but consumes the generator on demand (by chunks).
|
power_set [GenLabels_intf.S] |
All subsets of the gen (in no particular order).
|
power_set [Gen_intf.S] |
All subsets of the gen (in no particular order).
|
pp [GenLabels_intf.S] |
Pretty print the content of the generator on a formatter.
|
pp [Gen_intf.S] |
Pretty print the content of the generator on a formatter.
|
product [GenLabels_intf.S] |
Cartesian product, in no predictable order.
|
product [Gen_intf.S] |
Cartesian product, in no predictable order.
|
R | |
rand_int [GenLabels_intf.S] |
Random ints in the given range.
|
rand_int [Gen_intf.S] |
Random ints in the given range.
|
reduce [GenLabels_intf.S] |
Fold on non-empty sequences.
|
reduce [Gen_intf.S] |
Fold on non-empty sequences.
|
repeat [GenLabels_intf.S] |
Repeat same element endlessly
|
repeat [Gen_intf.S] |
Repeat same element endlessly
|
repeatedly [GenLabels] |
Call the same function an infinite number of times (useful for instance
if the function is a random generator).
|
repeatedly [Gen] |
Call the same function an infinite number of times (useful for instance
if the function is a random generator).
|
return [GenM_intf.MONAD] | |
return [GenM_intf.S] | |
return [GenLabels_intf.S] |
Alias to
GenLabels_intf.S.singleton
|
return [Gen_intf.S] |
Alias to
Gen_intf.S.singleton
|
round_robin [GenLabels_intf.S] |
Split the gen into
n generators in a fair way.
|
round_robin [Gen_intf.S] |
Split the gen into
n generators in a fair way.
|
S | |
scan [GenLabels_intf.S] |
Like
GenLabels_intf.S.fold , but keeping successive values of the accumulator.
|
scan [Gen_intf.S] |
Like
Gen_intf.S.fold , but keeping successive values of the accumulator.
|
sequence_m [GenM_intf.S] |
From a generator of actions, return an effectful generator
|
singleton [GenLabels_intf.S] |
One-element generator
|
singleton [Gen_intf.S] |
One-element generator
|
sort [GenLabels_intf.S] |
Sort according to the given comparison function.
|
sort [Gen_intf.S] |
Sort according to the given comparison function.
|
sort_uniq [GenLabels_intf.S] |
Sort and remove duplicates.
|
sort_uniq [Gen_intf.S] |
Sort and remove duplicates.
|
sorted_merge [GenLabels_intf.S] |
Merge two sorted sequences into a sorted sequence
|
sorted_merge [Gen_intf.S] |
Merge two sorted sequences into a sorted sequence
|
sorted_merge_n [GenLabels_intf.S] |
Sorted merge of multiple sorted sequences
|
sorted_merge_n [Gen_intf.S] |
Sorted merge of multiple sorted sequences
|
start [GenLabels] |
Create a new transient generator.
|
start [Gen] |
Create a new transient generator.
|
sum [GenLabels_intf.S] |
Sum of all elements
|
sum [Gen_intf.S] |
Sum of all elements
|
T | |
take [GenLabels_intf.S] |
Take at most n elements
|
take [Gen_intf.S] |
Take at most n elements
|
take_nth [GenLabels_intf.S] | take_nth n g returns every element of g whose index
is a multiple of n .
|
take_nth [Gen_intf.S] | take_nth n g returns every element of g whose index
is a multiple of n .
|
take_while [GenLabels_intf.S] |
Take elements while they satisfy the predicate.
|
take_while [Gen_intf.S] |
Take elements while they satisfy the predicate.
|
tee [GenLabels_intf.S] |
Duplicate the gen into
n generators (default 2).
|
tee [Gen_intf.S] |
Duplicate the gen into
n generators (default 2).
|
to_array [GenLabels_intf.S] |
Convert the gen to an array (not very efficient)
|
to_array [Gen_intf.S] |
Convert the gen to an array (not very efficient)
|
to_buffer [GenLabels_intf.S] |
Consumes the iterator and writes to the buffer
|
to_buffer [Gen_intf.S] |
Consumes the iterator and writes to the buffer
|
to_clonable [GenMList] | |
to_gen [GenMList] |
Iterate on the mlist.
|
to_list [GenLabels_intf.S] |
non tail-call trasnformation to list, in the same order
|
to_list [Gen_intf.S] |
non tail-call trasnformation to list, in the same order
|
to_prependable [GenClone] | |
to_rev_list [GenLabels_intf.S] |
Tail call conversion to list, in reverse order (more efficient)
|
to_rev_list [Gen_intf.S] |
Tail call conversion to list, in reverse order (more efficient)
|
to_string [GenLabels_intf.S] |
Convert into a string
|
to_string [Gen_intf.S] |
Convert into a string
|
U | |
unfold [GenLabels_intf.S] |
Dual of
GenLabels_intf.S.fold , with a deconstructing operation.
|
unfold [Gen_intf.S] |
Dual of
Gen_intf.S.fold , with a deconstructing operation.
|
unfold_scan [GenLabels_intf.S] |
A mix of
GenLabels_intf.S.unfold and GenLabels_intf.S.scan .
|
unfold_scan [Gen_intf.S] |
A mix of
Gen_intf.S.unfold and Gen_intf.S.scan .
|
uniq [GenLabels_intf.S] |
Remove consecutive duplicate elements.
|
uniq [Gen_intf.S] |
Remove consecutive duplicate elements.
|
unlines [GenLabels_intf.S] |
Explode lines into their chars, adding a
'\n' after each one
|
unlines [Gen_intf.S] |
Explode lines into their chars, adding a
'\n' after each one
|
unzip [GenLabels_intf.S] |
Unzip into two sequences, splitting each pair
|
unzip [Gen_intf.S] |
Unzip into two sequences, splitting each pair
|
W | |
with_in [GenClone.IO] | read filename f opens filename and calls f g ,
where g is a clonable generator of characters from the file.
|
with_in [GenLabels.IO] | with_in ~file f opens file and calls f g ,
where g is a generator of characters from the file.
|
with_in [Gen.IO] | with_in filename f opens filename and calls f g ,
where g is a generator of characters from the file.
|
with_lines [GenLabels.IO] | with_lines ~file f opens file file and calls f g ,
where g is a generator that iterates on the lines from the file.
|
with_lines [Gen.IO] | with_lines filename f opens file filename and calls f g ,
where g is a generator that iterates on the lines from the file.
|
write [GenLabels.IO] |
Same as
GenLabels.IO.write_str but with individual characters
|
write [Gen.IO] |
Same as
Gen.IO.write_str but with individual characters
|
write_lines [GenLabels.IO] | write_lines ~file g is similar to write_str file g ~sep:"\n" but
also adds '\n' at the end of the file
|
write_lines [Gen.IO] | write_lines file g is similar to write_str file g ~sep:"\n" but
also adds '\n' at the end of the file
|
write_str [GenLabels.IO] | write_to ~file g writes all strings from g into the given
file.
|
write_str [Gen.IO] | write_to filename g writes all strings from g into the given
file.
|
Z | |
zip [GenLabels_intf.S] |
Zip together the common part of the gens
|
zip [Gen_intf.S] |
Zip together the common part of the gens
|
zip_index [GenLabels_intf.S] |
Zip elements with their index in the gen
|
zip_index [Gen_intf.S] |
Zip elements with their index in the gen
|
zip_with [GenLabels_intf.S] |
Combine common part of the gens (stops when one is exhausted)
|
zip_with [Gen_intf.S] |
Combine common part of the gens (stops when one is exhausted)
|