`sig
type +'a t
val mem : ?equal:('a -> 'a -> bool) -> 'a t -> 'a -> bool
val length : 'a t -> int
val is_empty : 'a t -> bool
val iter : 'a t -> f:('a -> unit) -> unit
val fold : 'a t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum
val exists : 'a t -> f:('a -> bool) -> bool
val for_all : 'a t -> f:('a -> bool) -> bool
val count : 'a t -> f:('a -> bool) -> int
val sum :
(module Core_kernel.Commutative_group.S with type t = 'sum) ->
'a t -> f:('a -> 'sum) -> 'sum
val find : 'a t -> f:('a -> bool) -> 'a option
val find_map : 'a t -> f:('a -> 'b option) -> 'b option
val to_list : 'a t -> 'a list
val to_array : 'a t -> 'a array
val min_elt : 'a t -> cmp:('a -> 'a -> int) -> 'a option
val max_elt : 'a t -> cmp:('a -> 'a -> int) -> 'a option
val iteri : 'a Lazy_sequence.t -> f:(int -> 'a -> unit) -> unit
val foldi :
'a Lazy_sequence.t ->
init:'state -> f:(int -> 'state -> 'a -> 'state) -> 'state
val map : 'a Lazy_sequence.t -> f:('a -> 'b) -> 'b Lazy_sequence.t
val mapi : 'a Lazy_sequence.t -> f:(int -> 'a -> 'b) -> 'b Lazy_sequence.t
val filter : 'a Lazy_sequence.t -> f:('a -> bool) -> 'a Lazy_sequence.t
val filter_map :
'a Lazy_sequence.t -> f:('a -> 'b option) -> 'b Lazy_sequence.t
val filter_mapi :
'a Lazy_sequence.t -> f:(int -> 'a -> 'b option) -> 'b Lazy_sequence.t
val fold_map :
'a Lazy_sequence.t ->
init:'state -> f:('state -> 'a -> 'state * 'b) -> 'b Lazy_sequence.t
val filter_fold_map :
'a Lazy_sequence.t ->
init:'state ->
f:('state -> 'a -> 'state * 'b option) -> 'b Lazy_sequence.t
val concat : 'a Lazy_sequence.t Lazy_sequence.t -> 'a Lazy_sequence.t
val concat_seq_list : 'a Lazy_sequence.t list -> 'a Lazy_sequence.t
val concat_list_seq : 'a list Lazy_sequence.t -> 'a Lazy_sequence.t
val concat_map :
'a Lazy_sequence.t -> f:('a -> 'b list) -> 'b Lazy_sequence.t
val hd : 'a Lazy_sequence.t -> 'a option
val last : 'a Lazy_sequence.t -> 'a option
val nth : 'a Lazy_sequence.t -> int -> 'a option
val tl : 'a Lazy_sequence.t -> 'a Lazy_sequence.t
val take : 'a Lazy_sequence.t -> int -> 'a Lazy_sequence.t
val drop : 'a Lazy_sequence.t -> int -> 'a Lazy_sequence.t
val append : 'a Lazy_sequence.t -> 'a Lazy_sequence.t -> 'a Lazy_sequence.t
val sub : 'a Lazy_sequence.t -> pos:int -> len:int -> 'a Lazy_sequence.t
val filter_map_partial :
'a Lazy_sequence.t ->
f:('a -> [ `Continue of 'b option | `Stop ]) -> 'b Lazy_sequence.t
val zip_full :
'a Lazy_sequence.t ->
'b Lazy_sequence.t -> ('a option * 'b option) Lazy_sequence.t
val length_if_at_most : max:int -> 'a Lazy_sequence.t -> int option
val length_bounded_by : ?min:int -> ?max:int -> 'a Lazy_sequence.t -> bool
val of_list : 'a list -> 'a Lazy_sequence.t
val of_array : 'a array -> 'a Lazy_sequence.t
val init : (int -> 'a option) -> 'a Lazy_sequence.t
val read_lines : string -> string Lazy_sequence.t
val force : 'a Lazy_sequence.t -> 'a Lazy_sequence.t
module Iterator :
sig
type 'a seq = 'a Lazy_sequence.t
type 'a t
val create :
'a Lazy_sequence.Iterator.seq -> 'a Lazy_sequence.Iterator.t
val close : 'a Lazy_sequence.Iterator.t -> unit
val with_sequence :
'a Lazy_sequence.Iterator.seq ->
f:('a Lazy_sequence.Iterator.t -> 'b) -> 'b
val has_next : 'a Lazy_sequence.Iterator.t -> bool
val peek : 'a Lazy_sequence.Iterator.t -> 'a option
val get : 'a Lazy_sequence.Iterator.t -> 'a option
val get_exn : 'a Lazy_sequence.Iterator.t -> 'a
val iter : 'a Lazy_sequence.Iterator.t -> f:('a -> unit) -> unit
val fold :
'a Lazy_sequence.Iterator.t ->
init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum
val copy : 'a Lazy_sequence.Iterator.t -> 'a Lazy_sequence.Iterator.t
end
val empty : 'a Lazy_sequence.t
val ( ==> ) : 'a -> (unit -> 'a Lazy_sequence.t) -> 'a Lazy_sequence.t
val ( ==>> ) :
'a list -> (unit -> 'a Lazy_sequence.t) -> 'a Lazy_sequence.t
val initialize : (unit -> 'a Lazy_sequence.t) -> 'a Lazy_sequence.t
val protect :
finally:(unit -> unit) ->
(unit -> 'a Lazy_sequence.t) -> 'a Lazy_sequence.t
end`