Functor building an implementation of a weak hash table
Propose the same interface as usual hash table. However since the bindings are weak, even if
mem h k is true, a subsequent
find h k may raise
Not_found because the garbage collector can run between the two.
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val length : 'a t -> int
val clean : 'a t -> unit
remove all dead bindings. Done automatically during automatic resizing.