---
name: "__gnu_parallel::LoserTreePointerUnguardedBase"
section: "3cxx"
platform: "linux"
package: "libstdc++6-4.4-doc"
version: "4.4.7-2"
release: "Debian 7 (Wheezy)"
platforms: ["linux"]
url: "https://new.carta.tech/__gnu_parallel::LoserTreePointerUnguardedBase/3cxx"
---

# \_\_gnu\_parallel::LoserTreePointerUnguardedBase(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.