haskell-psqueues 0.2.7.2-1build1 source package in Ubuntu

Changelog

haskell-psqueues (0.2.7.2-1build1) eoan; urgency=medium

  * Rebuild against new GHC abi.

 -- Gianfranco Costamagna <email address hidden>  Tue, 06 Aug 2019 09:01:08 +0200

Upload details

Uploaded by:
Gianfranco Costamagna on 2019-08-06
Uploaded to:
Eoan
Original maintainer:
Debian Haskell Group
Architectures:
any all
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Focal release on 2019-10-18 universe misc
Eoan release on 2019-09-09 universe misc

Downloads

File Size SHA-256 Checksum
haskell-psqueues_0.2.7.2.orig.tar.gz 26.8 KiB 26263b555d943f9b18bbebda6a090848fdba3c1b403a9b7c848f6bac99e893f9
haskell-psqueues_0.2.7.2-1build1.debian.tar.xz 3.3 KiB 4c1776642a8b750454ac8c3ff6f06d4685170b28436ce582b0fb68d8a1ff47ce
haskell-psqueues_0.2.7.2-1build1.dsc 2.4 KiB 9192fee47d03384081544ad2795c02cd47aab4673fde85dd119ce77006c6bc2b

View changes file

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: Pure priority search queues; documentation

 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 the documentation for a library for the Haskell
 programming language.
 See http://www.haskell.org/ for more information on Haskell.

libghc-psqueues-prof: Pure priority search queues; profiling libraries

 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, compiled
 for profiling. See http://www.haskell.org/ for more information on Haskell.