Module Make.Seq_sSource

type !'a node = 'a Bare_structs.Seq_s.node =
  1. | Nil
  2. | Cons of 'a * 'a t
and 'a t = 'a Bare_structs.Seq_s.t
val empty : 'a t
val return : 'a -> 'a t
val return_s : 'a Lwt.t -> 'a t
val cons : 'a -> 'a t -> 'a t
val cons_s : 'a Lwt.t -> 'a t -> 'a t
val append : 'a t -> 'a t -> 'a t
val first : 'a t -> 'a option Lwt.t
val fold_left : ('a -> 'b -> 'a) -> 'a -> 'b t -> 'a Lwt.t
val fold_left_e : ('a -> 'b -> ('a, 'trace) Stdlib.result) -> 'a -> 'b t -> ('a, 'trace) Stdlib.result Lwt.t
val fold_left_s : ('a -> 'b -> 'a Lwt.t) -> 'a -> 'b t -> 'a Lwt.t
val fold_left_es : ('a -> 'b -> ('a, 'trace) Stdlib.result Lwt.t) -> 'a -> 'b t -> ('a, 'trace) Stdlib.result Lwt.t
val iter : ('a -> unit) -> 'a t -> unit Lwt.t
val iter_e : ('a -> (unit, 'trace) Stdlib.result) -> 'a t -> (unit, 'trace) Stdlib.result Lwt.t
val iter_s : ('a -> unit Lwt.t) -> 'a t -> unit Lwt.t
val iter_es : ('a -> (unit, 'trace) Stdlib.result Lwt.t) -> 'a t -> (unit, 'trace) Stdlib.result Lwt.t
val iter_p : ('a -> unit Lwt.t) -> 'a t -> unit Lwt.t
val map : ('a -> 'b) -> 'a t -> 'b t
val map_s : ('a -> 'b Lwt.t) -> 'a t -> 'b t
val filter : ('a -> bool) -> 'a t -> 'a t
val filter_s : ('a -> bool Lwt.t) -> 'a t -> 'a t
val filter_map : ('a -> 'b option) -> 'a t -> 'b t
val filter_map_s : ('a -> 'b option Lwt.t) -> 'a t -> 'b t
val unfold : ('b -> ('a * 'b) option) -> 'b -> 'a t
val unfold_s : ('b -> ('a * 'b) option Lwt.t) -> 'b -> 'a t
val of_seq : 'a Stdlib.Seq.t -> 'a t
val of_seq_s : 'a Lwt.t Stdlib.Seq.t -> 'a t
Sourceval iter_ep : ('a -> (unit, 'error Monad.trace) Stdlib.result Lwt.t) -> 'a t -> (unit, 'error Monad.trace) Stdlib.result Lwt.t