Module Ocamlformat_stdlib.Map

type (!'key, !+'value, !'cmp) t
module Or_duplicate : sig ... end
module Continue_or_stop : sig ... end
module Finished_or_unfinished : sig ... end
module Merge_element : sig ... end
type (!'k, !'cmp) comparator = (module Base__.Comparator.S with type comparator_witness = 'cmp and type t = 'k)
  • deprecated [since 2021-12] use [Comparator.Module.t] instead
val invariants : ('a, 'b, 'c) t -> bool
val 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.t
val empty : (module Base__.Comparator.S with type comparator_witness = 'cmp and type t = 'a) -> ('a, 'b, 'cmp) t
val singleton : (module Base__.Comparator.S with type comparator_witness = 'cmp and type t = 'a) -> 'a -> 'b -> ('a, 'b, 'cmp) t
val 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) result
val of_alist_exn : (module Base__.Comparator.S with type comparator_witness = 'cmp and type t = 'a) -> ('a * 'b) list -> ('a, 'b, 'cmp) t
val of_alist_multi : (module Base__.Comparator.S with type comparator_witness = 'cmp and type t = 'a) -> ('a * 'b) list -> ('a, 'b list, 'cmp) t
val 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) t
val 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) t
val 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) t
val 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) result
val of_sorted_array_unchecked : (module Base__.Comparator.S with type comparator_witness = 'cmp and type t = 'a) -> ('a * 'b) array -> ('a, 'b, 'cmp) t
val 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) t
val 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) result
val 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) result
val of_sequence_exn : (module Base__.Comparator.S with type comparator_witness = 'cmp and type t = 'a) -> ('a * 'b) Base__.Sequence.t -> ('a, 'b, 'cmp) t
val 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) t
val 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) t
val 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) t
val 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) result
val 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) t
val 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) t
val is_empty : ('a, 'b, 'c) t -> bool
val length : ('a, 'b, 'c) t -> int
val set : ('k, 'v, 'cmp) t -> key:'k -> data:'v -> ('k, 'v, 'cmp) t
val add : ('k, 'v, 'cmp) t -> key:'k -> data:'v -> ('k, 'v, 'cmp) t Or_duplicate.t
val add_exn : ('k, 'v, 'cmp) t -> key:'k -> data:'v -> ('k, 'v, 'cmp) t
val add_multi : ('k, 'v list, 'cmp) t -> key:'k -> data:'v -> ('k, 'v list, 'cmp) t
val remove_multi : ('k, 'v list, 'cmp) t -> 'k -> ('k, 'v list, 'cmp) t
val find_multi : ('k, 'v list, 'cmp) t -> 'k -> 'v list
val change : ('k, 'v, 'cmp) t -> 'k -> f:('v option -> 'v option) -> ('k, 'v, 'cmp) t
val update : ('k, 'v, 'cmp) t -> 'k -> f:('v option -> 'v) -> ('k, 'v, 'cmp) t
val find : ('k, 'v, 'cmp) t -> 'k -> 'v option
val find_exn : ('k, 'v, 'cmp) t -> 'k -> 'v
val remove : ('k, 'v, 'cmp) t -> 'k -> ('k, 'v, 'cmp) t
val mem : ('k, 'a, 'cmp) t -> 'k -> bool
val iter_keys : ('k, 'a, 'b) t -> f:('k -> unit) -> unit
val iter : ('a, 'v, 'b) t -> f:('v -> unit) -> unit
val iteri : ('k, 'v, 'a) t -> f:(key:'k -> data:'v -> unit) -> unit
val iteri_until : ('k, 'v, 'a) t -> f:(key:'k -> data:'v -> Continue_or_stop.t) -> Finished_or_unfinished.t
val iter2 : ('k, 'v1, 'cmp) t -> ('k, 'v2, 'cmp) t -> f:(key:'k -> data:('v1, 'v2) Merge_element.t -> unit) -> unit
val map : ('k, 'v1, 'cmp) t -> f:('v1 -> 'v2) -> ('k, 'v2, 'cmp) t
val mapi : ('k, 'v1, 'cmp) t -> f:(key:'k -> data:'v1 -> 'v2) -> ('k, 'v2, 'cmp) t
val 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) t
val fold : ('k, 'v, 'a) t -> init:'acc -> f:(key:'k -> data:'v -> 'acc -> 'acc) -> 'acc
val 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) -> 'final
val fold_right : ('k, 'v, 'a) t -> init:'acc -> f:(key:'k -> data:'v -> 'acc -> 'acc) -> 'acc
val fold2 : ('k, 'v1, 'cmp) t -> ('k, 'v2, 'cmp) t -> init:'acc -> f:(key:'k -> data:('v1, 'v2) Merge_element.t -> 'acc -> 'acc) -> 'acc
val filter_keys : ('k, 'v, 'cmp) t -> f:('k -> bool) -> ('k, 'v, 'cmp) t
val filter : ('k, 'v, 'cmp) t -> f:('v -> bool) -> ('k, 'v, 'cmp) t
val filteri : ('k, 'v, 'cmp) t -> f:(key:'k -> data:'v -> bool) -> ('k, 'v, 'cmp) t
val filter_map : ('k, 'v1, 'cmp) t -> f:('v1 -> 'v2 option) -> ('k, 'v2, 'cmp) t
val filter_mapi : ('k, 'v1, 'cmp) t -> f:(key:'k -> data:'v1 -> 'v2 option) -> ('k, 'v2, 'cmp) t
val partition_mapi : ('k, 'v1, 'cmp) t -> f:(key:'k -> data:'v1 -> ('v2, 'v3) Base__.Either0.t) -> ('k, 'v2, 'cmp) t * ('k, 'v3, 'cmp) t
val partition_map : ('k, 'v1, 'cmp) t -> f:('v1 -> ('v2, 'v3) Base__.Either0.t) -> ('k, 'v2, 'cmp) t * ('k, 'v3, 'cmp) t
val partitioni_tf : ('k, 'v, 'cmp) t -> f:(key:'k -> data:'v -> bool) -> ('k, 'v, 'cmp) t * ('k, 'v, 'cmp) t
val partition_tf : ('k, 'v, 'cmp) t -> f:('v -> bool) -> ('k, 'v, 'cmp) t * ('k, 'v, 'cmp) t
val combine_errors : ('k, ('v, Base__.Info.t) result, 'cmp) t -> (('k, 'v, 'cmp) t, Base__.Info.t) result
val compare_direct : ('v -> 'v -> int) -> ('k, 'v, 'cmp) t -> ('k, 'v, 'cmp) t -> int
val equal : ('v -> 'v -> bool) -> ('k, 'v, 'cmp) t -> ('k, 'v, 'cmp) t -> bool
val keys : ('k, 'a, 'b) t -> 'k list
val data : ('a, 'v, 'b) t -> 'v list
val to_alist : ?key_order:[ `Decreasing | `Increasing ] -> ('k, 'v, 'a) t -> ('k * 'v) list
val merge : ('k, 'v1, 'cmp) t -> ('k, 'v2, 'cmp) t -> f:(key:'k -> ('v1, 'v2) Merge_element.t -> 'v3 option) -> ('k, 'v3, 'cmp) t
val merge_skewed : ('k, 'v, 'cmp) t -> ('k, 'v, 'cmp) t -> combine:(key:'k -> 'v -> 'v -> 'v) -> ('k, 'v, 'cmp) t
module Symmetric_diff_element : sig ... end
val symmetric_diff : ('k, 'v, 'cmp) t -> ('k, 'v, 'cmp) t -> data_equal:('v -> 'v -> bool) -> ('k, 'v) Symmetric_diff_element.t Base__.Sequence.t
val 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) -> 'acc
val min_elt : ('k, 'v, 'a) t -> ('k * 'v) option
val min_elt_exn : ('k, 'v, 'a) t -> 'k * 'v
val max_elt : ('k, 'v, 'a) t -> ('k * 'v) option
val max_elt_exn : ('k, 'v, 'a) t -> 'k * 'v
val 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) t
val for_all : ('k, 'v, 'a) t -> f:('v -> bool) -> bool
val for_alli : ('k, 'v, 'a) t -> f:(key:'k -> data:'v -> bool) -> bool
val exists : ('k, 'v, 'a) t -> f:('v -> bool) -> bool
val existsi : ('k, 'v, 'a) t -> f:(key:'k -> data:'v -> bool) -> bool
val count : ('k, 'v, 'a) t -> f:('v -> bool) -> int
val counti : ('k, 'v, 'a) t -> f:(key:'k -> data:'v -> bool) -> int
val split : ('k, 'v, 'cmp) t -> 'k -> ('k, 'v, 'cmp) t * ('k * 'v) option * ('k, 'v, 'cmp) t
val split_le_gt : ('k, 'v, 'cmp) t -> 'k -> ('k, 'v, 'cmp) t * ('k, 'v, 'cmp) t
val split_lt_ge : ('k, 'v, 'cmp) t -> 'k -> ('k, 'v, 'cmp) t * ('k, 'v, 'cmp) t
val 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) t
val fold_range_inclusive : ('k, 'v, 'cmp) t -> min:'k -> max:'k -> init:'acc -> f:(key:'k -> data:'v -> 'acc -> 'acc) -> 'acc
val range_to_alist : ('k, 'v, 'cmp) t -> min:'k -> max:'k -> ('k * 'v) list
val closest_key : ('k, 'v, 'cmp) t -> [ `Greater_or_equal_to | `Greater_than | `Less_or_equal_to | `Less_than ] -> 'k -> ('k * 'v) option
val nth : ('k, 'v, 'a) t -> int -> ('k * 'v) option
val nth_exn : ('k, 'v, 'a) t -> int -> 'k * 'v
val rank : ('k, 'v, 'cmp) t -> 'k -> int option
val 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.t
val binary_search_segmented : ('k, 'v, 'cmp) t -> segment_of:(key:'k -> data:'v -> [ `Left | `Right ]) -> [ `First_on_right | `Last_on_left ] -> ('k * 'v) option
val 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) t
module Make_applicative_traversals (A : sig ... end) : sig ... end
module M (K : sig ... end) : sig ... end
module type Sexp_of_m = sig ... end
module type M_of_sexp = sig ... end
module type M_sexp_grammar = sig ... end
module type Compare_m = sig ... end
module type Equal_m = sig ... end
module type Hash_fold_m = sig ... end
val sexp_of_m__t : (module Sexp_of_m with type t = 'k) -> ('v -> Sexplib0.Sexp.t) -> ('k, 'v, 'cmp) t -> Sexplib0.Sexp.t
val m__t_of_sexp : (module M_of_sexp with type comparator_witness = 'cmp and type t = 'k) -> (Sexplib0.Sexp.t -> 'v) -> Sexplib0.Sexp.t -> ('k, 'v, 'cmp) t
val m__t_sexp_grammar : (module M_sexp_grammar with type t = 'k) -> 'v Sexplib0.Sexp_grammar.t -> ('k, 'v, 'cmp) t Sexplib0.Sexp_grammar.t
val compare_m__t : (module Compare_m) -> ('v -> 'v -> int) -> ('k, 'v, 'cmp) t -> ('k, 'v, 'cmp) t -> int
val equal_m__t : (module Equal_m) -> ('v -> 'v -> bool) -> ('k, 'v, 'cmp) t -> ('k, 'v, 'cmp) t -> bool
val hash_fold_m__t : (module Hash_fold_m with type t = 'k) -> (Base_internalhash_types.state -> 'v -> Base_internalhash_types.state) -> Base_internalhash_types.state -> ('k, 'v, 'a) t -> Base_internalhash_types.state
module Using_comparator : sig ... end
module Poly : sig ... end
val 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) t
val to_tree : ('k, 'v, 'cmp) t -> ('k, 'v, 'cmp) Using_comparator.Tree.t
module With_comparator : sig ... end
module With_first_class_module : sig ... end
module Without_comparator : sig ... end
module type For_deriving = sig ... end
module type S_poly = sig ... end
module type Accessors_generic = sig ... end
module type Creators_and_accessors_generic = sig ... end
module type Creators_generic = sig ... end