Ubuntu
haskell-psqueues package

haskell-psqueues 0.2.7.3-1 source package in Ubuntu

Changelog

haskell-psqueues (0.2.7.3-1) unstable; urgency=medium

  [ Ilias Tsitsimpis ]
  * Declare compliance with Debian policy 4.6.1

  [ Clint Adams ]
  * New upstream release

 -- Clint Adams <email address hidden>  Thu, 30 Jun 2022 16:03:17 -0400

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 Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
haskell-psqueues_0.2.7.3-1.dsc 2.4 KiB 250b899bd21242539ae3e8468c59d0d8474a380b6fcc1b132e875f491e24d269
haskell-psqueues_0.2.7.3.orig.tar.gz 26.7 KiB d09750ba3578d905b54d0b3a60a7b468910a60b3165e5de98bf6f4efae3ebfb2
haskell-psqueues_0.2.7.3-1.debian.tar.xz 3.3 KiB f36b7cdcc38bd0b77b1275350bf6091978b8f5239e40bc991833e5ef699bbf7e

No changes file available.

Binary packages built by this source

libghc-psqueues-dev: No summary available for libghc-psqueues-dev in ubuntu kinetic.

No description available for libghc-psqueues-dev in ubuntu kinetic.

libghc-psqueues-doc: No summary available for libghc-psqueues-doc in ubuntu kinetic.

No description available for libghc-psqueues-doc in ubuntu kinetic.

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.