Set.Poly
A polymorphic Set.
type 'elt t = ('elt, Comparator.Poly.comparator_witness) t
include Container.Generic with type ('a, 'b) t := 'a t with type 'a elt := 'a
val length : _ t -> int
val is_empty : _ t -> bool
val iter : 'a t -> f:('a -> unit) -> unit
val fold : 'a t -> init:'acc -> f:('acc -> 'a -> 'acc) -> 'acc
val exists : 'a t -> f:('a -> bool) -> bool
val for_all : 'a t -> f:('a -> bool) -> bool
val count : 'a t -> f:('a -> bool) -> int
val sum :
(module Container.Summable with type t = 'sum) ->
'a t ->
f:('a -> 'sum) ->
'sum
val find : 'a t -> f:('a -> bool) -> 'a option
val find_map : 'a t -> f:('a -> 'b option) -> 'b option
val to_list : 'a t -> 'a list
val to_array : 'a t -> 'a array
val invariants : 'a t -> bool
val mem : 'a t -> 'a -> bool
override Container
's mem
val symmetric_diff : 'a t -> 'a t -> ('a, 'a) Either.t Sequence.t
module Named : sig ... end
val fold_until :
'a t ->
init:'acc ->
f:('acc -> 'a -> ('acc, 'final) Container.Continue_or_stop.t) ->
finish:('acc -> 'final) ->
'final
val fold_right : 'a t -> init:'acc -> f:('a -> 'acc -> 'acc) -> 'acc
val elements : 'a t -> 'a list
val min_elt : 'a t -> 'a option
val min_elt_exn : 'a t -> 'a
val max_elt : 'a t -> 'a option
val max_elt_exn : 'a t -> 'a
val choose : 'a t -> 'a option
val choose_exn : 'a t -> 'a
val find_exn : 'a t -> f:('a -> bool) -> 'a
val nth : 'a t -> int -> 'a option
val to_sequence :
?order:[ `Increasing | `Decreasing ] ->
?greater_or_equal_to:'a ->
?less_or_equal_to:'a ->
'a t ->
'a Sequence.t
val binary_search :
'a t ->
compare:('a -> 'key -> int) ->
Binary_searchable.Which_target_by_key.t ->
'key ->
'a option
val binary_search_segmented :
'a t ->
segment_of:('a -> [ `Left | `Right ]) ->
Binary_searchable.Which_target_by_segment.t ->
'a option
val merge_to_sequence :
?order:[ `Increasing | `Decreasing ] ->
?greater_or_equal_to:'a ->
?less_or_equal_to:'a ->
'a t ->
'a t ->
('a, 'a) Sequence.Merge_with_duplicates_element.t Sequence.t
val empty : 'a t
val singleton : 'a -> 'a t
val of_list : 'a list -> 'a t
val of_sequence : 'a Sequence.t -> 'a t
val of_array : 'a array -> 'a t
val of_sorted_array : 'a array -> 'a t Or_error.t
val of_sorted_array_unchecked : 'a array -> 'a t
val of_increasing_iterator_unchecked : len:int -> f:(int -> 'a) -> 'a t
The types of map
and filter_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 used
Set.map
-- comparator comes as an argumentSet.Poly.map
-- comparator is polymorphic comparisonFoo.Set.map
-- comparator is Foo.comparator