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.0.tbz
sha256=50aa6aa6767d3fe1875e35c69e4b1d92346a5f3a0349ac065f2efce6378c89c3
sha512=58736c04b4c5f11165fc04b7b1ffe7183852e994a3617cebc7ecaa6e88244b583712c3d04e5f82bc52241317b71c8c3262d188a6c8f398a3f7813c75a8fc52dd
doc/index.html
miou
API
Library miou
Miou
Miou_fmt
Miou_gen
Miou_logs
Miou_pqueue
This 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_queue
Miou_sequence
Mutable sequence of elements.Miou_state
Miou_vector
Vectors (aka resizable arrays, growing arrays, dynamic arrays, etc.)
Library miou.backoff
Miou_backoff
Randomized exponential backoff mechanism.
Library miou.sync
Library miou.unix
Miou_bitv
This 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_poll
A direct binding ofpoll(2)
.Miou_poll_config
Miou_unix
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page