#include <forward_list.h>
|
| | _Fwd_list_node_base (_Fwd_list_node_base &&__x) noexcept |
|
| _Fwd_list_node_base (const _Fwd_list_node_base &)=delete |
| void | _M_reverse_after () noexcept |
| _Fwd_list_node_base * | _M_transfer_after (_Fwd_list_node_base *__begin, _Fwd_list_node_base *__end) noexcept |
| _Fwd_list_node_base & | operator= (_Fwd_list_node_base &&__x) noexcept |
|
_Fwd_list_node_base & | operator= (const _Fwd_list_node_base &)=delete |
A helper basic node class for forward_list. This is just a linked list with nothing inside it. There are purely list shuffling utility methods here.
Definition at line 54 of file forward_list.h.
◆ _Fwd_list_node_base()
| std::_Fwd_list_node_base::_Fwd_list_node_base |
( |
_Fwd_list_node_base && | __x | ) |
|
|
inlinenoexcept |
◆ _M_reverse_after()
| void std::_Fwd_list_node_base::_M_reverse_after |
( |
| ) |
|
|
inlinenoexcept |
◆ _M_transfer_after()
| _Fwd_list_node_base * std::_Fwd_list_node_base::_M_transfer_after |
( |
_Fwd_list_node_base * | __begin, |
|
|
_Fwd_list_node_base * | __end ) |
|
inlinenoexcept |
◆ operator=()
| _Fwd_list_node_base & std::_Fwd_list_node_base::operator= |
( |
_Fwd_list_node_base && | __x | ) |
|
|
inlinenoexcept |
◆ _M_next
| _Fwd_list_node_base* std::_Fwd_list_node_base::_M_next |
The documentation for this struct was generated from the following file: