How to Install and Uninstall triehash Package on Kali Linux
Last updated: December 28,2024
1. Install "triehash" package
Please follow the guidance below to install triehash on Kali Linux
$
sudo apt update
Copied
$
sudo apt install
triehash
Copied
2. Uninstall "triehash" package
Please follow the steps below to uninstall triehash on Kali Linux:
$
sudo apt remove
triehash
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the triehash package on Kali Linux
Package: triehash
Version: 0.3-3
Installed-Size: 41
Maintainer: Julian Andres Klode
Architecture: all
Depends: perl:any
Size: 12308
SHA256: 83f4713563f3fec9b82587d5628da3840def9d4f7299c0131f687144c90fbff0
SHA1: cec73a9c3b3bf6f0c3e1100f8d47297ac9ce2cac
MD5sum: 4a66b272c8b4ff007ecc2ea1b7134bd0
Description: Generates perfect hash functions as native machine code
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.
Description-md5:
Multi-Arch: foreign
Homepage: https://github.com/julian-klode/triehash
Section: devel
Priority: optional
Filename: pool/main/t/triehash/triehash_0.3-3_all.deb
Version: 0.3-3
Installed-Size: 41
Maintainer: Julian Andres Klode
Architecture: all
Depends: perl:any
Size: 12308
SHA256: 83f4713563f3fec9b82587d5628da3840def9d4f7299c0131f687144c90fbff0
SHA1: cec73a9c3b3bf6f0c3e1100f8d47297ac9ce2cac
MD5sum: 4a66b272c8b4ff007ecc2ea1b7134bd0
Description: Generates perfect hash functions as native machine code
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.
Description-md5:
Multi-Arch: foreign
Homepage: https://github.com/julian-klode/triehash
Section: devel
Priority: optional
Filename: pool/main/t/triehash/triehash_0.3-3_all.deb