type (!'key, !'value) t =
('key, 'value, Base__.Comparator.Poly.comparator_witness) Base__Map.ttype ('key, 'value) tree =
('key, 'value, Base__.Comparator.Poly.comparator_witness)
Base__Map.Using_comparator.Tree.ttype comparator_witness = Base__.Comparator.Poly.comparator_witnessval empty : ('k, 'cmp, ('k, 'a) t) Base__Map_intf.Without_comparator.tval singleton :
('k, 'cmp, 'k -> 'v -> ('k, 'v) t) Base__Map_intf.Without_comparator.tval map_keys :
('k2,
'cmp2,
('k1, 'v) t ->
f:('k1 -> 'k2) ->
[ `Duplicate_key of 'k2 | `Ok of ('k2, 'v) t ])
Base__Map_intf.Without_comparator.tval map_keys_exn :
('k2, 'cmp2, ('k1, 'v) t -> f:('k1 -> 'k2) -> ('k2, 'v) t)
Base__Map_intf.Without_comparator.tval transpose_keys :
('k1,
'cmp1,
('k2, 'cmp2, ('k1, ('k2, 'a) t) t -> ('k2, ('k1, 'a) t) t)
Base__Map_intf.Without_comparator.t)
Base__Map_intf.Without_comparator.tval of_sorted_array :
('k, 'cmp, ('k * 'v) array -> ('k, 'v) t Base__.Or_error.t)
Base__Map_intf.Without_comparator.tval of_sorted_array_unchecked :
('k, 'cmp, ('k * 'v) array -> ('k, 'v) t) Base__Map_intf.Without_comparator.tval of_increasing_iterator_unchecked :
('k, 'cmp, len:int -> f:(int -> 'k * 'v) -> ('k, 'v) t)
Base__Map_intf.Without_comparator.tval of_alist :
('k, 'cmp, ('k * 'v) list -> [ `Duplicate_key of 'k | `Ok of ('k, 'v) t ])
Base__Map_intf.Without_comparator.tval of_alist_or_error :
('k, 'cmp, ('k * 'v) list -> ('k, 'v) t Base__.Or_error.t)
Base__Map_intf.Without_comparator.tval of_alist_exn :
('k, 'cmp, ('k * 'v) list -> ('k, 'v) t) Base__Map_intf.Without_comparator.tval of_alist_multi :
('k, 'cmp, ('k * 'v) list -> ('k, 'v list) t)
Base__Map_intf.Without_comparator.tval of_alist_fold :
('k,
'cmp,
('k * 'v1) list ->
init:'v2 ->
f:('v2 -> 'v1 -> 'v2) ->
('k, 'v2) t)
Base__Map_intf.Without_comparator.tval of_alist_reduce :
('k, 'cmp, ('k * 'v) list -> f:('v -> 'v -> 'v) -> ('k, 'v) t)
Base__Map_intf.Without_comparator.tval of_increasing_sequence :
('k, 'cmp, ('k * 'v) Base__.Sequence.t -> ('k, 'v) t Base__.Or_error.t)
Base__Map_intf.Without_comparator.tval of_sequence :
('k,
'cmp,
('k * 'v) Base__.Sequence.t ->
[ `Duplicate_key of 'k | `Ok of ('k, 'v) t ])
Base__Map_intf.Without_comparator.tval of_sequence_or_error :
('k, 'cmp, ('k * 'v) Base__.Sequence.t -> ('k, 'v) t Base__.Or_error.t)
Base__Map_intf.Without_comparator.tval of_sequence_exn :
('k, 'cmp, ('k * 'v) Base__.Sequence.t -> ('k, 'v) t)
Base__Map_intf.Without_comparator.tval of_sequence_multi :
('k, 'cmp, ('k * 'v) Base__.Sequence.t -> ('k, 'v list) t)
Base__Map_intf.Without_comparator.tval of_sequence_fold :
('k,
'cmp,
('k * 'v1) Base__.Sequence.t ->
init:'v2 ->
f:('v2 -> 'v1 -> 'v2) ->
('k, 'v2) t)
Base__Map_intf.Without_comparator.tval of_sequence_reduce :
('k, 'cmp, ('k * 'v) Base__.Sequence.t -> f:('v -> 'v -> 'v) -> ('k, 'v) t)
Base__Map_intf.Without_comparator.tval of_list_with_key :
('k,
'cmp,
'v list ->
get_key:('v -> 'k) ->
[ `Duplicate_key of 'k | `Ok of ('k, 'v) t ])
Base__Map_intf.Without_comparator.tval of_list_with_key_or_error :
('k, 'cmp, 'v list -> get_key:('v -> 'k) -> ('k, 'v) t Base__.Or_error.t)
Base__Map_intf.Without_comparator.tval of_list_with_key_exn :
('k, 'cmp, 'v list -> get_key:('v -> 'k) -> ('k, 'v) t)
Base__Map_intf.Without_comparator.tval of_list_with_key_multi :
('k, 'cmp, 'v list -> get_key:('v -> 'k) -> ('k, 'v list) t)
Base__Map_intf.Without_comparator.tval of_list_with_key_fold :
('k,
'cmp,
'v list ->
get_key:('v -> 'k) ->
init:'acc ->
f:('acc -> 'v -> 'acc) ->
('k, 'acc) t)
Base__Map_intf.Without_comparator.tval of_list_with_key_reduce :
('k, 'cmp, 'v list -> get_key:('v -> 'k) -> f:('v -> 'v -> 'v) -> ('k, 'v) t)
Base__Map_intf.Without_comparator.tval of_iteri :
('k,
'cmp,
iteri:(f:(key:'k -> data:'v -> unit) -> unit) ->
[ `Duplicate_key of 'k | `Ok of ('k, 'v) t ])
Base__Map_intf.Without_comparator.tval of_iteri_exn :
('k, 'cmp, iteri:(f:(key:'k -> data:'v -> unit) -> unit) -> ('k, 'v) t)
Base__Map_intf.Without_comparator.tval of_tree :
('k, 'cmp, ('k, 'v) tree -> ('k, 'v) t) Base__Map_intf.Without_comparator.tval invariants :
('k, 'cmp, ('k, 'v) t -> bool) Base__Map_intf.Without_comparator.tval is_empty : ('a, 'b) t -> boolval length : ('a, 'b) t -> intval add :
('k,
'cmp,
('k, 'v) t ->
key:'k ->
data:'v ->
('k, 'v) t Base__Map_intf.Or_duplicate.t)
Base__Map_intf.Without_comparator.tval add_exn :
('k, 'cmp, ('k, 'v) t -> key:'k -> data:'v -> ('k, 'v) t)
Base__Map_intf.Without_comparator.tval set :
('k, 'cmp, ('k, 'v) t -> key:'k -> data:'v -> ('k, 'v) t)
Base__Map_intf.Without_comparator.tval add_multi :
('k, 'cmp, ('k, 'v list) t -> key:'k -> data:'v -> ('k, 'v list) t)
Base__Map_intf.Without_comparator.tval remove_multi :
('k, 'cmp, ('k, 'v list) t -> 'k -> ('k, 'v list) t)
Base__Map_intf.Without_comparator.tval find_multi :
('k, 'cmp, ('k, 'v list) t -> 'k -> 'v list)
Base__Map_intf.Without_comparator.tval change :
('k, 'cmp, ('k, 'v) t -> 'k -> f:('v option -> 'v option) -> ('k, 'v) t)
Base__Map_intf.Without_comparator.tval update :
('k, 'cmp, ('k, 'v) t -> 'k -> f:('v option -> 'v) -> ('k, 'v) t)
Base__Map_intf.Without_comparator.tval find :
('k, 'cmp, ('k, 'v) t -> 'k -> 'v option) Base__Map_intf.Without_comparator.tval find_exn :
('k, 'cmp, ('k, 'v) t -> 'k -> 'v) Base__Map_intf.Without_comparator.tval remove :
('k, 'cmp, ('k, 'v) t -> 'k -> ('k, 'v) t)
Base__Map_intf.Without_comparator.tval mem :
('k, 'cmp, ('k, 'a) t -> 'k -> bool) Base__Map_intf.Without_comparator.tval iter_keys : ('k, 'a) t -> f:('k -> unit) -> unitval iter : ('a, 'v) t -> f:('v -> unit) -> unitval iteri : ('k, 'v) t -> f:(key:'k -> data:'v -> unit) -> unitval iteri_until :
('k, 'v) t ->
f:(key:'k -> data:'v -> Base__Map_intf.Continue_or_stop.t) ->
Base__Map_intf.Finished_or_unfinished.tval iter2 :
('k,
'cmp,
('k, 'v1) t ->
('k, 'v2) t ->
f:(key:'k -> data:('v1, 'v2) Base__Map_intf.Merge_element.t -> unit) ->
unit)
Base__Map_intf.Without_comparator.tval map : ('k, 'v1) t -> f:('v1 -> 'v2) -> ('k, 'v2) tval mapi : ('k, 'v1) t -> f:(key:'k -> data:'v1 -> 'v2) -> ('k, 'v2) tval fold :
('k, 'v) t ->
init:'acc ->
f:(key:'k -> data:'v -> 'acc -> 'acc) ->
'accval fold_until :
('k, 'v) 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) t ->
init:'acc ->
f:(key:'k -> data:'v -> 'acc -> 'acc) ->
'accval fold2 :
('k,
'cmp,
('k, 'v1) t ->
('k, 'v2) t ->
init:'acc ->
f:
(key:'k ->
data:('v1, 'v2) Base__Map_intf.Merge_element.t ->
'acc ->
'acc) ->
'acc)
Base__Map_intf.Without_comparator.tval filter_keys : ('k, 'v) t -> f:('k -> bool) -> ('k, 'v) tval filter : ('k, 'v) t -> f:('v -> bool) -> ('k, 'v) tval filteri : ('k, 'v) t -> f:(key:'k -> data:'v -> bool) -> ('k, 'v) tval filter_map : ('k, 'v1) t -> f:('v1 -> 'v2 option) -> ('k, 'v2) tval filter_mapi :
('k, 'v1) t ->
f:(key:'k -> data:'v1 -> 'v2 option) ->
('k, 'v2) tval partition_mapi :
('k, 'v1) t ->
f:(key:'k -> data:'v1 -> ('v2, 'v3) Base__.Either.t) ->
('k, 'v2) t * ('k, 'v3) tval partition_map :
('k, 'v1) t ->
f:('v1 -> ('v2, 'v3) Base__.Either.t) ->
('k, 'v2) t * ('k, 'v3) tval partitioni_tf :
('k, 'v) t ->
f:(key:'k -> data:'v -> bool) ->
('k, 'v) t * ('k, 'v) tval partition_tf : ('k, 'v) t -> f:('v -> bool) -> ('k, 'v) t * ('k, 'v) tval combine_errors :
('k, 'cmp, ('k, 'v Base__.Or_error.t) t -> ('k, 'v) t Base__.Or_error.t)
Base__Map_intf.Without_comparator.tval unzip : ('k, 'v1 * 'v2) t -> ('k, 'v1) t * ('k, 'v2) tval compare_direct :
('k, 'cmp, ('v -> 'v -> int) -> ('k, 'v) t -> ('k, 'v) t -> int)
Base__Map_intf.Without_comparator.tval equal :
('k, 'cmp, ('v -> 'v -> bool) -> ('k, 'v) t -> ('k, 'v) t -> bool)
Base__Map_intf.Without_comparator.tval keys : ('k, 'a) t -> 'k listval data : ('a, 'v) t -> 'v listval to_alist : ?key_order:??? -> ('k, 'v) t -> ('k * 'v) listval merge :
('k,
'cmp,
('k, 'v1) t ->
('k, 'v2) t ->
f:(key:'k -> ('v1, 'v2) Base__Map_intf.Merge_element.t -> 'v3 option) ->
('k, 'v3) t)
Base__Map_intf.Without_comparator.tval merge_disjoint_exn :
('k, 'cmp, ('k, 'v) t -> ('k, 'v) t -> ('k, 'v) t)
Base__Map_intf.Without_comparator.tval merge_skewed :
('k,
'cmp,
('k, 'v) t ->
('k, 'v) t ->
combine:(key:'k -> 'v -> 'v -> 'v) ->
('k, 'v) t)
Base__Map_intf.Without_comparator.tval symmetric_diff :
('k,
'cmp,
('k, 'v) t ->
('k, 'v) t ->
data_equal:('v -> 'v -> bool) ->
('k, 'v) Base__Map_intf.Symmetric_diff_element.t Base__.Sequence.t)
Base__Map_intf.Without_comparator.tval fold_symmetric_diff :
('k,
'cmp,
('k, 'v) t ->
('k, 'v) t ->
data_equal:('v -> 'v -> bool) ->
init:'acc ->
f:('acc -> ('k, 'v) Base__Map_intf.Symmetric_diff_element.t -> 'acc) ->
'acc)
Base__Map_intf.Without_comparator.tval min_elt : ('k, 'v) t -> ('k * 'v) optionval min_elt_exn : ('k, 'v) t -> 'k * 'vval max_elt : ('k, 'v) t -> ('k * 'v) optionval max_elt_exn : ('k, 'v) t -> 'k * 'vval for_all : ('k, 'v) t -> f:('v -> bool) -> boolval for_alli : ('k, 'v) t -> f:(key:'k -> data:'v -> bool) -> boolval exists : ('k, 'v) t -> f:('v -> bool) -> boolval existsi : ('k, 'v) t -> f:(key:'k -> data:'v -> bool) -> boolval count : ('k, 'v) t -> f:('v -> bool) -> intval counti : ('k, 'v) t -> f:(key:'k -> data:'v -> bool) -> intval sum :
(module Base__.Container.Summable with type t = 'a) ->
('k, 'v) t ->
f:('v -> 'a) ->
'aval sumi :
(module Base__.Container.Summable with type t = 'a) ->
('k, 'v) t ->
f:(key:'k -> data:'v -> 'a) ->
'aval split :
('k, 'cmp, ('k, 'v) t -> 'k -> ('k, 'v) t * ('k * 'v) option * ('k, 'v) t)
Base__Map_intf.Without_comparator.tval split_le_gt :
('k, 'cmp, ('k, 'v) t -> 'k -> ('k, 'v) t * ('k, 'v) t)
Base__Map_intf.Without_comparator.tval split_lt_ge :
('k, 'cmp, ('k, 'v) t -> 'k -> ('k, 'v) t * ('k, 'v) t)
Base__Map_intf.Without_comparator.tval append :
('k,
'cmp,
lower_part:('k, 'v) t ->
upper_part:('k, 'v) t ->
[ `Ok of ('k, 'v) t | `Overlapping_key_ranges ])
Base__Map_intf.Without_comparator.tval subrange :
('k,
'cmp,
('k, 'v) t ->
lower_bound:'k Base__.Maybe_bound.t ->
upper_bound:'k Base__.Maybe_bound.t ->
('k, 'v) t)
Base__Map_intf.Without_comparator.tval fold_range_inclusive :
('k,
'cmp,
('k, 'v) t ->
min:'k ->
max:'k ->
init:'acc ->
f:(key:'k -> data:'v -> 'acc -> 'acc) ->
'acc)
Base__Map_intf.Without_comparator.tval range_to_alist :
('k, 'cmp, ('k, 'v) t -> min:'k -> max:'k -> ('k * 'v) list)
Base__Map_intf.Without_comparator.tval closest_key :
('k,
'cmp,
('k, 'v) t ->
[ `Greater_or_equal_to | `Greater_than | `Less_or_equal_to | `Less_than ] ->
'k ->
('k * 'v) option)
Base__Map_intf.Without_comparator.tval nth : ('k, 'v) t -> int -> ('k * 'v) optionval nth_exn : ('k, 'v) t -> int -> 'k * 'vval rank :
('k, 'cmp, ('k, 'a) t -> 'k -> int option)
Base__Map_intf.Without_comparator.tval to_tree : ('k, 'v) t -> ('k, 'v) treeval to_sequence :
('k,
'cmp,
?order:??? ->
?keys_greater_or_equal_to:??? ->
?keys_less_or_equal_to:??? ->
('k, 'v) t ->
('k * 'v) Base__.Sequence.t)
Base__Map_intf.Without_comparator.tval binary_search :
('k,
'cmp,
('k, 'v) t ->
compare:(key:'k -> data:'v -> 'key -> int) ->
Base__.Binary_searchable.Which_target_by_key.t ->
'key ->
('k * 'v) option)
Base__Map_intf.Without_comparator.tval binary_search_segmented :
('k,
'cmp,
('k, 'v) t ->
segment_of:(key:'k -> data:'v -> [ `Left | `Right ]) ->
Base__.Binary_searchable.Which_target_by_segment.t ->
('k * 'v) option)
Base__Map_intf.Without_comparator.tval binary_search_subrange :
('k,
'cmp,
('k, 'v) t ->
compare:(key:'k -> data:'v -> 'bound -> int) ->
lower_bound:'bound Base__.Maybe_bound.t ->
upper_bound:'bound Base__.Maybe_bound.t ->
('k, 'v) t)
Base__Map_intf.Without_comparator.tmodule Make_applicative_traversals : sig ... endval sexp_of_t :
('a -> {Sexp}16/shadowed/(f7b6f2ec1a4db5354bbd51a10c39707d).t) ->
('b -> {Sexp}16/shadowed/(f7b6f2ec1a4db5354bbd51a10c39707d).t) ->
('a, 'b, 'c) Base.Map.t ->
Sexplib0__.Sexp.t