type (!'key, !+'value, !'cmp) ttype (!'k, !'cmp) comparator =
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'k)val invariants : ('a, 'b, 'c) t -> boolval comparator_s :
('a, 'b, 'cmp) t ->
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'a)val comparator : ('a, 'b, 'cmp) t -> ('a, 'cmp) Base__.Comparator.tval empty :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'a) ->
('a, 'b, 'cmp) tval singleton :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'a) ->
'a ->
'b ->
('a, 'b, 'cmp) tval of_alist :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'a) ->
('a * 'b) list ->
[ `Duplicate_key of 'a | `Ok of ('a, 'b, 'cmp) t ]val of_alist_or_error :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'a) ->
('a * 'b) list ->
(('a, 'b, 'cmp) t, Base__.Info.t) resultval of_alist_exn :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'a) ->
('a * 'b) list ->
('a, 'b, 'cmp) tval of_alist_multi :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'a) ->
('a * 'b) list ->
('a, 'b list, 'cmp) tval of_alist_fold :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'a) ->
('a * 'b) list ->
init:'c ->
f:('c -> 'b -> 'c) ->
('a, 'c, 'cmp) tval of_alist_reduce :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'a) ->
('a * 'b) list ->
f:('b -> 'b -> 'b) ->
('a, 'b, 'cmp) tval of_iteri :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'a) ->
iteri:(f:(key:'a -> data:'b -> unit) -> unit) ->
[ `Duplicate_key of 'a | `Ok of ('a, 'b, 'cmp) t ]val of_iteri_exn :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'a) ->
iteri:(f:(key:'a -> data:'b -> unit) -> unit) ->
('a, 'b, 'cmp) tval of_sorted_array :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'a) ->
('a * 'b) array ->
(('a, 'b, 'cmp) t, Base__.Info.t) resultval of_sorted_array_unchecked :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'a) ->
('a * 'b) array ->
('a, 'b, 'cmp) tval of_increasing_iterator_unchecked :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'a) ->
len:int ->
f:(int -> 'a * 'b) ->
('a, 'b, 'cmp) tval of_increasing_sequence :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'k) ->
('k * 'v) Base__.Sequence.t ->
(('k, 'v, 'cmp) t, Base__.Info.t) resultval of_sequence :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'k) ->
('k * 'v) Base__.Sequence.t ->
[ `Duplicate_key of 'k | `Ok of ('k, 'v, 'cmp) t ]val of_sequence_or_error :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'a) ->
('a * 'b) Base__.Sequence.t ->
(('a, 'b, 'cmp) t, Base__.Info.t) resultval of_sequence_exn :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'a) ->
('a * 'b) Base__.Sequence.t ->
('a, 'b, 'cmp) tval of_sequence_multi :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'a) ->
('a * 'b) Base__.Sequence.t ->
('a, 'b list, 'cmp) tval of_sequence_fold :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'a) ->
('a * 'b) Base__.Sequence.t ->
init:'c ->
f:('c -> 'b -> 'c) ->
('a, 'c, 'cmp) tval of_sequence_reduce :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'a) ->
('a * 'b) Base__.Sequence.t ->
f:('b -> 'b -> 'b) ->
('a, 'b, 'cmp) tval of_list_with_key :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'k) ->
'v list ->
get_key:('v -> 'k) ->
[ `Duplicate_key of 'k | `Ok of ('k, 'v, 'cmp) t ]val of_list_with_key_or_error :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'k) ->
'v list ->
get_key:('v -> 'k) ->
(('k, 'v, 'cmp) t, Base__.Info.t) resultval of_list_with_key_exn :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'k) ->
'v list ->
get_key:('v -> 'k) ->
('k, 'v, 'cmp) tval of_list_with_key_multi :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'k) ->
'v list ->
get_key:('v -> 'k) ->
('k, 'v list, 'cmp) tval is_empty : ('a, 'b, 'c) t -> boolval length : ('a, 'b, 'c) t -> intval set : ('k, 'v, 'cmp) t -> key:'k -> data:'v -> ('k, 'v, 'cmp) tval add :
('k, 'v, 'cmp) t ->
key:'k ->
data:'v ->
('k, 'v, 'cmp) t Or_duplicate.tval add_exn : ('k, 'v, 'cmp) t -> key:'k -> data:'v -> ('k, 'v, 'cmp) tval add_multi :
('k, 'v list, 'cmp) t ->
key:'k ->
data:'v ->
('k, 'v list, 'cmp) tval remove_multi : ('k, 'v list, 'cmp) t -> 'k -> ('k, 'v list, 'cmp) tval find_multi : ('k, 'v list, 'cmp) t -> 'k -> 'v listval change :
('k, 'v, 'cmp) t ->
'k ->
f:('v option -> 'v option) ->
('k, 'v, 'cmp) tval update : ('k, 'v, 'cmp) t -> 'k -> f:('v option -> 'v) -> ('k, 'v, 'cmp) tval find : ('k, 'v, 'cmp) t -> 'k -> 'v optionval find_exn : ('k, 'v, 'cmp) t -> 'k -> 'vval remove : ('k, 'v, 'cmp) t -> 'k -> ('k, 'v, 'cmp) tval mem : ('k, 'a, 'cmp) t -> 'k -> boolval iter_keys : ('k, 'a, 'b) t -> f:('k -> unit) -> unitval iter : ('a, 'v, 'b) t -> f:('v -> unit) -> unitval iteri : ('k, 'v, 'a) t -> f:(key:'k -> data:'v -> unit) -> unitval iter2 :
('k, 'v1, 'cmp) t ->
('k, 'v2, 'cmp) t ->
f:(key:'k -> data:('v1, 'v2) Merge_element.t -> unit) ->
unitval map : ('k, 'v1, 'cmp) t -> f:('v1 -> 'v2) -> ('k, 'v2, 'cmp) tval mapi :
('k, 'v1, 'cmp) t ->
f:(key:'k -> data:'v1 -> 'v2) ->
('k, 'v2, 'cmp) tval map_keys :
(module Base__.Comparator.S
with type comparator_witness = 'cmp2
and type t = 'k2) ->
('k1, 'v, 'cmp1) t ->
f:('k1 -> 'k2) ->
[ `Duplicate_key of 'k2 | `Ok of ('k2, 'v, 'cmp2) t ]val map_keys_exn :
(module Base__.Comparator.S
with type comparator_witness = 'cmp2
and type t = 'k2) ->
('k1, 'v, 'cmp1) t ->
f:('k1 -> 'k2) ->
('k2, 'v, 'cmp2) tval fold :
('k, 'v, 'a) t ->
init:'acc ->
f:(key:'k -> data:'v -> 'acc -> 'acc) ->
'accval fold_until :
('k, 'v, 'a) t ->
init:'acc ->
f:
(key:'k ->
data:'v ->
'acc ->
('acc, 'final) Base__.Container.Continue_or_stop.t) ->
finish:('acc -> 'final) ->
'finalval fold_right :
('k, 'v, 'a) t ->
init:'acc ->
f:(key:'k -> data:'v -> 'acc -> 'acc) ->
'accval fold2 :
('k, 'v1, 'cmp) t ->
('k, 'v2, 'cmp) t ->
init:'acc ->
f:(key:'k -> data:('v1, 'v2) Merge_element.t -> 'acc -> 'acc) ->
'accval filter_keys : ('k, 'v, 'cmp) t -> f:('k -> bool) -> ('k, 'v, 'cmp) tval filter : ('k, 'v, 'cmp) t -> f:('v -> bool) -> ('k, 'v, 'cmp) tval filteri :
('k, 'v, 'cmp) t ->
f:(key:'k -> data:'v -> bool) ->
('k, 'v, 'cmp) tval filter_map :
('k, 'v1, 'cmp) t ->
f:('v1 -> 'v2 option) ->
('k, 'v2, 'cmp) tval filter_mapi :
('k, 'v1, 'cmp) t ->
f:(key:'k -> data:'v1 -> 'v2 option) ->
('k, 'v2, 'cmp) tval partition_mapi :
('k, 'v1, 'cmp) t ->
f:(key:'k -> data:'v1 -> ('v2, 'v3) Base__.Either0.t) ->
('k, 'v2, 'cmp) t * ('k, 'v3, 'cmp) tval partition_map :
('k, 'v1, 'cmp) t ->
f:('v1 -> ('v2, 'v3) Base__.Either0.t) ->
('k, 'v2, 'cmp) t * ('k, 'v3, 'cmp) tval partitioni_tf :
('k, 'v, 'cmp) t ->
f:(key:'k -> data:'v -> bool) ->
('k, 'v, 'cmp) t * ('k, 'v, 'cmp) tval partition_tf :
('k, 'v, 'cmp) t ->
f:('v -> bool) ->
('k, 'v, 'cmp) t * ('k, 'v, 'cmp) tval combine_errors :
('k, ('v, Base__.Info.t) result, 'cmp) t ->
(('k, 'v, 'cmp) t, Base__.Info.t) resultval compare_direct :
('v -> 'v -> int) ->
('k, 'v, 'cmp) t ->
('k, 'v, 'cmp) t ->
intval equal : ('v -> 'v -> bool) -> ('k, 'v, 'cmp) t -> ('k, 'v, 'cmp) t -> boolval keys : ('k, 'a, 'b) t -> 'k listval data : ('a, 'v, 'b) t -> 'v listval to_alist :
?key_order:[ `Decreasing | `Increasing ] ->
('k, 'v, 'a) t ->
('k * 'v) listval merge :
('k, 'v1, 'cmp) t ->
('k, 'v2, 'cmp) t ->
f:(key:'k -> ('v1, 'v2) Merge_element.t -> 'v3 option) ->
('k, 'v3, 'cmp) tval merge_skewed :
('k, 'v, 'cmp) t ->
('k, 'v, 'cmp) t ->
combine:(key:'k -> 'v -> 'v -> 'v) ->
('k, 'v, 'cmp) tval symmetric_diff :
('k, 'v, 'cmp) t ->
('k, 'v, 'cmp) t ->
data_equal:('v -> 'v -> bool) ->
('k, 'v) Symmetric_diff_element.t Base__.Sequence.tval fold_symmetric_diff :
('k, 'v, 'cmp) t ->
('k, 'v, 'cmp) t ->
data_equal:('v -> 'v -> bool) ->
init:'acc ->
f:('acc -> ('k, 'v) Symmetric_diff_element.t -> 'acc) ->
'accval min_elt : ('k, 'v, 'a) t -> ('k * 'v) optionval min_elt_exn : ('k, 'v, 'a) t -> 'k * 'vval max_elt : ('k, 'v, 'a) t -> ('k * 'v) optionval max_elt_exn : ('k, 'v, 'a) t -> 'k * 'vval transpose_keys :
(module Base__.Comparator.S
with type comparator_witness = 'cmp2
and type t = 'k2) ->
('k1, ('k2, 'v, 'cmp2) t, 'cmp1) t ->
('k2, ('k1, 'v, 'cmp1) t, 'cmp2) tval for_all : ('k, 'v, 'a) t -> f:('v -> bool) -> boolval for_alli : ('k, 'v, 'a) t -> f:(key:'k -> data:'v -> bool) -> boolval exists : ('k, 'v, 'a) t -> f:('v -> bool) -> boolval existsi : ('k, 'v, 'a) t -> f:(key:'k -> data:'v -> bool) -> boolval count : ('k, 'v, 'a) t -> f:('v -> bool) -> intval counti : ('k, 'v, 'a) t -> f:(key:'k -> data:'v -> bool) -> intval split :
('k, 'v, 'cmp) t ->
'k ->
('k, 'v, 'cmp) t * ('k * 'v) option * ('k, 'v, 'cmp) tval split_le_gt : ('k, 'v, 'cmp) t -> 'k -> ('k, 'v, 'cmp) t * ('k, 'v, 'cmp) tval split_lt_ge : ('k, 'v, 'cmp) t -> 'k -> ('k, 'v, 'cmp) t * ('k, 'v, 'cmp) tval append :
lower_part:('k, 'v, 'cmp) t ->
upper_part:('k, 'v, 'cmp) t ->
[ `Ok of ('k, 'v, 'cmp) t | `Overlapping_key_ranges ]val subrange :
('k, 'v, 'cmp) t ->
lower_bound:'k Base__.Maybe_bound.t ->
upper_bound:'k Base__.Maybe_bound.t ->
('k, 'v, 'cmp) tval fold_range_inclusive :
('k, 'v, 'cmp) t ->
min:'k ->
max:'k ->
init:'acc ->
f:(key:'k -> data:'v -> 'acc -> 'acc) ->
'accval range_to_alist : ('k, 'v, 'cmp) t -> min:'k -> max:'k -> ('k * 'v) listval closest_key :
('k, 'v, 'cmp) t ->
[ `Greater_or_equal_to | `Greater_than | `Less_or_equal_to | `Less_than ] ->
'k ->
('k * 'v) optionval nth : ('k, 'v, 'a) t -> int -> ('k * 'v) optionval nth_exn : ('k, 'v, 'a) t -> int -> 'k * 'vval rank : ('k, 'v, 'cmp) t -> 'k -> int optionval to_sequence :
?order:[ `Decreasing_key | `Increasing_key ] ->
?keys_greater_or_equal_to:'k ->
?keys_less_or_equal_to:'k ->
('k, 'v, 'cmp) t ->
('k * 'v) Base__.Sequence.tval binary_search :
('k, 'v, 'cmp) t ->
compare:(key:'k -> data:'v -> 'key -> int) ->
[ `First_equal_to
| `First_greater_than_or_equal_to
| `First_strictly_greater_than
| `Last_equal_to
| `Last_less_than_or_equal_to
| `Last_strictly_less_than ] ->
'key ->
('k * 'v) optionval binary_search_segmented :
('k, 'v, 'cmp) t ->
segment_of:(key:'k -> data:'v -> [ `Left | `Right ]) ->
[ `First_on_right | `Last_on_left ] ->
('k * 'v) optionval binary_search_subrange :
('k, 'v, 'cmp) t ->
compare:(key:'k -> data:'v -> 'bound -> int) ->
lower_bound:'bound Base__.Maybe_bound.t ->
upper_bound:'bound Base__.Maybe_bound.t ->
('k, 'v, 'cmp) tmodule M (K : sig ... end) : sig ... endval compare_m__t :
(module Compare_m) ->
('v -> 'v -> int) ->
('k, 'v, 'cmp) t ->
('k, 'v, 'cmp) t ->
intval equal_m__t :
(module Equal_m) ->
('v -> 'v -> bool) ->
('k, 'v, 'cmp) t ->
('k, 'v, 'cmp) t ->
boolmodule Poly : sig ... endval of_tree :
(module Base__.Comparator.S
with type comparator_witness = 'cmp
and type t = 'k) ->
('k, 'v, 'cmp) Using_comparator.Tree.t ->
('k, 'v, 'cmp) tmodule type S_poly = sig ... end