Module Core_kernel.Map.Poly

type ('a, 'b, 'c) map = ('a'b'ct
module Tree : sig ... end
type ('a, +'b) t = ('a'bComparator.Poly.comparator_witnessmap
include sig ... end
val bin_read_t : 'a Bin_prot.Read.reader ‑> 'b Bin_prot.Read.reader ‑> ('a'bt Bin_prot.Read.reader
val __bin_read_t__ : 'a Bin_prot.Read.reader ‑> 'b Bin_prot.Read.reader ‑> (Core_kernel__.Import.int ‑> ('a'bt) Bin_prot.Read.reader
val bin_size_t : 'a Bin_prot.Size.sizer ‑> 'b Bin_prot.Size.sizer ‑> ('a'bt Bin_prot.Size.sizer
val bin_write_t : 'a Bin_prot.Write.writer ‑> 'b Bin_prot.Write.writer ‑> ('a'bt Bin_prot.Write.writer
val t_of_sexp : (Base.Sexp.t ‑> 'a) ‑> (Base.Sexp.t ‑> 'b) ‑> Base.Sexp.t ‑> ('a'bt
val sexp_of_t : ('a ‑> Base.Sexp.t) ‑> ('b ‑> Base.Sexp.t) ‑> ('a'bt ‑> Base.Sexp.t
val compare : ('a ‑> 'a ‑> Core_kernel__.Import.int) ‑> ('b ‑> 'b ‑> Core_kernel__.Import.int) ‑> ('a'bt ‑> ('a'bt ‑> Core_kernel__.Import.int
include Map_intf.Creators_and_accessors2 with type (a, b) t := (a, b) t with type (a, b) tree := (a, b) Tree.t
include Map_intf.Creators2
include Map_intf.Map.Creators2
type ('a, 'b) t
type ('a, 'b) tree
val empty : ('a'bt
val singleton : 'a ‑> 'b ‑> ('a'bt
val of_alist : ('a * 'b) list ‑> [ `Duplicate_key of 'a | `Ok of ('a'bt ]
val of_alist_or_error : ('a * 'b) list ‑> ('a'bt Base.Or_error.t
val of_alist_exn : ('a * 'b) list ‑> ('a'bt
val of_alist_multi : ('a * 'b) list ‑> ('a'b list) t
val of_alist_fold : ('a * 'b) list ‑> init:'c ‑> f:('c ‑> 'b ‑> 'c) ‑> ('a'ct
val of_alist_reduce : ('a * 'b) list ‑> f:('b ‑> 'b ‑> 'b) ‑> ('a'bt
val of_sorted_array : ('a * 'b) array ‑> ('a'bt Base.Or_error.t
val of_sorted_array_unchecked : ('a * 'b) array ‑> ('a'bt
val of_increasing_iterator_unchecked : len:int ‑> f:(int ‑> 'a * 'b) ‑> ('a'bt
val of_increasing_sequence : ('a * 'b) Base.Sequence.t ‑> ('a'bt Base.Or_error.t
val of_iteri : iteri:(f:(key:'a ‑> data:'b ‑> unit) ‑> unit) ‑> [ `Duplicate_key of 'a | `Ok of ('a'bt ]
val of_tree : ('a'btree ‑> ('a'bt
val of_hashtbl_exn : ('a'bHashtbl.t ‑> ('a'bt
include Map_intf.Accessors2 with type (a, b) t := (a, b) t with type (a, b) tree := (a, b) tree
include Map_intf.Map.Accessors2
type ('a, 'b) t
type ('a, 'b) tree
val invariants : ('a'bt ‑> bool
val is_empty : ('a'bt ‑> bool
val length : ('a'bt ‑> int
val add : ('a'bt ‑> key:'a ‑> data:'b ‑> ('a'bt Base__.Map_intf.Or_duplicate.t
val add_exn : ('a'bt ‑> key:'a ‑> data:'b ‑> ('a'bt
val set : ('a'bt ‑> key:'a ‑> data:'b ‑> ('a'bt
val add_multi : ('a'b list) t ‑> key:'a ‑> data:'b ‑> ('a'b list) t
val remove_multi : ('a'b list) t ‑> 'a ‑> ('a'b list) t
val find_multi : ('a'b list) t ‑> 'a ‑> 'b list
val change : ('a'bt ‑> 'a ‑> f:('b option ‑> 'b option) ‑> ('a'bt
val update : ('a'bt ‑> 'a ‑> f:('b option ‑> 'b) ‑> ('a'bt
val find : ('a'bt ‑> 'a ‑> 'b option
val find_exn : ('a'bt ‑> 'a ‑> 'b
val remove : ('a'bt ‑> 'a ‑> ('a'bt
val mem : ('a'bt ‑> 'a ‑> bool
val iter_keys : ('a'bt ‑> f:('a ‑> unit) ‑> unit
val iter : ('a'bt ‑> f:('b ‑> unit) ‑> unit
val iteri : ('a'bt ‑> f:(key:'a ‑> data:'b ‑> unit) ‑> unit
val iter2 : ('a'bt ‑> ('a'ct ‑> f:(key:'a ‑> data:[ `Both of 'b * 'c | `Left of 'b | `Right of 'c ] ‑> unit) ‑> unit
val map : ('a'bt ‑> f:('b ‑> 'c) ‑> ('a'ct
val mapi : ('a'bt ‑> f:(key:'a ‑> data:'b ‑> 'c) ‑> ('a'ct
val fold : ('a'bt ‑> init:'c ‑> f:(key:'a ‑> data:'b ‑> 'c ‑> 'c) ‑> 'c
val fold_right : ('a'bt ‑> init:'c ‑> f:(key:'a ‑> data:'b ‑> 'c ‑> 'c) ‑> 'c
val fold2 : ('a'bt ‑> ('a'ct ‑> init:'d ‑> f:(key:'a ‑> data:[ `Both of 'b * 'c | `Left of 'b | `Right of 'c ] ‑> 'd ‑> 'd) ‑> 'd
val filter_keys : ('a'bt ‑> f:('a ‑> bool) ‑> ('a'bt
val filter : ('a'bt ‑> f:('b ‑> bool) ‑> ('a'bt
val filteri : ('a'bt ‑> f:(key:'a ‑> data:'b ‑> bool) ‑> ('a'bt
val filter_map : ('a'bt ‑> f:('b ‑> 'c option) ‑> ('a'ct
val filter_mapi : ('a'bt ‑> f:(key:'a ‑> data:'b ‑> 'c option) ‑> ('a'ct
val partition_mapi : ('a'bt ‑> f:(key:'a ‑> data:'b ‑> [ `Fst of 'c | `Snd of 'd ]) ‑> ('a'ct * ('a'dt
val partition_map : ('a'bt ‑> f:('b ‑> [ `Fst of 'c | `Snd of 'd ]) ‑> ('a'ct * ('a'dt
val partitioni_tf : ('a'bt ‑> f:(key:'a ‑> data:'b ‑> bool) ‑> ('a'bt * ('a'bt
val partition_tf : ('a'bt ‑> f:('b ‑> bool) ‑> ('a'bt * ('a'bt
val compare_direct : ('b ‑> 'b ‑> int) ‑> ('a'bt ‑> ('a'bt ‑> int
val equal : ('b ‑> 'b ‑> bool) ‑> ('a'bt ‑> ('a'bt ‑> bool
val keys : ('a'bt ‑> 'a list
val data : ('a'bt ‑> 'b list
val to_alist : ?⁠key_order:[ `Decreasing | `Increasing ] ‑> ('a'bt ‑> ('a * 'b) list
val validate : name:('a ‑> string) ‑> 'b Base.Validate.check ‑> ('a'bt Base.Validate.check
val merge : ('a'bt ‑> ('a'ct ‑> f:(key:'a ‑> [ `Both of 'b * 'c | `Left of 'b | `Right of 'c ] ‑> 'd option) ‑> ('a'dt
val symmetric_diff : ('a'bt ‑> ('a'bt ‑> data_equal:('b ‑> 'b ‑> bool) ‑> ('a'bBase__.Map_intf.Symmetric_diff_element.t Base.Sequence.t
val min_elt : ('a'bt ‑> ('a * 'b) option
val min_elt_exn : ('a'bt ‑> 'a * 'b
val max_elt : ('a'bt ‑> ('a * 'b) option
val max_elt_exn : ('a'bt ‑> 'a * 'b
val for_all : ('a'bt ‑> f:('b ‑> bool) ‑> bool
val for_alli : ('a'bt ‑> f:(key:'a ‑> data:'b ‑> bool) ‑> bool
val exists : ('a'bt ‑> f:('b ‑> bool) ‑> bool
val existsi : ('a'bt ‑> f:(key:'a ‑> data:'b ‑> bool) ‑> bool
val count : ('a'bt ‑> f:('b ‑> bool) ‑> int
val counti : ('a'bt ‑> f:(key:'a ‑> data:'b ‑> bool) ‑> int
val split : ('a'bt ‑> 'a ‑> ('a'bt * ('a * 'b) option * ('a'bt
val append : lower_part:('a'bt ‑> upper_part:('a'bt ‑> [ `Ok of ('a'bt | `Overlapping_key_ranges ]
val subrange : ('a'bt ‑> lower_bound:'a Base.Maybe_bound.t ‑> upper_bound:'a Base.Maybe_bound.t ‑> ('a'bt
val fold_range_inclusive : ('a'bt ‑> min:'a ‑> max:'a ‑> init:'c ‑> f:(key:'a ‑> data:'b ‑> 'c ‑> 'c) ‑> 'c
val range_to_alist : ('a'bt ‑> min:'a ‑> max:'a ‑> ('a * 'b) list
val closest_key : ('a'bt ‑> [ `Greater_or_equal_to | `Greater_than | `Less_or_equal_to | `Less_than ] ‑> 'a ‑> ('a * 'b) option
val nth : ('a'bt ‑> int ‑> ('a * 'b) option
val nth_exn : ('a'bt ‑> int ‑> 'a * 'b
val rank : ('a'bt ‑> 'a ‑> int option
val to_tree : ('a'bt ‑> ('a'btree
val to_sequence : ?⁠order:[ `Decreasing_key | `Increasing_key ] ‑> ?⁠keys_greater_or_equal_to:'a ‑> ?⁠keys_less_or_equal_to:'a ‑> ('a'bt ‑> ('a * 'b) Base.Sequence.t
val shrinker : 'k Quickcheck.Shrinker.t ‑> 'v Quickcheck.Shrinker.t ‑> ('k'vt Quickcheck.Shrinker.t