Ephemeron.K1.MakeSeeded(3) OCaml library Ephemeron.K1.MakeSeeded(3)

# [NAME](#NAME)

Ephemeron.K1.MakeSeeded - Functor building an implementation of a weak hash table.

# [Module](#Module)

Module Ephemeron.K1.MakeSeeded

# [Documentation](#Documentation)

Module **MakeSeeded**  
: **functor (H : Hashtbl.SeededHashedType) -> sig end**

Functor building an implementation of a weak hash table. The seed is similar to the one of **Hashtbl.MakeSeeded** .

**Parameters:**

"H"

**Stdlib.Hashtbl.SeededHashedType**

*type key*

*type* **'a** *t*

*val create* : **?random:bool -> 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 iter* : **(key -> 'a -> unit) -> 'a t -> unit**

*val filter\_map\_inplace* : **(key -> 'a -> 'a option) -> 'a t -> unit**

*val fold* : **(key -> 'a -> 'b -> 'b) ->** **'a t -> 'b -> 'b**

*val length* : **'a t -> int**

*val stats* : **'a t -> Hashtbl.statistics**

*val to\_seq* : **'a t -> (key * 'a) Seq.t**

*val to\_seq\_keys* : **'a t -> key Seq.t**

*val to\_seq\_values* : **'a t -> 'a Seq.t**

*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-10-27 OCamldoc

---

Document: Ephemeron.K1.MakeSeeded(3o) from ocaml-4 4.14.4-r4 (Chainguard OS)
Source: https://github.com/ocaml/ocaml