M (core_kernel.Core_kernel.Set_intf.Check

include Set.Accessors_generic with type ('a, 'b) named := ('a, 'b) Named.t and type 'cmp cmp := 'cmp Cmp.t and type 'a elt := 'a Elt.t and type ('a, 'b) tree := ('a, 'b) Tree.t and type ('a, 'b) t := ('a, 'b) T.t and type ('a, 'b, 'c) options := ('a, 'b, 'c) Options.t

include Base.Container.Generic_phantom with type ('a, 'b) t := ('a, 'b) T.t and type 'a elt := 'a Elt.t

val length : ('a, 'b) T.t -> int
val is_empty : ('a, 'b) T.t -> bool
val iter : ('a, 'b) T.t -> f:('a Elt.t -> unit) -> unit
val fold : ('a, 'b) T.t -> init:'accum -> f:('accum -> 'a Elt.t -> 'accum) -> 'accum
val fold_result : ('a, 'b) T.t -> init:'accum -> f:('accum -> 'a Elt.t -> ('accum, 'e) Base.Result.t) -> ('accum, 'e) Base.Result.t
val fold_until : ('a, 'b) T.t -> init:'accum -> f:('accum -> 'a Elt.t -> ('accum, 'final) Base__Container_intf.Export.Continue_or_stop.t) -> finish:('accum -> 'final) -> 'final
val exists : ('a, 'b) T.t -> f:('a Elt.t -> bool) -> bool
val for_all : ('a, 'b) T.t -> f:('a Elt.t -> bool) -> bool
val count : ('a, 'b) T.t -> f:('a Elt.t -> bool) -> int
val sum : (module Base__Container_intf.Summable with type t = 'sum) -> ('a, 'b) T.t -> f:('a Elt.t -> 'sum) -> 'sum
val find : ('a, 'b) T.t -> f:('a Elt.t -> bool) -> 'a Elt.t option
val find_map : ('a, 'b) T.t -> f:('a Elt.t -> 'b option) -> 'b option
val to_list : ('a, 'b) T.t -> 'a Elt.t list
val to_array : ('a, 'b) T.t -> 'a Elt.t array
val min_elt : ('a, 'b) T.t -> compare:('a Elt.t -> 'a Elt.t -> int) -> 'a Elt.t option
val max_elt : ('a, 'b) T.t -> compare:('a Elt.t -> 'a Elt.t -> int) -> 'a Elt.t option

val invariants : ('a, 'b, 'c) Options.t
val mem : ('a, 'b, 'c) Options.t: override Container's mem

val add : ('a, 'b, 'c) Options.t
val remove : ('a, 'b, 'c) Options.t
val union : ('a, 'b, 'c) Options.t
val inter : ('a, 'b, 'c) Options.t
val diff : ('a, 'b, 'c) Options.t
val symmetric_diff : ('a, 'b, 'c) Options.t
val compare_direct : ('a, 'b, 'c) Options.t
val equal : ('a, 'b, 'c) Options.t
val is_subset : ('a, 'b, 'c) Options.t
val are_disjoint : ('a, 'b, 'c) Options.t

module Named : sig ... end

val fold_until : ('a, 'b) T.t -> init:'b -> f:('b -> 'a Elt.t -> ('b, 'final) Base__Set_intf.Continue_or_stop.t) -> finish:('b -> 'final) -> 'final
val fold_right : ('a, 'b) T.t -> init:'b -> f:('a Elt.t -> 'b -> 'b) -> 'b
val iter2 : ('a, 'b, 'c) Options.t
val filter : ('a, 'b, 'c) Options.t
val partition_tf : ('a, 'b, 'c) Options.t
val elements : ('a, 'b) T.t -> 'a Elt.t list
val min_elt : ('a, 'b) T.t -> 'a Elt.t option
val min_elt_exn : ('a, 'b) T.t -> 'a Elt.t
val max_elt : ('a, 'b) T.t -> 'a Elt.t option
val max_elt_exn : ('a, 'b) T.t -> 'a Elt.t
val choose : ('a, 'b) T.t -> 'a Elt.t option
val choose_exn : ('a, 'b) T.t -> 'a Elt.t
val split : ('a, 'b, 'c) Options.t
val group_by : ('a, 'b, 'c) Options.t
val find_exn : ('a, 'b) T.t -> f:('a Elt.t -> bool) -> 'a Elt.t
val nth : ('a, 'b) T.t -> int -> 'a Elt.t option
val remove_index : ('a, 'b, 'c) Options.t
val to_tree : ('a, 'b) T.t -> ('a, 'b) Tree.t
val to_sequence : ('a, 'b, 'c) Options.t
val binary_search : ('a, 'b, 'c) Options.t
val binary_search_segmented : ('a, 'b, 'c) Options.t
val merge_to_sequence : ('a, 'b, 'c) Options.t

val to_map : ('a, 'b, 'c) Options.t
val quickcheck_observer : 'a Elt.t Quickcheck.Observer.t -> ('a, 'b) T.t Quickcheck.Observer.t
val quickcheck_shrinker : ('a, 'b, 'c) Options.t