Thrill
0.1
|
Unguarded loser tree, copying the whole element into the tree structure.
This is a base class for the LoserTreeCopyUnguarded<true> and <false> classes.
No guarding is done, therefore not a single input sequence must run empty. This is a very fast variant.
Definition at line 528 of file loser_tree.hpp.
#include <loser_tree.hpp>
Classes | |
struct | Loser |
Internal representation of a loser tree player/node. More... | |
Public Types | |
using | Source = uint32_t |
size of counters and array indexes More... | |
Public Member Functions | |
LoserTreeCopyUnguardedBase (Source k, const ValueType &sentinel, const Comparator &cmp=Comparator()) | |
void | init () |
Source | init_winner (const Source &root) |
void | insert_start (const ValueType *keyp, const Source &source, bool sup) |
Source | min_source () |
return the index of the player with the smallest element. More... | |
Static Public Attributes | |
static constexpr Source | invalid_ = Source(-1) |
sentinel for invalid or finished Sources More... | |
Protected Attributes | |
Comparator | cmp_ |
the comparator object More... | |
Source | ik_ |
number of nodes More... | |
Source | k_ |
log_2(ik) next greater power of 2 More... | |
SimpleVector< Loser > | losers_ |
array containing loser tree nodes More... | |