package tezos-protocol-demo-counter

  1. Overview
  2. Docs
Tezos/Protocol: demo_counter economic-protocol definition

Install

Dune Dependency

Authors

Maintainers

Sources

tezos-16.0.tar.gz
sha256=ad9e08819871c75ba6f4530b125f7d157799398e4d77a1e6bfea9d91ff37ff55
sha512=c5dc4d40cc09bc6980fbbdb5c2e105bf4252cf9cfcb2b49660b0ebe4dc789f6709ec3b3bf2f87d81580d3eed9521eeb1c960f24d9b14eb0285aaba1f84d10a9b

doc/tezos-protocol-demo-counter.environment/Tezos_protocol_environment_demo_counter/Block_hash/Set/index.html

Module Block_hash.Set

type elt = t
type t
val empty : t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val remove : elt -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val disjoint : t -> t -> bool
val diff : t -> t -> t
val compare : t -> t -> int
val equal : t -> t -> bool
val subset : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val iter_e : (elt -> (unit, 'trace) Pervasives.result) -> t -> (unit, 'trace) Pervasives.result
val iter_s : (elt -> unit Lwt.t) -> t -> unit Lwt.t
val iter_p : (elt -> unit Lwt.t) -> t -> unit Lwt.t
val iter_es : (elt -> (unit, 'trace) Pervasives.result Lwt.t) -> t -> (unit, 'trace) Pervasives.result Lwt.t
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val fold_e : (elt -> 'a -> ('a, 'trace) Pervasives.result) -> t -> 'a -> ('a, 'trace) Pervasives.result
val fold_s : (elt -> 'a -> 'a Lwt.t) -> t -> 'a -> 'a Lwt.t
val fold_es : (elt -> 'a -> ('a, 'trace) Pervasives.result Lwt.t) -> t -> 'a -> ('a, 'trace) Pervasives.result Lwt.t
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val filter : (elt -> bool) -> t -> t
val filter_map : (elt -> elt option) -> t -> t
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val elements : t -> elt list
val min_elt : t -> elt option
val min_elt_opt : t -> elt option
val max_elt : t -> elt option
val max_elt_opt : t -> elt option
val choose : t -> elt option
val choose_opt : t -> elt option
val split : elt -> t -> t * bool * t
val find : elt -> t -> elt option
val find_opt : elt -> t -> elt option
val find_first : (elt -> bool) -> t -> elt option
val find_first_opt : (elt -> bool) -> t -> elt option
val find_last : (elt -> bool) -> t -> elt option
val find_last_opt : (elt -> bool) -> t -> elt option
val of_list : elt list -> t
val to_seq_from : elt -> t -> elt Seq.t
val to_seq : t -> elt Seq.t
val to_rev_seq : t -> elt Seq.t
val add_seq : elt Seq.t -> t -> t
val of_seq : elt Seq.t -> t
val iter_ep : (elt -> (unit, 'error Error_monad.trace) Pervasives.result Lwt.t) -> t -> (unit, 'error Error_monad.trace) Pervasives.result Lwt.t
val random_elt : t -> elt
val encoding : t Data_encoding.t
OCaml

Innovation. Community. Security.