Module Map.Using_comparatorSource

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

Sourcetype nonrec ('k, +'v, 'cmp) t = ('k, 'v, 'cmp) t
Sourceval sexp_of_t : ('k -> Sexplib0.Sexp.t) -> ('v -> Sexplib0.Sexp.t) -> ('cmp -> Sexplib0.Sexp.t) -> ('k, 'v, 'cmp) t -> Sexplib0.Sexp.t
Sourceval t_of_sexp_direct : comparator:('k, 'cmp) Comparator.t -> (Sexp.t -> 'k) -> (Sexp.t -> 'v) -> Sexp.t -> ('k, 'v, 'cmp) t
Sourcemodule Tree : sig ... end
Sourceval invariants : (_, _, _) t -> bool
Sourceval is_empty : (_, _, _) t -> bool
Sourceval length : (_, _, _) t -> int
Sourceval add : ('a, 'b, 'cmp) t -> key:'a -> data:'b -> [ `Ok of ('a, 'b, 'cmp) t | `Duplicate ]
Sourceval add_exn : ('a, 'b, 'cmp) t -> key:'a -> data:'b -> ('a, 'b, 'cmp) t
Sourceval set : ('a, 'b, 'cmp) t -> key:'a -> data:'b -> ('a, 'b, 'cmp) t
Sourceval add_multi : ('a, 'b list, 'cmp) t -> key:'a -> data:'b -> ('a, 'b list, 'cmp) t
Sourceval remove_multi : ('a, 'b list, 'cmp) t -> 'a -> ('a, 'b list, 'cmp) t
Sourceval find_multi : ('a, 'b list, 'cmp) t -> 'a -> 'b list
Sourceval change : ('a, 'b, 'cmp) t -> 'a -> f:('b option -> 'b option) -> ('a, 'b, 'cmp) t
Sourceval update : ('a, 'b, 'cmp) t -> 'a -> f:('b option -> 'b) -> ('a, 'b, 'cmp) t
Sourceval find : ('a, 'b, 'cmp) t -> 'a -> 'b option
Sourceval find_exn : ('a, 'b, 'cmp) t -> 'a -> 'b
Sourceval remove : ('a, 'b, 'cmp) t -> 'a -> ('a, 'b, 'cmp) t
Sourceval mem : ('a, 'b, 'cmp) t -> 'a -> bool
Sourceval iter_keys : ('a, _, 'cmp) t -> f:('a -> unit) -> unit
Sourceval iter : (_, 'b, 'cmp) t -> f:('b -> unit) -> unit
Sourceval iteri : ('a, 'b, 'cmp) t -> f:(key:'a -> data:'b -> unit) -> unit
Sourceval iteri_until : ('a, 'b, 'cmp) t -> f:(key:'a -> data:'b -> Continue_or_stop.t) -> Finished_or_unfinished.t
Sourceval iter2 : ('a, 'b, 'cmp) t -> ('a, 'c, 'cmp) t -> f:(key:'a -> data:[ `Left of 'b | `Right of 'c | `Both of 'b * 'c ] -> unit) -> unit
Sourceval map : ('a, 'b, 'cmp) t -> f:('b -> 'c) -> ('a, 'c, 'cmp) t
Sourceval mapi : ('a, 'b, 'cmp) t -> f:(key:'a -> data:'b -> 'c) -> ('a, 'c, 'cmp) t
Sourceval fold : ('a, 'b, _) t -> init:'c -> f:(key:'a -> data:'b -> 'c -> 'c) -> 'c
Sourceval fold_until : ('k, 'v, _) t -> init:'a -> f:(key:'k -> data:'v -> 'a -> ('a, 'final) Container.Continue_or_stop.t) -> finish:('a -> 'final) -> 'final
Sourceval fold_right : ('a, 'b, _) t -> init:'c -> f:(key:'a -> data:'b -> 'c -> 'c) -> 'c
Sourceval fold2 : ('a, 'b, 'cmp) t -> ('a, 'c, 'cmp) t -> init:'d -> f: (key:'a -> data:[ `Left of 'b | `Right of 'c | `Both of 'b * 'c ] -> 'd -> 'd) -> 'd
Sourceval filter_keys : ('a, 'b, 'cmp) t -> f:('a -> bool) -> ('a, 'b, 'cmp) t
Sourceval filter : ('a, 'b, 'cmp) t -> f:('b -> bool) -> ('a, 'b, 'cmp) t
Sourceval filteri : ('a, 'b, 'cmp) t -> f:(key:'a -> data:'b -> bool) -> ('a, 'b, 'cmp) t
Sourceval filter_map : ('a, 'b, 'cmp) t -> f:('b -> 'c option) -> ('a, 'c, 'cmp) t
Sourceval filter_mapi : ('a, 'b, 'cmp) t -> f:(key:'a -> data:'b -> 'c option) -> ('a, 'c, 'cmp) t
Sourceval partition_mapi : ('a, 'b, 'cmp) t -> f:(key:'a -> data:'b -> ('c, 'd) Either.t) -> ('a, 'c, 'cmp) t * ('a, 'd, 'cmp) t
Sourceval partition_map : ('a, 'b, 'cmp) t -> f:('b -> ('c, 'd) Either.t) -> ('a, 'c, 'cmp) t * ('a, 'd, 'cmp) t
Sourceval partitioni_tf : ('a, 'b, 'cmp) t -> f:(key:'a -> data:'b -> bool) -> ('a, 'b, 'cmp) t * ('a, 'b, 'cmp) t
Sourceval partition_tf : ('a, 'b, 'cmp) t -> f:('b -> bool) -> ('a, 'b, 'cmp) t * ('a, 'b, 'cmp) t
Sourceval combine_errors : ('a, 'b Or_error.t, 'cmp) t -> ('a, 'b, 'cmp) t Or_error.t
Sourceval compare_direct : ('b -> 'b -> int) -> ('a, 'b, 'cmp) t -> ('a, 'b, 'cmp) t -> int
Sourceval equal : ('b -> 'b -> bool) -> ('a, 'b, 'cmp) t -> ('a, 'b, 'cmp) t -> bool
Sourceval keys : ('a, _, _) t -> 'a list
Sourceval data : (_, 'b, _) t -> 'b list
Sourceval to_alist : ?key_order:[ `Increasing | `Decreasing ] -> ('a, 'b, _) t -> ('a * 'b) list
Sourceval merge : ('a, 'b, 'cmp) t -> ('a, 'c, 'cmp) t -> f:(key:'a -> [ `Left of 'b | `Right of 'c | `Both of 'b * 'c ] -> 'd option) -> ('a, 'd, 'cmp) t
Sourceval merge_skewed : ('k, 'v, 'cmp) t -> ('k, 'v, 'cmp) t -> combine:(key:'k -> 'v -> 'v -> 'v) -> ('k, 'v, 'cmp) t
Sourceval symmetric_diff : ('a, 'b, 'cmp) t -> ('a, 'b, 'cmp) t -> data_equal:('b -> 'b -> bool) -> ('a * [ `Left of 'b | `Right of 'b | `Unequal of 'b * 'b ]) Sequence.t
Sourceval fold_symmetric_diff : ('a, 'b, 'cmp) t -> ('a, 'b, 'cmp) t -> data_equal:('b -> 'b -> bool) -> init:'c -> f:('c -> ('a * [ `Left of 'b | `Right of 'b | `Unequal of 'b * 'b ]) -> 'c) -> 'c
Sourceval min_elt : ('a, 'b, 'cmp) t -> ('a * 'b) option
Sourceval min_elt_exn : ('a, 'b, 'cmp) t -> 'a * 'b
Sourceval max_elt : ('a, 'b, 'cmp) t -> ('a * 'b) option
Sourceval max_elt_exn : ('a, 'b, 'cmp) t -> 'a * 'b
Sourceval for_all : (_, 'b, _) t -> f:('b -> bool) -> bool
Sourceval for_alli : ('a, 'b, _) t -> f:(key:'a -> data:'b -> bool) -> bool
Sourceval exists : (_, 'b, _) t -> f:('b -> bool) -> bool
Sourceval existsi : ('a, 'b, _) t -> f:(key:'a -> data:'b -> bool) -> bool
Sourceval count : (_, 'b, _) t -> f:('b -> bool) -> int
Sourceval counti : ('a, 'b, _) t -> f:(key:'a -> data:'b -> bool) -> int
Sourceval split : ('k, 'v, 'cmp) t -> 'k -> ('k, 'v, 'cmp) t * ('k * 'v) option * ('k, 'v, 'cmp) t
Sourceval append : lower_part:('k, 'v, 'cmp) t -> upper_part:('k, 'v, 'cmp) t -> [ `Ok of ('k, 'v, 'cmp) t | `Overlapping_key_ranges ]
Sourceval subrange : ('k, 'v, 'cmp) t -> lower_bound:'k Maybe_bound.t -> upper_bound:'k Maybe_bound.t -> ('k, 'v, 'cmp) t
Sourceval fold_range_inclusive : ('a, 'b, _) t -> min:'a -> max:'a -> init:'c -> f:(key:'a -> data:'b -> 'c -> 'c) -> 'c
Sourceval range_to_alist : ('a, 'b, _) t -> min:'a -> max:'a -> ('a * 'b) list
Sourceval closest_key : ('a, 'b, _) t -> [ `Greater_or_equal_to | `Greater_than | `Less_or_equal_to | `Less_than ] -> 'a -> ('a * 'b) option
Sourceval nth : ('a, 'b, _) t -> int -> ('a * 'b) option
Sourceval nth_exn : ('a, 'b, _) t -> int -> 'a * 'b
Sourceval rank : ('a, _, _) t -> 'a -> int option
Sourceval to_tree : ('a, 'b, 'cmp) t -> ('a, 'b, 'cmp) Tree.t
Sourceval 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
Sourceval binary_search_segmented : ('k, 'v, _) t -> segment_of:(key:'k -> data:'v -> [ `Left | `Right ]) -> Binary_searchable.Which_target_by_segment.t -> ('k * 'v) option
Sourceval binary_search_subrange : ('k, 'v, 'cmp) t -> compare:(key:'k -> data:'v -> 'bound -> int) -> lower_bound:'bound Maybe_bound.t -> upper_bound:'bound Maybe_bound.t -> ('k, 'v, 'cmp) t
Sourceval empty : comparator:('a, 'cmp) Comparator.t -> ('a, _, 'cmp) t
Sourceval singleton : comparator:('a, 'cmp) Comparator.t -> 'a -> 'b -> ('a, 'b, 'cmp) t
Sourceval map_keys : comparator:('k2, 'cmp2) Comparator.t -> ('k1, 'v, 'cmp1) t -> f:('k1 -> 'k2) -> [ `Ok of ('k2, 'v, 'cmp2) t | `Duplicate_key of 'k2 ]
Sourceval map_keys_exn : comparator:('k2, 'cmp2) Comparator.t -> ('k1, 'v, 'cmp1) t -> f:('k1 -> 'k2) -> ('k2, 'v, 'cmp2) t
Sourceval of_alist : comparator:('a, 'cmp) Comparator.t -> ('a * 'b) list -> [ `Ok of ('a, 'b, 'cmp) t | `Duplicate_key of 'a ]
Sourceval of_alist_or_error : comparator:('a, 'cmp) Comparator.t -> ('a * 'b) list -> ('a, 'b, 'cmp) t Or_error.t
Sourceval of_alist_exn : comparator:('a, 'cmp) Comparator.t -> ('a * 'b) list -> ('a, 'b, 'cmp) t
Sourceval of_alist_multi : comparator:('a, 'cmp) Comparator.t -> ('a * 'b) list -> ('a, 'b list, 'cmp) t
Sourceval of_alist_fold : comparator:('a, 'cmp) Comparator.t -> ('a * 'b) list -> init:'c -> f:('c -> 'b -> 'c) -> ('a, 'c, 'cmp) t
Sourceval of_alist_reduce : comparator:('a, 'cmp) Comparator.t -> ('a * 'b) list -> f:('b -> 'b -> 'b) -> ('a, 'b, 'cmp) t
Sourceval of_sorted_array : comparator:('a, 'cmp) Comparator.t -> ('a * 'b) array -> ('a, 'b, 'cmp) t Or_error.t
Sourceval of_sorted_array_unchecked : comparator:('a, 'cmp) Comparator.t -> ('a * 'b) array -> ('a, 'b, 'cmp) t
Sourceval of_increasing_iterator_unchecked : comparator:('a, 'cmp) Comparator.t -> len:int -> f:(int -> 'a * 'b) -> ('a, 'b, 'cmp) t
Sourceval of_increasing_sequence : comparator:('a, 'cmp) Comparator.t -> ('a * 'b) Sequence.t -> ('a, 'b, 'cmp) t Or_error.t
Sourceval of_sequence : comparator:('a, 'cmp) Comparator.t -> ('a * 'b) Sequence.t -> [ `Ok of ('a, 'b, 'cmp) t | `Duplicate_key of 'a ]
Sourceval of_sequence_or_error : comparator:('a, 'cmp) Comparator.t -> ('a * 'b) Sequence.t -> ('a, 'b, 'cmp) t Or_error.t
Sourceval of_sequence_exn : comparator:('a, 'cmp) Comparator.t -> ('a * 'b) Sequence.t -> ('a, 'b, 'cmp) t
Sourceval of_sequence_multi : comparator:('a, 'cmp) Comparator.t -> ('a * 'b) Sequence.t -> ('a, 'b list, 'cmp) t
Sourceval of_sequence_fold : comparator:('a, 'cmp) Comparator.t -> ('a * 'b) Sequence.t -> init:'c -> f:('c -> 'b -> 'c) -> ('a, 'c, 'cmp) t
Sourceval of_sequence_reduce : comparator:('a, 'cmp) Comparator.t -> ('a * 'b) Sequence.t -> f:('b -> 'b -> 'b) -> ('a, 'b, 'cmp) t
Sourceval of_iteri : comparator:('a, 'cmp) Comparator.t -> iteri:(f:(key:'a -> data:'b -> unit) -> unit) -> [ `Ok of ('a, 'b, 'cmp) t | `Duplicate_key of 'a ]
Sourceval of_iteri_exn : comparator:('a, 'cmp) Comparator.t -> iteri:(f:(key:'a -> data:'b -> unit) -> unit) -> ('a, 'b, 'cmp) t
Sourceval of_tree : comparator:('a, 'cmp) Comparator.t -> ('a, 'b, 'cmp) Tree.t -> ('a, 'b, 'cmp) t
Sourceval comparator : ('a, _, 'cmp) t -> ('a, 'cmp) Comparator.t
Sourceval hash_fold_direct : 'k Hash.folder -> 'v Hash.folder -> ('k, 'v, 'cmp) t Hash.folder

To get around the value restriction, apply the functor and include it. You can see an example of this in the Poly submodule below.