pqueue

Reliable, persistent, fast priority queues.

Version on this page:1.2.1@rev:1
LTS Haskell 22.34:1.5.0.0@rev:2
Stackage Nightly 2024-09-12:1.5.0.0@rev:2
Latest on Hackage:1.5.0.0@rev:2

See all snapshots pqueue appears in

BSD-3-Clause licensed by Louis Wasserman
Maintained by Louis Wasserman
This version can be pinned in stack with:pqueue-1.2.1@sha256:ea1de2ab89c2b8b16eb189910b568409e2a5b4af283cf19e179a6fd95fe15fa3,994

Module documentation for 1.2.1

  • Data
    • Data.PQueue
      • Data.PQueue.Max
      • Data.PQueue.Min
      • Data.PQueue.Prio
        • Data.PQueue.Prio.Max
        • Data.PQueue.Prio.Min
Depends on 2 packages(full list with versions):
base, deepseq
Used by 1 package in lts-0.7(full list with versions):
kdt

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