How to Install and Uninstall libghc-psqueues-dev Package on Ubuntu 21.10 (Impish Indri)

Last updated: May 14,2024

1. Install "libghc-psqueues-dev" package

In this section, we are going to explain the necessary steps to install libghc-psqueues-dev on Ubuntu 21.10 (Impish Indri)

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

2. Uninstall "libghc-psqueues-dev" package

This tutorial shows how to uninstall libghc-psqueues-dev on Ubuntu 21.10 (Impish Indri):

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

3. Information about the libghc-psqueues-dev package on Ubuntu 21.10 (Impish Indri)

Package: libghc-psqueues-dev
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: 1955
Provides: libghc-psqueues-dev-0.2.7.2-a907a
Depends: libghc-base-dev-4.13.0.0-2f220, libghc-deepseq-dev-1.4.4.0-9f093, libghc-ghc-prim-dev-0.5.3-49209, libghc-hashable-dev-1.3.0.0-d5f3c, libc6 (>= 2.2.5), libgmp10
Suggests: libghc-psqueues-doc, libghc-psqueues-prof
Filename: pool/universe/h/haskell-psqueues/libghc-psqueues-dev_0.2.7.2-2build2_amd64.deb
Size: 198016
MD5sum: c22541bfa626b627ad4e1e8cd2a2034f
SHA1: 90d51cbc47de36e9d293db8a3b9ace97f7f4225d
SHA256: 27e67252f68a5dc29a1c424dd946a735c45cacfefc14ce85b1968a9c0d5c594e
SHA512: 9389de7044174e4825c10a4a54b373de37dc5188cbed57332050c3def1f5d9296ab2f05810670055697bad8336167e527d6144d51b179ab0e398d789aeba2007
Homepage: https://hackage.haskell.org/package/psqueues
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
Ghc-Package: psqueues-0.2.7.2-JzlnOOug5ulET7oKxYZytW