STD::_FWD_LIST_NODE(3cxx)

🎀 NAME 🎀

Okay bestie, welcome to the std::_Fwd_list_node< _Tp >(3cxx) page 💅. This is a helper node class for forward_list — that's the whole vibe. It's just a linked list, but every node has uninitialized storage for a data value in it. Also? There is a sorting utility method. Yes ma'am.

---

✨ SYNOPSIS ✨

#include <forward_list>

Inherits std::_Fwd_list_node_base — that's the base class, periodt.

💖 Public Member Functions 💖

• void _M_reverse_after () noexcept — the reverse-after operation, and it's marked noexcept 🫶.
• _Fwd_list_node_base * _M_transfer_after (_Fwd_list_node_base *__begin, _Fwd_list_node_base *__end) noexcept — the transfer-after helper: it takes __begin and __end, both _Fwd_list_node_base *, returns a _Fwd_list_node_base *, and is noexcept.
• const _Tp * _M_valptr () const noexcept — const flavor of the value-pointer getter: returns const _Tp *, and it's noexcept.
• _Tp * _M_valptr () noexcept — non-const flavor of the value-pointer getter: returns _Tp *, and it's noexcept.

🦋 Public Attributes 🦋

• _Fwd_list_node_base * _M_next — a _Fwd_list_node_base * named _M_next. Exact type, no cap.
• __gnu_cxx::__aligned_buffer< _Tp > _M_storage — the aligned buffer for storage, typed exactly as __gnu_cxx::__aligned_buffer< _Tp >.

---

🌸 Detailed Description 🌸

template<typename _Tp>
struct std::_Fwd_list_node< _Tp >

The description attached to that struct says: “A helper node class for forward_list. This is just a linked list with uninitialized storage for a data value in each node. There is a sorting utility method.” Like, that's it, that's the tea ☕✨.

---

👑 Author 👑

This page was generated automatically by Doxygen for libstdc++ from the source code — yes, she's auto-built, not handwritten 💅.

---

Cute sign-off bestie: source/version is libstdc++, and the footer repeats std::_Fwd_list_node< _Tp >(3cxx); no separate date is shown on this page. Bye 🫶🌈✨