How to Install and Uninstall libghc-hashtables-dev Package on Ubuntu 20.10 (Groovy Gorilla)

Last updated: May 11,2024

1. Install "libghc-hashtables-dev" package

Learn how to install libghc-hashtables-dev on Ubuntu 20.10 (Groovy Gorilla)

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

2. Uninstall "libghc-hashtables-dev" package

This is a short guide on how to uninstall libghc-hashtables-dev on Ubuntu 20.10 (Groovy Gorilla):

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

3. Information about the libghc-hashtables-dev package on Ubuntu 20.10 (Groovy Gorilla)

Package: libghc-hashtables-dev
Architecture: amd64
Version: 1.2.3.4-1build1
Priority: extra
Section: universe/haskell
Source: haskell-hashtables
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Haskell Group
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 2253
Provides: libghc-hashtables-dev-1.2.3.4-06fbb
Depends: libghc-base-dev-4.13.0.0-c9705, libghc-ghc-prim-dev-0.5.3-ce4de, libghc-hashable-dev-1.3.0.0-56a7e, libghc-primitive-dev-0.7.0.1-4044d, libghc-vector-dev-0.12.1.2-52265, libc6 (>= 2.14), libgmp10
Suggests: libghc-hashtables-doc, libghc-hashtables-prof
Filename: pool/universe/h/haskell-hashtables/libghc-hashtables-dev_1.2.3.4-1build1_amd64.deb
Size: 200388
MD5sum: 381fef0031f1eaa0f45777a14fdbad1d
SHA1: 79563b5e9a0c53d08ea33000b7b323d5f5b30165
SHA256: cbcf4233f80e488d5ad1614e921702879f075d6602a6f16739dbb0da33191987
SHA512: 40f5f972008c2422cad3665219419cb35b117f9934307ba2b3ce22507eb973ef5ac4dad950d7d74274e6c4f43e4f40417d4e17edd681e9b8c57876c456cf649e
Homepage: http://github.com/gregorycollins/hashtables
Description-en: mutable hash tables
This package provides a couple of different implementations of mutable hash
tables in the ST monad, as well as a typeclass abstracting their common
operations, and a set of wrappers to use the hash tables in the IO monad.
.
There are three hash table implementations:
.
* Data.HashTable.ST.Basic contains a basic open-addressing hash table using
linear probing as the collision strategy. This should currently be the
fastest available hash table implementation for lookups, although it has a
higher memory overhead than others.
* Data.HashTable.ST.Cuckoo contains an implementation of "cuckoo hashing".
Cuckoo hashing has worst-case O(1) lookups and performs well even when the
table is highly loaded.
* Data.HashTable.ST.Linear contains a linear hash table, which trades some
insert and lookup performance for higher space efficiency and much shorter
delays when expanding the table.
.
This package provides a library for the Haskell programming language.
See http://www.haskell.org/ for more information on Haskell.
Description-md5: a5d6688db307c1e59505d5b01e51e370
Ghc-Package: hashtables-1.2.3.4-3tTcVHYINQt8KaW89JE0Mi