Module Lazy_listSource
Lazy lists.
include Core.Monad.S with type 'a t := 'a t
val (>>=) : 'a t -> ('a -> 'b t) -> 'b tval (>>|) : 'a t -> ('a -> 'b) -> 'b tval bind : 'a t -> f:('a -> 'b t) -> 'b tval join : 'a t t -> 'a tval ignore_m : 'a t -> unit tval all : 'a t list -> 'a list tval all_unit : unit t list -> unit tSourceval decons : 'a t -> ('a * 'a t) option val map : 'a t -> f:('a -> 'b) -> 'b tSourceval nth : 'a t -> int -> 'a option Sourceval concat_list : 'a list t -> 'a t Sourceval find : f:('a -> bool) -> 'a t -> 'a option Sourceval filter : f:('a -> bool) -> 'a t -> 'a t Sourceval filter_opt : 'a option t -> 'a t Sourceval filter_map : f:('a -> 'b option) -> 'a t -> 'b t Sourceval fold_left : f:('a -> 'b -> 'a) -> init:'a -> 'b t -> 'a Sourceval fold_right : f:('a -> 'b -> 'b) -> 'a t -> init:'b -> 'b Sourceval iter : 'a t -> f:('a -> unit) -> unit Sourceval of_iterator : curr:('a -> 'b option) -> next:('a -> 'a) -> init:'a -> 'b t Sourceval build : f:('s -> ('a * 's) option) -> seed:'s -> 'a t Sourceval unfold : f:('a -> 'a option) -> init:'a -> 'a t Sourceval uniter : f:(unit -> 'a option) -> 'a t Sourceval of_list : 'a list -> 'a t Sourceval to_rev_list : 'a t -> 'a list Sourceval to_list : 'a t -> 'a list Sourceval of_array : 'a array -> 'a t Sourceval to_array : 'a t -> 'a array Sourceval merge : cmp:('a -> 'a -> int) -> 'a t -> 'a t -> 'a t Sourceval unify :
cmp:('a -> 'b -> int) ->
'a t ->
'b t ->
[ `Left of 'a | `Right of 'b | `Both of 'a * 'b ] t Sourceval sort : cmp:('a -> 'a -> int) -> 'a t -> 'a t Sourceval lazy_sort : cmp:('a -> 'a -> int) -> 'a t -> 'a t