How to Install and Uninstall tlx.i686 Package on Fedora 38

Last updated: October 05,2024

1. Install "tlx.i686" package

In this section, we are going to explain the necessary steps to install tlx.i686 on Fedora 38


    
        
            $
        

        
            
                sudo dnf update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf install
            
                        
                tlx.i686
            
                    
    
    Copied

2. Uninstall "tlx.i686" package

This guide let you learn how to uninstall tlx.i686 on Fedora 38:


    
        
            $
        

        
            
                sudo dnf remove
            
                        
                tlx.i686
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf autoremove
            
                    
    
    Copied

3. Information about the tlx.i686 package on Fedora 38

Last metadata expiration check: 5:29:53 ago on Sat Mar 16 22:59:57 2024.
Available Packages
Name : tlx
Version : 0.5.20210401
Release : 2.fc38
Architecture : i686
Size : 95 k
Source : tlx-0.5.20210401-2.fc38.src.rpm
Repository : fedora
Summary : Sophisticated C++ data structures, algorithms, and helpers
URL : https://panthema.net/tlx
License : BSL-1.0
Description : TLX is a collection of sophisticated C++ data structures, algorithms,
: and miscellaneous helpers. It contains:
: - The fast tournament (loser) trees from MCSTL by Johannes Singler, with
: many fixes.
: - A fast intrusive reference counter called CountingPtr, which has
: considerably less overhead than std::shared_ptr.
: - Efficient and fast multiway merging algorithms from Johannes Singler,
: which were previously included with gcc. The tlx version has many
: fixes and is available for clang and MSVC++.
: - Many string manipulation algorithms for std::string.
: - An improved version of the stx-btree implementation, which is
: basically always a better alternative to std::map (but not
: std::unordered_map).
: - A copy of siphash for string hashing.
: - Efficient sequential string sorting implementations such as radix sort
: and multikey quicksort.
: - Much more; see the doxygen documentation.