Information for RPM tlx-0.5.20210401-2.fc38.src.rpm
| ID | 1015788 | ||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
| Name | tlx | ||||||||||
| Version | 0.5.20210401 | ||||||||||
| Release | 2.fc38 | ||||||||||
| Epoch | |||||||||||
| Arch | src | ||||||||||
| 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. | ||||||||||
| Build Time | 2023-05-29 16:36:29 GMT | ||||||||||
| Size | 428.37 KB | ||||||||||
| 5f0520b3b5e848076c9af5f1caa30283 | |||||||||||
| License | BSL-1.0 | ||||||||||
| Buildroot | f38-build-719143-96783 | ||||||||||
| Provides |
|
||||||||||
| Obsoletes | No Obsoletes | ||||||||||
| Conflicts | No Conflicts | ||||||||||
| Requires |
|
||||||||||
| Recommends | No Recommends | ||||||||||
| Suggests | No Suggests | ||||||||||
| Supplements | No Supplements | ||||||||||
| Enhances | No Enhances | ||||||||||
| Files |
|
||||||||||
| Component of | No Buildroots | ||||||||||
