package octez-proto-libs

  1. Overview
  2. Docs
Package contains no libraries
include module type of struct include Tezos_error_monad.TzLwtreslib.Seq end
type !'a t = 'a Seq.t
and !'a node = 'a Seq.node =
  1. | Nil
  2. | Cons of 'a * 'a t
val is_empty : 'a t -> bool
val uncons : 'a t -> ('a * 'a t) option
val length : 'a t -> int
val iter : ('a -> unit) -> 'a t -> unit
val fold_left : ('a -> 'b -> 'a) -> 'a -> 'b t -> 'a
val iteri : (int -> 'a -> unit) -> 'a t -> unit
val fold_lefti : ('b -> int -> 'a -> 'b) -> 'b -> 'a t -> 'b
val for_all : ('a -> bool) -> 'a t -> bool
val exists : ('a -> bool) -> 'a t -> bool
val find : ('a -> bool) -> 'a t -> 'a option
val find_map : ('a -> 'b option) -> 'a t -> 'b option
val iter2 : ('a -> 'b -> unit) -> 'a t -> 'b t -> unit
val fold_left2 : ('a -> 'b -> 'c -> 'a) -> 'a -> 'b t -> 'c t -> 'a
val for_all2 : ('a -> 'b -> bool) -> 'a t -> 'b t -> bool
val exists2 : ('a -> 'b -> bool) -> 'a t -> 'b t -> bool
val equal : ('a -> 'b -> bool) -> 'a t -> 'b t -> bool
val compare : ('a -> 'b -> int) -> 'a t -> 'b t -> int
val empty : 'a t
val return : 'a -> 'a t
val cons : 'a -> 'a t -> 'a t
val unfold : ('b -> ('a * 'b) option) -> 'b -> 'a t
val repeat : 'a -> 'a t
val forever : (unit -> 'a) -> 'a t
val cycle : 'a t -> '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 memoize : 'a t -> 'a t
exception Forced_twice
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 map2 : ('a -> 'b -> 'c) -> 'a t -> 'b t -> 'c 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 map_product : ('a -> 'b -> 'c) -> 'a t -> 'b t -> 'c t
val unzip : ('a * 'b) t -> 'a t * 'b t
val split : ('a * 'b) t -> 'a t * 'b 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 of_dispenser : (unit -> 'a option) -> 'a t
val to_dispenser : 'a t -> unit -> 'a option
val ints : int -> int t
val init : when_negative_length:'err -> int -> (int -> 'a) -> ('a t, 'err) result
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 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 iter2_p : ('a -> 'b -> unit Lwt.t) -> 'a t -> 'b t -> unit Lwt.t
val iter_ep : ('a -> (unit, 'error Tezos_error_monad.TzTrace.trace) result Lwt.t) -> 'a t -> (unit, 'error Tezos_error_monad.TzTrace.trace) result Lwt.t
val iteri_ep : (int -> 'a -> (unit, 'error Tezos_error_monad.TzTrace.trace) result Lwt.t) -> 'a t -> (unit, 'error Tezos_error_monad.TzTrace.trace) result Lwt.t
val iter2_ep : ('a -> 'b -> (unit, 'error Tezos_error_monad.TzTrace.trace) result Lwt.t) -> 'a t -> 'b t -> (unit, 'error Tezos_error_monad.TzTrace.trace) result Lwt.t
val first : 'a t -> 'a option
val fold_left_e : ('a -> 'b -> ('a, 'c) result) -> 'a -> 'b Seq.t -> ('a, 'c) result
val fold_left_s : ('a -> 'b -> 'a Lwt.t) -> 'a -> 'b Seq.t -> 'a Lwt.t
val fold_left_es : ('a -> 'b -> ('a, 'c) result Lwt.t) -> 'a -> 'b Seq.t -> ('a, 'c) result Lwt.t
val iter_e : ('a -> (unit, 'b) result) -> 'a Seq.t -> (unit, 'b) result
val iter_s : ('a -> unit Lwt.t) -> 'a Seq.t -> unit Lwt.t
val iter_es : ('a -> (unit, 'b) result Lwt.t) -> 'a Seq.t -> (unit, 'b) result Lwt.t
val iteri_e : (int -> 'a -> (unit, 'b) result) -> 'a Seq.t -> (unit, 'b) result
val iteri_s : (int -> 'a -> unit Lwt.t) -> 'a Seq.t -> unit Lwt.t
val iteri_es : (int -> 'a -> (unit, 'b) result Lwt.t) -> 'a Seq.t -> (unit, 'b) result Lwt.t
val fold_lefti_e : ('a -> int -> 'b -> ('a, 'c) result) -> 'a -> 'b Seq.t -> ('a, 'c) result
val fold_lefti_s : ('a -> int -> 'b -> 'a Lwt.t) -> 'a -> 'b Seq.t -> 'a Lwt.t
val fold_lefti_es : ('a -> int -> 'b -> ('a, 'c) result Lwt.t) -> 'a -> 'b Seq.t -> ('a, 'c) result Lwt.t
val for_all_e : ('a -> (bool, 'b) result) -> 'a Seq.t -> (bool, 'b) result
val for_all_s : ('a -> bool Lwt.t) -> 'a Seq.t -> bool Lwt.t
val for_all_es : ('a -> (bool, 'b) result Lwt.t) -> 'a Seq.t -> (bool, 'b) result Lwt.t
val exists_e : ('a -> (bool, 'b) result) -> 'a Seq.t -> (bool, 'b) result
val exists_s : ('a -> bool Lwt.t) -> 'a Seq.t -> bool Lwt.t
val exists_es : ('a -> (bool, 'b) result Lwt.t) -> 'a Seq.t -> (bool, 'b) result Lwt.t
val find_e : ('a -> (bool, 'b) result) -> 'a Seq.t -> ('a option, 'b) result
val find_s : ('a -> bool Lwt.t) -> 'a Seq.t -> 'a option Lwt.t
val find_es : ('a -> (bool, 'b) result Lwt.t) -> 'a Seq.t -> ('a option, 'b) result Lwt.t
val find_map_e : ('a -> ('b option, 'c) result) -> 'a Seq.t -> ('b option, 'c) result
val find_map_s : ('a -> 'b option Lwt.t) -> 'a Seq.t -> 'b option Lwt.t
val find_map_es : ('a -> ('b option, 'c) result Lwt.t) -> 'a Seq.t -> ('b option, 'c) result Lwt.t
val iter2_e : ('a -> 'b -> (unit, 'c) result) -> 'a Seq.t -> 'b Seq.t -> (unit, 'c) result
val iter2_s : ('a -> 'b -> unit Lwt.t) -> 'a Seq.t -> 'b Seq.t -> unit Lwt.t
val iter2_es : ('a -> 'b -> (unit, 'c) result Lwt.t) -> 'a Seq.t -> 'b Seq.t -> (unit, 'c) result Lwt.t
val fold_left2_e : ('a -> 'b -> 'c -> ('a, 'd) result) -> 'a -> 'b Seq.t -> 'c Seq.t -> ('a, 'd) result
val fold_left2_s : ('a -> 'b -> 'c -> 'a Lwt.t) -> 'a -> 'b Seq.t -> 'c Seq.t -> 'a Lwt.t
val fold_left2_es : ('a -> 'b -> 'c -> ('a, 'd) result Lwt.t) -> 'a -> 'b Seq.t -> 'c Seq.t -> ('a, 'd) result Lwt.t
val for_all2_e : ('a -> 'b -> (bool, 'c) result) -> 'a Seq.t -> 'b Seq.t -> (bool, 'c) result
val for_all2_s : ('a -> 'b -> bool Lwt.t) -> 'a Seq.t -> 'b Seq.t -> bool Lwt.t
val for_all2_es : ('a -> 'b -> (bool, 'c) result Lwt.t) -> 'a Seq.t -> 'b Seq.t -> (bool, 'c) result Lwt.t
val exists2_e : ('a -> 'b -> (bool, 'c) result) -> 'a Seq.t -> 'b Seq.t -> (bool, 'c) result
val exists2_s : ('a -> 'b -> bool Lwt.t) -> 'a Seq.t -> 'b Seq.t -> bool Lwt.t
val exists2_es : ('a -> 'b -> (bool, 'c) result Lwt.t) -> 'a Seq.t -> 'b Seq.t -> (bool, 'c) result Lwt.t
OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct