Information for RPM tlx-0.6.1-3.fc40.src.rpm
| ID | 1245743 | ||||||||
|---|---|---|---|---|---|---|---|---|---|
| Name | tlx | ||||||||
| Version | 0.6.1 | ||||||||
| Release | 3.fc40 | ||||||||
| 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 | 2024-03-18 15:23:57 GMT | ||||||||
| Size | 434.61 KB | ||||||||
| 523b2fc64a5413a298cf5e449e36fe9e | |||||||||
| License | BSL-1.0 | ||||||||
| Buildroot | f40-build-791180-137122 | ||||||||
| 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 | ||||||||
