How to Install and Uninstall tlx.x86_64 Package on Fedora 39
Last updated: November 15,2024
1. Install "tlx.x86_64" package
Please follow the step by step instructions below to install tlx.x86_64 on Fedora 39
$
sudo dnf update
Copied
$
sudo dnf install
tlx.x86_64
Copied
2. Uninstall "tlx.x86_64" package
This is a short guide on how to uninstall tlx.x86_64 on Fedora 39:
$
sudo dnf remove
tlx.x86_64
Copied
$
sudo dnf autoremove
Copied
3. Information about the tlx.x86_64 package on Fedora 39
Last metadata expiration check: 5:28:17 ago on Thu Mar 7 11:44:58 2024.
Available Packages
Name : tlx
Version : 0.6.1
Release : 2.fc39
Architecture : x86_64
Size : 87 k
Source : tlx-0.6.1-2.fc39.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.
Available Packages
Name : tlx
Version : 0.6.1
Release : 2.fc39
Architecture : x86_64
Size : 87 k
Source : tlx-0.6.1-2.fc39.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.