# Module Lazy_list

    module Lazy_list: sig .. end

Lazy lists.

Lazy lists.

    type 'a t

    include Monad.S

    val empty : unit -> 'a t

    val is_empty : 'a t -> bool

    val length : 'a t -> int

    val decons : 'a t -> ('a * 'a t) option

    val cons : 'a -> 'a t -> 'a t

    val snoc : 'a t -> 'a -> 'a t

    val append : 'a t -> 'a t -> 'a t

    val map : 'a t -> f:('a -> 'b) -> 'b t

    val concat : 'a t t -> 'a t

    val nth : 'a t -> int -> 'a option

    val concat_list : 'a list t -> 'a t

    val find : f:('a -> bool) -> 'a t -> 'a option

    val filter : f:('a -> bool) -> 'a t -> 'a t

    val filter_opt : 'a option t -> 'a t

    val filter_map : f:('a -> 'b option) -> 'a t -> 'b t

    val fold_left : f:('a -> 'b -> 'a) -> init:'a -> 'b t -> 'a

    val fold_right : f:('a -> 'b -> 'b) -> 'a t -> init:'b -> 'b

    val foldr : 'a t -> f:('a -> 'b Lazy_m.t -> 'b) -> init:'b -> 'b Lazy_m.t

    val iter : 'a t -> f:('a -> unit) -> unit

    val of_iterator : curr:('a -> 'b option) -> next:('a -> 'a) -> init:'a -> 'b t

    val build : f:('s -> ('a * 's) option) -> seed:'s -> 'a t

    val unfold : f:('a -> 'a option) -> init:'a -> 'a t

    val uniter : f:(unit -> 'a option) -> 'a t

    val of_list : 'a list -> 'a t

    val to_rev_list : 'a t -> 'a list

    val to_list : 'a t -> 'a list

    val of_array : 'a array -> 'a t

    val to_array : 'a t -> 'a array

    val cartesian_product : 'a t t -> 'a t t

    val merge : cmp:('a -> 'a -> int) -> 'a t -> 'a t -> 'a t

    val unify : cmp:('a -> 'b -> int) ->
           'a t ->
           'b t ->
           [ `Both of 'a * 'b | `Left of 'a | `Right of 'b ] t

    val sort : cmp:('a -> 'a -> int) -> 'a t -> 'a t

    val lazy_sort : cmp:('a -> 'a -> int) -> 'a t -> 'a t

    module Of_container: sig .. end

    module Iterator: sig .. end