Ephemeron.GenHashTable(3)

okay so bestie, this is the manual page for Ephemeron.GenHashTable(3) from the OCaml library — the module is Ephemeron.GenHashTable, and it's literally all about hash tables on generic containers with a notion of death and aliveness. 💅✨

🌸 NAME 🌸

Ephemeron.GenHashTable — hash tables on generic containers with notion of death and aliveness. 🫶

🎀 Module 🎀

Module Ephemeron.GenHashTable 👑

✨ Documentation ✨

Module GenHashTable : sig end

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. 💀➡️🗑️

Here's the equal type, exactly:

       type equal =
        | ETrue
        | EFalse
        | EDead  (* the container is dead
        *)

And the functor signature:

module MakeSeeded : functor (H : sig end) -> sig end

MakeSeeded is a functor building an implementation of a hash table that uses the container for keeping the information given. Lowkey iconic. 🔥

---

k bye bestie, that's the whole page 💖 it came from OCamldoc on 2026-09-24, and it's Ephemeron.GenHashTable(3). slay 🎀