Prioqueue v0.2.0 Prioqueue.Implementations.SkewHeap View Source
An implementation of a Priority Queue built on top of a Skew Heap.
A Skew Heap is very simple, which means that this implementation is also quite concise: All operations are built on top of a ‘combine’ procedure.
To improve efficiency, the internal heap is stored as tuples representing tree nodes (rather than structs representing tree nodes)
More information about Skew Heaps can be found in Issue #16 of the Monad.Reader.