LoserTreePointer< true, ValueType, Comparator > Class Template Reference

Guarded loser tree, using pointers to the elements instead of copying them into the tree nodes. More...

#include <loser_tree.hpp>

Inheritance diagram for LoserTreePointer< true, ValueType, Comparator >:

Public Types
using	Super = LoserTreePointerBase< ValueType, Comparator >
using	Source = typename Super::Source
Public Types inherited from LoserTreePointerBase< ValueType, Comparator >
using	Source = uint32_t
	size of counters and array indexes More...

Public Member Functions
	LoserTreePointer (Source k, const Comparator &cmp=Comparator())
void	delete_min_insert (const ValueType *keyp, bool sup)
Public Member Functions inherited from LoserTreePointerBase< ValueType, Comparator >
	LoserTreePointerBase (Source k, const Comparator &cmp=Comparator())
	LoserTreePointerBase (const LoserTreePointerBase &)=delete
LoserTreePointerBase &	operator= (const LoserTreePointerBase &)=delete
	LoserTreePointerBase (LoserTreePointerBase &&)=default
LoserTreePointerBase &	operator= (LoserTreePointerBase &&)=default
Source	min_source ()
	return the index of the player with the smallest element. More...
void	insert_start (const ValueType *keyp, const Source &source, bool sup)
	Initializes the player source with the element key. More...
Source	init_winner (const Source &root)
	Computes the winner of the competition at player root. More...
void	init ()

Additional Inherited Members
Static Public Attributes inherited from LoserTreePointerBase< ValueType, Comparator >
static constexpr Source	invalid_
	sentinel for invalid or finished Sources More...
Protected Attributes inherited from LoserTreePointerBase< ValueType, Comparator >
const Source	ik_
	number of nodes More...
const 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

template<typename ValueType, typename Comparator>
class tlx::LoserTreePointer< true, ValueType, Comparator >

Guarded loser tree, using pointers to the elements instead of copying them into the tree nodes.

Unstable specialization of LoserTreeCopyBase.

Guarding is done explicitly through one flag sup per element, inf is not needed due to a better initialization routine. This is a well-performing variant.

Definition at line 478 of file loser_tree.hpp.

---

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

• tlx/container/loser_tree.hpp