__gnu_para...uardedBase(3)

🎀 NAME 🎀

okay bestie, this is the Library Functions Manual page titled __gnu_para...uardedBase(3), and it’s all about __gnu_parallel::LoserTreeUnguardedBase — the base class for unguarded LoserTree implementation. We’re so back 💖.

✨ SYNOPSIS ✨

Here’s the whole public interface, no gatekeeping:

💫 Public Member Functions 💫

int get_min_source ()
void insert_start (const T &key, int source, bool)
LoserTreeUnguardedBase (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 time, bestie:

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

Okay so here’s the tea: __gnu_parallel::LoserTreeUnguardedBase< T, Comparator > is the base class for unguarded LoserTree implementation. The whole element is copied into the tree structure — like, the entire thing, no half-measures 🫶.

No guarding is done, therefore not a single input sequence must run empty. That’s a real caveat, bestie — not one input sequence is allowed to run empty. Unused sequence heads are marked with a sentinel which is > all elements that are to be merged. This is a very fast variant. Periodt 🔥.

Definition at line 554 of file losertree.h.

👑 AUTHOR 👑

This page was Generated automatically by Doxygen for libstdc++ from the source code. So no human author gossip here — it’s all Doxygen magic ✨.

And that’s the whole page, bestie! Cute little sign-off: libstdc++, 21 Apr 2009, page __gnu_para...uardedBase(3) — mwah 💋🎀