How to Install and Uninstall triehash.noarch Package on Fedora 34
Last updated: November 29,2024
1. Install "triehash.noarch" package
Learn how to install triehash.noarch on Fedora 34
$
sudo dnf update
Copied
$
sudo dnf install
triehash.noarch
Copied
2. Uninstall "triehash.noarch" package
In this section, we are going to explain the necessary steps to uninstall triehash.noarch on Fedora 34:
$
sudo dnf remove
triehash.noarch
Copied
$
sudo dnf autoremove
Copied
3. Information about the triehash.noarch package on Fedora 34
Last metadata expiration check: 5:22:09 ago on Tue Sep 6 08:10:37 2022.
Available Packages
Name : triehash
Version : 0.3
Release : 5.fc34
Architecture : noarch
Size : 21 k
Source : triehash-0.3-5.fc34.src.rpm
Repository : fedora
Summary : Generator for order-preserving minimal perfect hash functions in C
URL : https://jak-linux.org/projects/triehash/
License : MIT
Description : TrieHash generates perfect hash functions as C code which then gets
: compiled into optimal machine code as part of the usual program compilation.
:
: TrieHash works by translating a list of strings to a trie, and then converting
: the trie to a set of recursive switch statements; first switching by length,
: and then switching by bytes.
:
: TrieHash has various optimizations such as processing multiple bytes at once
: (on GNU C), and shortcuts for reducing the complexity of case-insensitive
: matching (ASCII only). Generated code performs substantially faster than
: gperf, but is larger.
:
: TrieHash was written for use in APT.
Available Packages
Name : triehash
Version : 0.3
Release : 5.fc34
Architecture : noarch
Size : 21 k
Source : triehash-0.3-5.fc34.src.rpm
Repository : fedora
Summary : Generator for order-preserving minimal perfect hash functions in C
URL : https://jak-linux.org/projects/triehash/
License : MIT
Description : TrieHash generates perfect hash functions as C code which then gets
: compiled into optimal machine code as part of the usual program compilation.
:
: TrieHash works by translating a list of strings to a trie, and then converting
: the trie to a set of recursive switch statements; first switching by length,
: and then switching by bytes.
:
: TrieHash has various optimizations such as processing multiple bytes at once
: (on GNU C), and shortcuts for reducing the complexity of case-insensitive
: matching (ASCII only). Generated code performs substantially faster than
: gperf, but is larger.
:
: TrieHash was written for use in APT.