Data.Queue.PQueue

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.

Documentation

data PQueue e

Instances

Show e => Show (PQueue e)

Ord e => Monoid (PQueue e)

Ord e => IQueue (PQueue e)

drawQueue :: Show e => PQueue e -> String