include Creators_generic
val of_sorted_array : ('k, 'cmp, ('k key * 'v) array ‑> ('k, 'v, 'cmp) t Or_error.t) options
val of_alist_or_error : ('k, 'cmp, ('k key * 'v) list ‑> ('k, 'v, 'cmp) t Or_error.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
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 Validate.check ‑> ('k, 'v, _) t Validate.check
val symmetric_diff : ('k, 'cmp, ('k, 'v, 'cmp) t ‑> ('k, 'v, 'cmp) t ‑> data_equal:('v ‑> 'v ‑> bool) ‑> ('k key, 'v) Symmetric_diff_element.t 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 Maybe_bound.t ‑> upper_bound:'k key Maybe_bound.t ‑> ('k, 'v, 'cmp) t) options