type 'a t = unit -> 'a gen
type 'a restartable = 'a t
include S with type 'a t := 'a restartable
val empty : 'a restartable
Empty generator, with no elements
val singleton : 'a -> 'a restartable
val repeat : 'a -> 'a restartable
Repeat same element endlessly
val iterate : 'a -> ( 'a -> 'a ) -> 'a restartable
iterate x f is
[x; f x; f (f x); f (f (f x)); ...]
val unfold : ( 'b -> ('a * 'b) option ) -> 'b -> 'a restartable
fold, with a deconstructing operation. It keeps on unfolding the
'b value into a new
'b, and a
'a which is yielded, until
None is returned.
val init : ?limit:int -> ( int -> 'a ) -> 'a restartable
Calls the function, starting from 0, on increasing indices. If
limit is provided and is a positive int, iteration will stop at the limit (excluded). For instance
init ~limit:4 id will yield 0, 1, 2, and 3.
Note: those combinators, applied to generators (not restartable generators) consume their argument. Sometimes they consume it lazily, sometimes eagerly, but in any case once
f gen has been called (with
f a combinator),
gen shouldn't be used anymore.
val is_empty : _ restartable -> bool
Check whether the gen is empty. Pops an element, if any
val fold : f:( 'b -> 'a -> 'b ) -> init:'b -> 'a restartable -> 'b
Fold on the generator, tail-recursively. Consumes the generator.
val reduce : f:( 'a -> 'a -> 'a ) -> 'a restartable -> 'a
Fold on non-empty sequences. Consumes the generator.
fold, but keeping successive values of the accumulator. Consumes the generator.
val iter : f:( 'a -> unit ) -> 'a restartable -> unit
Iterate on the gen, consumes it.
val iteri : f:( int -> 'a -> unit ) -> 'a restartable -> unit
Iterate on elements with their index in the gen, from 0, consuming it.
val length : _ restartable -> int
Length of an gen (linear time), consuming it
Lazy map. No iteration is performed now, the function will be called when the result is traversed.
Lazy map with indexing starting from 0. No iteration is performed now, the function will be called when the result is traversed.
Lazy fold and map. No iteration is performed now, the function will be called when the result is traversed. The result is an iterator over the successive states of the fold.
Append the two gens; the result contains the elements of the first, then the elements of the second gen.
Flatten the generator of generators
Monadic bind; each element is transformed to a sub-gen which is then iterated on, before the next element is processed, and so on.
val mem : ?eq:( 'a -> 'a -> bool ) -> x:'a -> 'a restartable -> bool
Is the given element, member of the gen?
val nth : int -> 'a restartable -> 'a
n-th element, or Not_found
take_nth n g returns every element of
g whose index is a multiple of
n. For instance
take_nth 2 (1--10) |> to_list will return
Filter out elements that do not satisfy the predicate.
Take elements while they satisfy the predicate. The initial generator itself is not to be used anymore after this.
val fold_while : f:( 'a -> 'b -> 'a * [ `Stop | `Continue ] ) -> init:'a -> 'b restartable -> 'a
Fold elements until (
'a, `Stop) is indicated by the accumulator.
Drop elements while they satisfy the predicate. The initial generator itself should not be used anymore, only the result of
Maps some elements to 'b, drop the other ones
Unzip into two sequences, splitting each pair
partition p l returns the elements that satisfy
p, and the elements that do not satisfy
val for_all : f:( 'a -> bool ) -> 'a restartable -> bool
Is the predicate true for all elements?
val exists : f:( 'a -> bool ) -> 'a restartable -> bool
Is the predicate true for at least one element?
val min : ?lt:( 'a -> 'a -> bool ) -> 'a restartable -> 'a
Minimum element, according to the given comparison function.
Equality of generators.
Lexicographic comparison of generators. If a generator is a prefix of the other one, it is considered smaller.
val find : f:( 'a -> bool ) -> 'a restartable -> 'a option
find p e returns the first element of
e to satisfy
p, or None.
val sum : int restartable -> int
Sum of all elements
Map on the two sequences. Stops once one of them is exhausted.
Iterate on the two sequences. Stops once one of them is exhausted.
Fold the common prefix of the two iterators
Succeeds if all pairs of elements satisfy the predicate. Ignores elements of an iterator if the other runs dry.
Succeeds if some pair of elements satisfy the predicate. Ignores elements of an iterator if the other runs dry.
Combine common part of the gens (stops when one is exhausted)
Zip together the common part of the gens
Pick elements fairly in each sub-generator. The merge of gens
e1, e2, ... picks elements in
e2 .... Once a generator is empty, it is skipped; when they are all empty, and none remains in the input, their merge is also empty. For instance,
merge [1;3;5] [2;4;6] will be, in disorder,
Intersection of two sorted sequences. Only elements that occur in both inputs appear in the output
Merge two sorted sequences into a sorted sequence
Sorted merge of multiple sorted sequences
Duplicate the gen into
n generators (default 2). The generators share the same underlying instance of the gen, so the optimal case is when they are consumed evenly
Split the gen into
n generators in a fair way. Elements with
index = k mod n with go to the k-th gen.
n default value is 2.
interleave a b yields an element of
a, then an element of
b, and so on. When a generator is exhausted, this behaves like the other generator.
Put the separator element between all elements of the given gen
Cartesian product, in no predictable order. Works even if some of the arguments are infinite.
Group equal consecutive elements together.
Remove consecutive duplicate elements. Basically this is like
fun e -> map List.hd (group e).
Sort according to the given comparison function. The gen must be finite.
Sort and remove duplicates. The gen must be finite.
chunks n e returns a generator of arrays of length
n, composed of successive elements of
e. The last array may be smaller than
Permutations of the gen, using Heap's algorithm.
Combinations of given length. The ordering of the elements within each combination is unspecified. Example (ignoring ordering):
combinations 2 (1--3) |> to_list = [[1;2]; [1;3]; [2;3]]
All subsets of the gen (in no particular order). The ordering of the elements within each subset is unspecified.
val of_list : 'a list -> 'a restartable
Enumerate elements of the list
val to_list : 'a restartable -> 'a list
non tail-call trasnformation to list, in the same order
val to_rev_list : 'a restartable -> 'a list
Tail call conversion to list, in reverse order (more efficient)
val to_array : 'a restartable -> 'a array
Convert the gen to an array (not very efficient)
val of_array : ?start:int -> ?len:int -> 'a array -> 'a restartable
Iterate on (a slice of) the given array
val of_string : ?start:int -> ?len:int -> string -> char restartable
Iterate on bytes of the string
val to_string : char restartable -> string
Convert into a string
val rand_int : int -> int restartable
Random ints in the given range.
val int_range : ?step:int -> int -> int -> int restartable
int_range ~step a b generates integers between
b, included, with steps of length
step (1 if omitted).
a is assumed to be smaller than
step must not be null, but it can be negative for decreasing integers.
Explode lines into their chars, adding a
'\n' after each one
module Infix : sig ... end
val (--) : int -> int -> int restartable
Monadic bind operator
val pp : ?start:string -> ?stop:string -> ?sep:string -> ?horizontal:bool -> ( Format.formatter -> 'a -> unit ) -> Format.formatter -> 'a restartable -> unit
Pretty print the content of the generator on a formatter.