How to Install and Uninstall ghc-bytestring-trie.x86_64 Package on Fedora 36

Last updated: October 05,2024

1. Install "ghc-bytestring-trie.x86_64" package

This is a short guide on how to install ghc-bytestring-trie.x86_64 on Fedora 36


    
        
            $
        

        
            
                sudo dnf update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf install
            
                        
                ghc-bytestring-trie.x86_64
            
                    
    
    Copied

2. Uninstall "ghc-bytestring-trie.x86_64" package

This is a short guide on how to uninstall ghc-bytestring-trie.x86_64 on Fedora 36:


    
        
            $
        

        
            
                sudo dnf remove
            
                        
                ghc-bytestring-trie.x86_64
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf autoremove
            
                    
    
    Copied

3. Information about the ghc-bytestring-trie.x86_64 package on Fedora 36

Last metadata expiration check: 2:10:49 ago on Thu Sep 8 02:05:26 2022.
Available Packages
Name : ghc-bytestring-trie
Version : 0.2.5.0
Release : 10.fc36
Architecture : x86_64
Size : 52 k
Source : ghc-bytestring-trie-0.2.5.0-10.fc36.src.rpm
Repository : fedora
Summary : An efficient finite map from (byte)strings to values
URL : https://hackage.haskell.org/package/bytestring-trie
License : BSD
Description : An efficient finite map from bytestrings to values.
:
: The implementation is based on big-endian patricia trees, like "Data.IntMap".
: We first trie on the elements of "Data.ByteString" and then trie on the
: big-endian bit representation of those elements. Patricia trees have efficient
: algorithms for union and other merging operations, but they're also quick for
: lookups and insertions.
:
: If you are only interested in being able to associate strings to values, then
: you may prefer the 'hashmap' package which is faster for those only needing a
: map-like structure. This package is intended for those who need the extra
: capabilities that a trie-like structure can offer (e.g., structure sharing to
: reduce memory costs for highly redundant keys, taking the submap of all keys
: with a given prefix, contextual mapping, extracting the minimum and maximum
: keys, etc.).