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
include Creators with type a Creators.t := 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
val length : 'a t ‑> int
val is_empty : 'a t ‑> bool
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 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 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 filter_inplace : 'a t ‑> f:('a ‑> bool) ‑> unit
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 type Sexp_of_m : sig ... end
module type M_of_sexp : sig ... end