A hash set that uses polymorphic comparison
include sig ... end
val t_of_sexp : (Base.Sexp.t ‑> 'a) ‑> Base.Sexp.t ‑> 'a t
val sexp_of_t : ('a ‑> Base.Sexp.t) ‑> 'a t ‑> Base.Sexp.t
include Creators_generic with type a t := a t with type 'a elt = 'a with type (key, z) create_options := (key, z) create_options_without_first_class_module
val create : ('a, unit ‑> 'a t) create_options
val of_list : ('a, 'a elt list ‑> 'a t) create_options
include Accessors with type a t := a t with type a elt := a elt
include Base.Container.Generic
val length : _ t ‑> int
val is_empty : _ t ‑> bool
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 sum : (module Base.Commutative_group.S with type t = 'sum) ‑> 'a t ‑> f:('a elt ‑> 'sum) ‑> 'sum
val add : 'a t ‑> 'a ‑> unit
val strict_add : 'a t ‑> 'a ‑> unit Base.Or_error.t
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
val strict_remove_exn : 'a t ‑> 'a ‑> unit
val clear : 'a t ‑> unit
val filter_inplace : 'a t ‑> f:('a ‑> bool) ‑> unit
inter t1 t2
computes the set intersection of t1
and t2
. Runs in O(max(length
t1, length t2)). Behavior is undefined if t1
and t2
don't have the same
equality function.
val of_hashtbl_keys : ('a, _) Base.Hashtbl.t ‑> 'a t
val to_hashtbl : 'key t ‑> f:('key ‑> 'data) ‑> ('key, 'data) Base.Hashtbl.t