sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page
Functor building an implementation of a weak hash table
Propose the same interface as usual hash table. However since the bindings are weak, even if mem h k
is true, a subsequent find h k
may raise Not_found
because the garbage collector can run between the two.
Moreover, the table shouldn't be modified during a call to iter
. Use filter_map_inplace
in this case.
module H1 : Hashtbl.HashedType
module H2 : Hashtbl.HashedType
val create : int -> 'a t
val clear : 'a t -> unit
val reset : 'a t -> unit
val length : 'a t -> int
val stats : 'a t -> Hashtbl.statistics
val clean : 'a t -> unit
remove all dead bindings. Done automatically during automatic resizing.
val stats_alive : 'a t -> Hashtbl.statistics
same as Hashtbl.SeededS.stats
but only count the alive bindings