package ocaml-base-compiler
Official release 4.14.2
Install
Dune Dependency
Authors
Maintainers
Sources
4.14.2.tar.gz
sha256=c2d706432f93ba85bd3383fa451d74543c32a4e84a1afaf3e8ace18f7f097b43
doc/stdlib/Stdlib/Ephemeron/K2/Make/index.html
Module K2.Make
Source
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 H1 : Hashtbl.HashedType
module H2 : Hashtbl.HashedType
Signature
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