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

Last updated: May 14,2024

1. Install "libghc-psqueues-doc" package

This guide covers the steps necessary to install libghc-psqueues-doc on Ubuntu 21.10 (Impish Indri)

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

2. Uninstall "libghc-psqueues-doc" package

Please follow the guidance below to uninstall libghc-psqueues-doc on Ubuntu 21.10 (Impish Indri):

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

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

Package: libghc-psqueues-doc
Architecture: all
Version: 0.2.7.2-2build2
Priority: extra
Section: universe/doc
Source: haskell-psqueues
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Haskell Group
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 1911
Depends: haddock-interface-35
Recommends: libghc-hashable-doc, libjs-mathjax
Filename: pool/universe/h/haskell-psqueues/libghc-psqueues-doc_0.2.7.2-2build2_all.deb
Size: 95576
MD5sum: 60b85cc1f1957ee61c66048227cb71e5
SHA1: 6e10846c081ab02e4a412bc868270d95ab4dde75
SHA256: 0521d9259b64d19fa463275666efd3d72c0f404a03340283df8d9f5c8d2606e0
SHA512: 17bed605a533e2920ed4ae13857c28011f783301c1317fc4894638ca01f322b6d29caebf3a73149a35d5c2dbcd9889d586c7c62fe8405e0d293cd9568fad1950
Homepage: https://hackage.haskell.org/package/psqueues
Description-en: Pure priority search queues; documentation
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 the documentation for a library for the Haskell
programming language.
See http://www.haskell.org/ for more information on Haskell.
Description-md5: 4b01bcba4a003fce5cc40f1ee117b50f