libstdc++
|
#include <losertree.h>
Classes | |
struct | _Loser |
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 |
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.
_Tp | the element type |
_Compare | the comparator to use, defaults to std::less<_Tp> |
Definition at line 55 of file losertree.h.
|
inline |
The constructor.
__k | The number of sequences to merge. |
__comp | The comparator to use. |
Definition at line 94 of file losertree.h.
References __gnu_parallel::__rd_log2(), _M_comp, _M_first_insert, _M_log_k, and _M_losers.
|
inline |
|
inline |
Definition at line 155 of file losertree.h.
References _M_losers.
|
inline |
Initializes the sequence "_M_source" with the element "__key".
__key | the element to insert |
__source | __index of the __source __sequence |
__sup | flag that determines whether the value to insert is an explicit __supremum. |
Definition at line 134 of file losertree.h.
References _M_first_insert, and _M_losers.
|
protected |
|
protected |
State flag that determines whether the _LoserTree is empty.
Only used for building the _LoserTree.
Definition at line 85 of file losertree.h.
Referenced by _LoserTreeBase(), and __insert_start().
|
protected |
Definition at line 69 of file losertree.h.
|
protected |
Definition at line 69 of file losertree.h.
|
protected |
|
protected |
_LoserTree __elements.
Definition at line 75 of file losertree.h.
Referenced by _LoserTreeBase(), ~_LoserTreeBase(), __get_min_source(), and __insert_start().
|
protected |
Definition at line 69 of file losertree.h.