Information for build tlx-0.5.20191212-2.fc33
| ID | 149215 |
|---|---|
| Package Name | tlx |
| Version | 0.5.20191212 |
| Release | 2.fc33 |
| Epoch | |
| Source | git+https://src.fedoraproject.org/rpms/tlx.git#d5421b139b0fd8ff5bd5fa2bf192d17cff294ce9 |
| 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. |
| Built by | davidlt |
| State | failed |
| Volume | DEFAULT |
| Started | Sun, 10 May 2020 11:51:51 UTC |
| Completed | Sun, 10 May 2020 12:22:39 UTC |
| Task | build (f33, /rpms/tlx.git:d5421b139b0fd8ff5bd5fa2bf192d17cff294ce9) |
| Extra | {'source': {'original_url': 'git+https://src.fedoraproject.org/rpms/tlx.git#d5421b139b0fd8ff5bd5fa2bf192d17cff294ce9'}} |
| Tags | No tags |
| RPMs | No RPMs |
| Changelog | * Fri Jan 31 2020 Fedora Release Engineering <releng@fedoraproject.org> - 0.5.20191212-2 - Rebuilt for https://fedoraproject.org/wiki/Fedora_32_Mass_Rebuild * Fri Dec 13 2019 Jerry James <loganjerry@gmail.com> - 0.5.20191212-1 - Initial RPM |
