__gnu_parallel::_LoserTreePointerUnguardedBase< _Tp, _Compare > Class Template Reference

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

#include <parallel/losertree.h>

Inheritance diagram for __gnu_parallel::_LoserTreePointerUnguardedBase< _Tp, _Compare >:

Classes
struct	_Loser

Public Member Functions
	_LoserTreePointerUnguardedBase (unsigned int __k, const _Tp &__sentinel, _Compare __comp=std::less< _Tp >())
	~_LoserTreePointerUnguardedBase ()
int	__get_min_source ()
void	__insert_start (const _Tp &__key, int __source, bool)

Protected Attributes
unsigned int	_M_ik
unsigned int	_M_k
unsigned int	_M_offset
_Loser *	_M_losers
_Compare	_M_comp

Detailed Description

template<typename _Tp, typename _Compare>
class __gnu_parallel::_LoserTreePointerUnguardedBase< _Tp, _Compare >

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.

Constructor & Destructor Documentation

template<typename _Tp , typename _Compare >

__gnu_parallel::_LoserTreePointerUnguardedBase< _Tp, _Compare >::_LoserTreePointerUnguardedBase ( unsigned int  __k, const _Tp &  __sentinel, _Compare  __comp = std::less<_Tp>()  )

inline

      : _M_comp(__comp)
      {
    _M_ik = __k;

    // Next greater power of 2.
    _M_k = 1 << (__rd_log2(_M_ik - 1) + 1);
    _M_offset = _M_k;
    // Avoid default-constructing _M_losers[]._M_key
    _M_losers = new _Loser[2 * _M_k];

    for (unsigned int __i = _M_k + _M_ik - 1; __i < (2 * _M_k); ++__i)
      {
        _M_losers[__i]._M_keyp = &__sentinel;
        _M_losers[__i]._M_source = -1;
      }
      }

template<typename _Tp , typename _Compare >

__gnu_parallel::_LoserTreePointerUnguardedBase< _Tp, _Compare >::~_LoserTreePointerUnguardedBase ( )

inline

      { delete[] _M_losers; }

Member Function Documentation

template<typename _Tp , typename _Compare >

int __gnu_parallel::_LoserTreePointerUnguardedBase< _Tp, _Compare >::__get_min_source ( )

inline

      {
#if _GLIBCXX_ASSERTIONS
    // no dummy sequence can ever be at the top!
    _GLIBCXX_PARALLEL_ASSERT(_M_losers[0]._M_source != -1);
#endif
    return _M_losers[0]._M_source;
      }

template<typename _Tp , typename _Compare >

void __gnu_parallel::_LoserTreePointerUnguardedBase< _Tp, _Compare >::__insert_start ( const _Tp &  __key, int  __source, bool    )

inline

      {
    unsigned int __pos = _M_k + __source;

    _M_losers[__pos]._M_keyp = &__key;
    _M_losers[__pos]._M_source = __source;
      }

Member Data Documentation

template<typename _Tp , typename _Compare >

_Compare __gnu_parallel::_LoserTreePointerUnguardedBase< _Tp, _Compare >::_M_comp

protected

template<typename _Tp , typename _Compare >

unsigned int __gnu_parallel::_LoserTreePointerUnguardedBase< _Tp, _Compare >::_M_ik

protected

template<typename _Tp , typename _Compare >

unsigned int __gnu_parallel::_LoserTreePointerUnguardedBase< _Tp, _Compare >::_M_k

protected

template<typename _Tp , typename _Compare >

_Loser* __gnu_parallel::_LoserTreePointerUnguardedBase< _Tp, _Compare >::_M_losers

protected

template<typename _Tp , typename _Compare >

unsigned int __gnu_parallel::_LoserTreePointerUnguardedBase< _Tp, _Compare >::_M_offset

protected

---

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

• GCC4/inc/parallel/losertree.h