MoreLabels.Hashtbl.SeededS(3)

🌸 NAME 🌸

Okay bestie, welcome to MoreLabels.Hashtbl.SeededS from the OCaml library β€” this is the manual page for the output signature of the functor MoreLabels.Hashtbl.MakeSeeded. No cap, that's the whole vibe. πŸ¦‹

πŸ¦‹ Module type πŸ¦‹

Module type MoreLabels.Hashtbl.SeededS

Yep, that's the module type name, and it's serving main character energy. πŸ‘‘

✨ Documentation ✨

Module type SeededS
 = sig end

It's giving the output signature of the functor MoreLabels.Hashtbl.MakeSeeded. Since 4.00, periodt. πŸ’…

Vibe check on the members, in order:

  • type key β€” the key type is here, bestie. πŸ”‘
  • type !'a t β€” the !'a t type, and yes the ! is literally part of it. Do not come for the !. πŸ‘‘
  • val create : ?random:bool -> int -> 'a t β€” the create signature, with the optional ?random:bool, an int, and 'a t all present. ✨
  • val clear : 'a t -> unit β€” clear, returning unit. Simple, iconic. 🧚
  • val reset : 'a t -> unit β€” reset, also returning unit. Reset era, lowkey. 🌸
  • val copy : 'a t -> 'a t β€” copy, from 'a t to 'a t. Copy that. πŸ’…
  • val add : 'a t -> key:key -> data:'a -> unit β€” add, with labeled key:key and data:'a, returning unit. πŸŽ€
  • val remove : 'a t -> key -> unit β€” remove, taking a key and returning unit. Bye bestie. πŸ™ˆ
  • val find_and_remove : 'a t -> key -> 'a option β€” find_and_remove, returning 'a option. Since 5.5. πŸ”₯
  • val find : 'a t -> key -> 'a β€” find, going straight to 'a. Ngl, bold. πŸ’œ
  • val find_opt : 'a t -> key -> 'a option β€” find_opt, returning 'a option. Since 4.05. ✨
  • val find_all : 'a t -> key -> 'a list β€” find_all, returning 'a list. Collect them all, fr fr. πŸ“
  • val replace : 'a t -> key:key -> data:'a -> unit β€” replace, with labeled key:key and data:'a, returning unit. Out with the old, in with the new. πŸ’–
  • val find_and_replace : 'a t -> key:key -> data:'a -> 'a option β€” find_and_replace, with key:key, data:'a, and 'a option. Since 5.5. 🌈
  • val mem : 'a t -> key -> bool β€” mem, returning bool. Are you in or are you out? πŸ‘€
  • val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit β€” iter, with f:(key:key -> data:'a -> unit), then 'a t, then unit. πŸ¦‹
  • val filter_map_inplace : f:(key:key -> data:'a -> 'a option) -> 'a t -> unit β€” filter_map_inplace, with f:(key:key -> data:'a -> 'a option), 'a t, and unit. Since 4.03. πŸ”₯
  • val fold : f:(key:key -> data:'a -> 'acc -> 'acc) -> 'a t -> init:'acc -> 'acc β€” fold, with f:(key:key -> data:'a -> 'acc -> 'acc), 'a t, init:'acc, and 'acc. Big main character energy. πŸ‘‘
  • val length : 'a t -> int β€” length, returning int. Math girlie moment. πŸŽ€
  • val stats : 'a t -> MoreLabels.Hashtbl.statistics β€” stats, returning MoreLabels.Hashtbl.statistics, exactly. ✨
  • val to_seq : 'a t -> (key * 'a) Seq.t β€” to_seq, returning (key * 'a) Seq.t. Since 4.07. 🌸
  • val to_seq_keys : 'a t -> key Seq.t β€” to_seq_keys, returning key Seq.t. Since 4.07. πŸ”‘
  • val to_seq_values : 'a t -> 'a Seq.t β€” to_seq_values, returning 'a Seq.t. Since 4.07. πŸ’–
  • val add_seq : 'a t -> (key * 'a) Seq.t -> unit β€” add_seq, taking (key * 'a) Seq.t and returning unit. Since 4.07. πŸ¦‹
  • val replace_seq : 'a t -> (key * 'a) Seq.t -> unit β€” replace_seq, taking (key * 'a) Seq.t and returning unit. Since 4.07. 🌈
  • val of_seq : (key * 'a) Seq.t -> 'a t β€” of_seq, from (key * 'a) Seq.t to 'a t. Since 4.07. Obsessed. πŸ’…

Byeeee, bestie! 🫢 This page was brought to you by OCamldoc, dated 2026-06-22, and it's all about MoreLabels.Hashtbl.SeededS(3). Slay and stay hydrated. πŸ’–πŸŽ€

πŸ“¦ where this page comes from