package octez-plonk

You can search for identifiers within the package.

in-package search v0.2.0

Package contains no libraries

module StringMap : sig ... end

module type S = sig ... end

include S

include Stdlib.Map.S with type key = string and type 'a t = 'a StringMap.t

type key = string

type !'a0 t = 'a StringMap.t

val empty : 'a t

val is_empty : 'a t -> bool

val mem : key -> 'a t -> bool

val add : key -> 'a -> 'a t -> 'a t

val update : key -> ('a option -> 'a option) -> 'a t -> 'a t

val singleton : key -> 'a -> 'a t

val remove : key -> 'a t -> 'a t

val merge : 
  (key -> 'a option -> 'b option -> 'c option) ->
  'a t ->
  'b t ->
  'c t

val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

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

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

val iter : (key -> 'a -> unit) -> 'a t -> unit

val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b

val for_all : (key -> 'a -> bool) -> 'a t -> bool

val exists : (key -> 'a -> bool) -> 'a t -> bool

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

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

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

val cardinal : 'a t -> int

val bindings : 'a t -> (key * 'a) list

val min_binding : 'a t -> key * 'a

val min_binding_opt : 'a t -> (key * 'a) option

val max_binding : 'a t -> key * 'a

val max_binding_opt : 'a t -> (key * 'a) option

val choose : 'a t -> key * 'a

val choose_opt : 'a t -> (key * 'a) option

val split : key -> 'a t -> 'a t * 'a option * 'a t

val find : key -> 'a t -> 'a

val find_opt : key -> 'a t -> 'a option

val find_first : (key -> bool) -> 'a t -> key * 'a

val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option

val find_last : (key -> bool) -> 'a t -> key * 'a

val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option

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

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

val to_seq : 'a t -> (key * 'a) Stdlib.Seq.t

val to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.t

val to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.t

val add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a t

val of_seq : (key * 'a) Stdlib.Seq.t -> 'a t

val t : 'a Repr.ty -> 'a t Repr.ty

val of_list : (string * 'a) list -> 'a t

val keys : 'a t -> string list

val values : 'a t -> 'a list

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

val add_unique : key -> 'a -> 'a t -> 'a t

val union_disjoint : 
  ?common_keys_equal_elt:(string list * ('a -> 'a -> bool)) ->
  'a t ->
  'a t ->
  'a t

val union_disjoint_list : 
  ?common_keys_equal_elt:(string list * ('a -> 'a -> bool)) ->
  'a t list ->
  'a t

val map_list_to_list_map : 'a t list -> 'a list t

val sub_map : 'a t -> 'b t -> 'b t

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

val update_keys : (key -> key) -> 'a t -> 'a t

module Aggregation : sig ... end