Module `Using_comparator.Tree`

type ('k, +'v, 'cmp) t

val sexp_of_t : ('k -> Base.Sexp.t) -> ('v -> Base.Sexp.t) -> ('cmp -> Base.Sexp.t) -> ('k, 'v, 'cmp) t -> Base.Sexp.t

val t_of_sexp_direct : comparator:('k, 'cmp) Base.Comparator.t -> (Base.Sexp.t -> 'k) -> (Base.Sexp.t -> 'v) -> Base.Sexp.t -> ('k, 'v, 'cmp) t

include Base__.Map_intf.Creators_and_accessors3_with_comparator with type ('a, 'b, 'c) t := ('a, 'b, 'c) t with type ('a, 'b, 'c) tree := ('a, 'b, 'c) t

include Base__.Map_intf.Creators3_with_comparator with type ('a, 'b, 'c) t := ('a, 'b, 'c) t with type ('a, 'b, 'c) tree := ('a, 'b, 'c) t

val empty : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t
val singleton : comparator:('a, 'cmp) Base.Comparator.t -> 'a -> 'b -> ('a, 'b, 'c) t
val of_alist : comparator:('a, 'cmp) Base.Comparator.t -> ('a * 'b) list -> [ `Duplicate_key of 'a | `Ok of ('a, 'b, 'c) t ]
val of_alist_or_error : comparator:('a, 'cmp) Base.Comparator.t -> ('a * 'b) list -> ('a, 'b, 'c) t Base.Or_error.t
val of_alist_exn : comparator:('a, 'cmp) Base.Comparator.t -> ('a * 'b) list -> ('a, 'b, 'c) t
val of_alist_multi : comparator:('a, 'cmp) Base.Comparator.t -> ('a * 'b) list -> ('a, 'b, 'c) t
val of_alist_fold : comparator:('a, 'cmp) Base.Comparator.t -> ('a * 'b) list -> init:'c -> f:('c -> 'b -> 'c) -> ('a, 'b, 'c) t
val of_alist_reduce : comparator:('a, 'cmp) Base.Comparator.t -> ('a * 'b) list -> f:('b -> 'b -> 'b) -> ('a, 'b, 'c) t
val of_sorted_array : comparator:('a, 'cmp) Base.Comparator.t -> ('a * 'b) array -> ('a, 'b, 'c) t Base.Or_error.t
val of_sorted_array_unchecked : comparator:('a, 'cmp) Base.Comparator.t -> ('a * 'b) array -> ('a, 'b, 'c) t
val of_increasing_iterator_unchecked : comparator:('a, 'cmp) Base.Comparator.t -> len:int -> f:(int -> 'a * 'b) -> ('a, 'b, 'c) t
val of_increasing_sequence : comparator:('a, 'cmp) Base.Comparator.t -> ('a * 'b) Base.Sequence.t -> ('a, 'b, 'c) t Base.Or_error.t
val of_sequence : comparator:('a, 'cmp) Base.Comparator.t -> ('a * 'b) Base.Sequence.t -> [ `Duplicate_key of 'a | `Ok of ('a, 'b, 'c) t ]
val of_sequence_or_error : comparator:('a, 'cmp) Base.Comparator.t -> ('a * 'b) Base.Sequence.t -> ('a, 'b, 'c) t Base.Or_error.t
val of_sequence_exn : comparator:('a, 'cmp) Base.Comparator.t -> ('a * 'b) Base.Sequence.t -> ('a, 'b, 'c) t
val of_sequence_multi : comparator:('a, 'cmp) Base.Comparator.t -> ('a * 'b) Base.Sequence.t -> ('a, 'b, 'c) t
val of_sequence_fold : comparator:('a, 'cmp) Base.Comparator.t -> ('a * 'b) Base.Sequence.t -> init:'c -> f:('c -> 'b -> 'c) -> ('a, 'b, 'c) t
val of_sequence_reduce : comparator:('a, 'cmp) Base.Comparator.t -> ('a * 'b) Base.Sequence.t -> f:('b -> 'b -> 'b) -> ('a, 'b, 'c) t
val of_iteri : comparator:('a, 'cmp) Base.Comparator.t -> iteri:(f:(key:'a -> data:'b -> unit) -> unit) -> [ `Duplicate_key of 'a | `Ok of ('a, 'b, 'c) t ]
val of_tree : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> ('a, 'b, 'c) t

include Base__.Map_intf.Accessors3_with_comparator with type ('a, 'b, 'c) t := ('a, 'b, 'c) t with type ('a, 'b, 'c) tree := ('a, 'b, 'c) t

val invariants : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> bool
val is_empty : ('a, 'b, 'c) t -> bool
val length : ('a, 'b, 'c) t -> int
val add : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> key:'a -> data:'b -> [ `Ok of ('a, 'b, 'c) t | `Duplicate ]
val add_exn : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> key:'a -> data:'b -> ('a, 'b, 'c) t
val set : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> key:'a -> data:'b -> ('a, 'b, 'c) t
val add_multi : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> key:'a -> data:'b -> ('a, 'b, 'c) t
val remove_multi : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> 'a -> ('a, 'b, 'c) t
val find_multi : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> 'a -> 'b list
val change : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> 'a -> f:('b option -> 'b option) -> ('a, 'b, 'c) t
val update : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> 'a -> f:('b option -> 'b) -> ('a, 'b, 'c) t
val find : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> 'a -> 'b option
val find_exn : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> 'a -> 'b
val remove : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> 'a -> ('a, 'b, 'c) t
val mem : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> 'a -> bool
val iter_keys : ('a, 'b, 'c) t -> f:('a -> unit) -> unit
val iter : ('a, 'b, 'c) t -> f:('b -> unit) -> unit
val iteri : ('a, 'b, 'c) t -> f:(key:'a -> data:'b -> unit) -> unit
val iteri_until : ('a, 'b, 'c) t -> f:(key:'a -> data:'b -> Base__.Map_intf.Continue_or_stop.t) -> Base__.Map_intf.Finished_or_unfinished.t
val iter2 : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> ('a, 'b, 'c) t -> f:(key:'a -> data:[ `Both of 'b * 'c | `Left of 'b | `Right of 'c ] -> unit) -> unit
val map : ('a, 'b, 'c) t -> f:('b -> 'c) -> ('a, 'b, 'c) t
val mapi : ('a, 'b, 'c) t -> f:(key:'a -> data:'b -> 'c) -> ('a, 'b, 'c) t
val fold : ('a, 'b, 'c) t -> init:'c -> f:(key:'a -> data:'b -> 'c -> 'c) -> 'c
val fold_right : ('a, 'b, 'c) t -> init:'c -> f:(key:'a -> data:'b -> 'c -> 'c) -> 'c
val fold2 : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> ('a, 'b, 'c) t -> init:'d -> f:(key:'a -> data:[ `Both of 'b * 'c | `Left of 'b | `Right of 'c ] -> 'd -> 'd) -> 'd
val filter_keys : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> f:('a -> bool) -> ('a, 'b, 'c) t
val filter : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> f:('b -> bool) -> ('a, 'b, 'c) t
val filteri : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> f:(key:'a -> data:'b -> bool) -> ('a, 'b, 'c) t
val filter_map : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> f:('b -> 'c option) -> ('a, 'b, 'c) t
val filter_mapi : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> f:(key:'a -> data:'b -> 'c option) -> ('a, 'b, 'c) t
val partition_mapi : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> f:(key:'a -> data:'b -> [ `Fst of 'c | `Snd of 'd ]) -> ('a, 'b, 'c) t * ('a, 'b, 'c) t
val partition_map : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> f:('b -> [ `Fst of 'c | `Snd of 'd ]) -> ('a, 'b, 'c) t * ('a, 'b, 'c) t
val partitioni_tf : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> f:(key:'a -> data:'b -> bool) -> ('a, 'b, 'c) t * ('a, 'b, 'c) t
val partition_tf : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> f:('b -> bool) -> ('a, 'b, 'c) t * ('a, 'b, 'c) t
val compare_direct : comparator:('a, 'cmp) Base.Comparator.t -> ('b -> 'b -> int) -> ('a, 'b, 'c) t -> ('a, 'b, 'c) t -> int
val equal : comparator:('a, 'cmp) Base.Comparator.t -> ('b -> 'b -> bool) -> ('a, 'b, 'c) t -> ('a, 'b, 'c) t -> bool
val keys : ('a, 'b, 'c) t -> 'a list
val data : ('a, 'b, 'c) t -> 'b list
val to_alist : ?⁠key_order:[ `Decreasing | `Increasing ] -> ('a, 'b, 'c) t -> ('a * 'b) list
val validate : name:('a -> string) -> 'b Base.Validate.check -> ('a, 'b, 'c) t Base.Validate.check
val merge : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> ('a, 'b, 'c) t -> f:(key:'a -> [ `Both of 'b * 'c | `Left of 'b | `Right of 'c ] -> 'd option) -> ('a, 'b, 'c) t
val symmetric_diff : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> ('a, 'b, 'c) t -> data_equal:('b -> 'b -> bool) -> ('a, 'b) Base__.Map_intf.Symmetric_diff_element.t Base.Sequence.t
val fold_symmetric_diff : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> ('a, 'b, 'c) t -> data_equal:('b -> 'b -> bool) -> init:'c -> f:('c -> ('a * [ `Left of 'b | `Right of 'b | `Unequal of 'b * 'b ]) -> 'c) -> 'c
val min_elt : ('a, 'b, 'c) t -> ('a * 'b) option
val min_elt_exn : ('a, 'b, 'c) t -> 'a * 'b
val max_elt : ('a, 'b, 'c) t -> ('a * 'b) option
val max_elt_exn : ('a, 'b, 'c) t -> 'a * 'b
val for_all : ('a, 'b, 'c) t -> f:('b -> bool) -> bool
val for_alli : ('a, 'b, 'c) t -> f:(key:'a -> data:'b -> bool) -> bool
val exists : ('a, 'b, 'c) t -> f:('b -> bool) -> bool
val existsi : ('a, 'b, 'c) t -> f:(key:'a -> data:'b -> bool) -> bool
val count : ('a, 'b, 'c) t -> f:('b -> bool) -> int
val counti : ('a, 'b, 'c) t -> f:(key:'a -> data:'b -> bool) -> int
val split : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> 'a -> ('a, 'b, 'c) t * ('a * 'b) option * ('a, 'b, 'c) t
val append : comparator:('a, 'cmp) Base.Comparator.t -> lower_part:('a, 'b, 'c) t -> upper_part:('a, 'b, 'c) t -> [ `Ok of ('a, 'b, 'c) t | `Overlapping_key_ranges ]
val subrange : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> lower_bound:'a Base.Maybe_bound.t -> upper_bound:'a Base.Maybe_bound.t -> ('a, 'b, 'c) t
val fold_range_inclusive : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> min:'a -> max:'a -> init:'c -> f:(key:'a -> data:'b -> 'c -> 'c) -> 'c
val range_to_alist : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> min:'a -> max:'a -> ('a * 'b) list
val closest_key : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> [ `Greater_or_equal_to | `Greater_than | `Less_or_equal_to | `Less_than ] -> 'a -> ('a * 'b) option
val nth : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> int -> ('a * 'b) option
val nth_exn : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> int -> 'a * 'b
val rank : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> 'a -> int option
val to_tree : ('a, 'b, 'c) t -> ('a, 'b, 'c) t
val to_sequence : comparator:('a, 'cmp) Base.Comparator.t -> ?⁠order:[ `Decreasing_key | `Increasing_key ] -> ?⁠keys_greater_or_equal_to:'a -> ?⁠keys_less_or_equal_to:'a -> ('a, 'b, 'c) t -> ('a * 'b) Base.Sequence.t
val binary_search : comparator:('k, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> compare:(key:'k -> data:'v -> 'key -> int) -> [ `First_equal_to | `First_greater_than_or_equal_to | `First_strictly_greater_than | `Last_equal_to | `Last_less_than_or_equal_to | `Last_strictly_less_than ] -> 'key -> ('k * 'v) option
val binary_search_segmented : comparator:('k, 'cmp) Base.Comparator.t -> ('a, 'b, 'c) t -> segment_of:(key:'k -> data:'v -> [ `Left | `Right ]) -> [ `First_on_right | `Last_on_left ] -> ('k * 'v) option

val empty_without_value_restriction : (_, _, _) t