pqueue

Reliable, persistent, fast priority queues.

Version on this page:1.3.2.2
LTS Haskell 21.23:1.4.3.0
Stackage Nightly 2023-12-07:1.5.0.0@rev:1
Latest on Hackage:1.5.0.0@rev:1

See all snapshots pqueue appears in

BSD-3-Clause licensed by Louis Wasserman
Maintained by Lennart Spitzner <lsp@informatik.uni-kiel.de> Louis Wasserman
This version can be pinned in stack with:pqueue-1.3.2.2@sha256:4820d3c02aa3301c91070e07f8e60bd9738d15be8efe5b79b6c7ab117354cecb,1938

Module documentation for 1.3.2.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.2 – 2017-03-12

  • Add test-suite from darcs repository for pqueue-1.0.1.

1.3.2.1 – 2017-03-11

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

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
A service provided by FP Complete