octez-libs 20.1 · OCaml Package

type !'a node = 'a Bare_structs.Seq_s.node =

| Nil
| Cons of 'a * 'a t

and 'a t = 'a Bare_structs.Seq_s.t

val iter : ('a -> unit) -> 'a t -> unit Lwt.t

val fold_left : ('a -> 'b -> 'a) -> 'a -> 'b t -> 'a Lwt.t

val iteri : (int -> 'a -> unit) -> 'a t -> unit Lwt.t

val fold_lefti : ('b -> int -> 'a -> 'b) -> 'b -> 'a t -> 'b Lwt.t

val for_all : ('a -> bool) -> 'a t -> bool Lwt.t

val exists : ('a -> bool) -> 'a t -> bool Lwt.t

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

val find_map : ('a -> 'b option) -> 'a t -> 'b option Lwt.t

val iter2 : ('a -> 'b -> unit) -> 'a t -> 'b t -> unit Lwt.t

val fold_left2 : ('a -> 'b -> 'c -> 'a) -> 'a -> 'b t -> 'c t -> 'a Lwt.t

val for_all2 : ('a -> 'b -> bool) -> 'a t -> 'b t -> bool Lwt.t

val exists2 : ('a -> 'b -> bool) -> 'a t -> 'b t -> bool Lwt.t

val init : int -> (int -> 'a) -> 'a t

val unfold : ('b -> ('a * 'b) option) -> 'b -> 'a t

val forever : (unit -> 'a) -> 'a t

val iterate : ('a -> 'a) -> 'a -> 'a t

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

val mapi : (int -> 'a -> 'b) -> 'a t -> 'b t

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

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

val scan : ('b -> 'a -> 'b) -> 'b -> 'a t -> 'b t

val take_while : ('a -> bool) -> 'a t -> 'a t

val drop_while : ('a -> bool) -> 'a t -> 'a t

val group : ('a -> 'a -> bool) -> 'a t -> 'a t t

val map2 : ('a -> 'b -> 'c) -> 'a t -> 'b t -> 'c t

val map_product : ('a -> 'b -> 'c) -> 'a t -> 'b t -> 'c t

val partition_map : ('a -> ('b, 'c) Either.t) -> 'a t -> 'b t * 'c t

val partition : ('a -> bool) -> 'a t -> 'a t * 'a t

val is_empty : 'a t -> bool Lwt.t

val uncons : 'a t -> ('a * 'a t) option Lwt.t

val length : 'a t -> int Lwt.t

val equal : ('a -> 'b -> bool) -> 'a t -> 'b t -> bool Lwt.t

val compare : ('a -> 'b -> int) -> 'a t -> 'b t -> int Lwt.t

val empty : 'a t

val return : 'a -> 'a t

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

val repeat : 'a -> 'a t

val cycle : 'a t -> 'a t

val memoize : 'a t -> 'a t

val once : 'a t -> 'a t

val transpose : 'a t t -> 'a t t

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

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

val flat_map : ('a -> 'b t) -> 'a t -> 'b t

val concat_map : ('a -> 'b t) -> 'a t -> 'b t

val zip : 'a t -> 'b t -> ('a * 'b) t

val interleave : 'a t -> 'a t -> 'a t

val sorted_merge : ('a -> 'a -> int) -> 'a t -> 'a t -> 'a t

val product : 'a t -> 'b t -> ('a * 'b) t

val unzip : ('a * 'b) t -> 'a t * 'b t

val split : ('a * 'b) t -> 'a t * 'b t

val of_dispenser : (unit -> 'a option Lwt.t) -> 'a t

val to_dispenser : 'a t -> unit -> 'a option Lwt.t

val ints : int -> int t

module E : sig ... end

module S : sig ... end

module ES : sig ... end

val return_s : 'a Lwt.t -> 'a t

val cons_s : 'a Lwt.t -> 'a t -> 'a t

val iter_p : ('a -> unit Lwt.t) -> 'a t -> unit Lwt.t

val iteri_p : (int -> 'a -> unit Lwt.t) -> 'a t -> unit Lwt.t

val take : when_negative_length:'err -> int -> 'a t -> ('a t, 'err) result

val drop : when_negative_length:'err -> int -> 'a t -> ('a t, 'err) result

val of_seq : 'a Seq.t -> 'a t

val of_seq_s : 'a Lwt.t Seq.t -> 'a t

val iter_ep : 
  ('a -> (unit, 'error TzTrace.trace) result Lwt.t) ->
  'a t ->
  (unit, 'error TzTrace.trace) result Lwt.t

package octez-libs