This module implements imperative sets as hash tables.
Operations like union, intersection or difference are not provided,
since there is no way to implement them easily (i.e. more easily than
iterating over sets).
module type HashedType =
The input signature of the functor
module type S =
Functor building an implementation of the hashtable structure.