Module Hashset

module Hashset: sig .. end

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 = sig .. end

The input signature of the functor Hashset.Make.

module type S = sig .. end

The output signature of the functor Hashset.Make.

module Make: functor (H : HashedType) -> S  with type elt = H.t

Functor building an implementation of the hashtable structure.