.TH "Ephemeron.K2.MakeSeeded" 3o 2023-09-20 OCamldoc "OCaml library" .SH NAME Ephemeron.K2.MakeSeeded \- Functor building an implementation of a weak hash table. .SH Module Module Ephemeron.K2.MakeSeeded .SH Documentation .sp Module .BI "MakeSeeded" : .B functor (H1 : Hashtbl.SeededHashedType) (H2 : Hashtbl.SeededHashedType) -> .B sig end .sp Functor building an implementation of a weak hash table\&. The seed is similar to the one of .ft B Hashtbl\&.MakeSeeded .ft R \&. .sp .B "Parameters:" .sp "H1" .B Stdlib.Hashtbl.SeededHashedType .sp "H2" .B Stdlib.Hashtbl.SeededHashedType .sp .sp .I type key .sp .sp .I type .B 'a .I t .sp .sp .I val create : .B ?random:bool -> int -> 'a t .sp .sp .I val clear : .B 'a t -> unit .sp .sp .I val reset : .B 'a t -> unit .sp .sp .I val copy : .B 'a t -> 'a t .sp .sp .I val add : .B 'a t -> key -> '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 .sp .I val find_all : .B 'a t -> key -> 'a list .sp .sp .I val replace : .B 'a t -> key -> 'a -> unit .sp .sp .I val mem : .B 'a t -> key -> bool .sp .sp .I val iter : .B (key -> 'a -> unit) -> 'a t -> unit .sp .sp .I val filter_map_inplace : .B (key -> 'a -> 'a option) -> 'a t -> unit .sp .sp .I val fold : .B (key -> 'a -> 'b -> 'b) -> .B 'a t -> 'b -> 'b .sp .sp .I val length : .B 'a t -> int .sp .sp .I val stats : .B 'a t -> Hashtbl.statistics .sp .sp .I val to_seq : .B 'a t -> (key * 'a) Seq.t .sp .sp .I val to_seq_keys : .B 'a t -> key Seq.t .sp .sp .I val to_seq_values : .B 'a t -> 'a Seq.t .sp .sp .I val add_seq : .B 'a t -> (key * 'a) Seq.t -> unit .sp .sp .I val replace_seq : .B 'a t -> (key * 'a) Seq.t -> unit .sp .sp .I val of_seq : .B (key * 'a) Seq.t -> 'a t .sp .sp .I val clean : .B 'a t -> unit .sp remove all dead bindings\&. Done automatically during automatic resizing\&. .sp .I val stats_alive : .B 'a t -> Hashtbl.statistics .sp same as .ft B Hashtbl\&.SeededS\&.stats .ft R but only count the alive bindings .sp