haskell-psqueues 0.2.4.0-1 source package in Ubuntu
Changelog
haskell-psqueues (0.2.4.0-1) unstable; urgency=medium
[ Ilias Tsitsimpis ]
* Change Priority to optional. Since Debian Policy version 4.0.1,
priority extra has been deprecated.
* Use the HTTPS form of the copyright-format URL
* Modify d/watch and Source field in d/copyright to use HTTPS
* Declare compliance with Debian policy 4.1.1
[ Clint Adams ]
* New upstream release
-- Clint Adams <email address hidden> Fri, 24 Nov 2017 16:07:47 -0500
Upload details
- Uploaded by:
- Debian Haskell Group
- Uploaded to:
- Sid
- Original maintainer:
- Debian Haskell Group
- Architectures:
- any all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Bionic | release | universe | misc |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| haskell-psqueues_0.2.4.0-1.dsc | 2.5 KiB | 09418ede57bb8a13a33c9c202d834da12d8b860f8bb2a391adcbe4dae28d08cd |
| haskell-psqueues_0.2.4.0.orig.tar.gz | 26.5 KiB | 491a345401175c4c23408312a9e624331dcc1081bc8e33637838246eaba972d1 |
| haskell-psqueues_0.2.4.0-1.debian.tar.xz | 3.1 KiB | 7e7e0d4689b1693d64cb7e1252315f6d5c80f26ba8b65f25ba85953e8b65ff2f |
Available diffs
- diff from 0.2.3.0-1 to 0.2.4.0-1 (4.2 KiB)
No changes file available.
Binary packages built by this source
- libghc-psqueues-dev: Pure priority search queues
This 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.
.
Typical applications of Priority Search Queues include:
.
* Caches, and more specifically LRU Caches;
.
* Schedulers;
.
* Pathfinding algorithms, such as Dijkstra's and A*.
.
This package provides a library for the Haskell programming language.
See http://www.haskell. org/ for more information on Haskell.
- libghc-psqueues-doc: No summary available for libghc-psqueues-doc in ubuntu cosmic.
No description available for libghc-psqueues-doc in ubuntu cosmic.
- libghc-psqueues-prof: No summary available for libghc-psqueues-prof in ubuntu cosmic.
No description available for libghc-
psqueues- prof in ubuntu cosmic.
