Module Set.Poly

module Tree : sig ... end
type 'elt t = ('elt, Comparator.Poly.comparator_witness) t
include Bin_prot.Binable.S1 with type 'elt t := 'elt t
val bin_shape_t : Bin_prot.Shape.t -> Bin_prot.Shape.t
val bin_size_t : ('a, 'a t) Bin_prot.Size.sizer1
val bin_write_t : ('a, 'a t) Bin_prot.Write.writer1
val bin_read_t : ('a, 'a t) Bin_prot.Read.reader1
val __bin_read_t__ : ('a, int -> 'a t) Bin_prot.Read.reader1
val bin_writer_t : ('a, 'a t) Bin_prot.Type_class.S1.writer
val bin_reader_t : ('a, 'a t) Bin_prot.Type_class.S1.reader
val bin_t : ('a, 'a t) Bin_prot.Type_class.S1.t
val compare : ('elt -> 'elt -> Base.Int.t) -> 'elt t -> 'elt t -> Base.Int.t
include Ppx_sexp_conv_lib.Sexpable.S1 with type 'elt t := 'elt t
val t_of_sexp : (Sexplib0.Sexp.t -> 'a) -> Sexplib0.Sexp.t -> 'a t
val sexp_of_t : ('a -> Sexplib0.Sexp.t) -> 'a t -> Sexplib0.Sexp.t
include Set_intf.Creators_and_accessors1 with type ('a, 'b) set := ('a, 'b) t with type 'elt t := 'elt t with type 'elt tree := 'elt Tree.t with type 'a named := 'a named with type comparator_witness := Comparator.Poly.comparator_witness
include Set_intf.Accessors1 with type 'elt t := 'elt t with type 'elt tree := 'elt Tree.t with type 'a named := 'a named with type comparator_witness := Comparator.Poly.comparator_witness
include Set_intf.Set.Accessors1 with type 'elt t := 'elt t with type 'elt tree := 'elt Tree.t with type 'a named := 'a named with type comparator_witness := Comparator.Poly.comparator_witness
include Base.Container.S1 with type 'elt t := 'elt t
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

fold t ~init ~f returns f (... f (f (f init e1) e2) e3 ...) en, where e1..en are the elements of t

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

fold_result t ~init ~f is a short-circuiting version of fold that runs in the Result monad. If f returns an Error _, that value is returned without any additional invocations of f.

val exists : 'a t -> f:('a -> bool) -> bool

Returns true if and only if there exists an element for which the provided function evaluates to true. This is a short-circuiting operation.

val for_all : 'a t -> f:('a -> bool) -> bool

Returns true if and only if the provided function evaluates to true for all elements. This is a short-circuiting operation.

val count : 'a t -> f:('a -> bool) -> int

Returns the number of elements for which the provided function evaluates to true.

val sum : (module Base__Container_intf.Summable with type t = 'sum) -> 'a t -> f:('a -> 'sum) -> 'sum

Returns the sum of f i for all i in the container.

val find : 'a t -> f:('a -> bool) -> 'a option

Returns as an option the first element for which f evaluates to true.

val find_map : 'a t -> f:('a -> 'b option) -> 'b option

Returns the first evaluation of f that returns Some, and returns None if there is no such element.

val to_list : 'a t -> 'a list
val to_array : 'a t -> 'a array
val invariants : _ t -> bool
val mem : 'a t -> 'a -> bool
val add : 'a t -> 'a -> 'a t
val remove : 'a t -> 'a -> 'a t
val union : 'a t -> 'a t -> 'a t
val inter : 'a t -> 'a t -> 'a t
val diff : 'a t -> 'a t -> 'a t
val symmetric_diff : 'a t -> 'a t -> ('a, 'a) Base.Either.t Base.Sequence.t
val compare_direct : 'a t -> 'a t -> int
val equal : 'a t -> 'a t -> bool
val is_subset : 'a t -> of_:'a t -> bool
val are_disjoint : 'a t -> 'a t -> bool
module Named : sig ... end
val fold_until : 'a t -> init:'b -> f:('b -> 'a -> ('b, 'final) Base__Set_intf.Continue_or_stop.t) -> finish:('b -> 'final) -> 'final
val fold_right : 'a t -> init:'b -> f:('a -> 'b -> 'b) -> 'b
val iter2 : 'a t -> 'a t -> f:([ `Left of 'a | `Right of 'a | `Both of 'a * 'a ] -> unit) -> unit
val filter : 'a t -> f:('a -> bool) -> 'a t
val partition_tf : 'a t -> f:('a -> bool) -> 'a t * 'a t
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 split : 'a t -> 'a -> 'a t * 'a option * 'a t
val group_by : 'a t -> equiv:('a -> 'a -> bool) -> 'a t list
val find_exn : 'a t -> f:('a -> bool) -> 'a
val nth : 'a t -> int -> 'a option
val remove_index : 'a t -> int -> 'a t
val to_tree : 'a t -> 'a Tree.t
val to_sequence : ?order:[ `Increasing | `Decreasing ] -> ?greater_or_equal_to:'a -> ?less_or_equal_to:'a -> 'a t -> 'a Base.Sequence.t
val binary_search_segmented : 'a t -> segment_of:('a -> [ `Left | `Right ]) -> [ `Last_on_left | `First_on_right ] -> '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) Base.Sequence.Merge_with_duplicates_element.t Base.Sequence.t
val to_map : 'a t -> f:('a -> 'b) -> ('a, 'b, Comparator.Poly.comparator_witness) Base.Map.t
val quickcheck_observer : 'a Quickcheck.Observer.t -> 'a t Quickcheck.Observer.t
val quickcheck_shrinker : 'a Quickcheck.Shrinker.t -> 'a t Quickcheck.Shrinker.t
include Set_intf.Creators1 with type 'a t := 'a t with type 'a tree := 'a Tree.t with type comparator_witness := Comparator.Poly.comparator_witness with type ('a, 'b) set := ('a, 'b) t
include Set_intf.Set.Creators1 with type 'a t := 'a t with type 'a tree := 'a Tree.t with type comparator_witness := Comparator.Poly.comparator_witness with type ('a, 'b) set := ('a, 'b) t
val empty : 'a t
val singleton : 'a -> 'a t
val union_list : 'a t list -> 'a t
val of_list : 'a list -> 'a t
val of_array : 'a array -> 'a t
val of_sorted_array : 'a array -> 'a t Base.Or_error.t
val of_sorted_array_unchecked : 'a array -> 'a t
val of_increasing_iterator_unchecked : len:int -> f:(int -> 'a) -> 'a t
val stable_dedup_list : 'a list -> 'a list
val map : ('a, _) t -> f:('a -> 'b) -> 'b t
val filter_map : ('a, _) t -> f:('a -> 'b option) -> 'b t
val of_tree : 'a Tree.t -> 'a t
val of_hash_set : 'a Hash_set.t -> 'a t
val of_hashtbl_keys : ('a, _) Hashtbl.t -> 'a t
val of_map_keys : ('a, _, Comparator.Poly.comparator_witness) Base.Map.t -> 'a t
val quickcheck_generator : 'a Quickcheck.Generator.t -> 'a t Quickcheck.Generator.t