#include <slist.hpp>
template<typename T, class TAllocator = std::allocator>
class std::slist< T, TAllocator >
◆ allocator_type
template<typename T , class TAllocator = std::allocator>
◆ const_iterator
template<typename T , class TAllocator = std::allocator>
◆ iterator
template<typename T , class TAllocator = std::allocator>
◆ size_type
template<typename T , class TAllocator = std::allocator>
◆ value_type
template<typename T , class TAllocator = std::allocator>
◆ slist() [1/3]
template<typename T , class TAllocator = std::allocator>
150 : m_allocator(allocator)
◆ slist() [2/3]
template<typename T , class TAllocator = std::allocator>
template<class InputIterator >
155 : m_allocator(allocator)
void assign(InputIterator first, InputIterator last)
Definition: slist.hpp:226
◆ slist() [3/3]
template<typename T , class TAllocator = std::allocator>
161 : m_allocator(allocator)
164 assign(rhs.begin(), rhs.end());
void assign(InputIterator first, InputIterator last)
Definition: slist.hpp:226
◆ ~slist()
template<typename T , class TAllocator = std::allocator>
void clear()
Definition: slist.hpp:238
◆ assign()
template<typename T , class TAllocator = std::allocator>
template<class InputIterator >
void std::slist< T, TAllocator >::assign |
( |
InputIterator |
first, |
|
|
InputIterator |
last |
|
) |
| |
|
inline |
230 while (first != last)
node_iterator< node *, T *, T & > iterator
Definition: slist.hpp:145
void clear()
Definition: slist.hpp:238
void insert_after(iterator pos, const T &value)
Definition: slist.hpp:220
◆ begin() [1/2]
template<typename T , class TAllocator = std::allocator>
182 return iterator(upcast(m_root.next));
node_iterator< node *, T *, T & > iterator
Definition: slist.hpp:145
◆ begin() [2/2]
template<typename T , class TAllocator = std::allocator>
node_iterator< const node *, const T *, const T & > const_iterator
Definition: slist.hpp:146
◆ clear()
template<typename T , class TAllocator = std::allocator>
240 node* it = upcast(m_root.next);
241 while (it != &m_root)
243 node* nextIt = upcast(it->next);
◆ empty()
template<typename T , class TAllocator = std::allocator>
251 return !m_root.in_list();
◆ end() [1/2]
template<typename T , class TAllocator = std::allocator>
node_iterator< node *, T *, T & > iterator
Definition: slist.hpp:145
◆ end() [2/2]
template<typename T , class TAllocator = std::allocator>
node_iterator< const node *, const T *, const T & > const_iterator
Definition: slist.hpp:146
◆ front() [1/2]
template<typename T , class TAllocator = std::allocator>
const T& std::slist< T, TAllocator >::front |
( |
| ) |
const |
|
inline |
200 return upcast(m_root.next)->value;
bool empty() const
Definition: slist.hpp:249
◆ front() [2/2]
template<typename T , class TAllocator = std::allocator>
205 return upcast(m_root.next)->value;
bool empty() const
Definition: slist.hpp:249
◆ insert_after()
template<typename T , class TAllocator = std::allocator>
222 node* newNode = construct_node(value);
223 newNode->link_after(pos.node());
◆ operator=()
template<typename T , class TAllocator = std::allocator>
175 assign(rhs.begin(), rhs.end());
void assign(InputIterator first, InputIterator last)
Definition: slist.hpp:226
◆ pop_front()
template<typename T , class TAllocator = std::allocator>
216 node* n = upcast(m_root.next);
bool empty() const
Definition: slist.hpp:249
◆ previous() [1/2]
template<typename T , class TAllocator = std::allocator>
269 assert(nextIt.node()->in_list());
271 while (nextIt.node() != prevIt.next())
node_iterator< node *, T *, T & > iterator
Definition: slist.hpp:145
◆ previous() [2/2]
template<typename T , class TAllocator = std::allocator>
277 assert(nextIt.node()->in_list());
279 while (nextIt.node() != prevIt.next())
node_iterator< const node *, const T *, const T & > const_iterator
Definition: slist.hpp:146
◆ push_front()
template<typename T , class TAllocator = std::allocator>
void std::slist< T, TAllocator >::push_front |
( |
const T & |
value | ) |
|
|
inline |
210 node* newNode = construct_node(value);
211 newNode->link_after(&m_root);
◆ size()
template<typename T , class TAllocator = std::allocator>
256 const node* it = upcast(m_root.next);
258 while (it != &m_root)
261 it = upcast(it->next);
int size_type
Definition: slist.hpp:144
size_type size() const
Definition: slist.hpp:254
◆ kNodeSize
template<typename T , class TAllocator = std::allocator>
const size_t std::slist< T, TAllocator >::kNodeSize = sizeof(node) |
|
static |
Die Dokumentation für diese Klasse wurde erzeugt aufgrund der Datei: