Unguarded loser tree, keeping only pointers to the elements in the tree structure. More...

Inheritance diagram for LoserTreePointerUnguardedBase< ValueType, Comparator >:

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
	LoserTreePointerUnguardedBase (const Source &k, const ValueType &sentinel, const Comparator &cmp=Comparator())

	LoserTreePointerUnguardedBase (const LoserTreePointerUnguardedBase &other)=delete

LoserTreePointerUnguardedBase &	operator= (const LoserTreePointerUnguardedBase &)=delete

Source	min_source ()

void	insert_start (const ValueType *keyp, const Source &source, bool sup)

Source	init_winner (const Source &root)

void	init ()

Static Public Attributes
static constexpr Source	invalid_
	sentinel for invalid or finished Sources More...

Protected Attributes
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...

Comparator	cmp_
	the comparator object More...

Detailed Description

Unguarded loser tree, keeping only pointers to the elements in the tree structure.

This is a base class for the LoserTreePointerUnguarded<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 705 of file loser_tree.hpp.

The documentation for this class was generated from the following file:

Classes