__GNU_PARALLEL::LOSERTREEPOINTERUNGUARDEDBASE(3)

🌸 NAME 🌸

__gnu_parallel::LoserTreePointerUnguardedBase — bestie, it's an unguarded loser tree that keeps only pointers to the elements in the tree structure. 💅

✨ SYNOPSIS ✨

Okay so this is from the Library Functions Manual, and here's the whole cast of public member functions:

💫 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. Like, no cap, it's speedy, but you must keep every input sequence fed — nobody's allowed to run empty. Periodt. 💀

Definition at line 789 of file losertree.h.

🫶 AUTHOR 🫶

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

And that's the vibe check, bestie — this page came from libstdc++, dated 21 Apr 2009, and the whole thing is the __gnu_para...guardedBase(3) manual page. Slay. 🎀