include Creators_generic
include Map_intf.Creators_generic
val of_sorted_array : ('k, 'cmp, ('k key * 'v) array ‑> ('k, 'v, 'cmp) t Base.Or_error.t) options
val of_alist_or_error : ('k, 'cmp, ('k key * 'v) list ‑> ('k, 'v, 'cmp) t Base.Or_error.t) options
val of_hashtbl_exn : ('k, 'cmp, ('k key, 'v) Core_kernel__.Core_hashtbl.t ‑> ('k, 'v, 'cmp) t) options
val gen : ('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, b, c) options := (a, b, c) options
include Map_intf.Accessors_generic
val is_empty : (_, _, _) t ‑> bool
val length : (_, _, _) t ‑> int
val iter : (_, 'v, _) t ‑> f:('v ‑> unit) ‑> unit
val data : (_, 'v, _) t ‑> 'v list
val validate : name:('k key ‑> string) ‑> 'v Base.Validate.check ‑> ('k, 'v, _) t Base.Validate.check
val symmetric_diff : ('k, 'cmp, ('k, 'v, 'cmp) t ‑> ('k, 'v, 'cmp) t ‑> data_equal:('v ‑> 'v ‑> bool) ‑> ('k key, 'v) Map_intf.Symmetric_diff_element.t Base.Sequence.t) options
val for_all : ('k, 'v, _) t ‑> f:('v ‑> bool) ‑> bool
val exists : ('k, 'v, _) t ‑> f:('v ‑> bool) ‑> bool
val count : ('k, 'v, _) t ‑> f:('v ‑> bool) ‑> int
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 obs : 'k key Core_kernel.Quickcheck.Observer.t ‑> 'v Core_kernel.Quickcheck.Observer.t ‑> ('k, 'v, 'cmp) t Core_kernel.Quickcheck.Observer.t
val 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