MoreLabels.Hashtbl.S(3)

πŸ’… MoreLabels.Hashtbl.S(3) πŸ’…

okay so, bestie, we are deep in the OCaml library manual and this page is giving signature-only, no-drama, all-structure energy. It’s MoreLabels.Hashtbl.S(3), and the whole point is that this is the output signature of the functor MoreLabels.Hashtbl.Make. no cap. 🫢


🌸 NAME 🌸

MoreLabels.Hashtbl.S β€” the output signature of the functor MoreLabels.Hashtbl.Make. That’s the whole name section, and it ate. πŸ’…


πŸŽ€ Module type πŸŽ€

Module type   MoreLabels.Hashtbl.S

that’s the module type in question, iconic. ✨


✨ Documentation ✨

πŸ’– Module type S πŸ’–

Module type S
 = sig end

The output signature of the functor MoreLabels.Hashtbl.Make.

Here’s the whole cast, in order, with every signature exactly as written. periodt. πŸŽ€

  • type key β€” the key type, exactly as written. πŸ¦‹
  • type !'a t β€” the 'a t type, with the ! exactly where the original puts it. no notes added. ✨
  • val create : int -> 'a t β€” takes an int and returns an 'a t. that’s the signature, bestie. πŸ’–
  • val clear : 'a t -> unit β€” takes an 'a t and returns unit. 🌸
  • val reset : 'a t -> unit β€” same unit-returning energy. Since 4.00. 🫢
  • val copy : 'a t -> 'a t β€” 'a t in, 'a t out. πŸ’…
  • val add : 'a t -> key:key -> data:'a -> unit β€” takes 'a t, labelled key:key, labelled data:'a, and returns unit. πŸ’–
  • val remove : 'a t -> key -> unit β€” takes 'a t and key, returns unit. πŸŽ€
  • val find_and_remove : 'a t -> key -> 'a option β€” takes 'a t and key, returns 'a option. Since 5.5. πŸ¦‹
  • val find : 'a t -> key -> 'a β€” takes 'a t and key, returns 'a. ✨
  • val find_opt : 'a t -> key -> 'a option β€” takes 'a t and key, returns 'a option. Since 4.05. 🌸
  • val find_all : 'a t -> key -> 'a list β€” takes 'a t and key, returns 'a list. πŸ’…
  • val replace : 'a t -> key:key -> data:'a -> unit β€” takes 'a t, labelled key:key, labelled data:'a, and returns unit. πŸ’–
  • val find_and_replace : 'a t -> key:key -> data:'a -> 'a option β€” takes 'a t, labelled key:key, labelled data:'a, and returns 'a option. Since 5.5. πŸŽ€
  • val mem : 'a t -> key -> bool β€” takes 'a t and key, returns bool. πŸ¦‹
  • val iter : f:(key:key -> data:'a -> unit) -> 'a t -> unit β€” takes a function f with labelled key:key and data:'a, then an 'a t, and returns unit. ✨
  • val filter_map_inplace β€” the whole signature is a two-liner, exactly:
val filter_map_inplace : f:(key:key -> data:'a -> 'a option) -> 'a t ->
unit

Since 4.03. 🌸

  • val fold β€” another two-liner, line break and all:
val fold : f:(key:key -> data:'a -> 'acc -> 'acc) -> 'a t -> init:'acc
-> 'acc

that’s the full signature. πŸ’…

  • val length : 'a t -> int β€” takes an 'a t and returns an int. πŸ’–
  • val stats : 'a t -> MoreLabels.Hashtbl.statistics β€” takes an 'a t and returns MoreLabels.Hashtbl.statistics. Since 4.00. πŸŽ€
  • val to_seq : 'a t -> (key * 'a) Seq.t β€” takes an 'a t and returns a (key * 'a) Seq.t. Since 4.07. πŸ¦‹
  • val to_seq_keys : 'a t -> key Seq.t β€” takes an 'a t and returns a key Seq.t. Since 4.07. ✨
  • val to_seq_values : 'a t -> 'a Seq.t β€” takes an 'a t and returns an 'a Seq.t. Since 4.07. 🌸
  • val add_seq : 'a t -> (key * 'a) Seq.t -> unit β€” takes an 'a t and a (key * 'a) Seq.t, returns unit. Since 4.07. πŸ’…
  • val replace_seq : 'a t -> (key * 'a) Seq.t -> unit β€” takes an 'a t and a (key * 'a) Seq.t, returns unit. Since 4.07. πŸ’–
  • val of_seq : (key * 'a) Seq.t -> 'a t β€” takes a (key * 'a) Seq.t and returns an 'a t. Since 4.07. πŸŽ€

mwah πŸ’– β€” that’s the whole page, bestie. This cutie was brought to you by OCamldoc, dated 2026-06-22, and it’s still MoreLabels.Hashtbl.S(3) at the very end. periodt. 🫢

πŸ“¦ where this page comes from