Module type Core_kernel.Set_intf.Creators_and_accessors2

include Accessors2
include Set.Accessors2
type ('a, 'phantom) t
val length : ('a'bt ‑> int
val is_empty : ('a'bt ‑> bool
val iter : ('a'bt ‑> f:('a ‑> unit) ‑> unit
val fold : ('a'bt ‑> init:'accum ‑> f:('accum ‑> 'a ‑> 'accum) ‑> 'accum
val fold_result : ('a'bt ‑> init:'accum ‑> f:('accum ‑> 'a ‑> ('accum'eBase.Result.t) ‑> ('accum'eBase.Result.t
val exists : ('a'bt ‑> f:('a ‑> bool) ‑> bool
val for_all : ('a'bt ‑> f:('a ‑> bool) ‑> bool
val count : ('a'bt ‑> f:('a ‑> bool) ‑> int
val sum : (module Base.Commutative_group.S with type t = 'sum) ‑> ('a'bt ‑> f:('a ‑> 'sum) ‑> 'sum
val find : ('a'bt ‑> f:('a ‑> bool) ‑> 'a option
val find_map : ('a'ct ‑> f:('a ‑> 'b option) ‑> 'b option
val to_list : ('a'bt ‑> 'a list
val to_array : ('a'bt ‑> 'a array
type ('a, 'cmp) tree
val invariants : ('a'bt ‑> bool
val mem : ('a'bt ‑> 'a ‑> bool
val add : ('a'cmpt ‑> 'a ‑> ('a'cmpt
val remove : ('a'cmpt ‑> 'a ‑> ('a'cmpt
val union : ('a'cmpt ‑> ('a'cmpt ‑> ('a'cmpt
val inter : ('a'cmpt ‑> ('a'cmpt ‑> ('a'cmpt
val diff : ('a'cmpt ‑> ('a'cmpt ‑> ('a'cmpt
val symmetric_diff : ('a'cmpt ‑> ('a'cmpt ‑> ('a'aBase.Either.t Base.Sequence.t
val compare_direct : ('a'cmpt ‑> ('a'cmpt ‑> int
val equal : ('a'cmpt ‑> ('a'cmpt ‑> bool
val is_subset : ('a'cmpt ‑> of_:('a'cmpt ‑> bool
val subset : ('a'cmpt ‑> ('a'cmpt ‑> bool
  • Deprecated [since 2016-09] Replace [Set.subset t1 t2] with [Set.is_subset t1 ~of_:t2]
type ('a, 'cmp) named
module Named : sig ... end
val fold_until : ('a'ct ‑> init:'b ‑> f:('b ‑> 'a ‑> ('b'finalBase__.Set_intf.Continue_or_stop.t) ‑> finish:('b ‑> 'final) ‑> 'final
val fold_right : ('a'ct ‑> init:'b ‑> f:('a ‑> 'b ‑> 'b) ‑> 'b
val iter2 : ('a'cmpt ‑> ('a'cmpt ‑> f:([ `Both of 'a * 'a | `Left of 'a | `Right of 'a ] ‑> unit) ‑> unit
val filter : ('a'cmpt ‑> f:('a ‑> bool) ‑> ('a'cmpt
val partition_tf : ('a'cmpt ‑> f:('a ‑> bool) ‑> ('a'cmpt * ('a'cmpt
val elements : ('a'bt ‑> 'a list
val min_elt : ('a'bt ‑> 'a option
val min_elt_exn : ('a'bt ‑> 'a
val max_elt : ('a'bt ‑> 'a option
val max_elt_exn : ('a'bt ‑> 'a
val choose : ('a'bt ‑> 'a option
val choose_exn : ('a'bt ‑> 'a
val split : ('a'cmpt ‑> 'a ‑> ('a'cmpt * 'a option * ('a'cmpt
val group_by : ('a'cmpt ‑> equiv:('a ‑> 'a ‑> bool) ‑> ('a'cmpt list
val find_exn : ('a'bt ‑> f:('a ‑> bool) ‑> 'a
val find_index : ('a'bt ‑> int ‑> 'a option
  • Deprecated [since 2016-10] Use [nth]
val nth : ('a'bt ‑> int ‑> 'a option
val remove_index : ('a'cmpt ‑> int ‑> ('a'cmpt
val to_tree : ('a'cmpt ‑> ('a'cmptree
val to_sequence : ?⁠order:[ `Decreasing | `Increasing ] ‑> ?⁠greater_or_equal_to:'a ‑> ?⁠less_or_equal_to:'a ‑> ('a'cmpt ‑> 'a Base.Sequence.t
val merge_to_sequence : ?⁠order:[ `Decreasing | `Increasing ] ‑> ?⁠greater_or_equal_to:'a ‑> ?⁠less_or_equal_to:'a ‑> ('a'cmpt ‑> ('a'cmpt ‑> ('a'aBase__.Set_intf.Merge_to_sequence_element.t Base.Sequence.t
val to_map : ('a'cmpt ‑> f:('a ‑> 'b) ‑> ('a'b'cmpMap.t
val obs : 'a Quickcheck.Observer.t ‑> ('a'cmpt Quickcheck.Observer.t
val shrinker : 'a Quickcheck.Shrinker.t ‑> ('a'cmpt Quickcheck.Shrinker.t
include Creators2 with type (a, b) t := (a, b) t with type (a, b) tree := (a, b) tree
include Set.Creators2
type ('a, 'cmp) set
type ('a, 'cmp) t
type ('a, 'cmp) tree
val empty : ('a'cmpt
val singleton : 'a ‑> ('a'cmpt
val union_list : ('a'cmpt list ‑> ('a'cmpt
val of_list : 'a list ‑> ('a'cmpt
val of_array : 'a array ‑> ('a'cmpt
val of_sorted_array : 'a array ‑> ('a'cmpt Base.Or_error.t
val of_sorted_array_unchecked : 'a array ‑> ('a'cmpt
val of_increasing_iterator_unchecked : len:int ‑> f:(int ‑> 'a) ‑> ('a'cmpt
val stable_dedup_list : 'a list ‑> 'a list
val map : ('a'cset ‑> f:('a ‑> 'b) ‑> ('b'cmpt
val filter_map : ('a'cset ‑> f:('a ‑> 'b option) ‑> ('b'cmpt
val of_tree : ('a'cmptree ‑> ('a'cmpt
val of_hash_set : 'a Hash_set.t ‑> ('a'cmpt
val of_hashtbl_keys : ('a_Hashtbl.t ‑> ('a'cmpt
val of_map_keys : ('a_'cmpMap.t ‑> ('a'cmpt
val gen : 'a Quickcheck.Generator.t ‑> ('a'cmpt Quickcheck.Generator.t