libstdc++: __gnu_parallel::_LoserTreeBase< _Tp, _Compare > Class Template Reference (original) (raw)
#include <[losertree.h](a01031%5Fsource.html)>
Inheritance diagram for __gnu_parallel::_LoserTreeBase< _Tp, _Compare >:
Public Member Functions | |
---|---|
_LoserTreeBase (unsigned int __k, _Compare __comp) | |
~_LoserTreeBase () | |
int | __get_min_source () |
void | __insert_start (const _Tp &__key, int __source, bool __sup) |
Protected Attributes | |
---|---|
_Compare | _M_comp |
bool | _M_first_insert |
unsigned int | _M_ik |
unsigned int | _M_k |
unsigned int | _M_log_k |
_Loser * | _M_losers |
unsigned int | _M_offset |
Detailed Description
template<typename _Tp, typename _Compare>
class __gnu_parallel::_LoserTreeBase< _Tp, _Compare >
Guarded loser/tournament tree.
The smallest element is at the top.
Guarding is done explicitly through one flag _M_sup per element, inf is not needed due to a better initialization routine. This is a well-performing variant.
Parameters
_Tp | the element type |
---|---|
_Compare | the comparator to use, defaults to std::less<_Tp> |
Definition at line 55 of file losertree.h.
Constructor & Destructor Documentation
template<typename _Tp , typename _Compare >
◆ ~_LoserTreeBase()
template<typename _Tp , typename _Compare >
Member Function Documentation
◆ __get_min_source()
template<typename _Tp , typename _Compare >
◆ __insert_start()
template<typename _Tp , typename _Compare >
Member Data Documentation
◆ _M_comp
template<typename _Tp , typename _Compare >
◆ _M_first_insert
template<typename _Tp , typename _Compare >
◆ _M_ik
template<typename _Tp , typename _Compare >
◆ _M_k
template<typename _Tp , typename _Compare >
◆ _M_log_k
template<typename _Tp , typename _Compare >
◆ _M_losers
template<typename _Tp , typename _Compare >
◆ _M_offset
template<typename _Tp , typename _Compare >
The documentation for this class was generated from the following file: