include Accessors2
include Set.Accessors2
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.Commutative_group.S 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, 'c) 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 : ('a, 'b) t ‑> bool
val mem : ('a, 'b) t ‑> 'a ‑> bool
val symmetric_diff : ('a, 'cmp) t ‑> ('a, 'cmp) t ‑> ('a, 'a) Base.Either.t Base.Sequence.t
module Named : sig ... end
val fold_until : ('a, 'c) t ‑> init:'b ‑> f:('b ‑> 'a ‑> ('b, 'final) Base__.Set_intf.Continue_or_stop.t) ‑> finish:('b ‑> 'final) ‑> 'final
val fold_right : ('a, 'c) t ‑> init:'b ‑> f:('a ‑> 'b ‑> 'b) ‑> 'b
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 find_exn : ('a, 'b) t ‑> f:('a ‑> bool) ‑> 'a
val nth : ('a, 'b) t ‑> int ‑> 'a option
val to_sequence : ?order:[ `Decreasing | `Increasing ] ‑> ?greater_or_equal_to:'a ‑> ?less_or_equal_to:'a ‑> ('a, 'cmp) t ‑> 'a Base.Sequence.t
val merge_to_sequence : ?order:[ `Decreasing | `Increasing ] ‑> ?greater_or_equal_to:'a ‑> ?less_or_equal_to:'a ‑> ('a, 'cmp) t ‑> ('a, 'cmp) t ‑> ('a, 'a) Base__.Set_intf.Merge_to_sequence_element.t Base.Sequence.t
val to_map : ('a, 'cmp) t ‑> f:('a ‑> 'b) ‑> ('a, 'b, 'cmp) Core_kernel.Map.t
val obs : 'a Core_kernel.Quickcheck.Observer.t ‑> ('a, 'cmp) t Core_kernel.Quickcheck.Observer.t
val shrinker : 'a Core_kernel.Quickcheck.Shrinker.t ‑> ('a, 'cmp) t Core_kernel.Quickcheck.Shrinker.t
include Creators2 with type (a, b) t := (a, b) t with type (a, b) tree := (a, b) tree
include Set.Creators2
val empty : ('a, 'cmp) t
val singleton : 'a ‑> ('a, 'cmp) t
val of_list : 'a list ‑> ('a, 'cmp) t
val of_array : 'a array ‑> ('a, 'cmp) t
val of_sorted_array : 'a array ‑> ('a, 'cmp) t Base.Or_error.t
val of_sorted_array_unchecked : 'a array ‑> ('a, 'cmp) t
val of_increasing_iterator_unchecked : len:int ‑> f:(int ‑> 'a) ‑> ('a, 'cmp) t
val of_hash_set : 'a Core_kernel.Hash_set.t ‑> ('a, 'cmp) t
val of_hashtbl_keys : ('a, _) Core_kernel.Hashtbl.t ‑> ('a, 'cmp) t
val of_map_keys : ('a, _, 'cmp) Core_kernel.Map.t ‑> ('a, 'cmp) t
val gen : 'a Core_kernel.Quickcheck.Generator.t ‑> ('a, 'cmp) t Core_kernel.Quickcheck.Generator.t