How to Install and Uninstall libghc-psqueues-dev Package on Ubuntu 16.04 LTS (Xenial Xerus)
Last updated: December 24,2024
1. Install "libghc-psqueues-dev" package
This is a short guide on how to install libghc-psqueues-dev on Ubuntu 16.04 LTS (Xenial Xerus)
$
sudo apt update
Copied
$
sudo apt install
libghc-psqueues-dev
Copied
2. Uninstall "libghc-psqueues-dev" package
This guide covers the steps necessary to uninstall libghc-psqueues-dev on Ubuntu 16.04 LTS (Xenial Xerus):
$
sudo apt remove
libghc-psqueues-dev
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the libghc-psqueues-dev package on Ubuntu 16.04 LTS (Xenial Xerus)
Package: libghc-psqueues-dev
Priority: extra
Section: universe/haskell
Installed-Size: 1289
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Haskell Group
Architecture: amd64
Source: haskell-psqueues
Version: 0.2.0.3-1build1
Provides: libghc-psqueues-dev-0.2.0.3-78828
Depends: libghc-base-dev-4.8.2.0-0d6d1, libghc-deepseq-dev-1.4.1.1-614b6, libghc-ghc-prim-dev-0.4.0.0-6cdc8, libghc-hashable-dev-1.2.3.3-ce7af, libc6 (>= 2.2.5)
Suggests: libghc-psqueues-doc, libghc-psqueues-prof
Filename: pool/universe/h/haskell-psqueues/libghc-psqueues-dev_0.2.0.3-1build1_amd64.deb
Size: 140998
MD5sum: 1263c9b8fc81d2a0f0e6e1712c5da0f2
SHA1: f0d7e161ef8d50312f70759b4a7f90e59cfa16a0
SHA256: 4e3463e41ad1e0b804ac072f1a9c6554cc7bff33e756d03e93b888c53ea69284
Description-en: 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.
Description-md5: 5e502d3d58398c849220d5279050be99
Homepage: http://hackage.haskell.org/package/psqueues
Ghc-Package: psqueues-0.2.0.3-788287049b2675d8f1bedac8a62b2181
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu
Priority: extra
Section: universe/haskell
Installed-Size: 1289
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Haskell Group
Architecture: amd64
Source: haskell-psqueues
Version: 0.2.0.3-1build1
Provides: libghc-psqueues-dev-0.2.0.3-78828
Depends: libghc-base-dev-4.8.2.0-0d6d1, libghc-deepseq-dev-1.4.1.1-614b6, libghc-ghc-prim-dev-0.4.0.0-6cdc8, libghc-hashable-dev-1.2.3.3-ce7af, libc6 (>= 2.2.5)
Suggests: libghc-psqueues-doc, libghc-psqueues-prof
Filename: pool/universe/h/haskell-psqueues/libghc-psqueues-dev_0.2.0.3-1build1_amd64.deb
Size: 140998
MD5sum: 1263c9b8fc81d2a0f0e6e1712c5da0f2
SHA1: f0d7e161ef8d50312f70759b4a7f90e59cfa16a0
SHA256: 4e3463e41ad1e0b804ac072f1a9c6554cc7bff33e756d03e93b888c53ea69284
Description-en: 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.
Description-md5: 5e502d3d58398c849220d5279050be99
Homepage: http://hackage.haskell.org/package/psqueues
Ghc-Package: psqueues-0.2.0.3-788287049b2675d8f1bedac8a62b2181
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu