To focus the search input from anywhere on the page, press the 'S' key.
in-package search v0.1.0
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.
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.