MoreLabels.Hashtbl.Make(3)

💖 MoreLabels.Hashtbl.Make(3) 💖

okay so bestie, welcome to the OCaml library corner of the manual where we're about to talk about everyone's favorite ✨vibes✨: hash tables. this is MoreLabels.Hashtbl.Make, and honestly? she's giving custom-hashing main character energy. let's get into it 🫶

---

🌸 NAME 🌸

MoreLabels.Hashtbl.Make — a functor that builds you an implementation of the hashtable structure. periodt.

---

🎀 Module 🎀

the module is literally MoreLabels.Hashtbl.Make. iconic, no notes.

---

💅 Documentation 💅

✨ Module Make ✨

Module Make
 : (H : HashedType) -> sig end

so what is she, exactly? Make is a functor that builds an implementation of the hashtable structure 🔥. the functor Hashtbl.Make hands you back a structure containing a type key (that's your keys, bestie) and a type 'a t (those are your hash tables, which associate data of type 'a to keys of type key).

the operations work similarly to the ones in the generic interface — but 👏 they use the hashing and equality functions you specified in the functor argument H instead of the generic equality and hashing. custom behavior, your rules, iykyk 💅.

🚨 important caveat, do NOT skip: since the hash function is not seeded, the create operation of the result structure always returns non-randomized hash tables. like, literally always. no randomness, no surprise, just predictability 🌈.

🦋 Parameters 🦋

• "H" — which is MoreLabels.Hashtbl.HashedType, the whole vibe check of how your keys get hashed and compared 💜

---

👑 The Types 👑

• type key — your key type, exactly as it sounds 🎀
• type !'a t — the hash table type itself, mapping 'a data to your keys ✨

---

⭐ The Values ⭐

• val create : int -> 'a t — makes you a fresh table 🌸
• val clear : 'a t -> unit — empties her out 💀
• val reset : 'a t -> unit — resets her. Since 4.00 🎀
• val copy : 'a t -> 'a t — a whole duplicate, twin energy 👯
• val add : 'a t -> key:key -> data:'a -> unit — adds a key → data pair in there 🍓
• val remove : 'a t -> key -> unit — yeets the key out 🙈
• val find_and_remove : 'a t -> key -> 'a option — finds it and removes it in one go, multitasking queen 👑. Since 5.5
• val find : 'a t -> key -> 'a — finds the value for the key 🔍
• val find_opt : 'a t -> key -> 'a option — same but wrapped in an option, so much safer vibes 🫶. Since 4.05
• val find_all : 'a t -> key -> 'a list — gives you all the values for that key, a whole list of them 💖
• val replace : 'a t -> key:key -> data:'a -> unit — swaps in new data for the key, out with the old ✨
• val find_and_replace : 'a t -> key:key -> data:'a -> 'a option — replaces and hands you back the old value (as an option) like a little souvenir 🎁. Since 5.5
• val mem : 'a t -> key -> bool — is the key in there or not, true/false, simple as 🌈
• val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit — walks every key/data pair and runs f on each 🔥
• val filter_map_inplace : f:(key:key -> data:'a -> 'a option) -> 'a t -> unit — transforms each value in place via f; a None from f means that binding doesn't survive the vibe check 💀. Since 4.03
• val fold : f:(key:key -> data:'a -> 'acc -> 'acc) -> 'a t -> init:'acc -> 'acc — folds the whole table down into one accumulated 'acc, starting from init 🧚
• val length : 'a t -> int — how many bindings she's holding, a number 💜
• val stats : 'a t -> MoreLabels.Hashtbl.statistics — the receipts: statistics about the table 📊. Since 4.00
• val to_seq : 'a t -> (key * 'a) Seq.t — turns her into a sequence of (key * 'a) pairs 🦋. Since 4.07
• val to_seq_keys : 'a t -> key Seq.t — sequence of just the keys 🔑. Since 4.07
• val to_seq_values : 'a t -> 'a Seq.t — sequence of just the values 🍓. Since 4.07
• val add_seq : 'a t -> (key * 'a) Seq.t -> unit — pours a whole sequence of pairs into the table 🌸. Since 4.07
• val replace_seq : 'a t -> (key * 'a) Seq.t -> unit — same, but with replace semantics for each pair 💅. Since 4.07
• val of_seq : (key * 'a) Seq.t -> 'a t — builds you a brand new table straight out of a sequence of pairs, chef's kiss 👑. Since 4.07

---

that's the whole page bestie, every single function accounted for, no cap 🫶💖

🌟 and that's the tea, fr fr — this was OCamldoc documentation, dated 2026-06-22. go forth and hash responsibly ✨🎀🦋