sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page
Official release 4.14.5
Install
dune-project
Dependency
Authors
Maintainers
Sources
ocaml_4.14.5.tar.gz
sha256=608c30e5b97fc4568741db8e5e674a5a081ef08a3c4d17172deb1dc6c8825037
doc/stdlib/Stdlib/Ephemeron/K1/Make/index.html
Module K1.MakeSource
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.
Parameters
module H : Hashtbl.HashedTypeSignature
remove all dead bindings. Done automatically during automatic resizing.
same as Hashtbl.SeededS.stats but only count the alive bindings
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page