Ephemeron.Ge...le.MakeSeeded(3)

💖 NAME 💖

okay so bestie, welcome to the OCaml library manual — this page is Ephemeron.Ge...le.MakeSeeded(3) (yes the title got truncated by the terminal, we love a dramatic ellipsis 💀) and it's about:

Ephemeron.GenHashTable.MakeSeeded — a functor that builds you an implementation of a hash table, one that uses the container for keeping the information you gave it. that's the whole name, that's the whole vibe. ✨

---

🦋 Module 🦋

Module Ephemeron.GenHashTable.MakeSeeded

literally the module we're talking about, no notes 💅

---

✨ Documentation ✨

🎀 Module MakeSeeded 🎀

here's the signature, copied exactly because I do not play about types:

Module MakeSeeded
 : functor (H : sig end) -> sig end

so what is it? it's a functor building an implementation of a hash table that uses the container for keeping the information given. that's the official description, she ate and left no crumbs 🫶

💅 Parameters 💅

• "H" — its type is sig end. that's it. that's the parameter. a whole parameter and it's giving absolutely nothing (affectionate) 🙈

🍓 Types 🍓

• type key — the key type. iconic. 💜
• type 'a t — the table type itself, parameterised over 'a. main character energy fr fr 🌟

🌈 Values 🌈

no descriptions in the source for these, so I'm just handing you the signatures exactly as they are — take them, they're yours, don't lose them:

• val create : ?random:bool -> int -> 'a t — here's your constructor, with an optional ?random:bool and an int 💖
• val clear : 'a t -> unit — clear, unit-returning, as advertised 🧚
• val reset : 'a t -> unit — reset, also unit-returning ✨
• val copy : 'a t -> 'a t — copy gives you another 'a t 🎀
• val add : 'a t -> key -> 'a -> unit — add takes the table, a key, a 'a, returns unit 🌸
• val remove : 'a t -> key -> unit — remove takes the table and a key, returns unit 💀
• val find : 'a t -> key -> 'a — find gives you back a 'a 🦋
• val find_opt : 'a t -> key -> 'a option — the option-flavoured one: 'a option 👑
• val find_all : 'a t -> key -> 'a list — find_all, and yes it's a 'a list 🌈
• val replace : 'a t -> key -> 'a -> unit — replace takes table, key, 'a, and returns unit ⭐
• val mem : 'a t -> key -> bool — mem and it's a bool, obviously 💅
• val iter : (key -> 'a -> unit) -> 'a t -> unit — iter with that function argument (key -> 'a -> unit) and then the table, returns unit 🔥
• val filter_map_inplace : (key -> 'a -> 'a option) -> 'a t -> unit — filter_map_inplace, function goes (key -> 'a -> 'a option), then the table, returns unit 🍓
• val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b — fold, with (key -> 'a -> 'b -> 'b), the table, a 'b, and a 'b comes back out 🧚
• val length : 'a t -> int — length, returns an int 💜
• val stats : 'a t -> Hashtbl.statistics — stats, returns Hashtbl.statistics ✨
• val to_seq : 'a t -> (key * 'a) Seq.t — to_seq, gives you (key * 'a) Seq.t 🌸
• val to_seq_keys : 'a t -> key Seq.t — to_seq_keys, gives you key Seq.t 🎀
• val to_seq_values : 'a t -> 'a Seq.t — to_seq_values, gives you 'a Seq.t 🦋
• val add_seq : 'a t -> (key * 'a) Seq.t -> unit — add_seq takes a table and a (key * 'a) Seq.t, returns unit 👑
• val replace_seq : 'a t -> (key * 'a) Seq.t -> unit — replace_seq, same shape: table plus (key * 'a) Seq.t, returns unit 🌈
• val of_seq : (key * 'a) Seq.t -> 'a t — of_seq builds you an 'a t out of a (key * 'a) Seq.t ⭐

🔥 The two with actual notes 🔥

• val clean : 'a t -> unit — remove all dead bindings. and lowkey important: this is done automatically during automatic resizing. so you don't have to, but you can. 💅
• val stats_alive : 'a t -> Hashtbl.statistics — same as Hashtbl.SeededS.stats but it only counts the alive bindings. undead bindings do not get a vote 🙈

---

ngl bestie, if you're reaching for clean manually, the resize was gonna handle it anyway — but you do you, queen 👑

---

that's the whole page!! this little gift was brought to you by OCamldoc, dated 2026-09-24, filed under Ephemeron.Ge...le.MakeSeeded(3) in the OCaml library manual. go forth and hash, bestie 🫶💖✨