Module type Map_intf.Creators_and_accessors_generic

include Creators_generic
include Map.Creators_generic
type ('k, 'v, 'cmp) t
type ('k, 'v, 'cmp) tree
type 'k key
type ('a, 'cmp, 'z) options
type 'cmp cmp
val empty : ('k'cmp('k'a'cmp) t) options
val singleton : ('k'cmp'k key -> 'v -> ('k'v'cmp) t) options
val of_sorted_array : ('k'cmp('k key * 'v) array -> ('k'v'cmp) t Base.Or_error.t) options
val of_sorted_array_unchecked : ('k'cmp('k key * 'v) array -> ('k'v'cmp) t) options
val of_increasing_iterator_unchecked : ('k'cmplen:int -> f:(int -> 'k key * 'v) -> ('k'v'cmp) t) options
val of_alist : ('k'cmp('k key * 'v) list -> [ `Duplicate_key of 'k key | `Ok of ('k'v'cmp) t ]) options
val of_alist_or_error : ('k'cmp('k key * 'v) list -> ('k'v'cmp) t Base.Or_error.t) options
val of_alist_exn : ('k'cmp('k key * 'v) list -> ('k'v'cmp) t) options
val of_alist_multi : ('k'cmp('k key * 'v) list -> ('k'v list'cmp) t) options
val of_alist_fold : ('k'cmp('k key * 'v1) list -> init:'v2 -> f:('v2 -> 'v1 -> 'v2) -> ('k'v2'cmp) t) options
val of_alist_reduce : ('k'cmp('k key * 'v) list -> f:('v -> 'v -> 'v) -> ('k'v'cmp) t) options
val of_increasing_sequence : ('k'cmp('k key * 'v) Base.Sequence.t -> ('k'v'cmp) t Base.Or_error.t) options
val of_sequence : ('k'cmp('k key * 'v) Base.Sequence.t -> [ `Duplicate_key of 'k key | `Ok of ('k'v'cmp) t ]) options
val of_sequence_or_error : ('k'cmp('k key * 'v) Base.Sequence.t -> ('k'v'cmp) t Base.Or_error.t) options
val of_sequence_exn : ('k'cmp('k key * 'v) Base.Sequence.t -> ('k'v'cmp) t) options
val of_sequence_multi : ('k'cmp('k key * 'v) Base.Sequence.t -> ('k'v list'cmp) t) options
val of_sequence_fold : ('k'cmp('k key * 'v1) Base.Sequence.t -> init:'v2 -> f:('v2 -> 'v1 -> 'v2) -> ('k'v2'cmp) t) options
val of_sequence_reduce : ('k'cmp('k key * 'v) Base.Sequence.t -> f:('v -> 'v -> 'v) -> ('k'v'cmp) t) options
val of_iteri : ('k'cmpiteri:(f:(key:'k key -> data:'v -> unit) -> unit) -> [ `Duplicate_key of 'k key | `Ok of ('k'v'cmp) t ]) options
val of_tree : ('k'cmp('k key'v'cmp) tree -> ('k'v'cmp) t) options
val of_hashtbl_exn : ('k'cmp('k key'v) Core_kernel.Hashtbl.t -> ('k'v'cmp) t) options
val of_key_set : ('k key'cmp cmp) Base.Set.t -> f:('k key -> 'v) -> ('k'v'cmp) t

Never requires a comparator because it can get one from the input Set.t.

val quickcheck_generator : ('k'cmp'k key Core_kernel.Quickcheck.Generator.t -> 'v Core_kernel.Quickcheck.Generator.t -> ('k'v'cmp) t Core_kernel.Quickcheck.Generator.t) options
include Accessors_generic with type ('a, 'b, 'c) t := ('a'b'c) t with type ('a, 'b, 'c) tree := ('a'b'c) tree with type 'a key := 'a key with type 'a cmp := 'a cmp with type ('a, 'b, 'c) options := ('a'b'c) options
include Map.Accessors_generic
type ('a, 'b, 'cmp) t
type ('a, 'b, 'cmp) tree
type 'a key
type 'cmp cmp
type ('a, 'cmp, 'z) options
val invariants : ('k'cmp('k'v'cmp) t -> bool) options
val is_empty : ('a'b'c) t -> bool
val length : ('a'b'c) t -> int
val add : ('k'cmp('k'v'cmp) t -> key:'k key -> data:'v -> ('k'v'cmp) t Base__.Map_intf.Or_duplicate.t) options
val add_exn : ('k'cmp('k'v'cmp) t -> key:'k key -> data:'v -> ('k'v'cmp) t) options
val set : ('k'cmp('k'v'cmp) t -> key:'k key -> data:'v -> ('k'v'cmp) t) options
val add_multi : ('k'cmp('k'v list'cmp) t -> key:'k key -> data:'v -> ('k'v list'cmp) t) options
val remove_multi : ('k'cmp('k'v list'cmp) t -> 'k key -> ('k'v list'cmp) t) options
val find_multi : ('k'cmp('k'v list'cmp) t -> 'k key -> 'v list) options
val change : ('k'cmp('k'v'cmp) t -> 'k key -> f:('v option -> 'v option) -> ('k'v'cmp) t) options
val update : ('k'cmp('k'v'cmp) t -> 'k key -> f:('v option -> 'v) -> ('k'v'cmp) t) options
val find : ('k'cmp('k'v'cmp) t -> 'k key -> 'v option) options
val find_exn : ('k'cmp('k'v'cmp) t -> 'k key -> 'v) options
val remove : ('k'cmp('k'v'cmp) t -> 'k key -> ('k'v'cmp) t) options
val mem : ('k'cmp('k'a'cmp) t -> 'k key -> bool) options
val iter_keys : ('k'a'b) t -> f:('k key -> unit) -> unit
val iter : ('a'v'b) t -> f:('v -> unit) -> unit
val iteri : ('k'v'a) t -> f:(key:'k key -> data:'v -> unit) -> unit
val iteri_until : ('k'v'a) t -> f:(key:'k key -> data:'v -> Base__.Map_intf.Continue_or_stop.t) -> Base__.Map_intf.Finished_or_unfinished.t
val iter2 : ('k'cmp('k'v1'cmp) t -> ('k'v2'cmp) t -> f:(key:'k key -> data:[ `Both of 'v1 * 'v2 | `Left of 'v1 | `Right of 'v2 ] -> unit) -> unit) options
val map : ('k'v1'cmp) t -> f:('v1 -> 'v2) -> ('k'v2'cmp) t
val mapi : ('k'v1'cmp) t -> f:(key:'k key -> data:'v1 -> 'v2) -> ('k'v2'cmp) t
val fold : ('k'v'b) t -> init:'a -> f:(key:'k key -> data:'v -> 'a -> 'a) -> 'a
val fold_right : ('k'v'b) t -> init:'a -> f:(key:'k key -> data:'v -> 'a -> 'a) -> 'a
val fold2 : ('k'cmp('k'v1'cmp) t -> ('k'v2'cmp) t -> init:'a -> f:(key:'k key -> data:[ `Both of 'v1 * 'v2 | `Left of 'v1 | `Right of 'v2 ] -> 'a -> 'a) -> 'a) options
val filter_keys : ('k'cmp('k'v'cmp) t -> f:('k key -> bool) -> ('k'v'cmp) t) options
val filter : ('k'cmp('k'v'cmp) t -> f:('v -> bool) -> ('k'v'cmp) t) options
val filteri : ('k'cmp('k'v'cmp) t -> f:(key:'k key -> data:'v -> bool) -> ('k'v'cmp) t) options
val filter_map : ('k'cmp('k'v1'cmp) t -> f:('v1 -> 'v2 option) -> ('k'v2'cmp) t) options
val filter_mapi : ('k'cmp('k'v1'cmp) t -> f:(key:'k key -> data:'v1 -> 'v2 option) -> ('k'v2'cmp) t) options
val partition_mapi : ('k'cmp('k'v1'cmp) t -> f:(key:'k key -> data:'v1 -> [ `Fst of 'v2 | `Snd of 'v3 ]) -> ('k'v2'cmp) t * ('k'v3'cmp) t) options
val partition_map : ('k'cmp('k'v1'cmp) t -> f:('v1 -> [ `Fst of 'v2 | `Snd of 'v3 ]) -> ('k'v2'cmp) t * ('k'v3'cmp) t) options
val partitioni_tf : ('k'cmp('k'v'cmp) t -> f:(key:'k key -> data:'v -> bool) -> ('k'v'cmp) t * ('k'v'cmp) t) options
val partition_tf : ('k'cmp('k'v'cmp) t -> f:('v -> bool) -> ('k'v'cmp) t * ('k'v'cmp) t) options
val compare_direct : ('k'cmp('v -> 'v -> int) -> ('k'v'cmp) t -> ('k'v'cmp) t -> int) options
val equal : ('k'cmp('v -> 'v -> bool) -> ('k'v'cmp) t -> ('k'v'cmp) t -> bool) options
val keys : ('k'a'b) t -> 'k key list
val data : ('a'v'b) t -> 'v list
val to_alist : ?⁠key_order:[ `Decreasing | `Increasing ] -> ('k'v'a) t -> ('k key * 'v) list
val validate : name:('k key -> string) -> 'v Base.Validate.check -> ('k'v'a) t Base.Validate.check
val merge : ('k'cmp('k'v1'cmp) t -> ('k'v2'cmp) t -> f:(key:'k key -> [ `Both of 'v1 * 'v2 | `Left of 'v1 | `Right of 'v2 ] -> 'v3 option) -> ('k'v3'cmp) t) options
val symmetric_diff : ('k'cmp('k'v'cmp) t -> ('k'v'cmp) t -> data_equal:('v -> 'v -> bool) -> ('k key'v) Base__.Map_intf.Symmetric_diff_element.t Base.Sequence.t) options
val fold_symmetric_diff : ('k'cmp('k'v'cmp) t -> ('k'v'cmp) t -> data_equal:('v -> 'v -> bool) -> init:'a -> f:('a -> ('k key'v) Base__.Map_intf.Symmetric_diff_element.t -> 'a) -> 'a) options
val min_elt : ('k'v'a) t -> ('k key * 'v) option
val min_elt_exn : ('k'v'a) t -> 'k key * 'v
val max_elt : ('k'v'a) t -> ('k key * 'v) option
val max_elt_exn : ('k'v'a) t -> 'k key * 'v
val for_all : ('k'v'a) t -> f:('v -> bool) -> bool
val for_alli : ('k'v'a) t -> f:(key:'k key -> data:'v -> bool) -> bool
val exists : ('k'v'a) t -> f:('v -> bool) -> bool
val existsi : ('k'v'a) t -> f:(key:'k key -> data:'v -> bool) -> bool
val count : ('k'v'a) t -> f:('v -> bool) -> int
val counti : ('k'v'a) t -> f:(key:'k key -> data:'v -> bool) -> int
val split : ('k'cmp('k'v'cmp) t -> 'k key -> ('k'v'cmp) t * ('k key * 'v) option * ('k'v'cmp) t) options
val append : ('k'cmplower_part:('k'v'cmp) t -> upper_part:('k'v'cmp) t -> [ `Ok of ('k'v'cmp) t | `Overlapping_key_ranges ]) options
val subrange : ('k'cmp('k'v'cmp) t -> lower_bound:'k key Base.Maybe_bound.t -> upper_bound:'k key Base.Maybe_bound.t -> ('k'v'cmp) t) options
val fold_range_inclusive : ('k'cmp('k'v'cmp) t -> min:'k key -> max:'k key -> init:'a -> f:(key:'k key -> data:'v -> 'a -> 'a) -> 'a) options
val range_to_alist : ('k'cmp('k'v'cmp) t -> min:'k key -> max:'k key -> ('k key * 'v) list) options
val closest_key : ('k'cmp('k'v'cmp) t -> [ `Greater_or_equal_to | `Greater_than | `Less_or_equal_to | `Less_than ] -> 'k key -> ('k key * 'v) option) options
val nth : ('k'cmp('k'v'cmp) t -> int -> ('k key * 'v) option) options
val nth_exn : ('k'cmp('k'v'cmp) t -> int -> 'k key * 'v) options
val rank : ('k'cmp('k'a'cmp) t -> 'k key -> int option) options
val to_tree : ('k'v'cmp) t -> ('k key'v'cmp) tree
val to_sequence : ('k'cmp?⁠order:[ `Decreasing_key | `Increasing_key ] -> ?⁠keys_greater_or_equal_to:'k key -> ?⁠keys_less_or_equal_to:'k key -> ('k'v'cmp) t -> ('k key * 'v) Base.Sequence.t) options
val binary_search_segmented : ('k'cmp('k'v'cmp) t -> segment_of:(key:'k key -> data:'v -> [ `Left | `Right ]) -> [ `First_on_right | `Last_on_left ] -> ('k key * 'v) option) options
val key_set : ('k'cmp('k_'cmp) t -> ('k key'cmp cmp) Base.Set.t) options
val quickcheck_observer : 'k key Core_kernel.Quickcheck.Observer.t -> 'v Core_kernel.Quickcheck.Observer.t -> ('k'v'cmp) t Core_kernel.Quickcheck.Observer.t
val quickcheck_shrinker : ('k'cmp'k key Core_kernel.Quickcheck.Shrinker.t -> 'v Core_kernel.Quickcheck.Shrinker.t -> ('k'v'cmp) t Core_kernel.Quickcheck.Shrinker.t) options