Nonempty_setval singleton :
('a, 'cmp) Core.Comparator.Module.t ->
'a ->
('a, 'cmp) t @@ portableval reduce :
('a, _) t ->
map:('a -> 'b) ->
f:('b -> 'b -> 'b) ->
'b @@ portableval fold : ('a, _) t -> init:'b -> f:('b -> 'a -> 'b) -> 'b @@ portableval iter : ('a, _) t -> f:('a -> unit) @ local -> unit @@ portableval of_list :
('a, 'cmp) Core.Comparator.Module.t ->
'a list ->
('a, 'cmp) t option @@ portableval of_list_or_null :
('a, 'cmp) Core.Comparator.Module.t ->
'a list ->
('a, 'cmp) t or_null @@ portableval of_list_exn :
('a, 'cmp) Core.Comparator.Module.t ->
'a list ->
('a, 'cmp) t @@ portableval of_nonempty_list :
('a, 'cmp) Core.Comparator.Module.t ->
'a Core.Nonempty_list.t ->
('a, 'cmp) t @@ portableval to_list : ('a, _) t -> 'a list @@ portableval to_nonempty_list : ('a, _) t -> 'a Core.Nonempty_list.t @@ portableval map :
('b, 'cmp) Core.Comparator.Module.t ->
('a, _) t ->
f:('a -> 'b) ->
('b, 'cmp) t @@ portableval of_set : ('a, 'b) Core.Set.t -> ('a, 'b) t option @@ portableval of_set_or_null : ('a, 'b) Core.Set.t -> ('a, 'b) t or_null @@ portableval of_set_exn : ('a, 'b) Core.Set.t -> ('a, 'b) t @@ portableval of_set_add : ('a, 'b) Core.Set.t -> 'a -> ('a, 'b) t @@ portableval to_set : ('a, 'b) t -> ('a, 'b) Core.Set.t @@ portableval to_set_remove : ('a, 'b) t -> 'a -> ('a, 'b) Core.Set.t @@ portableval to_set_inter : ('a, 'b) t -> ('a, 'b) t -> ('a, 'b) Core.Set.t @@ portableunion t1 t2 returns the union of the two sets. O(length t1 + length t2).
val union_set : ('a, 'b) t -> ('a, 'b) Core.Set.t -> ('a, 'b) t @@ portableval union_list : ('a, 'cmp) t Core.Nonempty_list.t -> ('a, 'cmp) t @@ portableunion t list returns the union of t and all the sets in list. O(max(List.length list, n log n)), where n is the sum of sizes of the input sets.
val union_set_list :
('a, 'cmp) t ->
('a, 'cmp) Core.Set.t list ->
('a, 'cmp) t @@ portableval diff : ('a, 'cmp) t -> ('a, 'cmp) t -> ('a, 'cmp) Core.Set.t @@ portableval mem : ('a, _) t -> 'a -> bool @@ portableval length : (_, _) t -> int @@ portableval max_elt : ('a, _) t -> 'a @@ portableval min_elt : ('a, _) t -> 'a @@ portableval choose : ('a, _) t -> 'a @@ portableval sexp_of_m__t :
(module Core.Set.Sexp_of_m with type t = 'elt) ->
('elt, 'cmp) t ->
Core.Sexp.tval m__t_of_sexp :
(module Core.Set.M_of_sexp
with type comparator_witness = 'cmp
and type t = 'elt) ->
Core.Sexp.t ->
('elt, 'cmp) tval m__t_sexp_grammar :
(module Core.Set.M_sexp_grammar with type t = 'elt) ->
('elt, 'cmp) t Sexplib0.Sexp_grammar.t @@ portableval bin_shape_m__t : ('a, 'b) Core.Set.Elt_bin_io.t -> Core.Bin_prot.Shape.tval bin_size_m__t :
('a, 'b) Core.Set.Elt_bin_io.t ->
('a, 'b) t Core.Bin_prot.Size.sizerval bin_write_m__t :
('a, 'b) Core.Set.Elt_bin_io.t ->
('a, 'b) t Core.Bin_prot.Write.writerval bin_read_m__t :
('a, 'b) Core.Set.Elt_bin_io.t ->
('a, 'b) t Core.Bin_prot.Read.readerval __bin_read_m__t__ :
('a, 'b) Core.Set.Elt_bin_io.t ->
('a, 'b) t Core.Bin_prot.Read.vtag_readerval quickcheck_generator_m__t :
(module Core.Set.Quickcheck_generator_m
with type comparator_witness = 'cmp
and type t = 'a) ->
('a, 'cmp) t Core.Quickcheck.Generator.tval quickcheck_observer_m__t :
(module Core.Set.Quickcheck_observer_m
with type comparator_witness = 'cmp
and type t = 'a) ->
('a, 'cmp) t Core.Quickcheck.Observer.tval quickcheck_shrinker_m__t :
(module Core.Set.Quickcheck_shrinker_m
with type comparator_witness = 'cmp
and type t = 'a) ->
('a, 'cmp) t Core.Quickcheck.Shrinker.tval hash_fold_m__t :
(module Core.Set.Hash_fold_m with type t = 'elt) ->
Core.Hash.state ->
('elt, _) t ->
Core.Hash.stateval hash_m__t :
(module Core.Set.Hash_fold_m with type t = 'elt) ->
('elt, _) t ->
intval compare_m__t :
(module Core.Set.Compare_m) ->
('elt, 'cmp) t ->
('elt, 'cmp) t ->
intval equal_m__t :
(module Core.Set.Equal_m) ->
('elt, 'cmp) t ->
('elt, 'cmp) t ->
boolmodule Stable : sig ... end