How to Install and Uninstall ghc-hashtables-devel.x86_64 Package on Fedora 38
Last updated: November 28,2024
1. Install "ghc-hashtables-devel.x86_64" package
Please follow the guidelines below to install ghc-hashtables-devel.x86_64 on Fedora 38
$
sudo dnf update
Copied
$
sudo dnf install
ghc-hashtables-devel.x86_64
Copied
2. Uninstall "ghc-hashtables-devel.x86_64" package
This guide let you learn how to uninstall ghc-hashtables-devel.x86_64 on Fedora 38:
$
sudo dnf remove
ghc-hashtables-devel.x86_64
Copied
$
sudo dnf autoremove
Copied
3. Information about the ghc-hashtables-devel.x86_64 package on Fedora 38
Last metadata expiration check: 5:16:44 ago on Sat Mar 16 22:59:57 2024.
Available Packages
Name : ghc-hashtables-devel
Version : 1.3.1
Release : 2.fc38
Architecture : x86_64
Size : 173 k
Source : ghc-hashtables-1.3.1-2.fc38.src.rpm
Repository : fedora
Summary : Haskell hashtables library development files
URL : https://hackage.haskell.org/package/hashtables
License : BSD-3-Clause
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.3.1
Release : 2.fc38
Architecture : x86_64
Size : 173 k
Source : ghc-hashtables-1.3.1-2.fc38.src.rpm
Repository : fedora
Summary : Haskell hashtables library development files
URL : https://hackage.haskell.org/package/hashtables
License : BSD-3-Clause
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.