Ephemeron.K2.MakeSeeded(3)

💖 NAME 💖

okay so bestie, this is the manual page for Ephemeron.K2.MakeSeeded(3) from the OCaml library — and it's literally a functor that builds an implementation of a weak hash table. no cap. 💅✨

🦋 Module 🦋

The module is Ephemeron.K2.MakeSeeded, and the whole signature situation is giving:

Module MakeSeeded
 : (H1 : Hashtbl.SeededHashedType) (H2 : Hashtbl.SeededHashedType) ->
sig end

✨ Documentation ✨

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

🎀 Parameters 🎀

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

---

Here's every single declaration, bestie — all the types and vals, fully present, no details ghosted:

• 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 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. 👑

Catch you later, bestie — this cutie was served up by OCamldoc on 2026-06-22. 💅✨🫶