How to Install and Uninstall ghc-hashtables-devel.x86_64 Package on Red Hat Enterprise Linux 8 (RHEL 8)
Last updated: January 10,2025
1. Install "ghc-hashtables-devel.x86_64" package
This is a short guide on how to install ghc-hashtables-devel.x86_64 on Red Hat Enterprise Linux 8 (RHEL 8)
$
sudo dnf update
Copied
$
sudo dnf install
ghc-hashtables-devel.x86_64
Copied
2. Uninstall "ghc-hashtables-devel.x86_64" package
Here is a brief guide to show you how to uninstall ghc-hashtables-devel.x86_64 on Red Hat Enterprise Linux 8 (RHEL 8):
$
sudo dnf remove
ghc-hashtables-devel.x86_64
Copied
$
sudo dnf autoremove
Copied
3. Information about the ghc-hashtables-devel.x86_64 package on Red Hat Enterprise Linux 8 (RHEL 8)
Last metadata expiration check: 0:44:18 ago on Mon Feb 26 15:59:38 2024.
Available Packages
Name : ghc-hashtables-devel
Version : 1.2.3.1
Release : 1.el8
Architecture : x86_64
Size : 518 k
Source : ghc-hashtables-1.2.3.1-1.el8.src.rpm
Repository : epel
Summary : Haskell hashtables library development files
URL : https://hackage.haskell.org/package/hashtables
License : BSD
Description : This package provides the Haskell hashtables library development files.
: 2. "Data.HashTable.ST.Basic" contains a basic open-addressing hash table using
: linear probing as the collision strategy. On a pure speed basis it should
: currently be the fastest available Haskell hash table implementation for
: lookups, although it has a higher memory overhead than the other tables and can
: suffer from long delays when the table is resized because all of the elements
: in the table need to be rehashed.
Available Packages
Name : ghc-hashtables-devel
Version : 1.2.3.1
Release : 1.el8
Architecture : x86_64
Size : 518 k
Source : ghc-hashtables-1.2.3.1-1.el8.src.rpm
Repository : epel
Summary : Haskell hashtables library development files
URL : https://hackage.haskell.org/package/hashtables
License : BSD
Description : This package provides the Haskell hashtables library development files.
: 2. "Data.HashTable.ST.Basic" contains a basic open-addressing hash table using
: linear probing as the collision strategy. On a pure speed basis it should
: currently be the fastest available Haskell hash table implementation for
: lookups, although it has a higher memory overhead than the other tables and can
: suffer from long delays when the table is resized because all of the elements
: in the table need to be rehashed.