include Set.Creators_generic with 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
val empty : ('a, 'b, 'c) Options.t
val singleton : ('a, 'b, 'c) Options.t
val union_list : ('a, 'b, 'c) Options.t
val of_list : ('a, 'b, 'c) Options.t
val of_array : ('a, 'b, 'c) Options.t
val of_sorted_array : ('a, 'b, 'c) Options.t
val of_sorted_array_unchecked : ('a, 'b, 'c) Options.t
val of_increasing_iterator_unchecked : ('a, 'b, 'c) Options.t
val stable_dedup_list : ('a, 'b, 'c) Options.t
val map : ('a, 'b, 'c) Options.t
The types of
map
andfilter_map
are subtle. The input set,('a, _) set
, reflects the fact that these functions take a set of *any* type, with any comparator, while the output set,('b, 'cmp) t
, reflects that the output set has the particular'cmp
of the creation function. The comparator can come in one of three ways, depending on which set module is usedSet.map
-- comparator comes as an argumentSet.Poly.map
-- comparator is polymorphic comparisonFoo.Set.map
-- comparator isFoo.comparator
val of_hash_set : ('a, 'b, 'c) Options.t
val of_hashtbl_keys : ('a, 'b, 'c) Options.t
val of_map_keys : ('a Elt.t, _, 'cmp Cmp.t) Base.Map.t -> ('a, 'b) T.t
Never requires a comparator because it can get one from the input
Map.t
.
val quickcheck_generator : ('a, 'b, 'c) Options.t