Module Base.Hash_set

type 'a t
include sig ... end
val sexp_of_t : ('a ‑> Sexp.t) ‑> 'a t ‑> Sexp.t

We use [@@deriving_inline sexp_of][@@@end] but not [@@deriving sexp] because we want people to be explicit about the hash and comparison functions used when creating hashtables. One can use Hash_set.Poly.t, which does have [@@deriving_inline sexp][@@@end], to use polymorphic comparison and hashing.

module type Creators = Base__.Hash_set_intf.Creators
module type Creators_generic = Base__.Hash_set_intf.Creators_generic
type ('key, 'z) create_options = ('key, 'z) Base__.Hash_set_intf.create_options
include Creators with type a Creators.t := a t
type 'a t
val create : ?⁠growth_allowed:bool ‑> ?⁠size:int ‑> (module Base__.Hash_set_intf.Key with type t = 'a) ‑> 'a t
val of_list : ?⁠growth_allowed:bool ‑> ?⁠size:int ‑> (module Base__.Hash_set_intf.Key with type t = 'a) ‑> 'a list ‑> 'a t
module type Accessors = Base__.Hash_set_intf.Accessors
include Accessors with type a Accessors.t := a t with type 'a Accessors.elt = 'a
type 'a 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) Result.t) ‑> ('accum, 'e) 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 Commutative_group.S 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 copy : 'a t ‑> 'a t

preserves the equality function

val add : 'a t ‑> 'a ‑> unit
val strict_add : 'a t ‑> 'a ‑> unit Or_error.t
val strict_add_exn : 'a t ‑> 'a ‑> unit
val remove : 'a t ‑> 'a ‑> unit
val strict_remove : 'a t ‑> 'a ‑> unit Or_error.t
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 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 diff : 'a t ‑> 'a t ‑> 'a t
val of_hashtbl_keys : ('a, 'b) Hashtbl.t ‑> 'a t
val to_hashtbl : 'key t ‑> f:('key ‑> 'data) ‑> ('key, 'data) Hashtbl.t
val hashable_s : 'key t ‑> (module Base__.Hashtbl_intf.Key with type t = 'key)
type ('key, 'z) create_options_without_first_class_module = ('key, 'z) Base__.Hash_set_intf.create_options_without_first_class_module
module Poly : sig ... end

A hash set that uses polymorphic comparison

module M : functor (Elt : 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 ‑> Sexp.t
val m__t_of_sexp : (module M_of_sexp with type t = 'elt) ‑> Sexp.t ‑> 'elt t
module Creators : functor (Elt : sig ... end) -> sig ... end