MoreLabels.Hashtbl.MakeSeeded(3)

💖 NAME 💖

okay so bestie, this is the MoreLabels.Hashtbl.MakeSeeded(3) page from the OCaml library, and it's literally the functor that builds an implementation of the hashtable structure. slay. 💅

---

🧩 MODULE 🧩

The module in question is MoreLabels.Hashtbl.MakeSeeded. iconic. ✨

---

📚 DOCUMENTATION 📚

🌸 Module MakeSeeded 🌸

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

okay so this is the functor that builds an implementation of the hashtable structure. the functor Hashtbl.MakeSeeded returns a structure containing a type key of keys and a type 'a t of hash tables associating data of type 'a to keys of type key. the operations perform similarly to those of the generic interface, but they use the seeded hashing and equality functions specified in the functor argument H instead of generic equality and hashing. the result structure's create operation supports the optional ~random parameter and returns randomized hash tables if ~random:true is passed or if randomization is globally on (see MoreLabels.Hashtbl.randomize). 🫶

Since 4.00

💅 Parameters 💅

• "H" — MoreLabels.Hashtbl.SeededHashedType

✨ Signatures ✨

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:key -> data:'a -> unit
• val remove : 'a t -> key -> unit
• val find_and_remove : 'a t -> key -> 'a option — Since 5.5
• val find : 'a t -> key -> 'a
• val find_opt : 'a t -> key -> 'a option — Since 4.05
• val find_all : 'a t -> key -> 'a list
• val replace : 'a t -> key:key -> data:'a -> unit
• val find_and_replace : 'a t -> key:key -> data:'a -> 'a option — Since 5.5
• val mem : 'a t -> key -> bool
• val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit
• val filter_map_inplace : f:(key:key -> data:'a -> 'a option) -> 'a t -> unit — Since 4.03
• val fold : f:(key:key -> data:'a -> 'acc -> 'acc) -> 'a t -> init:'acc -> 'acc
• val length : 'a t -> int
• val stats : 'a t -> MoreLabels.Hashtbl.statistics
• val to_seq : 'a t -> (key * 'a) Seq.t — Since 4.07
• val to_seq_keys : 'a t -> key Seq.t — Since 4.07
• val to_seq_values : 'a t -> 'a Seq.t — Since 4.07
• val add_seq : 'a t -> (key * 'a) Seq.t -> unit — Since 4.07
• val replace_seq : 'a t -> (key * 'a) Seq.t -> unit — Since 4.07
• val of_seq : (key * 'a) Seq.t -> 'a t — Since 4.07

---

mwah 💋 — this page is from OCamldoc, dated 2026-06-22, and yes bestie, it's the MoreLabels.Hashtbl.MakeSeeded(3) manual page. periodt. 💅