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.5.1.tbz
sha256=129339f4a60fc9579ee118d693056caf00be3b68c7a52ea974b91b1f25e4dd63
sha512=5603847cce524c04e9a5dca268fc1050fbf2e4019b0e7fa24ee3d4941c4dce38e17f49b39c7f812634d1ab9b4d0cb02c5103c8c0c644c174df48074763801ffd
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
Miou_bitvThis module implements bit vectors, as an abstract datatypet. Since bit vectors are particular cases of arrays, this module provides the same operations as moduleArray. It also provides bitwise operations and conversions to/from integer types.Miou_pollA direct binding ofpoll(2).Miou_poll_configMiou_unix
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page