Ephemeron.K2.Make(3)

💖 NAME 💖

Ephemeron.K2.Make — functor building an implementation of a weak hash table 💅✨

This is the Ephemeron.K2.Make(3) page from the OCaml library, and she's lowkey iconic.

🧩 Module 🧩

Module Ephemeron.K2.Make

📚 Documentation 📚

🌸 Module Make

: (H1 : Hashtbl.HashedType) (H2 : Hashtbl.HashedType) -> sig end

Functor building an implementation of a weak hash table.

Parameters:

• "H1" — Stdlib.Hashtbl.HashedType
• "H2" — Stdlib.Hashtbl.HashedType

Okay bestie, the tea ☕: she proposes the same interface as a usual hash table. But — and this is the plot twist — the bindings are weak. So 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. Literally the GC can pop in between, no cap. 😭💀

Here's the exact roster, no edits, no omissions, periodt:

• type key
• type !'a t
• val create : int -> 'a t
• val clear : 'a t -> unit
• val reset : 'a t -> unit
• val copy : 'a t -> 'a t
• val add : 'a t -> key -> 'a -> unit
• val remove : 'a t -> key -> unit
• val find : 'a t -> key -> 'a
• val find_opt : 'a t -> key -> 'a option
• val find_all : 'a t -> key -> 'a list
• val replace : 'a t -> key -> 'a -> unit
• val mem : 'a t -> key -> bool
• val length : 'a t -> int
• val stats : 'a t -> Hashtbl.statistics
• val add_seq : 'a t -> (key * 'a) Seq.t -> unit
• val replace_seq : 'a t -> (key * 'a) Seq.t -> unit
• val of_seq : (key * 'a) Seq.t -> 'a t
• val clean : 'a t -> unit — remove all dead bindings. Done automatically during automatic resizing. 🧹
• val stats_alive : 'a t -> Hashtbl.statistics — same as Hashtbl.SeededS.stats but only count the alive bindings 👑

---

That's the whole page, bestie! 💖 Shoutout to OCamldoc for the source/version and the date stamp 2026-06-22 — this iconic little manual page is Ephemeron.K2.Make(3) and it ate. 🎀🫶