Module type Hash_set_intf.Hash_set
val sexp_of_t : ('a -> Base.Sexp.t) -> 'a t -> Base.Sexp.t
module Key = Key
module type Creators_generic = Creators_generic
type nonrec ('key, 'z) create_options
= ('key, 'z) create_options
include Accessors with type 'a Accessors.t := 'a t with type 'a Accessors.elt = 'a
val length : 'a t -> int
val is_empty : 'a t -> bool
val iter : 'a t -> f:('a elt -> unit) -> unit
val fold : 'a t -> init:'accum -> f:('accum -> 'a elt -> 'accum) -> 'accum
val fold_result : 'a t -> init:'accum -> f:('accum -> 'a elt -> ('accum, 'e) Base.Result.t) -> ('accum, 'e) Base.Result.t
val fold_until : 'a t -> init:'accum -> f:('accum -> 'a elt -> ('accum, 'final) Base__.Container_intf.Continue_or_stop.t) -> finish:('accum -> 'final) -> 'final
val exists : 'a t -> f:('a elt -> bool) -> bool
val for_all : 'a t -> f:('a elt -> bool) -> bool
val count : 'a t -> f:('a elt -> bool) -> int
val sum : (module Base__.Container_intf.Summable with type t = 'sum) -> 'a t -> f:('a elt -> 'sum) -> 'sum
val find : 'a t -> f:('a elt -> bool) -> 'a elt option
val find_map : 'a t -> f:('a elt -> 'b option) -> 'b option
val to_list : 'a t -> 'a elt list
val to_array : 'a t -> 'a elt array
val min_elt : 'a t -> compare:('a elt -> 'a elt -> int) -> 'a elt option
val max_elt : 'a t -> compare:('a elt -> 'a elt -> int) -> 'a elt option
val mem : 'a t -> 'a -> bool
override
Container.Generic.mem
val add : 'a t -> 'a -> unit
val strict_add : 'a t -> 'a -> unit Base.Or_error.t
strict_add t x
returnsOk ()
if thex
was not int
, or anError
if it was.
val strict_add_exn : 'a t -> 'a -> unit
val remove : 'a t -> 'a -> unit
val strict_remove : 'a t -> 'a -> unit Base.Or_error.t
strict_remove t x
returnsOk ()
if thex
was int
, or anError
if it was not.
val strict_remove_exn : 'a t -> 'a -> unit
val clear : 'a t -> unit
val equal : 'a t -> 'a t -> bool
val filter : 'a t -> f:('a -> bool) -> 'a t
val filter_inplace : 'a t -> f:('a -> bool) -> unit
val inter : 'key t -> 'key t -> 'key t
inter t1 t2
computes the set intersection oft1
andt2
. Runs in O(min(length t1, length t2)). Behavior is undefined ift1
andt2
don't have the same equality function.
val union : 'a t -> 'a t -> 'a t
val diff : 'a t -> 'a t -> 'a t
val of_hashtbl_keys : ('a, 'b) Base.Hashtbl.t -> 'a t
val to_hashtbl : 'key t -> f:('key -> 'data) -> ('key, 'data) Base.Hashtbl.t
type nonrec ('key, 'z) create_options_without_first_class_module
= ('key, 'z) create_options_without_first_class_module
module Poly : sig ... end
A hash set that uses polymorphic comparison
module M : functor (Elt : Base.T.T) -> sig ... end
M
is meant to be used in combination with OCaml applicative functor types:
module type Sexp_of_m = sig ... end
module type M_of_sexp = sig ... end
val sexp_of_m__t : (module Sexp_of_m with type t = 'elt) -> 'elt t -> Base.Sexp.t
val m__t_of_sexp : (module M_of_sexp with type t = 'elt) -> Base.Sexp.t -> 'elt t