Ephemeron.Kn.MakeSeeded(3)

💅 Ephemeron.Kn.MakeSeeded — bestie edition ✨

okay so real talk: this is a page straight out of the OCaml library manual, and it's about building a weak hash table — like a hash table but the entries can just… ghost you when nobody's looking 👻. Sit down, grab a strawberry 🍓, we're doing this.

---

🌸 NAME 🌸

Ephemeron.Kn.MakeSeeded — the functor that builds you an implementation of a weak hash table. that's it, that's the vibe 🫶

---

🦋 Module 🦋

Module Ephemeron.Kn.MakeSeeded

like, that's the whole module path. iconic, no notes.

---

✨ Documentation ✨

🎀 the module itself

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

So the way this works: MakeSeeded is a functor that builds you an implementation of a weak hash table 💖. And the seed situation? It's basically the same energy as the seed in Hashtbl.MakeSeeded — same idea, same family, iykyk.

Parameters (the one thing you gotta hand it):

• "H" — of type Stdlib.Hashtbl.SeededHashedType. that's your hashing bestie, you supply it, the functor does the rest 🔥

---

👑 the types it makes

• type key — your key type, slaying as always
• type !'a t — the actual table type, parameterized by 'a. note the ! — that's the variance marker doing main character energy ✨

---

💅 the functions bestie, all of them

• val create : ?random:bool -> int -> 'a t — makes you a fresh new table, optionally with the ?random flag, sized by that int 🌈
• val clear : 'a t -> unit — wipes it. gone. empty. no cap.
• val reset : 'a t -> unit — the other reset-flavored one, lowkey different from clear, both unit-returning 🧚
• val copy : 'a t -> 'a t — dupe it, twin it, give you a whole new table 💖
• val add : 'a t -> key -> 'a -> unit — put a binding in. key in, value in, done 🎀
• val remove : 'a t -> key -> unit — yeet that binding out by its key
• val find : 'a t -> key -> 'a — get the value for a key. note: returns 'a, not an option, so like… be normal about it 🙈
• val find_opt : 'a t -> key -> 'a option — the polite version, hands you 'a option so you can handle the nothingness gracefully 🦋
• val find_all : 'a t -> key -> 'a list — all the values for that key, in a 'a list. yes queen, plural 🌸
• val replace : 'a t -> key -> 'a -> unit — swap that binding out for a new value, clean and simple
• val mem : 'a t -> key -> bool — is this key in here or not, bool, that's the whole story 💀
• val length : 'a t -> int — how many you got, as an int
• val stats : 'a t -> Hashtbl.statistics — hands you back Hashtbl.statistics, the full report card ⭐
• val add_seq : 'a t -> (key * 'a) Seq.t -> unit — feeds a whole (key * 'a) Seq.t of pairs into the table, one by one, slay
• val replace_seq : 'a t -> (key * 'a) Seq.t -> unit — same sequence energy, but replaces as it goes 👑
• val of_seq : (key * 'a) Seq.t -> 'a t — builds you a whole new table from a (key * 'a) Seq.t. chef's kiss, table out of thin air 🔥

---

🧹 the two special ones

• val clean : 'a t -> unit — removes all dead bindings. and girl, don't stress about calling it: this happens automatically during automatic resizing anyway 🫶 so it's giving "optional maintenance, but make it cute".
• val stats_alive : 'a t -> Hashtbl.statistics — same as Hashtbl.SeededS.stats (yes, exactly that one) but it only counts the alive bindings. the dead ones get filtered out of the census 💀✨

⚠️ quick vibe check: this whole thing is a weak hash table — bindings can disappear when the GC decides they're not the moment anymore. that's not a bug, that's the entire point. don't come for me when find doesn't find something you "definitely added", bestie 😭

---

and that's the page!! 💖✨🎀🦋🌸💅🫶

this absolute icon of a manpage was brought to you by OCamldoc, dated 2026-06-22. go forth and hash weakly, my love 🌈👑