Module Control.Map

module Key : sig ... end with type Key.t = t and type Key.comparator_witness = comparator_witness
module Tree : sig ... end
include Map_intf.S_plain with module Key := Key and module Tree := Tree
type +'a t = (Key.t, 'a, Key.comparator_witness) Map_intf.Map.t
val compare : ('a -> 'a -> Base.Int.t) -> 'a t -> 'a t -> Base.Int.t
val sexp_of_t : ('a -> Ppx_sexp_conv_lib.Sexp.t) -> 'a t -> Ppx_sexp_conv_lib.Sexp.t
include Map_intf.Creators_and_accessors1 with type 'a t := 'a t with type 'a tree := 'a Tree.t with type key := Key.t with type comparator_witness := Key.comparator_witness
include Map_intf.Creators1 with type comparator_witness := Key.comparator_witness and type key := Key.t and type 'a tree := 'a Tree.t and type 'a t := 'a t
include Map_intf.Map.Creators1 with type 'a t := 'a t and type 'a tree := 'a Tree.t and type key := Key.t and type comparator_witness := Key.comparator_witness
val empty : 'a t
val singleton : Key.t -> 'a -> 'a t
val of_alist : (Key.t * 'a) list -> [ `Ok of 'a t | `Duplicate_key of Key.t ]
val of_alist_or_error : (Key.t * 'a) list -> 'a t Base.Or_error.t
val of_alist_exn : (Key.t * 'a) list -> 'a t
val of_alist_multi : (Key.t * 'a) list -> 'a t
val of_alist_fold : (Key.t * 'a) list -> init:'b -> f:('b -> 'a -> 'b) -> 'a t
val of_alist_reduce : (Key.t * 'a) list -> f:('a -> 'a -> 'a) -> 'a t
val of_sorted_array : (Key.t * 'a) array -> 'a t Base.Or_error.t
val of_sorted_array_unchecked : (Key.t * 'a) array -> 'a t
val of_increasing_iterator_unchecked : len:int -> f:(int -> Key.t * 'a) -> 'a t
val of_increasing_sequence : (Key.t * 'a) Base.Sequence.t -> 'a t Base.Or_error.t
val of_sequence : (Key.t * 'a) Base.Sequence.t -> [ `Ok of 'a t | `Duplicate_key of Key.t ]
val of_sequence_or_error : (Key.t * 'a) Base.Sequence.t -> 'a t Base.Or_error.t
val of_sequence_exn : (Key.t * 'a) Base.Sequence.t -> 'a t
val of_sequence_multi : (Key.t * 'a) Base.Sequence.t -> 'a t
val of_sequence_fold : (Key.t * 'a) Base.Sequence.t -> init:'b -> f:('b -> 'a -> 'b) -> 'a t
val of_sequence_reduce : (Key.t * 'a) Base.Sequence.t -> f:('a -> 'a -> 'a) -> 'a t
val of_iteri : iteri:(f:(key:Key.t -> data:'v -> unit) -> unit) -> [ `Ok of 'a t | `Duplicate_key of Key.t ]
val of_tree : 'a Tree.t -> 'a t
val of_hashtbl_exn : (Key.t, 'a) Hashtbl.t -> 'a t
val of_key_set : (Key.t, Key.comparator_witness) Base.Set.t -> f:(Key.t -> 'v) -> 'a t
val quickcheck_generator : Key.t Quickcheck.Generator.t -> 'a Quickcheck.Generator.t -> 'a t Quickcheck.Generator.t
include Map_intf.Accessors1 with type 'a t := 'a t with type 'a tree := 'a Tree.t with type key := Key.t with type comparator_witness := Key.comparator_witness
include Map_intf.Map.Accessors1 with type comparator_witness := Key.comparator_witness and type key := Key.t and type 'a tree := 'a Tree.t and type 'a t := 'a t
val invariants : 'a t -> bool
val is_empty : 'a t -> bool
val length : 'a t -> int
val add : 'a t -> key:Key.t -> data:'a -> [ `Ok of 'a t | `Duplicate ]
val add_exn : 'a t -> key:Key.t -> data:'a -> 'a t
val set : 'a t -> key:Key.t -> data:'a -> 'a t
val add_multi : 'a t -> key:Key.t -> data:'a -> 'a t
val remove_multi : 'a t -> Key.t -> 'a t
val find_multi : 'a t -> Key.t -> 'a list
val change : 'a t -> Key.t -> f:('a option -> 'a option) -> 'a t
val update : 'a t -> Key.t -> f:('a option -> 'a) -> 'a t
val find : 'a t -> Key.t -> 'a option
val find_exn : 'a t -> Key.t -> 'a
val remove : 'a t -> Key.t -> 'a t
val mem : 'a t -> Key.t -> bool
val iter_keys : 'a t -> f:(Key.t -> unit) -> unit
val iter : 'a t -> f:('a -> unit) -> unit
val iteri : 'a t -> f:(key:Key.t -> data:'a -> unit) -> unit
val iteri_until : 'a t -> f:(key:Key.t -> data:'a -> Base__Map_intf.Continue_or_stop.t) -> Base__Map_intf.Finished_or_unfinished.t
val iter2 : 'a t -> 'a t -> f:(key:Key.t -> data:[ `Left of 'a | `Right of 'b | `Both of 'a * 'b ] -> unit) -> unit
val map : 'a t -> f:('a -> 'b) -> 'a t
val mapi : 'a t -> f:(key:Key.t -> data:'a -> 'b) -> 'a t
val fold : 'a t -> init:'b -> f:(key:Key.t -> data:'a -> 'b -> 'b) -> 'b
val fold_right : 'a t -> init:'b -> f:(key:Key.t -> data:'a -> 'b -> 'b) -> 'b
val fold2 : 'a t -> 'a t -> init:'c -> f:(key:Key.t -> data:[ `Left of 'a | `Right of 'b | `Both of 'a * 'b ] -> 'c -> 'c) -> 'c
val filter_keys : 'a t -> f:(Key.t -> bool) -> 'a t
val filter : 'a t -> f:('a -> bool) -> 'a t
val filteri : 'a t -> f:(key:Key.t -> data:'a -> bool) -> 'a t
val filter_map : 'a t -> f:('a -> 'b option) -> 'a t
val filter_mapi : 'a t -> f:(key:Key.t -> data:'a -> 'b option) -> 'a t
val partition_mapi : 'a t -> f:(key:Key.t -> data:'a -> ('b, 'c) Base.Either.t) -> 'a t * 'a t
val partition_map : 'a t -> f:('a -> ('b, 'c) Base.Either.t) -> 'a t * 'a t
val partitioni_tf : 'a t -> f:(key:Key.t -> data:'a -> bool) -> 'a t * 'a t
val partition_tf : 'a t -> f:('a -> bool) -> 'a t * 'a t
val combine_errors : 'a t -> 'a t Base.Or_error.t
val compare_direct : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val keys : 'a t -> Key.t list
val data : 'a t -> 'a list
val to_alist : ?⁠key_order:[ `Increasing | `Decreasing ] -> 'a t -> (Key.t * 'a) list
val validate : name:(Key.t -> string) -> 'a Base.Validate.check -> 'a t Base.Validate.check
val validatei : name:(Key.t -> string) -> (Key.t * 'a) Base.Validate.check -> 'a t Base.Validate.check
val merge : 'a t -> 'a t -> f:(key:Key.t -> [ `Left of 'a | `Right of 'b | `Both of 'a * 'b ] -> 'c option) -> 'a t
val symmetric_diff : 'a t -> 'a t -> data_equal:('a -> 'a -> bool) -> (Key.t * [ `Left of 'a | `Right of 'a | `Unequal of 'a * 'a ]) Base.Sequence.t
val fold_symmetric_diff : 'a t -> 'a t -> data_equal:('a -> 'a -> bool) -> init:'c -> f:('c -> (Key.t * [ `Left of 'a | `Right of 'a | `Unequal of 'a * 'a ]) -> 'c) -> 'c
val min_elt : 'a t -> (Key.t * 'a) option
val min_elt_exn : 'a t -> Key.t * 'a
val max_elt : 'a t -> (Key.t * 'a) option
val max_elt_exn : 'a t -> Key.t * 'a
val for_all : 'a t -> f:('a -> bool) -> bool
val for_alli : 'a t -> f:(key:Key.t -> data:'a -> bool) -> bool
val exists : 'a t -> f:('a -> bool) -> bool
val existsi : 'a t -> f:(key:Key.t -> data:'a -> bool) -> bool
val count : 'a t -> f:('a -> bool) -> int
val counti : 'a t -> f:(key:Key.t -> data:'a -> bool) -> int
val split : 'a t -> Key.t -> 'a t * (Key.t * 'a) option * 'a t
val append : lower_part:'a t -> upper_part:'a t -> [ `Ok of 'a t | `Overlapping_key_ranges ]
val subrange : 'a t -> lower_bound:Key.t Base.Maybe_bound.t -> upper_bound:Key.t Base.Maybe_bound.t -> 'a t
val fold_range_inclusive : 'a t -> min:Key.t -> max:Key.t -> init:'b -> f:(key:Key.t -> data:'a -> 'b -> 'b) -> 'b
val range_to_alist : 'a t -> min:Key.t -> max:Key.t -> (Key.t * 'a) list
val closest_key : 'a t -> [ `Greater_or_equal_to | `Greater_than | `Less_or_equal_to | `Less_than ] -> Key.t -> (Key.t * 'a) option
val nth : 'a t -> int -> (Key.t * 'a) option
val nth_exn : 'a t -> int -> Key.t * 'a
val rank : 'a t -> Key.t -> int option
val to_tree : 'a t -> 'a Tree.t
val to_sequence : ?⁠order:[ `Increasing_key | `Decreasing_key ] -> ?⁠keys_greater_or_equal_to:Key.t -> ?⁠keys_less_or_equal_to:Key.t -> 'a t -> (Key.t * 'a) Base.Sequence.t
val binary_search_segmented : 'a t -> segment_of:(key:Key.t -> data:'a -> [ `Left | `Right ]) -> [ `Last_on_left | `First_on_right ] -> (Key.t * 'a) option
val key_set : 'a t -> (Key.t, Key.comparator_witness) Base.Set.t
val quickcheck_observer : Key.t Quickcheck.Observer.t -> 'v Quickcheck.Observer.t -> 'a t Quickcheck.Observer.t
val quickcheck_shrinker : Key.t Quickcheck.Shrinker.t -> 'v Quickcheck.Shrinker.t -> 'a t Quickcheck.Shrinker.t
module Provide_of_sexp : functor (Key : sig ... end with type Provide_of_sexp.t := Key.t) -> sig ... end with type 'a Provide_of_sexp.t := 'a t
module Provide_bin_io : functor (Key : sig ... end with type Provide_bin_io.t := Key.t) -> Map_intf.Binable.S1 with type 'a t := 'a t
module Provide_hash : functor (Key : Base.Hasher.S with type t := Key.t) -> sig ... end with type 'a Provide_hash.t := 'a t
include Sexpable.S1 with type 'a t := 'a t
val t_of_sexp : (Sexplib0.Sexp.t -> 'a) -> Sexplib0.Sexp.t -> 'a t
val sexp_of_t : ('a -> Sexplib0.Sexp.t) -> 'a t -> Sexplib0.Sexp.t