module type S =
Ephemeron.K2.Make. These hash tables are weak in the keys. If all the keys of a binding are alive the binding is kept, but if one of the keys of the binding is dead then the binding is removed.
mem h kis true, a subsequent
find h kmay raise
Not_foundbecause the garbage collector can run between the two.
Moreover, the table shouldn't be modified during a call to
filter_map_inplace in this case.
val clean :
'a t -> unit
val stats_alive :
'a t -> Hashtbl.statistics
Hashtbl.SeededS.statsbut only count the alive bindings