How to Install and Uninstall libghc-psqueues-prof Package on Ubuntu 21.04 (Hirsute Hippo)
Last updated: November 07,2024
1. Install "libghc-psqueues-prof" package
Please follow the instructions below to install libghc-psqueues-prof on Ubuntu 21.04 (Hirsute Hippo)
$
sudo apt update
Copied
$
sudo apt install
libghc-psqueues-prof
Copied
2. Uninstall "libghc-psqueues-prof" package
Please follow the guidance below to uninstall libghc-psqueues-prof on Ubuntu 21.04 (Hirsute Hippo):
$
sudo apt remove
libghc-psqueues-prof
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the libghc-psqueues-prof package on Ubuntu 21.04 (Hirsute Hippo)
Package: libghc-psqueues-prof
Architecture: amd64
Version: 0.2.7.2-2build2
Priority: extra
Section: universe/haskell
Source: haskell-psqueues
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Haskell Group
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 1755
Provides: libghc-psqueues-prof-0.2.7.2-a907a
Depends: libghc-psqueues-dev (= 0.2.7.2-2build2), libghc-base-prof-4.13.0.0-2f220, libghc-deepseq-prof-1.4.4.0-9f093, libghc-ghc-prim-prof-0.5.3-49209, libghc-hashable-prof-1.3.0.0-d5f3c
Filename: pool/universe/h/haskell-psqueues/libghc-psqueues-prof_0.2.7.2-2build2_amd64.deb
Size: 175976
MD5sum: e51290ec03d46661da559f02cf12c011
SHA1: 4bba97cf7c6a3da95f8950e3a58e17e48e8877cf
SHA256: 914ce47ee730724e73f962c87a02d46acdae41ea00a2554fadccf5ed7f83dd52
SHA512: 83e3ef02df96ce92988e2b4180681400d91f942d733ab2b250fabcb1abdcff117a531f7cd64e3e1b2c8283621d9f8e126c4c182ad77e67ddf2f4a6d8c3cbcff6
Homepage: https://hackage.haskell.org/package/psqueues
Description-en: 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.
Description-md5: 026258223cfeddd62b2ec9c69a99797a
Architecture: amd64
Version: 0.2.7.2-2build2
Priority: extra
Section: universe/haskell
Source: haskell-psqueues
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Haskell Group
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 1755
Provides: libghc-psqueues-prof-0.2.7.2-a907a
Depends: libghc-psqueues-dev (= 0.2.7.2-2build2), libghc-base-prof-4.13.0.0-2f220, libghc-deepseq-prof-1.4.4.0-9f093, libghc-ghc-prim-prof-0.5.3-49209, libghc-hashable-prof-1.3.0.0-d5f3c
Filename: pool/universe/h/haskell-psqueues/libghc-psqueues-prof_0.2.7.2-2build2_amd64.deb
Size: 175976
MD5sum: e51290ec03d46661da559f02cf12c011
SHA1: 4bba97cf7c6a3da95f8950e3a58e17e48e8877cf
SHA256: 914ce47ee730724e73f962c87a02d46acdae41ea00a2554fadccf5ed7f83dd52
SHA512: 83e3ef02df96ce92988e2b4180681400d91f942d733ab2b250fabcb1abdcff117a531f7cd64e3e1b2c8283621d9f8e126c4c182ad77e67ddf2f4a6d8c3cbcff6
Homepage: https://hackage.haskell.org/package/psqueues
Description-en: 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.
Description-md5: 026258223cfeddd62b2ec9c69a99797a