pqueue

Reliable, persistent, fast priority queues.

BSD-3-Clause licensed by Louis Wasserman

Maintained by Lennart Spitzner, Louis Wasserman, konsumlamm, David Feuer

This version can be pinned in stack with:pqueue-1.4.3.0@sha256:e75134245c2c0f76b1b0c84a6fae98b2cec83bcd270c32589c7b0ecff2d1841b,3231

Depends on 3 packages(full list with versions):

Used by 2 packages in lts-20.24(full list with versions):

A fast, reliable priority queue implementation based on a binomial heap.

For more information, see pqueue on Hackage.

Changes

Overall performance has improved greatly, especially when there are many insertions and/or merges in a row. Insertion, deletion, and merge are now worst case logarithmic, while maintaining their previous amortized bounds. (#26)
New mapMWithKey functions optimized for working in strict monads. These are used to implement the mapM and sequence methods of Traversable. (#46)
Define stimes in the Semigroup instances. (#57)
Add strict left unordered folds (foldlU', foldlWithKeyU') and monoidal unordered folds (foldMapU, foldMapWithKeyU). (#59)
New functions for adjusting and updating the min/max of a key-value priority queue in an Applicative context. (#66)
Fixed Data.PQueue.Max.map to work on MaxQueues. (#76)

Remove/replace buggy insertBehind implementation.

The existing implementation did not always insert behind. As a fix, the function was removed from Data.PQueue.Max/Min and was rewritten with a O(n) complexity (!) for Data.PQueue.Prio.Max/Min.
Adapt for ghc-8.4, based on the ghc-8.4.1-alpha1 release
Drop support for ghc<7.4

Fix documentation errors
- complexity on toList, toListU
- PQueue.Prio.Max had “ascending” instead of “descending” in some places

Add function insertBehind as a slight variation of insert which differs in behaviour for elements the compare equal.