STD::_LIST_NODE(3cxx)

🌸 NAME 🌸

std::_List_node< _Tp > — bestie, this is literally an actual node in the list. The manual name is std::_List_node< _Tp >(3cxx), and that's the whole vibe.

✨ SYNOPSIS ✨

First thing you gotta do is bring in the header:

#include <list>

And it inherits std::__detail::_List_node_base. No cap, that's the base-class situation.

💅 Public Member Functions 💅

• void _M_hook (_List_node_base *const __position) noexcept — the _M_hook member function, signature exactly like this, with __position and noexcept and everything.
• void _M_reverse () noexcept — _M_reverse, no args, noexcept, clean and simple.
• void _M_transfer (_List_node_base *const __first, _List_node_base *const __last) noexcept — _M_transfer taking __first and __last, both _List_node_base *const, and yes it's noexcept.
• void _M_unhook () noexcept — _M_unhook, no args, noexcept.
• _Tp * _M_valptr () — _M_valptr returning _Tp *.
• _Tp const * _M_valptr () const — the const version of _M_valptr, returning _Tp const *.

🎀 Static Public Member Functions 🎀

• static void swap (_List_node_base &__x, _List_node_base &__y) noexcept — static swap taking two _List_node_base & refs named __x and __y, and it's noexcept.

🦋 Public Attributes 🦋

• _List_node_base * _M_next — public attribute _M_next, type _List_node_base *.
• _List_node_base * _M_prev — public attribute _M_prev, type _List_node_base *.
• __gnu_cxx::__aligned_membuf< _Tp > _M_storage — public attribute _M_storage, type __gnu_cxx::__aligned_membuf< _Tp >.

💖 Detailed Description 💖

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

The description is literally: "An actual node in the list." Iconic. Periodt.

🌈 Author 🌈

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

---

💖 that's the whole std::_List_node< _Tp >(3cxx) moment, bestie — source/version: libstdc++, and there's no date in the footer so I'm not inventing one. Catch you in the include graph. 🫶