include Core_kernel.Set_intf.Make_S_plain_tree(Elt).S
val compare : t -> t -> Base.Int.t
include Core_kernel.Set_intf.Creators_and_accessors0 with type ('a, 'b) set := ('a, 'b) Base.Set.Using_comparator.Tree.t with type t := t with type tree := t with type elt := t with type named := named with type comparator_witness := Elt.comparator_witness
include Core_kernel.Set_intf.Accessors0 with type t := t with type tree := t with type elt := t with type named := named with type comparator_witness := Elt.comparator_witness
include Base.Set.Accessors0 with type t := t with type tree := t with type elt := t with type named := named with type comparator_witness := Elt.comparator_witness
include Base.Container.S0 with type t := t with type elt := t
val length : t -> int
val is_empty : t -> bool
val iter : t -> f:(t -> unit) -> unit

iter must allow exceptions raised in f to escape, terminating the iteration cleanly. The same holds for all functions below taking an f.

val fold : t -> init:'accum -> f:('accum -> t -> 'accum) -> 'accum

fold t ~init ~f returns f (... f (f (f init e1) e2) e3 ...) en, where e1..en are the elements of t.

val fold_result : t -> init:'accum -> f:('accum -> t -> ('accum, 'e) Base.Result.t) -> ('accum, 'e) Base.Result.t

fold_result t ~init ~f is a short-circuiting version of fold that runs in the Result monad. If f returns an Error _, that value is returned without any additional invocations of f.

val exists : t -> f:(t -> bool) -> bool

Returns true if and only if there exists an element for which the provided function evaluates to true. This is a short-circuiting operation.

val for_all : t -> f:(t -> bool) -> bool

Returns true if and only if the provided function evaluates to true for all elements. This is a short-circuiting operation.

val count : t -> f:(t -> bool) -> int

Returns the number of elements for which the provided function evaluates to true.

val sum : (module Base__.Container_intf.Summable with type t = 'sum) -> t -> f:(t -> 'sum) -> 'sum

Returns the sum of f i for all i in the container.

val find : t -> f:(t -> bool) -> t option

Returns as an option the first element for which f evaluates to true.

val find_map : t -> f:(t -> 'a option) -> 'a option

Returns the first evaluation of f that returns Some, and returns None if there is no such element.

val to_list : t -> t list
val to_array : t -> t array
val invariants : t -> bool
val mem : t -> t -> bool
val add : t -> t -> t
val remove : t -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val diff : t -> t -> t
val symmetric_diff : t -> t -> (t, t) Base.Either.t Base.Sequence.t
val compare_direct : t -> t -> int
val equal : t -> t -> bool
val is_subset : t -> of_:t -> bool
val are_disjoint : t -> t -> bool
module Named : sig ... end
val fold_until : t -> init:'b -> f:('b -> t -> ('b, 'final) Base__.Container_intf.Export.Continue_or_stop.t) -> finish:('b -> 'final) -> 'final
val fold_right : t -> init:'b -> f:(t -> 'b -> 'b) -> 'b
val iter2 : t -> t -> f:([ `Left of t | `Right of t | `Both of t * t ] -> unit) -> unit
val filter : t -> f:(t -> bool) -> t
val partition_tf : t -> f:(t -> bool) -> t * t
val elements : t -> t list
val min_elt : t -> t option
val min_elt_exn : t -> t
val max_elt : t -> t option
val max_elt_exn : t -> t
val choose : t -> t option
val choose_exn : t -> t
val split : t -> t -> t * t option * t
val group_by : t -> equiv:(t -> t -> bool) -> t list
val find_exn : t -> f:(t -> bool) -> t
val nth : t -> int -> t option
val remove_index : t -> int -> t
val to_tree : t -> t
val to_sequence : ?order:[ `Increasing | `Decreasing ] -> ?greater_or_equal_to:t -> ?less_or_equal_to:t -> t -> t Base.Sequence.t
val binary_search_segmented : t -> segment_of:(t -> [ `Left | `Right ]) -> [ `Last_on_left | `First_on_right ] -> t option
val merge_to_sequence : ?order:[ `Increasing | `Decreasing ] -> ?greater_or_equal_to:t -> ?less_or_equal_to:t -> t -> t -> (t, t) Base.Sequence.Merge_with_duplicates_element.t Base.Sequence.t
val to_map : t -> f:(t -> 'data) -> (t, 'data, Elt.comparator_witness) Base.Map.t
include Core_kernel.Set_intf.Creators0 with type t := t with type tree := t with type elt := t with type comparator_witness := Elt.comparator_witness with type ('a, 'b) set := ('a, 'b) Base.Set.Using_comparator.Tree.t
include Base.Set.Creators0 with type t := t with type tree := t with type elt := t with type comparator_witness := Elt.comparator_witness with type ('a, 'b) set := ('a, 'b) Base.Set.Using_comparator.Tree.t
val empty : t
val singleton : t -> t
val union_list : t list -> t
val of_list : t list -> t
val of_array : t array -> t
val of_sorted_array : t array -> t Base.Or_error.t
val of_sorted_array_unchecked : t array -> t
val of_increasing_iterator_unchecked : len:int -> f:(int -> t) -> t
val stable_dedup_list : t list -> t list
val map : ('a, _) Base.Set.Using_comparator.Tree.t -> f:('a -> t) -> t
val filter_map : ('a, _) Base.Set.Using_comparator.Tree.t -> f:('a -> t option) -> t
val of_tree : t -> t
val of_hash_set : t Core_kernel.Hash_set.t -> t
val of_hashtbl_keys : (t, _) Core_kernel.Hashtbl.t -> t
val of_map_keys : (t, _, Elt.comparator_witness) Base.Map.t -> t
module Provide_of_sexp (Elt : sig ... end) : sig ... end
include Core_kernel.Sexpable.S with type t := t
val t_of_sexp : Sexplib0.Sexp.t -> t
val sexp_of_t : t -> Sexplib0.Sexp.t