package miou
 sectionYPositions = computeSectionYPositions($el), 10)"
  x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
  >
  
  
On This Page
  
  
  Composable concurrency primitives for OCaml
Install
    
    dune-project
 Dependency
Authors
Maintainers
Sources
  
    
      miou-0.3.1.tbz
    
    
        
    
  
  
  
    
  
  
    
  
        sha256=2b7a2d52ec0599156b6e7c586190cc99dd964d840799763f6f2407bb83e39471
    
    
  sha512=eba70cb4c5484ef4c5fce522b106d32f20482fe55a9252c82cf7b85d69cd1359d97a9d7279f39c05f3b2365d87cdfec39fbe2a0780167506d1eaeaf618227895
    
    
  doc/index.html
miou
API
Library miou
MiouMiou_fmtMiou_genMiou_logsMiou_pqueueThis module implements a priority queue based on a minimal binary heap. The heap is implemented as a dynamic array, taken from the module vector.Miou_queueMiou_sequenceMutable sequence of elements.Miou_stateMiou_vectorVectors (aka resizable arrays, growing arrays, dynamic arrays, etc.)
Library miou.backoff
Miou_backoffRandomized exponential backoff mechanism.
Library miou.sync
Library miou.unix
 sectionYPositions = computeSectionYPositions($el), 10)"
  x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
  >
  
  
  On This Page