include Accessors_generic
include Set.Accessors_generic
val length : ('a, 'b) t ‑> int
val is_empty : ('a, 'b) t ‑> bool
val fold_result : ('a, 'b) t ‑> init:'accum ‑> f:('accum ‑> 'a elt ‑> ('accum, 'e) Base.Result.t) ‑> ('accum, 'e) Base.Result.t
val sum : (module Base.Commutative_group.S with type t = 'sum) ‑> ('a, 'b) t ‑> f:('a elt ‑> 'sum) ‑> 'sum
val symmetric_diff : ('a, 'cmp, ('a, 'cmp) t ‑> ('a, 'cmp) t ‑> ('a elt, 'a elt) Base.Either.t Base.Sequence.t) options
module Named : sig ... end
val fold_until : ('a, 'c) t ‑> init:'b ‑> f:('b ‑> 'a elt ‑> ('b, 'final) Base__.Set_intf.Continue_or_stop.t) ‑> finish:('b ‑> 'final) ‑> 'final
val merge_to_sequence : ('a, 'cmp, ?order:[ `Decreasing | `Increasing ] ‑> ?greater_or_equal_to:'a elt ‑> ?less_or_equal_to:'a elt ‑> ('a, 'cmp) t ‑> ('a, 'cmp) t ‑> ('a elt, 'a elt) Base__.Set_intf.Merge_to_sequence_element.t Base.Sequence.t) options
val obs : 'a elt Core_kernel.Quickcheck.Observer.t ‑> ('a, 'cmp) t Core_kernel.Quickcheck.Observer.t
val shrinker : ('a, 'cmp, 'a elt Core_kernel.Quickcheck.Shrinker.t ‑> ('a, 'cmp) t Core_kernel.Quickcheck.Shrinker.t) options
include Creators_generic with type (a, b, c) options := (a, b, c) options with type (a, b) t := (a, b) t with type (a, b) tree := (a, b) tree with type a elt := a elt with type cmp cmp := cmp cmp
include Set.Creators_generic
val of_sorted_array : ('a, 'cmp, 'a elt array ‑> ('a, 'cmp) t Base.Or_error.t) options
val of_hash_set : ('a, 'cmp, 'a elt Core_kernel.Hash_set.t ‑> ('a, 'cmp) t) options
val of_hashtbl_keys : ('a, 'cmp, ('a elt, _) Core_kernel.Hashtbl.t ‑> ('a, 'cmp) t) options
val of_map_keys : ('a elt, _, 'cmp cmp) Core_kernel.Map.t ‑> ('a, 'cmp) t
Never requires a comparator because it can get one from the input Map.t
.
val gen : ('a, 'cmp, 'a elt Core_kernel.Quickcheck.Generator.t ‑> ('a, 'cmp) t Core_kernel.Quickcheck.Generator.t) options