Module Using_comparator.Tree

type ('a, 'cmp) t

A Tree.t contains just the tree data structure that a set is based on, without including the comparator. Accordingly, any operation on a Tree.t must also take as an argument the corresponding comparator.

val sexp_of_t : ('a -> Base.Sexp.t) -> ('cmp -> Base.Sexp.t) -> ('a, 'cmp) t -> Base.Sexp.t
val t_of_sexp_direct : comparator:('elt, 'cmp) Base.Comparator.t -> (Base.Sexp.t -> 'elt) -> Base.Sexp.t -> ('elt, 'cmp) t
module Named : sig ... end
include Base__.Set_intf.Creators_and_accessors2_with_comparator with type ('a, 'b) set := ('a, 'b) t with type ('a, 'b) t := ('a, 'b) t with type ('a, 'b) tree := ('a, 'b) t with type ('a, 'b) named := ('a, 'b) Named.t with module Named := Named
include Base__.Set_intf.Accessors2_with_comparator with type ('a, 'b) t := ('a, 'b) t with type ('a, 'b) tree := ('a, 'b) t with type ('a, 'b) named := ('a, 'b) Named.t with module Named := Named
val length : ('a, 'b) t -> int
val is_empty : ('a, 'b) t -> bool
val iter : ('a, 'b) t -> f:('a -> unit) -> unit
val fold : ('a, 'b) t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum
val fold_result : ('a, 'b) t -> init:'accum -> f:('accum -> 'a -> ('accum, 'e) Base.Result.t) -> ('accum, 'e) Base.Result.t
val exists : ('a, 'b) t -> f:('a -> bool) -> bool
val for_all : ('a, 'b) t -> f:('a -> bool) -> bool
val count : ('a, 'b) t -> f:('a -> bool) -> int
val sum : (module Base__.Container_intf.Summable with type t = 'sum) -> ('a, 'b) t -> f:('a -> 'sum) -> 'sum
val find : ('a, 'b) t -> f:('a -> bool) -> 'a option
val find_map : ('a, 'b) t -> f:('a -> 'b option) -> 'b option
val to_list : ('a, 'b) t -> 'a list
val to_array : ('a, 'b) t -> 'a array
val invariants : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b) t -> bool
val mem : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b) t -> 'a -> bool
val add : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b) t -> 'a -> ('a, 'b) t
val remove : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b) t -> 'a -> ('a, 'b) t
val union : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b) t -> ('a, 'b) t -> ('a, 'b) t
val inter : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b) t -> ('a, 'b) t -> ('a, 'b) t
val diff : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b) t -> ('a, 'b) t -> ('a, 'b) t
val symmetric_diff : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b) t -> ('a, 'b) t -> ('a, 'a) Base__.Either.t Base.Sequence.t
val compare_direct : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b) t -> ('a, 'b) t -> int
val equal : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b) t -> ('a, 'b) t -> bool
val is_subset : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b) t -> of_:('a, 'b) t -> bool
val fold_until : ('a, 'b) t -> init:'accum -> f:('accum -> 'a -> ('accum, 'final) Base__.Container_intf.Export.Continue_or_stop.t) -> finish:('accum -> 'final) -> 'final
val fold_right : ('a, 'b) t -> init:'accum -> f:('a -> 'accum -> 'accum) -> 'accum
val iter2 : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b) t -> ('a, 'b) t -> f:([ `Both of 'a * 'a | `Left of 'a | `Right of 'a ] -> unit) -> unit
val filter : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b) t -> f:('a -> bool) -> ('a, 'b) t
val partition_tf : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b) t -> f:('a -> bool) -> ('a, 'b) t * ('a, 'b) t
val elements : ('a, 'b) t -> 'a list
val min_elt : ('a, 'b) t -> 'a option
val min_elt_exn : ('a, 'b) t -> 'a
val max_elt : ('a, 'b) t -> 'a option
val max_elt_exn : ('a, 'b) t -> 'a
val choose : ('a, 'b) t -> 'a option
val choose_exn : ('a, 'b) t -> 'a
val split : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b) t -> 'a -> ('a, 'b) t * 'a option * ('a, 'b) t
val group_by : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b) t -> equiv:('a -> 'a -> bool) -> ('a, 'b) t list
val find_exn : ('a, 'b) t -> f:('a -> bool) -> 'a
val nth : ('a, 'b) t -> int -> 'a option
val remove_index : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b) t -> int -> ('a, 'b) t
val to_tree : ('a, 'b) t -> ('a, 'b) t
val to_sequence : comparator:('a, 'cmp) Base.Comparator.t -> ?⁠order:[ `Decreasing | `Increasing ] -> ?⁠greater_or_equal_to:'a -> ?⁠less_or_equal_to:'a -> ('a, 'b) t -> 'a Base.Sequence.t
val binary_search_segmented : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b) t -> segment_of:('a -> [ `Left | `Right ]) -> [ `First_on_right | `Last_on_left ] -> 'a option
val merge_to_sequence : comparator:('a, 'cmp) Base.Comparator.t -> ?⁠order:[ `Decreasing | `Increasing ] -> ?⁠greater_or_equal_to:'a -> ?⁠less_or_equal_to:'a -> ('a, 'b) t -> ('a, 'b) t -> ('a, 'a) Base__.Set_intf.Merge_to_sequence_element.t Base.Sequence.t
include Base__.Set_intf.Creators2_with_comparator with type ('a, 'b) t := ('a, 'b) t with type ('a, 'b) tree := ('a, 'b) t with type ('a, 'b) set := ('a, 'b) t
val empty : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b) t
val singleton : comparator:('a, 'cmp) Base.Comparator.t -> 'a -> ('a, 'b) t
val union_list : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b) t list -> ('a, 'b) t
val of_list : comparator:('a, 'cmp) Base.Comparator.t -> 'a list -> ('a, 'b) t
val of_array : comparator:('a, 'cmp) Base.Comparator.t -> 'a array -> ('a, 'b) t
val of_sorted_array : comparator:('a, 'cmp) Base.Comparator.t -> 'a array -> ('a, 'b) t Base.Or_error.t
val of_sorted_array_unchecked : comparator:('a, 'cmp) Base.Comparator.t -> 'a array -> ('a, 'b) t
val of_increasing_iterator_unchecked : comparator:('a, 'cmp) Base.Comparator.t -> len:int -> f:(int -> 'a) -> ('a, 'b) t
val stable_dedup_list : comparator:('a, 'cmp) Base.Comparator.t -> 'a list -> 'a list
val map : comparator:('b, 'cmp) Base.Comparator.t -> ('a, 'b) t -> f:('a -> 'b) -> ('a, 'b) t
val filter_map : comparator:('b, 'cmp) Base.Comparator.t -> ('a, 'b) t -> f:('a -> 'b option) -> ('a, 'b) t
val of_tree : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'b) t -> ('a, 'b) t
val empty_without_value_restriction : (_, _) t