| Name : tlx
| |
| Version : 0.5.20200222
| Vendor : Fedora Project
|
| Release : 2.fc33
| Date : 2020-07-30 12:39:43
|
| Group : Unspecified
| Source RPM : tlx-0.5.20200222-2.fc33.src.rpm
|
| Size : 0.23 MB
| |
| Packager : Fedora Project
| |
| Summary : Sophisticated C++ data structures, algorithms, and helpers
|
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.
|
RPM found in directory: /packages/linux-pbone/archive.fedoraproject.org/fedora/linux/releases/33/Everything/x86_64/os/Packages/t |
