How to Install and Uninstall triehash Package on Ubuntu 20.10 (Groovy Gorilla)

Last updated: November 26,2024

1. Install "triehash" package

Please follow the guidance below to install triehash on Ubuntu 20.10 (Groovy Gorilla)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                triehash
            
                    
    
    Copied

2. Uninstall "triehash" package

Please follow the guidelines below to uninstall triehash on Ubuntu 20.10 (Groovy Gorilla):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                triehash
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the triehash package on Ubuntu 20.10 (Groovy Gorilla)

Package: triehash
Architecture: all
Version: 0.3-3
Multi-Arch: foreign
Priority: optional
Section: universe/devel
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Julian Andres Klode
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 41
Depends: perl:any
Filename: pool/universe/t/triehash/triehash_0.3-3_all.deb
Size: 12340
MD5sum: 427d9e845dcdb1bda13498b7a173b6e0
SHA1: 6222113c6370041d9261381068ce4bda4ea58272
SHA256: 8b7341f8862aaca76c5b15a0f5ad301ab3909416570439e31a2fabe1daa5dcc8
SHA512: 2739eb0e47e3f67db9fedfe376f55eef74987feffaf799f902e0a3ca8ecc42c75cc3cd52d5083e4e599300e35ca737804fef74db61e970846683c6fc9431e384
Homepage: https://github.com/julian-klode/triehash
Description-en: 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: 63f60be20f1d3886c406c82dc533532f