Module
GenHashTable
:
sig end
Define a hash table on generic containers which have a notion of "death" and aliveness. If a binding is dead the hash table can automatically remove it.
type equal
=
| ETrue
| EFalse
| EDead (* the container is dead
*)
module MakeSeeded : functor (H : sig end) -> sig end
Functor building an implementation of an hash table that use the container for keeping the information given