__GNU_PARALLEL::_LOSERTREEBASE(3)

🦋 NAME 🦋

okay bestie, say hi to __gnu_parallel::_LoserTreeBase< _Tp, _Compare > — it's a Guarded loser/tournament tree, and yes it's literally as iconic as it sounds 💅

(this whole thing lives in the Library Functions Manual, iykyk)

---

✨ SYNOPSIS ✨

#include <losertree.h>

so the way that this works: it's inherited by __gnu_parallel::_LoserTree< false, _Tp, _Compare >, __gnu_parallel::_LoserTree< __stable, _Tp, _Compare >, and __gnu_parallel::_LoserTree< false, _Tp, _Compare >. yes bestie, that last one is listed twice — I don't make the rules, I just report them 🙈

🎀 Classes 🎀

• struct _Loser — Internal representation of a _LoserTree element. it's the little internal baddie doing the actual work.

🫶 Public Member Functions 🫶

• _LoserTreeBase (unsigned int __k, _Compare __comp) — The constructor. the glow-up moment ✨
• ~_LoserTreeBase () — The destructor. it's giving closure, literally.
• int __get_min_source ()
• void __insert_start (const _Tp &__key, int __source, bool __sup) — Initializes the sequence _M_source"withtheelement__key.

💜 Protected Attributes 💜

• _Compare _M_comp — _Compare to use.
• bool _M_first_insert — State flag that determines whether the _LoserTree is empty.
• unsigned int _M_ik
• unsigned int _M_k
• unsigned int _M_log_k
• _Loser * _M_losers — _LoserTree __elements.
• unsigned int _M_offset

---

🌸 Detailed Description 🌸

template<typename _Tp, typename _Compare>
class __gnu_parallel::_LoserTreeBase< _Tp, _Compare >"Guarded loser/tournament tree.

The smallest element is at the top. like, the main character is always at the top of the feed, no cap 👑

Guarding is done explicitly through one flag _M_sup per element, inf is not needed due to a better initialization routine. This is a well-performing variant. fr fr, it ate.

🌈 Parameters 🌈

• _Tp the element type
• _Compare the comparator to use, defaults to std::less<_Tp>

---

💖 Constructor & Destructor Documentation 💖

__gnu_parallel::_LoserTreeBase< _Tp, _Compare >::_LoserTreeBase (unsigned int __k, _Compare __comp) [inline]

The constructor.

Parameters:

• __k The number of sequences to merge.
• __comp The comparator to use.

References __gnu_parallel::__rd_log2(), _M_comp, _M_first_insert, _M_log_k, and _M_losers.

__gnu_parallel::_LoserTreeBase< _Tp, _Compare >::~_LoserTreeBase () [inline]

The destructor.

References _M_losers.

---

🔥 Member Function Documentation 🔥

int __gnu_parallel::_LoserTreeBase< _Tp, _Compare >::__get_min_source () [inline]

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

References _M_losers.

void __gnu_parallel::_LoserTreeBase< _Tp, _Compare >::__insert_start (const _Tp & __key, int __source, bool __sup) [inline]

Initializes the sequence "_M_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.

References _M_first_insert, and _M_losers.

---

🧚 Member Data Documentation 🧚

_Compare __gnu_parallel::_LoserTreeBase< _Tp, _Compare >::_M_comp [protected]

_Compare to use.

Referenced by _LoserTreeBase().

bool __gnu_parallel::_LoserTreeBase< _Tp, _Compare >::_M_first_insert [protected]

State flag that determines whether the _LoserTree is empty. Only used for building the _LoserTree.

Referenced by _LoserTreeBase(), and __insert_start().

unsigned int __gnu_parallel::_LoserTreeBase< _Tp, _Compare >::_M_log_k [protected]

log_2{_M_k}

Referenced by _LoserTreeBase().

_Loser* __gnu_parallel::_LoserTreeBase< _Tp, _Compare >::_M_losers [protected]

_LoserTree __elements.

Referenced by _LoserTreeBase(), ~_LoserTreeBase(), __get_min_source(), and __insert_start().

---

👑 Author 👑

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

---

okay that's the whole thing bestie, every flag and field accounted for, we left nothing on read 💀

and that's a wrap on this libstdc++ __gnu_para... _Compare >(3) page — go forth and merge your sequences, you absolute icon 🌟🫶