package ocaml-base-compiler
 sectionYPositions = computeSectionYPositions($el), 10)"
  x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
  >
  
  
On This Page
  
  
  Official release 4.13.0
Install
    
    dune-project
 Dependency
Authors
Maintainers
Sources
  
    
      4.13.0.tar.gz
    
    
        
    
  
  
  
    
  
        sha256=d3eaf17fcd8722827ae15c560a419ee52cf7e066f1d6cb80df621bfd3a17d61c
    
    
  doc/stdlib/Stdlib/Ephemeron/K2/Make/index.html
Module K2.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 H1 : Hashtbl.HashedTypemodule H2 : Hashtbl.HashedTypeSignature
val clean : 'a t -> unitremove all dead bindings. Done automatically during automatic resizing.
val stats_alive : 'a t -> Hashtbl.statisticssame as Hashtbl.SeededS.stats but only count the alive bindings
 sectionYPositions = computeSectionYPositions($el), 10)"
  x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
  >
  
  
  On This Page