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.4.tbz
sha256=78ea4a53438b025ce1ec1b509635d0cdc42369b07afb7d39daada94c66d341df
sha512=015dc453ac1155743861cbdb6d1e99d91f17a6adaf3119d95dcb99faf3f3247a362a425216df3f0c153ae30c2302547dd9b9f65006de4ad09b03b05996cc0ea7
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.bitv
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.
Library miou.sync
Library miou.unix
Miou_pollA direct binding ofpoll(2).Miou_poll_configMiou_unix
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page