Ephemeron.K1.MakeSeeded(3)

πŸŽ€ NAME πŸŽ€

okay so this is the OCaml library manual page for Ephemeron.K1.MakeSeeded(3) β€” yes, title and manual name folded right in here, bestie πŸ’–. The official NAME line is giving:

  • Ephemeron.K1.MakeSeeded β€” Functor building an implementation of a weak hash table.

🧚 MODULE 🧚

The module is Ephemeron.K1.MakeSeeded, and that's the whole module section, periodt 🫢.

πŸ’– DOCUMENTATION πŸ’–

Here's the functor signature, exactly as it appears, because we are not about to mess with your types:

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

This functor builds an implementation of a weak hash table β€” iconic behavior ✨. The seed is similar to the one of Hashtbl.MakeSeeded 🌱.

🌈 Parameters 🌈

  • H β€” its type is Stdlib.Hashtbl.SeededHashedType πŸ’….

Then the types, with zero edits:

  • type key β€” the key type, no cap πŸŽ€.
  • type !'a t β€” the table type, !'a and all, exactly like that πŸ‘‘.

And now the values, in the original order, every signature preserved:

  • val create : ?random:bool -> int -> 'a t β€” this is the create signature, ?random:bool included πŸ’–.
  • val clear : 'a t -> unit β€” clear signature, exact ✨.
  • val reset : 'a t -> unit β€” reset signature, exact πŸŽ€.
  • val copy : 'a t -> 'a t β€” copy signature, exact πŸ¦‹.
  • val add : 'a t -> key -> 'a -> unit β€” add signature, exact 🌸.
  • val remove : 'a t -> key -> unit β€” remove signature, exact πŸ’….
  • val find : 'a t -> key -> 'a β€” find signature, exact 🫢.
  • val find_opt : 'a t -> key -> 'a option β€” find_opt signature, exact 😭.
  • val find_all : 'a t -> key -> 'a list β€” find_all signature, exact πŸ”₯.
  • val replace : 'a t -> key -> 'a -> unit β€” replace signature, exact πŸ‘‘.
  • val mem : 'a t -> key -> bool β€” mem signature, exact 🌈.
  • val length : 'a t -> int β€” length signature, exact ⭐.
  • val stats : 'a t -> Hashtbl.statistics β€” stats signature, exact πŸ’€.
  • val add_seq : 'a t -> (key * 'a) Seq.t -> unit β€” add_seq signature, exact πŸ™ˆ.
  • val replace_seq : 'a t -> (key * 'a) Seq.t -> unit β€” replace_seq signature, exact πŸ“.
  • val of_seq : (key * 'a) Seq.t -> 'a t β€” of_seq signature, exact 🧚.
  • 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. πŸ‘‘

source/version: OCamldoc Β· date: 2026-06-22 Β· page: Ephemeron.K1.MakeSeeded(3) β€” cute sign-off time, bestie: bye, stay seeded πŸ’…βœ¨.

πŸ“¦ where this page comes from