package ocaml-base-compiler
Official release 4.10.2
Install
Dune Dependency
Authors
Maintainers
Sources
4.10.2.tar.gz
sha256=7aa26e0d70f36f0338df92cf5aaeb2704f3443bfe910a3d02a5dca9162f1d866
doc/stdlib/Stdlib/Ephemeron/K1/Make/index.html
Module K1.Make
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.HashedType
Signature
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
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page