module Make:
Functor building an implementation of the hashtable structure.
The functor Hashset.Make returns a structure containing
a type elt of elements and a type t of hash sets.
The operations perform similarly to those of the generic
interface, but use the hashing and equality functions
specified in the functor argument H instead of generic
equality and hashing.
type
type
val create : int -> t
val clear : t -> unit
val copy : t -> t
val add : t -> elt -> unit
val remove : t -> elt -> unit
val mem : t -> elt -> bool
val cardinal : t -> int
val iter : (elt -> unit) -> t -> unit
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val exists : (elt -> bool) -> t -> bool
val for_all : (elt -> bool) -> t -> bool
val left_union : t -> t -> t
val is_empty : t -> bool
val filter : (elt -> bool) -> t -> unit
val to_string : t -> string
val of_list : elt list -> t
val to_list : t -> elt list
val map_to : ('b -> 'a -> 'a) -> 'a -> (elt -> 'b) -> t -> 'a