How to Install and Uninstall libghc-psqueues-prof Package on Ubuntu 16.04 LTS (Xenial Xerus)

Last updated: May 17,2024

1. Install "libghc-psqueues-prof" package

In this section, we are going to explain the necessary steps to install libghc-psqueues-prof on Ubuntu 16.04 LTS (Xenial Xerus)

$ sudo apt update $ sudo apt install libghc-psqueues-prof

2. Uninstall "libghc-psqueues-prof" package

Please follow the steps below to uninstall libghc-psqueues-prof on Ubuntu 16.04 LTS (Xenial Xerus):

$ sudo apt remove libghc-psqueues-prof $ sudo apt autoclean && sudo apt autoremove

3. Information about the libghc-psqueues-prof package on Ubuntu 16.04 LTS (Xenial Xerus)

Package: libghc-psqueues-prof
Priority: extra
Section: universe/haskell
Installed-Size: 1063
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Haskell Group
Architecture: amd64
Source: haskell-psqueues
Version: 0.2.0.3-1build1
Provides: libghc-psqueues-prof-0.2.0.3-78828
Depends: libghc-psqueues-dev (= 0.2.0.3-1build1), libghc-base-prof-4.8.2.0-0d6d1, libghc-deepseq-prof-1.4.1.1-614b6, libghc-ghc-prim-prof-0.4.0.0-6cdc8, libghc-hashable-prof-1.2.3.3-ce7af
Filename: pool/universe/h/haskell-psqueues/libghc-psqueues-prof_0.2.0.3-1build1_amd64.deb
Size: 115572
MD5sum: f24f5d01377a90dbab4d8967b62aa18b
SHA1: 8f145c40e0b64b800bf04d6740de32d0d9bd7660
SHA256: 66d220e19c6092d013531055fe6adff7f1262b90c9e8342d42be6de50fba7b42
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
Homepage: http://hackage.haskell.org/package/psqueues
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu