module type Accessors3 = sig .. end
type ('a, 'b, 'cmp) t
type ('a, 'b, 'cmp) tree
val invariants : ('a, 'b, 'c) t -> bool
val is_empty : ('a, 'b, 'c) t -> bool
val length : ('a, 'b, 'c) t -> int
val add : ('a, 'b, 'cmp) t ->
key:'a -> data:'b -> ('a, 'b, 'cmp) t
val add_multi : ('a, 'b list, 'cmp) t ->
key:'a -> data:'b -> ('a, 'b list, 'cmp) t
val change : ('a, 'b, 'cmp) t ->
'a -> ('b option -> 'b option) -> ('a, 'b, 'cmp) t
val find : ('a, 'b, 'cmp) t -> 'a -> 'b option
val find_exn : ('a, 'b, 'cmp) t -> 'a -> 'b
val remove : ('a, 'b, 'cmp) t ->
'a -> ('a, 'b, 'cmp) t
val mem : ('a, 'b, 'cmp) t -> 'a -> bool
val iter : ('a, 'b, 'cmp) t ->
f:(key:'a -> data:'b -> unit) -> unit
val iter2 : ('a, 'b, 'cmp) t ->
('a, 'c, 'cmp) t ->
f:(key:'a -> data:[ `Both of 'b * 'c | `Left of 'b | `Right of 'c ] -> unit) ->
unit
val map : ('a, 'b, 'cmp) t ->
f:('b -> 'c) -> ('a, 'c, 'cmp) t
val mapi : ('a, 'b, 'cmp) t ->
f:(key:'a -> data:'b -> 'c) -> ('a, 'c, 'cmp) t
val fold : ('a, 'b, 'd) t ->
init:'c -> f:(key:'a -> data:'b -> 'c -> 'c) -> 'c
val fold_right : ('a, 'b, 'd) t ->
init:'c -> f:(key:'a -> data:'b -> 'c -> 'c) -> 'c
val filter : ('a, 'b, 'cmp) t ->
f:(key:'a -> data:'b -> bool) -> ('a, 'b, 'cmp) t
val filter_map : ('a, 'b, 'cmp) t ->
f:('b -> 'c option) -> ('a, 'c, 'cmp) t
val filter_mapi : ('a, 'b, 'cmp) t ->
f:(key:'a -> data:'b -> 'c option) ->
('a, 'c, 'cmp) t
val compare_direct : ('b -> 'b -> int) ->
('a, 'b, 'cmp) t ->
('a, 'b, 'cmp) t -> int
val equal : ('b -> 'b -> bool) ->
('a, 'b, 'cmp) t ->
('a, 'b, 'cmp) t -> bool
val keys : ('a, 'b, 'c) t -> 'a list
val data : ('a, 'b, 'c) t -> 'b list
val to_alist : ('a, 'b, 'c) t -> ('a * 'b) list
val validate : name:('a -> string) ->
'b Validate.check -> ('a, 'b, 'c) t Validate.check
val merge : ('a, 'b, 'cmp) t ->
('a, 'c, 'cmp) t ->
f:(key:'a -> [ `Both of 'b * 'c | `Left of 'b | `Right of 'c ] -> 'd option) ->
('a, 'd, 'cmp) t
val symmetric_diff : ('a, 'b, 'cmp) t ->
('a, 'b, 'cmp) t ->
data_equal:('b -> 'b -> bool) ->
('a * [ `Left of 'b | `Right of 'b | `Unequal of 'b * 'b ]) list
val min_elt : ('a, 'b, 'cmp) t -> ('a * 'b) option
val min_elt_exn : ('a, 'b, 'cmp) t -> 'a * 'b
val max_elt : ('a, 'b, 'cmp) t -> ('a * 'b) option
val max_elt_exn : ('a, 'b, 'cmp) t -> 'a * 'b
val for_all : ('a, 'b, 'c) t -> f:('b -> bool) -> bool
val exists : ('a, 'b, 'c) t -> f:('b -> bool) -> bool
val fold_range_inclusive : ('a, 'b, 'd) t ->
min:'a -> max:'a -> init:'c -> f:(key:'a -> data:'b -> 'c -> 'c) -> 'c
val range_to_alist : ('a, 'b, 'c) t -> min:'a -> max:'a -> ('a * 'b) list
val prev_key : ('a, 'b, 'c) t -> 'a -> ('a * 'b) option
val next_key : ('a, 'b, 'c) t -> 'a -> ('a * 'b) option
val rank : ('a, 'b, 'c) t -> 'a -> int option
val to_tree : ('a, 'b, 'cmp) t ->
('a, 'b, 'cmp) tree