__GNU_PBDS::DETAIL::LEFT_CHILD_NEXT_SIBLING_HEAP_NODE_(3)

💖 NAME 💖

__gnu_pbds::detail::left_child_next_sibling_heap_node_ < _Value, _Metadata, _Alloc > — bestie, it's a Node. That's it. That's the whole job. It's a node. 🎀

This page lives in the Library Functions Manual corner of your system, and it's literally just describing one lil struct that does one lil job: holding your data together in a left-child, next-sibling heap. Iconic behaviour, honestly.

---

✨ SYNOPSIS ✨

First things first, you gotta let the compiler know this exists:

#include <node.hpp>

🌸 Public Types 🌸

Okay so these are the types this node is working with — no cap, they're all right here:

• metadata_type — a typedef for _Metadata. Yes, that's the same _Metadata from the template. She's consistent. 💅
• node_pointer — a typedef for rebind_traits< _Alloc, this_type >::pointer. This is the pointer type you use to point at other nodes of this same type. It's giving self-referential main character energy. 🦋
• size_type — a typedef for _Alloc::size_type. It's the size type, borrowed straight from your allocator. Nothing extra, nothing less. ⭐
• value_type — a typedef for _Value. The actual thing you're storing. The payload. The moment. 🔥

👑 Public Attributes 👑

And here's where the node keeps all its business:

• metadata_type m_metadata — the metadata slot. Whatever extra info your _Metadata type wants to carry around, this is its home. 🏠
• node_pointer m_p_l_child — pointer to this node's left child. Family tree goes down through here.
• node_pointer m_p_next_sibling — pointer to the next sibling. This is how you hop across the row, bestie. ➡️
• node_pointer m_p_prev_or_parent — pointer to the previous sibling, or the parent. Yeah, it's doing double duty. One pointer, two possible meanings, and it knows exactly which one it is at any given time. She's versatile like that. 💀
• value_type m_value — the actual stored value. The whole reason we're here. The moment. 🍓

---

🌈 Detailed Description 🌈

Here's the full declaration, exactly as it is, no edits from me:

template<typename _Value, typename _Metadata, typename _Alloc>
    struct __gnu_pbds::detail::left_child_next_sibling_heap_node_< _Value,
    _Metadata, _Alloc >

And what is it? It's a Node. 🫶

That's genuinely the entire description. It's a node. It nodes. It's out here being a structural building block for the left-child next-sibling heap, holding a value_type, a metadata_type, and three node_pointers so it can find its child, its next sibling, and its prev-or-parent. Lowkey a whole social network in one struct. 💜

Heads up bestie: this is a detail namespace type, which means it's an implementation detail of __gnu_pbds — not the public API you're meant to be poking at directly. It's here in the docs because Doxygen documents everything it can see, but like… don't build your whole app on it, okay? 🙈

---

🧚 Author 🧚

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

No human wrote this by hand, and honestly? The robot ate. 🤖✨

---

That's the whole page, babes — this is libstdc++ and this man page is __gnu_pbds...a, _Alloc >(3), and it came straight from the source code with love (and a Doxygen run). Stay structurally sound out there. 💖🎀🦋