package colibri2

  1. Overview
  2. Docs
type key = M.key
type 'a t = 'a M.t
val hash_fold_t : unit Base.Hash.folder -> unit t Base.Hash.folder
val empty : unit t
val is_empty : unit t -> bool
val mem : key -> unit t -> bool
val add : key -> unit -> unit t -> unit t
val singleton : key -> unit -> unit t
val remove : key -> unit t -> unit t
val merge : (key -> unit option -> unit option -> unit option) -> unit t -> unit t -> unit t
val compare : (unit -> unit -> int) -> unit t -> unit t -> int
val equal : (unit -> unit -> bool) -> unit t -> unit t -> bool
val iter : (key -> unit -> unit) -> unit t -> unit
val fold : (key -> unit -> 'b -> 'b) -> unit t -> 'b -> 'b
val for_all : (key -> unit -> bool) -> unit t -> bool
val exists : (key -> unit -> bool) -> unit t -> bool
val filter : (key -> unit -> bool) -> unit t -> unit t
val partition : (key -> unit -> bool) -> unit t -> unit t * unit t
val cardinal : unit t -> int
val bindings : unit t -> (key * unit) list
val min_binding : unit t -> key * unit
val max_binding : unit t -> key * unit
val choose : unit t -> key * unit
val split : key -> unit t -> unit t * unit option * unit t
val find : key -> unit t -> unit
val map : (unit -> unit) -> unit t -> unit t
val mapi : (key -> unit -> unit) -> unit t -> unit t
val change : (unit option -> unit option) -> key -> unit t -> unit t
val add_change : ('b -> unit) -> ('b -> unit -> unit) -> key -> 'b -> unit t -> unit t
val union : (key -> unit -> unit -> unit option) -> unit t -> unit t -> unit t
val union_merge : (key -> unit option -> unit -> unit option) -> unit t -> unit t -> unit t
val inter : (key -> unit -> unit -> unit option) -> unit t -> unit t -> unit t
val diff : (key -> unit -> unit -> unit option) -> unit t -> unit t -> unit t
val submap : (key -> unit -> unit -> bool) -> unit t -> unit t -> bool
val disjoint : (key -> unit -> unit -> bool) -> unit t -> unit t -> bool
val set_union : unit t -> unit t -> unit t
val set_inter : unit t -> unit t -> unit t
val set_diff : unit t -> unit t -> unit t
val set_submap : unit t -> unit t -> bool
val set_disjoint : unit t -> unit t -> bool
val set_compare : unit t -> unit t -> int
val set_equal : unit t -> unit t -> bool
val find_def : unit -> key -> unit t -> unit
val find_opt : key -> unit t -> unit option
val find_exn : exn -> key -> unit t -> unit
val find_remove : key -> unit t -> unit t * unit option
val add_opt : key -> unit option -> unit t -> unit t
val find_smaller_opt : key -> unit t -> (key * unit) option
val map_filter : (unit -> unit option) -> unit t -> unit t
val mapi_filter : (key -> unit -> unit option) -> unit t -> unit t
val mapi_fold : (key -> unit -> 'acc -> 'acc * unit) -> unit t -> 'acc -> 'acc * unit t
val mapi_filter_fold : (key -> unit -> 'acc -> 'acc * unit option) -> unit t -> 'acc -> 'acc * unit t
val fold_left : ('b -> key -> unit -> 'b) -> 'b -> unit t -> 'b
val fold2_inter : (key -> unit -> unit -> 'c -> 'c) -> unit t -> unit t -> 'c -> 'c
val fold2_union : (key -> unit option -> unit option -> 'c -> 'c) -> unit t -> unit t -> 'c -> 'c
val fold_decr : ('b -> key -> unit -> 'b) -> 'b -> unit t -> 'b
val translate : (key -> key) -> unit t -> unit t
val add_new : exn -> key -> unit -> unit t -> unit t
val keys : unit t -> key list
val values : unit t -> unit list
val of_list : (key * unit) list -> unit t
val is_num_elt : int -> unit t -> bool
val choose_rnd : (unit -> bool) -> unit t -> key * unit
type 'a enumeration
val val_enum : unit enumeration -> (key * unit) option
val start_enum : unit t -> unit enumeration
val next_enum : unit enumeration -> unit enumeration
val start_ge_enum : key -> unit t -> unit enumeration
val next_ge_enum : key -> unit enumeration -> unit enumeration
val check_invariant : unit t -> bool
OCaml

Innovation. Community. Security.