package ocaml-base-compiler

You can search for identifiers within the package.

in-package search v0.2.0

Package contains no libraries

Hash tables on generic containers with notion of death and aliveness.

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 (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