Module `Base__Set.Poly`

A polymorphic Set.

include Base__.Set_intf.Creators1 with type 'a t := 'a t with type 'a tree := 'a tree with type comparator_witness := comparator_witness

val of_tree : 'a tree -> 'a t
val filter_map : ('a, _) set -> f:('a -> 'b option) -> 'a t
val map : ('a, _) set -> f:('a -> 'b) -> 'a t
val stable_dedup_list : 'a list -> 'a list
val of_increasing_iterator_unchecked : len:int -> f:(int -> 'a) -> 'a t
val of_sorted_array_unchecked : 'a array -> 'a t
val of_sorted_array : 'a array -> 'a t Base.Or_error.t
val of_array : 'a array -> 'a t
val of_list : 'a list -> 'a t
val union_list : 'a t list -> 'a t
val singleton : 'a -> 'a t
val empty : 'a t

type ('a, 'cmp) set

include Base__.Set_intf.Accessors1 with type 'elt t = ('elt, Base__.Comparator.Poly.comparator_witness) t

val merge_to_sequence : ?⁠order:[ `Increasing | `Decreasing ] -> ?⁠greater_or_equal_to:'a -> ?⁠less_or_equal_to:'a -> 'a t -> 'a t -> ('a, 'a) Base__.Set_intf.Merge_to_sequence_element.t Base.Sequence.t
val binary_search_segmented : 'a t -> segment_of:('a -> [ `Left | `Right ]) -> [ `Last_on_left | `First_on_right ] -> 'a option
val binary_search : 'a t -> compare:('a -> 'key -> int) -> [ `Last_strictly_less_than | `Last_less_than_or_equal_to | `Last_equal_to | `First_equal_to | `First_greater_than_or_equal_to | `First_strictly_greater_than ] -> 'key -> 'a option
val to_sequence : ?⁠order:[ `Increasing | `Decreasing ] -> ?⁠greater_or_equal_to:'a -> ?⁠less_or_equal_to:'a -> 'a t -> 'a Base.Sequence.t
val to_tree : 'a t -> 'a tree
val remove_index : 'a t -> int -> 'a t
val nth : 'a t -> int -> 'a option
val find_exn : 'a t -> f:('a -> bool) -> 'a
val group_by : 'a t -> equiv:('a -> 'a -> bool) -> 'a t list
val split : 'a t -> 'a -> 'a t * 'a option * 'a t
val choose_exn : 'a t -> 'a
val choose : 'a t -> 'a option
val max_elt_exn : 'a t -> 'a
val max_elt : 'a t -> 'a option
val min_elt_exn : 'a t -> 'a
val min_elt : 'a t -> 'a option
val elements : 'a t -> 'a list
val partition_tf : 'a t -> f:('a -> bool) -> 'a t * 'a t
val filter : 'a t -> f:('a -> bool) -> 'a t
val iter2 : 'a t -> 'a t -> f:([ `Left of 'a | `Right of 'a | `Both of 'a * 'a ] -> unit) -> unit
val fold_right : 'a t -> init:'b -> f:('a -> 'b -> 'b) -> 'b
val fold_until : 'a t -> init:'b -> f:('b -> 'a -> ('b, 'final) Base__.Container_intf.Export.Continue_or_stop.t) -> finish:('b -> 'final) -> 'final

module Named : sig ... end

type 'a named

val is_subset : 'a t -> of_:'a t -> bool
val equal : 'a t -> 'a t -> bool
val compare_direct : 'a t -> 'a t -> int
val symmetric_diff : 'a t -> 'a t -> ('a, 'a) Base__.Either.t Base.Sequence.t
val diff : 'a t -> 'a t -> 'a t
val inter : 'a t -> 'a t -> 'a t
val union : 'a t -> 'a t -> 'a t
val remove : 'a t -> 'a -> 'a t
val add : 'a t -> 'a -> 'a t
val mem : 'a t -> 'a -> bool
val invariants : _ t -> bool

type comparator_witness
type 'a tree

include Base.Container.S1 with type 'elt t = ('elt, Base__.Comparator.Poly.comparator_witness) t

type 'elt t = ('elt, Base__.Comparator.Poly.comparator_witness) t

val mem : 'a t -> 'a -> equal:('a -> 'a -> bool) -> bool
val length : 'a t -> int
val is_empty : 'a t -> bool
val iter : 'a t -> f:('a -> unit) -> unit
val fold : 'a t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum
val fold_result : 'a t -> init:'accum -> f:('accum -> 'a -> ('accum, 'e) Base.Result.t) -> ('accum, 'e) Base.Result.t
val fold_until : 'a t -> init:'accum -> f:('accum -> 'a -> ('accum, 'final) Base__.Container_intf.Export.Continue_or_stop.t) -> finish:('accum -> 'final) -> 'final
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 Base__.Container_intf.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 min_elt : 'a t -> compare:('a -> 'a -> int) -> 'a option
val max_elt : 'a t -> compare:('a -> 'a -> int) -> 'a option