__gnu_parallel::LoserTree(3)

NAME
__gnu_parallel::LoserTree - Stable LoserTree variant.

SYNOPSIS

Inherits LoserTreeBase< T, Comparator >.

  Public Member Functions
void delete_min_insert (T key, bool sup)
int get_min_source ()
void init ()
unsigned int init_winner (unsigned int root)
void insert_start (const T &key, int source, bool sup)
LoserTree (unsigned int _k, Comparator _comp)

  Protected Attributes
unsigned int _M_log_k
Comparator comp
bool first_insert
unsigned int ik
unsigned int k
Loser * losers
unsigned int offset

Detailed Description

  template<bool stable, typename T, typename Comparator> class __gnu_parallel::LoserTree< stable, T, Comparator >
Stable LoserTree variant. Provides the stable implementations of insert_start, init_winner, init and delete_min_insert.

Unstable variant is done using partial specialisation below.

Definition at line 171 of file losertree.h.

Member Function Documentation

  template<bool stable, typename T , typename Comparator > void __gnu_parallel::LoserTree< stable, T, Comparator >::delete_min_insert (T key, bool sup) [inline]

Delete the smallest element and insert a new element from the previously smallest element's sequence.

This implementation is stable.

Definition at line 221 of file losertree.h.

  int __gnu_parallel::LoserTreeBase< T , Comparator >::get_min_source () [inline, inherited]

Returns:
    the index of the sequence with the smallest element.

Definition at line 158 of file losertree.h.

References __gnu_parallel::LoserTreeBase< T, Comparator >::losers, and __gnu_parallel::LoserTreeBase< T, Comparator >::LoserTreeBase::Loser::source.

  void __gnu_parallel::LoserTreeBase< T , Comparator >::insert_start (const T & key, int source, bool sup) [inline, inherited]

Initializes the sequence 'source' with the element 'key'.

Parameters:
    key the element to insert
    source index of the source sequence
    sup flag that determines whether the value to insert is an explicit supremum.

Definition at line 137 of file losertree.h.

References __gnu_parallel::LoserTreeBase< T, Comparator >::first_insert, __gnu_parallel::LoserTreeBase< T, Comparator >::LoserTreeBase::Loser::key, __gnu_parallel::LoserTreeBase< T, Comparator >::losers, __gnu_parallel::LoserTreeBase< T, Comparator >::LoserTreeBase::Loser::source, and __gnu_parallel::LoserTreeBase< T, Comparator >::LoserTreeBase::Loser::sup.

Member Data Documentation

  unsigned int __gnu_parallel::LoserTreeBase< T , Comparator >::_M_log_k [protected, inherited]

log_2{k}

Definition at line 80 of file losertree.h.

  Comparator __gnu_parallel::LoserTreeBase< T , Comparator >::comp [protected, inherited]

Comparator to use.

Definition at line 86 of file losertree.h.

  bool __gnu_parallel::LoserTreeBase< T , Comparator >::first_insert [protected, inherited]

State flag that determines whether the LoserTree is empty.

Only used for building the LoserTree.

Definition at line 93 of file losertree.h.

  Loser* __gnu_parallel::LoserTreeBase< T , Comparator >::losers [protected, inherited]

LoserTree elements.

Definition at line 83 of file losertree.h.

Author

Generated automatically by Doxygen for libstdc++ from the source code.