package miou

  1. Overview
  2. Docs
Composable concurrency primitives for OCaml

Install

dune-project
 Dependency

Authors

Maintainers

Sources

miou-0.5.4.tbz
sha256=78ea4a53438b025ce1ec1b509635d0cdc42369b07afb7d39daada94c66d341df
sha512=015dc453ac1155743861cbdb6d1e99d91f17a6adaf3119d95dcb99faf3f3247a362a425216df3f0c153ae30c2302547dd9b9f65006de4ad09b03b05996cc0ea7

doc/miou/Miou_pqueue/index.html

Module Miou_pqueueSource

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.

This is a contribution by Aymeric Walch.

Sourcemodule Make (X : sig ... end) : sig ... end