Module `Set.Poly`Source

A polymorphic Set.

Sourcetype 'elt t = ('elt, Base.Comparator.Poly.comparator_witness) Base.Set.t

include Base.Container.Generic
  with type ('a, 'cmp, _) t := 'a Base.Set.Poly.t
  with type 'a elt := 'a

Sourceval length : _ Base.Set.Poly.t -> int

Sourceval is_empty : _ Base.Set.Poly.t -> bool

Sourceval iter : 'a Base.Set.Poly.t -> f:('a -> unit) -> unit

Sourceval fold : 'a Base.Set.Poly.t -> init:'acc -> f:('acc -> 'a -> 'acc) -> 'acc

Source

val fold_result : 
  'a Base.Set.Poly.t ->
  init:'acc ->
  f:('acc -> 'a -> ('acc, 'e) Base.Result.t) ->
  ('acc, 'e) Base.Result.t

Sourceval exists : 'a Base.Set.Poly.t -> f:('a -> bool) -> bool

Sourceval for_all : 'a Base.Set.Poly.t -> f:('a -> bool) -> bool

Sourceval count : 'a Base.Set.Poly.t -> f:('a -> bool) -> int

Source

val sum : 
  (module Container.Summable with type t = 'sum) ->
  'a Base.Set.Poly.t ->
  f:('a -> 'sum) ->
  'sum

Sourceval find : 'a Base.Set.Poly.t -> f:('a -> bool) -> 'a option

Sourceval find_map : 'a Base.Set.Poly.t -> f:('a -> 'b option) -> 'b option

Sourceval to_list : 'a Base.Set.Poly.t -> 'a list

Sourceval to_array : 'a Base.Set.Poly.t -> 'a array

Sourceval invariants : 'a Base.Set.Poly.t -> bool

Sourceval mem : 'a Base.Set.Poly.t -> 'a -> bool

override Container's mem

Sourceval add : 'a Base.Set.Poly.t -> 'a -> 'a Base.Set.Poly.t

Sourceval remove : 'a Base.Set.Poly.t -> 'a -> 'a Base.Set.Poly.t

Sourceval union : 'a Base.Set.Poly.t -> 'a Base.Set.Poly.t -> 'a Base.Set.Poly.t

Sourceval inter : 'a Base.Set.Poly.t -> 'a Base.Set.Poly.t -> 'a Base.Set.Poly.t

Sourceval diff : 'a Base.Set.Poly.t -> 'a Base.Set.Poly.t -> 'a Base.Set.Poly.t

Source

val symmetric_diff : 
  'a Base.Set.Poly.t ->
  'a Base.Set.Poly.t ->
  ('a, 'a) Base.Either.t Base.Sequence.t

Sourceval compare_direct : 'a Base.Set.Poly.t -> 'a Base.Set.Poly.t -> int

Sourceval equal : 'a Base.Set.Poly.t -> 'a Base.Set.Poly.t -> bool

Sourceval is_subset : 'a Base.Set.Poly.t -> of_:'a Base.Set.Poly.t -> bool

Sourceval are_disjoint : 'a Base.Set.Poly.t -> 'a Base.Set.Poly.t -> bool

Sourcemodule Named : sig ... end

Source

val fold_until : 
  'a Base.Set.Poly.t ->
  init:'acc ->
  f:('acc -> 'a -> ('acc, 'final) Container.Continue_or_stop.t) ->
  finish:('acc -> 'final) ->
  'final

Source

