pqueue-mtl-1.0.2: Fully encapsulated monad transformers with queuelike functionality.Source codeContentsIndex

An efficient implementation of a priority queue.

The implementation of PQueue is based on a pairing heap, a simple and efficient implementation of a general-purpose priority queue. PQueue supports insert, merge, and peek in constant time, and extract and delete in logarithmic time.

data PQueue e Source
show/hide Instances
Read e => Read (PQueue e)
Show e => Show (PQueue e)
Ord e => Monoid (PQueue e)
Ord e => Queuelike (PQueue e) e
Produced by Haddock version 2.4.1