Package1.7.0.0Data Structures
pqueue
Reliable, persistent, fast priority queues.
- Version1.7.0.0
- CategoryData Structures
- LicenceBSD-3-Clause
- AuthorLouis Wasserman
- MaintainerLennart Spitzner <hexagoxel@
hexagoxel. de>, Louis Wasserman <wasserman. louis@ gmail. com>, konsumlamm <konsumlamm@ gmail. com>, David Feuer <David. Feuer@ gmail. com> - Homepagegithub.
com/ lspitzner/ pqueue - Pinned byhackage pqueue 1.
7. 0. 0 - Sourcepqueue-1.
7. 0. 0 on Hackage
Modules
- Data.PQueue.MaxGeneral purpose priority queue, supporting view-maximum operations. An amortized running time is given for each operation, with n referring
- Data.PQueue.MinGeneral purpose priority queue, supporting extract-minimum operations. An amortized running time is given for each operation, with n refe…
- Data.PQueue.Prio.MaxGeneral purpose priority queue.
- Data.PQueue.Prio.MinGeneral purpose priority queue.
Description
A fast, reliable priority queue implementation based on a binomial heap.
Depends on
3 packages- base-4.22.0.0with GHC
- deepseq-1.5.1.0with GHC
- indexed-traversable-0.1.5in this set