Package1.5.0.0Data Structures
pqueue
Reliable, persistent, fast priority queues.
- Version1.5.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.5.0.0
- Sourcehackage.haskell.org/package/pqueue-1.5.0.0
Modules
4 modules- Data.PQueue.Max46General purpose priority queue, supporting view-maximum operations. An amortized running time is given for each operation, with n referring
- Data.PQueue.Min47General purpose priority queue, supporting extract-minimum operations. An amortized running time is given for each operation, with n refe…
- Data.PQueue.Prio.Max73General purpose priority queue.
- Data.PQueue.Prio.Min75General purpose priority queue.
Description
A fast, reliable priority queue implementation based on a binomial heap.
Depends on
3 packages- base-4.20.2.0with GHC
- deepseq-1.5.0.0with GHC
- indexed-traversable-0.1.4in this set