`sig
type 'a t = 'a Cf_seq.cell Lazy.t
and 'a cell = P of 'a * 'a Cf_seq.t | Z
exception Empty
val nil : 'a Cf_seq.t
val head : 'a Cf_seq.t -> 'a
val tail : 'a Cf_seq.t -> 'a Cf_seq.t
val concat : 'a Cf_seq.t -> 'a Cf_seq.t -> 'a Cf_seq.t
val flatten : 'a Cf_seq.t Cf_seq.t -> 'a Cf_seq.t
val limit : ?x:exn -> int -> 'a Cf_seq.t -> 'a Cf_seq.t
val shift : int -> 'a Cf_seq.t -> 'a Cf_seq.t
val sentinel : exn -> 'a Cf_seq.t -> 'a Cf_seq.t
val reverse : 'a Cf_seq.t -> 'a list
val length : 'a Cf_seq.t -> int
val unfold : ('b -> ('a * 'b) option) -> 'b -> 'a Cf_seq.t
val unfold2 : ('b -> ('a * 'b) option) -> 'b -> ('a * 'b) Cf_seq.t
val iterate : ('a -> unit) -> 'a Cf_seq.t -> unit
val predicate : ('a -> bool) -> 'a Cf_seq.t -> bool
val constrain : ('a -> bool) -> 'a Cf_seq.t -> 'a Cf_seq.t
val search : ('a -> bool) -> 'a Cf_seq.t -> int
val fold : ('b -> 'a -> 'b) -> 'b -> 'a Cf_seq.t -> 'b
val filter : ('a -> bool) -> 'a Cf_seq.t -> 'a Cf_seq.t
val map : ('a -> 'b) -> 'a Cf_seq.t -> 'b Cf_seq.t
val optmap : ('a -> 'b option) -> 'a Cf_seq.t -> 'b Cf_seq.t
val listmap : ('a -> 'b list) -> 'a Cf_seq.t -> 'b Cf_seq.t
val seqmap : ('a -> 'b Cf_seq.t) -> 'a Cf_seq.t -> 'b Cf_seq.t
val partition : ('a -> bool) -> 'a Cf_seq.t -> 'a Cf_seq.t * 'a Cf_seq.t
val fcmp : ('a -> 'a -> int) -> 'a Cf_seq.t -> 'a Cf_seq.t -> int
val cmp : 'a Cf_seq.t -> 'a Cf_seq.t -> int
val equal : 'a Cf_seq.t -> 'a Cf_seq.t -> bool
val first : ('a * 'b) Cf_seq.t -> 'a Cf_seq.t
val second : ('a * 'b) Cf_seq.t -> 'b Cf_seq.t
val split : ('a * 'b) Cf_seq.t -> 'a Cf_seq.t * 'b Cf_seq.t
val combine : 'a Cf_seq.t -> 'b Cf_seq.t -> ('a * 'b) Cf_seq.t
val iterate2 : ('a -> 'b -> unit) -> 'a Cf_seq.t -> 'b Cf_seq.t -> unit
val predicate2 : ('a -> 'b -> bool) -> 'a Cf_seq.t -> 'b Cf_seq.t -> bool
val constrain2 :
('a -> 'b -> bool) -> 'a Cf_seq.t -> 'b Cf_seq.t -> ('a * 'b) Cf_seq.t
val fold2 :
('c -> 'a -> 'b -> 'c) -> 'c -> 'a Cf_seq.t -> 'b Cf_seq.t -> 'c
val filter2 :
('a -> 'b -> bool) -> 'a Cf_seq.t -> 'b Cf_seq.t -> ('a * 'b) Cf_seq.t
val map2 : ('a -> 'b -> 'c) -> 'a Cf_seq.t -> 'b Cf_seq.t -> 'c Cf_seq.t
val optmap2 :
('a -> 'b -> 'c option) -> 'a Cf_seq.t -> 'b Cf_seq.t -> 'c Cf_seq.t
val listmap2 :
('a -> 'b -> 'c list) -> 'a Cf_seq.t -> 'b Cf_seq.t -> 'c Cf_seq.t
val seqmap2 :
('a -> 'b -> 'c Cf_seq.t) -> 'a Cf_seq.t -> 'b Cf_seq.t -> 'c Cf_seq.t
val of_channel : Pervasives.in_channel -> char Cf_seq.t
val of_string : string -> char Cf_seq.t
val of_substring : string -> int -> char Cf_seq.t
val of_array : 'a array -> 'a Cf_seq.t
val of_subarray : 'a array -> int -> 'a Cf_seq.t
val of_list : 'a list -> 'a Cf_seq.t
val of_function : (unit -> 'a) -> 'a Cf_seq.t
val to_channel : char Cf_seq.t -> Pervasives.out_channel -> unit
val to_string : char Cf_seq.t -> string
val to_substring : char Cf_seq.t -> string -> int -> int -> char Cf_seq.t
val to_array : 'a Cf_seq.t -> 'a array
val to_subarray : 'a Cf_seq.t -> 'a array -> int -> int -> 'a Cf_seq.t
val to_list : 'a Cf_seq.t -> 'a list
val to_buffer : char Cf_seq.t -> Buffer.t -> unit
val to_function : 'a Cf_seq.t -> unit -> 'a
val writeC : 'x -> ('x Cf_seq.t, unit) Cf_cmonad.t
val evalC : ('x Cf_seq.t, unit) Cf_cmonad.t -> 'x Cf_seq.t
val writeSC : 'x -> ('s, 'x Cf_seq.t, unit) Cf_scmonad.t
val evalSC : ('s, 'x Cf_seq.t, unit) Cf_scmonad.t -> 's -> 'x Cf_seq.t
module S :
sig
val sequence :
('x, unit) Cf_smonad.t Cf_seq.t -> ('x, unit) Cf_smonad.t
val accumulate :
('x, 'a) Cf_smonad.t Cf_seq.t -> ('x, 'a list) Cf_smonad.t
end
module C :
sig
val sequence :
('x, unit) Cf_cmonad.t Cf_seq.t -> ('x, unit) Cf_cmonad.t
val accumulate :
('x, 'a) Cf_cmonad.t Cf_seq.t -> ('x, 'a list) Cf_cmonad.t
end
module SC :
sig
val sequence :
('s, 'x, unit) Cf_scmonad.t Cf_seq.t -> ('s, 'x, unit) Cf_scmonad.t
val accumulate :
('s, 'x, 'a) Cf_scmonad.t Cf_seq.t -> ('s, 'x, 'a list) Cf_scmonad.t
end
end`