module type Creators = sig .. end
type ('a, 'comparator) t
type ('a, 'comparator) set
type ('a, 'comparator) tree
type 'a elt
type ('a, 'comparator, 'z) options
val empty : ('a, 'comparator, ('a, 'comparator) t)
options
val singleton : ('a, 'comparator,
'a elt -> ('a, 'comparator) t)
options
val union_list : ('a, 'comparator,
('a, 'comparator) t list ->
('a, 'comparator) t)
options
val of_list : ('a, 'comparator,
'a elt list ->
('a, 'comparator) t)
options
val of_array : ('a, 'comparator,
'a elt array ->
('a, 'comparator) t)
options
val of_sorted_array : ('a, 'comparator,
'a elt array ->
('a, 'comparator) t Or_error.t)
options
Create set from sorted array. The input must be sorted (either in ascending
or descending order as given by the comparator) and contain no duplicates,
otherwise the result is an error. The complexity of this function is O(N).
val of_sorted_array_unchecked : ('a, 'comparator,
'a elt array ->
('a, 'comparator) t)
options
Similar to of_sorted_arary without checking the input array.
val stable_dedup_list : ('a, 'b,
'a elt list -> 'a elt list)
options
val map : ('b, 'comparator,
('a, 'c) set ->
f:('a -> 'b elt) ->
('b, 'comparator) t)
options
val filter_map : ('b, 'comparator,
('a, 'c) set ->
f:('a -> 'b elt option) ->
('b, 'comparator) t)
options
val of_tree : ('a, 'comparator,
('a elt, 'comparator) tree ->
('a, 'comparator) t)
options