__GNU_PARALLEL::_LOSERTREE(3)

💖 NAME 💖

__gnu_parallel::_LoserTree< __stable, _Tp, _Compare > — the stable _LoserTree variant, bestie. That's the whole vibe. (And yeah, we're in the libstdc++ Library Functions Manual, section 3, iykyk 🎀)

---

✨ SYNOPSIS ✨

#include <losertree.h>

She inherits from __gnu_parallel::_LoserTreeBase< _Tp, _Compare > — so a whole bunch of her powers are inherited, we love a nepo baby 💅

🫶 Public Member Functions

• _LoserTree (unsigned int __k, _Compare __comp) — the constructor, she's born ✨
• void __delete_min_insert (_Tp __key, bool __sup) — deletes the smallest element and inserts a new element from the previously smallest element's sequence
• int __get_min_source ()
• void __init ()
• unsigned int __init_winner (unsigned int __root)
• void __insert_start (const _Tp &__key, int __source, bool __sup) — initializes the sequence _M_source with the element __key

🌸 Protected Attributes

• unsigned int _M_ik
• unsigned int _M_log_k
• unsigned int _M_offset

---

🌈 Detailed Description

template<bool __stable, typename _Tp, typename _Compare>
class __gnu_parallel::_LoserTree< __stable, _Tp, _Compare >

Stable _LoserTree variant. 🦋

Okay so here's the tea: she provides the stable implementations of insert_start, __init_winner, __init and __delete_min_insert. All four, no skips, periodt.

And the unstable variant? Not here, babe — that one gets done using partial specialisation below. Different girl entirely. 💀

---

🎀 Member Function Documentation 🎀

💅 __delete_min_insert

template<bool __stable, typename _Tp, typename _Compare>
void __gnu_parallel::_LoserTree< __stable, _Tp, _Compare >::__delete_min_insert
    (_Tp __key, bool __sup) [inline]

Deletes the smallest element and inserts a new element from the previously smallest element's sequence. And this implementation? This implementation is stable. Say it back. 👑

💜 __get_min_source

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

Returns — the index of the sequence with the smallest element. That's it, that's the whole function, and she ate. ✨

References _M_losers.

🦋 __insert_start

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

Initializes the sequence "_M_source" with the element "__key". Glow up for a sequence, honestly.

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 ⭐

🌸 _M_log_k

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

log_2{_M_k} — yes bestie, that's literally the entire description, no notes. 📐

Referenced by _LoserTreeBase().

---

👑 Author

Generated automatically by Doxygen for libstdc++ from the source code. Not a human, not a girlboss, just a documentation generator doing its lil thing 🤖✨

---

Heads up: every one of these members is [inline], and the _LoserTreeBase ones are [inherited], and _M_log_k is [protected] — so mind your access, bestie 🙈

libstdc++ made this page happen, and it's the __gnu_para... _Compare >(3) manual page — that's the source and the version tag, mwah, no cap 💖 Thanks for reading all the way to the bottom, you're literally the main character 🫶🎀