type tree
type comparator_witness
val invariants : t -> bool
val mem : t -> elt -> bool
val add : t -> elt -> t
val remove : t -> elt -> t
val union : t -> t -> t
val inter : t -> t -> t
val diff : t -> t -> t
val symmetric_diff : t -> t -> (elt, elt) Base__.Either.t Base.Sequence.t
val compare_direct : t -> t -> int
val equal : t -> t -> bool
val is_subset : t -> of_:t -> bool
type named
module Named : sig ... end
val fold_until : t -> init:'b -> f:('b -> elt -> ('b, 'final) Continue_or_stop.t) -> finish:('b -> 'final) -> 'final
val fold_right : t -> init:'b -> f:(elt -> 'b -> 'b) -> 'b
val iter2 : t -> t -> f:([ `Left of elt | `Right of elt | `Both of elt * elt ] -> unit) -> unit
val filter : t -> f:(elt -> bool) -> t
val partition_tf : t -> f:(elt -> bool) -> t * t
val elements : t -> elt list
val min_elt : t -> elt option
val min_elt_exn : t -> elt
val max_elt : t -> elt option
val max_elt_exn : t -> elt
val choose : t -> elt option
val choose_exn : t -> elt
val split : t -> elt -> t * elt option * t
val group_by : t -> equiv:(elt -> elt -> bool) -> t list
val find_exn : t -> f:(elt -> bool) -> elt
val nth : t -> int -> elt option
val remove_index : t -> int -> t
val to_tree : t -> tree
val to_sequence : ?order:[ `Increasing | `Decreasing ] -> ?greater_or_equal_to:elt -> ?less_or_equal_to:elt -> t -> elt Base.Sequence.t
val binary_search : t -> compare:(elt -> 'key -> int) -> [ `Last_strictly_less_than | `Last_less_than_or_equal_to | `Last_equal_to | `First_equal_to | `First_greater_than_or_equal_to | `First_strictly_greater_than ] -> 'key -> elt option
val binary_search_segmented : t -> segment_of:(elt -> [ `Left | `Right ]) -> [ `Last_on_left | `First_on_right ] -> elt option
val merge_to_sequence : ?order:[ `Increasing | `Decreasing ] -> ?greater_or_equal_to:elt -> ?less_or_equal_to:elt -> t -> t -> (elt, elt) Merge_to_sequence_element.t Base.Sequence.t