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.10.1.tbz
sha256=56ea30ffd0924d941c8afdb96749252cc4af61465d392178c70475a7859284d5
sha512=42edbb87b4f9c3a0e67e85aebf037e8b6835eae7c8731a7e5caeb6d17be488137bc3bd5c4a375cd03f8eeac2f9d71e24ff0706b9877cc1dc6132666db1fa31d2
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_traceMiou_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.runtime_events
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