pqueue

Reliable, persistent, fast priority queues.

Version on this page:1.3.2
LTS Haskell 24.17:1.5.0.0@rev:3
Stackage Nightly 2025-10-31:1.6.0.0
Latest on Hackage:1.6.0.0

See all snapshots pqueue appears in

BSD-3-Clause licensed by Louis Wasserman
Maintained by Lennart Spitzner <[email protected]> Louis Wasserman
This version can be pinned in stack with:pqueue-1.3.2@sha256:f4a65f76a28ced1f1e3eac836a50de1b83eaa1f17316ee2e312353267c0a1367,1445

Module documentation for 1.3.2

Depends on 2 packages(full list with versions):
base, deepseq

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

Changes

Revision history for pqueue

1.3.2 – 2016-09-28

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

1.3.1.1 – 2016-05-21

  • Ensure compatibility with ghc-8
  • Minor internal refactors

1.3.1 – 2015-10-03

  • Add Monoid instance for MaxPQueue

1.3.0 – 2015-06-23

  • Lennart Spitzner starts co-maintaining
  • new git repository at github.com:lspitzner/pqueue
  • Ensure compatibility with ghc-7.10