package lwt

You can search for identifiers within the package.

in-package search v0.2.0

Promises and event-driven I/O

Install

Dune Dependency

github.com Readme MIT License Edit opam file Versions (25)

Authors

Maintainers

Anton Bachin

Sources

4.5.0.tar.gz

sha256=e07d845cd8b105802d975e9d09deee09dcfadbb66d2455d81f09608e42786186

md5=1b2fa7df39a70be1925acdabb8b3f8aa

doc/lwt/Lwt_pqueue/index.html

Module `Lwt_pqueue`

Functional priority queues (deprecated).

A priority queue maintains, in the abstract sense, a set of elements in order, and supports fast lookup and removal of the first ("minimum") element. This is used in Lwt for organizing threads that are waiting for timeouts.

The priority queues in this module preserve "duplicates": elements that compare equal in their order.

deprecated
This module is an internal implementation detail of Lwt, and may be removed from the API at some point in the future. For alternatives, see, for example: Heaps by Jean-Cristophe Filliatre, containers, Batteries, or psq.

module type OrderedType = sig ... end

Signature pairing an element type with an ordering function.

module type S = sig ... end

Signature of priority queues.

module Make (Ord : OrderedType) : S with type elt = Ord.t

Generates priority queue types from ordered types.