.TH "MoreLabels.Hashtbl.Make" 3o 2023-09-18 OCamldoc "OCaml library" .SH NAME MoreLabels.Hashtbl.Make \- Functor building an implementation of the hashtable structure. .SH Module Module MoreLabels.Hashtbl.Make .SH Documentation .sp Module .BI "Make" : .B functor (H : HashedType) -> sig end .sp Functor building an implementation of the hashtable structure\&. The functor .ft B Hashtbl\&.Make .ft R returns a structure containing a type .ft B key .ft R of keys and a type .ft B \&'a t .ft R of hash tables associating data of type .ft B \&'a .ft R to keys of type .ft B key .ft R \&. The operations perform similarly to those of the generic interface, but use the hashing and equality functions specified in the functor argument .ft B H .ft R instead of generic equality and hashing\&. Since the hash function is not seeded, the .ft B create .ft R operation of the result structure always returns non\-randomized hash tables\&. .sp .B "Parameters:" .sp "H" .B MoreLabels.Hashtbl.HashedType .sp .sp .I type key .sp .sp .I type .B 'a .I t .sp .sp .I val create : .B int -> 'a t .sp .sp .I val clear : .B 'a t -> unit .sp .sp .I val reset : .B 'a t -> unit .sp .B "Since" 4.00.0 .sp .I val copy : .B 'a t -> 'a t .sp .sp .I val add : .B 'a t -> key:key -> data:'a -> unit .sp .sp .I val remove : .B 'a t -> key -> unit .sp .sp .I val find : .B 'a t -> key -> 'a .sp .sp .I val find_opt : .B 'a t -> key -> 'a option .sp .B "Since" 4.05.0 .sp .I val find_all : .B 'a t -> key -> 'a list .sp .sp .I val replace : .B 'a t -> key:key -> data:'a -> unit .sp .sp .I val mem : .B 'a t -> key -> bool .sp .sp .I val iter : .B f:(key:key -> data:'a -> unit) -> .B 'a t -> unit .sp .sp .I val filter_map_inplace : .B f:(key:key -> data:'a -> 'a option) -> .B 'a t -> unit .sp .B "Since" 4.03.0 .sp .I val fold : .B f:(key:key -> data:'a -> 'b -> 'b) -> .B 'a t -> init:'b -> 'b .sp .sp .I val length : .B 'a t -> int .sp .sp .I val stats : .B 'a t -> MoreLabels.Hashtbl.statistics .sp .B "Since" 4.00.0 .sp .I val to_seq : .B 'a t -> (key * 'a) Seq.t .sp .B "Since" 4.07 .sp .I val to_seq_keys : .B 'a t -> key Seq.t .sp .B "Since" 4.07 .sp .I val to_seq_values : .B 'a t -> 'a Seq.t .sp .B "Since" 4.07 .sp .I val add_seq : .B 'a t -> .B (key * 'a) Seq.t -> unit .sp .B "Since" 4.07 .sp .I val replace_seq : .B 'a t -> .B (key * 'a) Seq.t -> unit .sp .B "Since" 4.07 .sp .I val of_seq : .B (key * 'a) Seq.t -> 'a t .sp .B "Since" 4.07 .sp