psqueues: Pure priority search queues

[ bsd3, data-structures, library ] [ Propose Tags ]

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*.

Downloads

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0.0, 0.1.0.1, 0.1.1.0, 0.2.0.0, 0.2.0.1, 0.2.0.2, 0.2.0.3, 0.2.1.0, 0.2.2.0, 0.2.2.1, 0.2.2.2, 0.2.2.3, 0.2.3.0, 0.2.4.0, 0.2.5.0, 0.2.6.0, 0.2.7.0, 0.2.7.1, 0.2.7.2, 0.2.7.3, 0.2.8.0
Change log CHANGELOG
Dependencies base (>=4.2 && <5), deepseq (>=1.2 && <1.5), ghc-prim, hashable (>=1.1.2.3 && <1.3) [details]
License BSD-3-Clause
Author
Maintainer Jasper Van der Jeugt <jaspervdj@gmail.com>
Revised Revision 1 made by HerbertValerioRiedel at 2019-01-08T18:52:42Z
Category Data Structures
Bug tracker https://github.com/jaspervdj/psqueues/issues
Source repo head: git clone http://github.com/jaspervdj/psqueues.git
Uploaded by JasperVanDerJeugt at 2018-04-30T14:30:17Z
Distributions Arch:0.2.8.0, Debian:0.2.7.2, Fedora:0.2.7.3, LTSHaskell:0.2.8.0, NixOS:0.2.8.0, Stackage:0.2.8.0, openSUSE:0.2.8.0
Reverse Dependencies 37 direct, 3566 indirect [details]
Downloads 70064 total (288 in the last 30 days)
Rating 2.25 (votes: 2) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2018-04-30 [all 1 reports]