libstdc++
|
Public Member Functions | |
_LoserTree (unsigned int __k, _Compare __comp) | |
void | __delete_min_insert (_Tp __key, bool __sup) |
int | __get_min_source () |
void | __init () |
unsigned int | __init_winner (unsigned int __root) |
void | __insert_start (const _Tp &__key, int __source, bool __sup) |
Protected Attributes | |
unsigned int | _M_ik |
unsigned int | _M_offset |
Unstable _LoserTree variant.
Stability (non-stable here) is selected with partial specialization.
Definition at line 261 of file losertree.h.
|
inline |
Delete the _M_key smallest element and insert the element __key instead.
__key | the _M_key to insert |
__sup | true iff __key is an explicitly marked supremum |
Definition at line 324 of file losertree.h.
References std::swap().
|
inlineinherited |
Definition at line 155 of file losertree.h.
References __gnu_parallel::_LoserTreeBase< _Tp, _Compare >::_M_losers, and __gnu_parallel::_LoserTreeBase< _Tp, _Compare >::_Loser::_M_source.
|
inline |
Computes the winner of the competition at position "__root".
Called recursively (starting at 0) to build the initial tree.
__root | __index of the "game" to start. |
Definition at line 284 of file losertree.h.
|
inlineinherited |
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 __gnu_parallel::_LoserTreeBase< _Tp, _Compare >::_M_first_insert, __gnu_parallel::_LoserTreeBase< _Tp, _Compare >::_Loser::_M_key, __gnu_parallel::_LoserTreeBase< _Tp, _Compare >::_M_losers, __gnu_parallel::_LoserTreeBase< _Tp, _Compare >::_Loser::_M_source, and __gnu_parallel::_LoserTreeBase< _Tp, _Compare >::_Loser::_M_sup.