package ocaml-base-compiler
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page
First release candidate of OCaml 4.14.2
Install
dune-project
Dependency
Authors
Maintainers
Sources
4.14.2-rc1.tar.gz
sha256=0779d4871c5a3be4ae24dc2f5a49ec5463973f951a11953a7da6089e02587a37
doc/stdlib/Stdlib/Ephemeron/Kn/Make/index.html
Module Kn.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