type 'a printer = Buffer.t -> 'a -> unittype 'a formatter = Format.formatter -> 'a -> unittype +'a t = unit -> [ `Nil | `Cons of 'a * 'a t ]val nil : 'a tval empty : 'a tval singleton : 'a -> 'a tval repeat : ?n:int -> 'a -> 'a trepeat ~n x repeats x n times then stops. If n is omitted, then x is repeated forever.
val is_empty : 'a t -> boolval fold : ('a -> 'b -> 'a) -> 'a -> 'b t -> 'aFold on values
val iter : ('a -> unit) -> 'a t -> unitval length : _ t -> intFair product of two (possibly infinite) lists into a new list. Lazy. The first parameter is used to combine each pair of elements
Specialization of product_with producing tuples
group eq l groups together consecutive elements that satisfy eq. Lazy. For instance group (=) [1;1;1;2;2;3;3;1] yields [1;1;1]; [2;2]; [3;3]; [1]
uniq eq l returns l but removes consecutive duplicates. Lazy. In other words, if several values that are equal follow one another, only the first of them is kept.
val range : int -> int -> int tval (--) : int -> int -> int tFold on two collections at once. Stop at soon as one of them ends
Map on two collections at once. Stop as soon as one of the arguments is exhausted
Iterate on two collections at once. Stop as soon as one of them ends
Eager sort. Requires the iterator to be finite. O(n ln(n)) time and space.
Eager sort that removes duplicate values. Requires the iterator to be finite. O(n ln(n)) time and space.
val return : 'a -> 'a tval pure : 'a -> 'a tmodule type MONAD = sig ... endval of_list : 'a list -> 'a tval to_list : 'a t -> 'a listGather all values into a list