val fold_right : 
  'a Base.Set.Poly.t ->
  init:'acc ->
  f:('a -> 'acc -> 'acc) ->
  'acc

Source

val iter2 : 
  'a Base.Set.Poly.t ->
  'a Base.Set.Poly.t ->
  f:([ `Left of 'a | `Right of 'a | `Both of 'a * 'a ] -> unit) ->
  unit

Sourceval filter : 'a Base.Set.Poly.t -> f:('a -> bool) -> 'a Base.Set.Poly.t

Source

val partition_tf : 
  'a Base.Set.Poly.t ->
  f:('a -> bool) ->
  'a Base.Set.Poly.t * 'a Base.Set.Poly.t

Sourceval elements : 'a Base.Set.Poly.t -> 'a list

Sourceval min_elt : 'a Base.Set.Poly.t -> 'a option

Sourceval min_elt_exn : 'a Base.Set.Poly.t -> 'a

Sourceval max_elt : 'a Base.Set.Poly.t -> 'a option

Sourceval max_elt_exn : 'a Base.Set.Poly.t -> 'a

Sourceval choose : 'a Base.Set.Poly.t -> 'a option

Sourceval choose_exn : 'a Base.Set.Poly.t -> 'a

Source

val split : 
  'a Base.Set.Poly.t ->
  'a ->
  'a Base.Set.Poly.t * 'a option * 'a Base.Set.Poly.t

Source

val split_le_gt : 
  'a Base.Set.Poly.t ->
  'a ->
  'a Base.Set.Poly.t * 'a Base.Set.Poly.t

Source

val split_lt_ge : 
  'a Base.Set.Poly.t ->
  'a ->
  'a Base.Set.Poly.t * 'a Base.Set.Poly.t

Source

val group_by : 
  'a Base.Set.Poly.t ->
  equiv:('a -> 'a -> bool) ->
  'a Base.Set.Poly.t list

Sourceval find_exn : 'a Base.Set.Poly.t -> f:('a -> bool) -> 'a

Sourceval nth : 'a Base.Set.Poly.t -> int -> 'a option

Sourceval remove_index : 'a Base.Set.Poly.t -> int -> 'a Base.Set.Poly.t

Source

val to_tree : 
  'a Base.Set.Poly.t ->
  ('a, Base.Comparator.Poly.comparator_witness)
    Base.Set.Using_comparator.Tree.t

Source

val to_sequence : 
  ?order:[ `Increasing | `Decreasing ] ->
  ?greater_or_equal_to:'a ->
  ?less_or_equal_to:'a ->
  'a Base.Set.Poly.t ->
  'a Base.Sequence.t

Source

val binary_search : 
  'a Base.Set.Poly.t ->
  compare:('a -> 'key -> int) ->
  Base.Binary_searchable.Which_target_by_key.t ->
  'key ->
  'a option

Source

val binary_search_segmented : 
  'a Base.Set.Poly.t ->
  segment_of:('a -> [ `Left | `Right ]) ->
  Base.Binary_searchable.Which_target_by_segment.t ->
  'a option

Source

val merge_to_sequence : 
  ?order:[ `Increasing | `Decreasing ] ->
  ?greater_or_equal_to:'a ->
  ?less_or_equal_to:'a ->
  'a Base.Set.Poly.t ->
  'a Base.Set.Poly.t ->
  ('a, 'a) Base.Sequence.Merge_with_duplicates_element.t Base.Sequence.t

Sourceval empty : 'a Base.Set.Poly.t

Sourceval singleton : 'a -> 'a Base.Set.Poly.t

Sourceval union_list : 'a Base.Set.Poly.t list -> 'a Base.Set.Poly.t

Sourceval of_list : 'a list -> 'a Base.Set.Poly.t

Sourceval of_sequence : 'a Base.Sequence.t -> 'a Base.Set.Poly.t

Sourceval of_array : 'a array -> 'a Base.Set.Poly.t

Sourceval of_sorted_array : 'a array -> 'a Base.Set.Poly.t Base.Or_error.t

Sourceval of_sorted_array_unchecked : 'a array -> 'a Base.Set.Poly.t

Source

val of_increasing_iterator_unchecked : 
  len:int ->
  f:(int -> 'a) ->
  'a Base.Set.Poly.t

Sourceval stable_dedup_list : 'a list -> 'a list

deprecated [since 2023-04] Use [List.stable_dedup] instead.

Sourceval map : ('a, _) Base.Set.t -> f:('a -> 'b) -> 'b Base.Set.Poly.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 argument
Set.Poly.map -- comparator is polymorphic comparison
Foo.Set.map -- comparator is Foo.comparator

Source

val filter_map : 
  ('a, _) Base.Set.t ->
  f:('a -> 'b option) ->
  'b Base.Set.Poly.t

Source

val of_tree : 
  ('a, Base.Comparator.Poly.comparator_witness)
    Base.Set.Using_comparator.Tree.t ->
  'a Base.Set.Poly.t

Module Set.PolySource

Module `Set.Poly`Source