Ephemeron.Kn.Make(3) OCaml library Ephemeron.Kn.Make(3)

# [NAME](#NAME)

Ephemeron.Kn.Make - Functor building an implementation of a weak hash table

# [Module](#Module)

Module Ephemeron.Kn.Make

# [Documentation](#Documentation)

Module **Make**  
: **(H : Hashtbl.HashedType) -> sig end**

Functor building an implementation of a weak hash table

**Parameters:**

"H"

**Stdlib.Hashtbl.HashedType**

Propose the same interface as usual hash table. However since the bindings are weak, 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.

*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

2026-09-04 OCamldoc

---

Document: Ephemeron.Kn.Make(3o) from ocaml 5.5.1-r0 (Chainguard OS)
Source: https://github.com/ocaml/ocaml