Module Base.Map.Using_comparator

Using comparator is a similar interface as the toplevel of Map, except the functions take a ~comparator:('k, 'cmp) Comparator.t where the functions at the toplevel of Map takes a ('k, 'cmp) comparator.

type ('k, +'v, 'cmp) t = ('k'v'cmpt
include sig ... end
val sexp_of_t : ('k ‑> Base__.Sexplib.Sexp.t) ‑> ('v ‑> Base__.Sexplib.Sexp.t) ‑> ('cmp ‑> Base__.Sexplib.Sexp.t) ‑> ('k'v'cmpt ‑> Base__.Sexplib.Sexp.t
val t_of_sexp_direct : comparator:('k'cmpComparator.t ‑> (Sexp.t ‑> 'k) ‑> (Sexp.t ‑> 'v) ‑> Sexp.t ‑> ('k'v'cmpt
module Tree : sig ... end
include Map_intf.Accessors3 with type (a, b, c) t := (a, b, c) t with type (a, b, c) tree := (a, b, c) Tree.t
type ('a, 'b, 'cmp) t
type ('a, 'b, 'cmp) tree
val invariants : (___t ‑> bool
val is_empty : (___t ‑> bool
val length : (___t ‑> int
val add : ('a'b'cmpt ‑> key:'a ‑> data:'b ‑> ('a'b'cmpt
val add_multi : ('a'b list, 'cmpt ‑> key:'a ‑> data:'b ‑> ('a'b list, 'cmpt
val remove_multi : ('a'b list, 'cmpt ‑> 'a ‑> ('a'b list, 'cmpt
val change : ('a'b'cmpt ‑> 'a ‑> f:('b option ‑> 'b option) ‑> ('a'b'cmpt
val update : ('a'b'cmpt ‑> 'a ‑> f:('b option ‑> 'b) ‑> ('a'b'cmpt
val find : ('a'b'cmpt ‑> 'a ‑> 'b option
val find_exn : ('a'b'cmpt ‑> 'a ‑> 'b
val remove : ('a'b'cmpt ‑> 'a ‑> ('a'b'cmpt
val mem : ('a'b'cmpt ‑> 'a ‑> bool
val iter_keys : ('a_'cmpt ‑> f:('a ‑> unit) ‑> unit
val iter : (_'b'cmpt ‑> f:('b ‑> unit) ‑> unit
val iteri : ('a'b'cmpt ‑> f:(key:'a ‑> data:'b ‑> unit) ‑> unit
val iter2 : ('a'b'cmpt ‑> ('a'c'cmpt ‑> f:(key:'a ‑> data:[ `Left of 'b | `Right of 'c | `Both of 'b * 'c ] ‑> unit) ‑> unit
val map : ('a'b'cmpt ‑> f:('b ‑> 'c) ‑> ('a'c'cmpt
val mapi : ('a'b'cmpt ‑> f:(key:'a ‑> data:'b ‑> 'c) ‑> ('a'c'cmpt
val fold : ('a'b_t ‑> init:'c ‑> f:(key:'a ‑> data:'b ‑> 'c ‑> 'c) ‑> 'c
val fold_right : ('a'b_t ‑> init:'c ‑> f:(key:'a ‑> data:'b ‑> 'c ‑> 'c) ‑> 'c
val fold2 : ('a'b'cmpt ‑> ('a'c'cmpt ‑> init:'d ‑> f:(key:'a ‑> data:[ `Left of 'b | `Right of 'c | `Both of 'b * 'c ] ‑> 'd ‑> 'd) ‑> 'd
val filter_keys : ('a'b'cmpt ‑> f:('a ‑> bool) ‑> ('a'b'cmpt
val filter : ('a'b'cmpt ‑> f:('b ‑> bool) ‑> ('a'b'cmpt
val filteri : ('a'b'cmpt ‑> f:(key:'a ‑> data:'b ‑> bool) ‑> ('a'b'cmpt
val filter_map : ('a'b'cmpt ‑> f:('b ‑> 'c option) ‑> ('a'c'cmpt
val filter_mapi : ('a'b'cmpt ‑> f:(key:'a ‑> data:'b ‑> 'c option) ‑> ('a'c'cmpt
val partition_mapi : ('a'b'cmpt ‑> f:(key:'a ‑> data:'b ‑> [ `Fst of 'c | `Snd of 'd ]) ‑> ('a'c'cmpt * ('a'd'cmpt
val partition_map : ('a'b'cmpt ‑> f:('b ‑> [ `Fst of 'c | `Snd of 'd ]) ‑> ('a'c'cmpt * ('a'd'cmpt
val partitioni_tf : ('a'b'cmpt ‑> f:(key:'a ‑> data:'b ‑> bool) ‑> ('a'b'cmpt * ('a'b'cmpt
val partition_tf : ('a'b'cmpt ‑> f:('b ‑> bool) ‑> ('a'b'cmpt * ('a'b'cmpt
val compare_direct : ('b ‑> 'b ‑> int) ‑> ('a'b'cmpt ‑> ('a'b'cmpt ‑> int
val equal : ('b ‑> 'b ‑> bool) ‑> ('a'b'cmpt ‑> ('a'b'cmpt ‑> bool
val keys : ('a__t ‑> 'a list
val data : (_'b_t ‑> 'b list
val to_alist : ?key_order:[ `Increasing | `Decreasing ] ‑> ('a'b_t ‑> ('a * 'b) list
val validate : name:('a ‑> string) ‑> 'b Validate.check ‑> ('a'b_t Validate.check
val merge : ('a'b'cmpt ‑> ('a'c'cmpt ‑> f:(key:'a ‑> [ `Left of 'b | `Right of 'c | `Both of 'b * 'c ] ‑> 'd option) ‑> ('a'd'cmpt
val symmetric_diff : ('a'b'cmpt ‑> ('a'b'cmpt ‑> data_equal:('b ‑> 'b ‑> bool) ‑> ('a'bMap_intf.Symmetric_diff_element.t Sequence.t
val min_elt : ('a'b'cmpt ‑> ('a * 'b) option
val min_elt_exn : ('a'b'cmpt ‑> 'a * 'b
val max_elt : ('a'b'cmpt ‑> ('a * 'b) option
val max_elt_exn : ('a'b'cmpt ‑> 'a * 'b
val for_all : (_'b_t ‑> f:('b ‑> bool) ‑> bool
val for_alli : ('a'b_t ‑> f:(key:'a ‑> data:'b ‑> bool) ‑> bool
val exists : (_'b_t ‑> f:('b ‑> bool) ‑> bool
val existsi : ('a'b_t ‑> f:(key:'a ‑> data:'b ‑> bool) ‑> bool
val count : (_'b_t ‑> f:('b ‑> bool) ‑> int
val counti : ('a'b_t ‑> f:(key:'a ‑> data:'b ‑> bool) ‑> int
val split : ('k'v'cmpt ‑> 'k ‑> ('k'v'cmpt * ('k * 'v) option * ('k'v'cmpt
val append : lower_part:('k'v'cmpt ‑> upper_part:('k'v'cmpt ‑> [ `Ok of ('k'v'cmpt | `Overlapping_key_ranges ]
val subrange : ('k'v'cmpt ‑> lower_bound:'k Maybe_bound.t ‑> upper_bound:'k Maybe_bound.t ‑> ('k'v'cmpt
val fold_range_inclusive : ('a'b_t ‑> min:'a ‑> max:'a ‑> init:'c ‑> f:(key:'a ‑> data:'b ‑> 'c ‑> 'c) ‑> 'c
val range_to_alist : ('a'b_t ‑> min:'a ‑> max:'a ‑> ('a * 'b) list
val closest_key : ('a'b_t ‑> [ `Greater_or_equal_to | `Greater_than | `Less_or_equal_to | `Less_than ] ‑> 'a ‑> ('a * 'b) option
val nth : ('a'b_t ‑> int ‑> ('a * 'b) option
val nth_exn : ('a'b_t ‑> int ‑> 'a * 'b
val rank : ('a__t ‑> 'a ‑> int option
val to_tree : ('a'b'cmpt ‑> ('a'b'cmptree
val to_sequence : ?order:[ `Increasing_key | `Decreasing_key ] ‑> ?keys_greater_or_equal_to:'a ‑> ?keys_less_or_equal_to:'a ‑> ('a'b_t ‑> ('a * 'b) Sequence.t
include Map_intf.Creators3_with_comparator with type (a, b, c) t := (a, b, c) t with type (a, b, c) tree := (a, b, c) Tree.t
type ('a, 'b, 'cmp) t
type ('a, 'b, 'cmp) tree
val empty : comparator:('a'cmpComparator.t ‑> ('a_'cmpt
val singleton : comparator:('a'cmpComparator.t ‑> 'a ‑> 'b ‑> ('a'b'cmpt
val of_alist : comparator:('a'cmpComparator.t ‑> ('a * 'b) list ‑> [ `Ok of ('a'b'cmpt | `Duplicate_key of 'a ]
val of_alist_or_error : comparator:('a'cmpComparator.t ‑> ('a * 'b) list ‑> ('a'b'cmpt Or_error.t
val of_alist_exn : comparator:('a'cmpComparator.t ‑> ('a * 'b) list ‑> ('a'b'cmpt
val of_alist_multi : comparator:('a'cmpComparator.t ‑> ('a * 'b) list ‑> ('a'b list, 'cmpt
val of_alist_fold : comparator:('a'cmpComparator.t ‑> ('a * 'b) list ‑> init:'c ‑> f:('c ‑> 'b ‑> 'c) ‑> ('a'c'cmpt
val of_alist_reduce : comparator:('a'cmpComparator.t ‑> ('a * 'b) list ‑> f:('b ‑> 'b ‑> 'b) ‑> ('a'b'cmpt
val of_sorted_array : comparator:('a'cmpComparator.t ‑> ('a * 'b) array ‑> ('a'b'cmpt Or_error.t
val of_sorted_array_unchecked : comparator:('a'cmpComparator.t ‑> ('a * 'b) array ‑> ('a'b'cmpt
val of_increasing_iterator_unchecked : comparator:('a'cmpComparator.t ‑> len:int ‑> f:(int ‑> 'a * 'b) ‑> ('a'b'cmpt
val of_iteri : comparator:('a'cmpComparator.t ‑> iteri:(f:(key:'a ‑> data:'b ‑> unit) ‑> unit) ‑> [ `Ok of ('a'b'cmpt | `Duplicate_key of 'a ]
val of_tree : comparator:('a'cmpComparator.t ‑> ('a'b'cmptree ‑> ('a'b'cmpt
val comparator : ('a_'cmpt ‑> ('a'cmpComparator.t
val hash_fold_direct : 'k Hash.folder ‑> 'v Hash.folder ‑> ('k'v'cmpt Hash.folder
module Empty_without_value_restriction : functor (K : Comparator.S1) -> sig ... end