Guarded loser tree, using pointers to the elements instead of copying them into the tree nodes.
More...
|
| LoserTreePointer (Source k, const Comparator &cmp=Comparator()) |
|
void | delete_min_insert (const ValueType *keyp, bool sup) |
|
| LoserTreePointer (Source k, const Comparator &cmp=Comparator()) |
|
void | delete_min_insert (const ValueType *keyp, bool sup) |
|
| 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.
|
|
void | insert_start (const ValueType *keyp, const Source &source, bool sup) |
| Initializes the player source with the element key.
|
|
Source | init_winner (const Source &root) |
| Computes the winner of the competition at player root.
|
|
void | init () |
|
| LoserTreePointerBase (Source k, const Comparator &cmp=Comparator()) |
|
| LoserTreePointerBase (const LoserTreePointerBase &)=delete |
|
| LoserTreePointerBase (LoserTreePointerBase &&)=default |
|
LoserTreePointerBase & | operator= (const LoserTreePointerBase &)=delete |
|
LoserTreePointerBase & | operator= (LoserTreePointerBase &&)=default |
|
Source | min_source () |
| return the index of the player with the smallest element.
|
|
void | insert_start (const ValueType *keyp, const Source &source, bool sup) |
| Initializes the player source with the element key.
|
|
Source | init_winner (const Source &root) |
| Computes the winner of the competition at player root.
|
|
void | init () |
|
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.