include Creators_generic
include Map.Creators_generic
val of_sorted_array : ('k, 'cmp, ('k key * 'v) array ‑> ('k, 'v, 'cmp) t Base.Or_error.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_alist_or_error : ('k, 'cmp, ('k key * 'v) list ‑> ('k, 'v, 'cmp) t Base.Or_error.t) options
val gen : ('k, 'cmp, 'k key Quickcheck.Generator.t ‑> 'v Quickcheck.Generator.t ‑> ('k, 'v, 'cmp) t 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.Accessors_generic
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 iter : ('a, 'v, 'b) t ‑> f:('v ‑> unit) ‑> unit
val data : ('a, 'v, 'b) t ‑> 'v list
val validate : name:('k key ‑> string) ‑> 'v Base.Validate.check ‑> ('k, 'v, 'a) 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) Base__.Map_intf.Symmetric_diff_element.t Base.Sequence.t) options
val for_all : ('k, 'v, 'a) t ‑> f:('v ‑> bool) ‑> bool
val exists : ('k, 'v, 'a) t ‑> f:('v ‑> bool) ‑> bool
val count : ('k, 'v, 'a) 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 Quickcheck.Observer.t ‑> 'v Quickcheck.Observer.t ‑> ('k, 'v, 'cmp) t Quickcheck.Observer.t
val shrinker : ('k, 'cmp, 'k key Quickcheck.Shrinker.t ‑> 'v Quickcheck.Shrinker.t ‑> ('k, 'v, 'cmp) t Quickcheck.Shrinker.t) options