Scroll to navigation

__gnu_parallel::LoserTreePointerUnguardedBase< T, Comparator >(3cxx) __gnu_parallel::LoserTreePointerUnguardedBase< T, Comparator >(3cxx)

NAME

__gnu_parallel::LoserTreePointerUnguardedBase< T, Comparator > -

SYNOPSIS

Inherited by __gnu_parallel::LoserTreePointerUnguarded< stable, T, Comparator >, and __gnu_parallel::LoserTreePointerUnguarded< false, T, Comparator >.

Public Member Functions


int get_min_source ()
 
void insert_start (const T &key, int source, bool)
 
LoserTreePointerUnguardedBase (unsigned int _k, const T &_sentinel, Comparator _comp= std::less< T >())
 

Protected Attributes


Comparator comp
 
unsigned int ik
 
unsigned int k
 
Loser * losers
 
unsigned int offset
 

Detailed Description

 

template<typename T, typename Comparator>class __gnu_parallel::LoserTreePointerUnguardedBase< T, Comparator >

Unguarded loser tree, keeping only pointers to the elements in the tree structure.
 
No guarding is done, therefore not a single input sequence must run empty. This is a very fast variant.
Definition at line 789 of file losertree.h.
 

Author

Generated automatically by Doxygen for libstdc++ from the source code.
Thu Aug 2 2012 libstdc++