psqueues

Pure priority search queues

Version on this page:0.2.7.1@rev:1
LTS Haskell 13.25:0.2.7.2
Stackage Nightly 2019-06-17:0.2.7.2
Latest on Hackage:0.2.7.2

See all snapshots psqueues appears in

BSD-3-Clause licensed
Maintained by Jasper Van der Jeugt

Module documentation for 0.2.7.1

This version can be pinned in stack with:psqueues-0.2.7.1@sha256:7ee401e558e0ec0f5e7c0584d9d31fd66dc5c1ec8316bf87b064f738596a660c,4814

The psqueues package provides Priority Search Queues in three different flavors.

  • OrdPSQ k p v, which uses the Ord k instance to provide fast insertion, deletion and lookup. This implementation is based on Ralf Hinze's A Simple Implementation Technique for Priority Search Queues. Hence, it is similar to the PSQueue library, although it is considerably faster and provides a slightly different API.

  • IntPSQ p v is a far more efficient implementation. It fixes the key type to Int and uses a radix tree (like IntMap) with an additional min-heap property.

  • HashPSQ k p v is a fairly straightforward extension of IntPSQ: it simply uses the keys' hashes as indices in the IntPSQ. If there are any hash collisions, it uses an OrdPSQ to resolve those. The performance of this implementation is comparable to that of IntPSQ, but it is more widely applicable since the keys are not restricted to Int, but rather to any Hashable datatype.

Each of the three implementations provides the same API, so they can be used interchangeably. The benchmarks show how they perform relative to one another, and also compared to the other Priority Search Queue implementations on Hackage: PSQueue and fingertree-psqueue.

Typical applications of Priority Search Queues include:

  • Caches, and more specifically LRU Caches;

  • Schedulers;

  • Pathfinding algorithms, such as Dijkstra's and A*.

comments powered byDisqus