Description
Provides reliable, persistent, fast priority queues for Haskell. Priority queues return the most important item first, while persistence lets previous versions remain available after updates.
It is useful for schedulers, graph algorithms, simulations, search, and task ordering. It is a data-structure library and has no standalone queue service.