package ocaml-base-compiler

  1. Overview
  2. Docs

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 =
  1. | ETrue
  2. | EFalse
  3. | EDead

    the container is dead

module MakeSeeded (H : sig ... end) : SeededS with type key = H.t

Functor building an implementation of an hash table that use the container for keeping the information given


Innovation. Community. Security.