doubly-linked list
More...
#include <modm/container/doubly_linked_list.hpp>
|
typedef Allocator::template rebind< Node >::other | NodeAllocator |
|
|
NodeAllocator | nodeAllocator |
|
Node * | front |
|
Node * | back |
|
|
class | const_iterator |
|
class | iterator |
|
template<typename T, typename Allocator = allocator::Dynamic<T>>
class modm::DoublyLinkedList< T, Allocator >
doubly-linked list
- Template Parameters
-
- Author
- Fabian Greif
template<typename T , typename Allocator = allocator::Dynamic<T>>
iterator modm::DoublyLinkedList< T, Allocator >::begin |
( |
| ) |
|
Returns a read/write iterator that points to the first element in the list. Iteration is done in ordinary element order.
template<typename T , typename Allocator = allocator::Dynamic<T>>
const_iterator modm::DoublyLinkedList< T, Allocator >::begin |
( |
| ) |
const |
Returns a read-only (constant) iterator that points to the first element in the list. Iteration is done in ordinary element order.
template<typename T , typename Allocator = allocator::Dynamic<T>>
iterator modm::DoublyLinkedList< T, Allocator >::end |
( |
| ) |
|
Returns a read/write iterator that points one past the last element in the list. Iteration is done in ordinary element order.
template<typename T , typename Allocator = allocator::Dynamic<T>>
Returns a read-only (constant) iterator that points one past the last element in the list. Iteration is done in ordinary element order.
template<typename T , typename Allocator = allocator::Dynamic<T>>
Deletes element pointed to by iterator and returns an iterator to the next element behind the deleted one.
Warning: you must not use the iterator after calling erase()
template<typename T , typename Allocator = allocator::Dynamic<T>>
const T& modm::DoublyLinkedList< T, Allocator >::getBack |
( |
| ) |
const |
|
inline |
- Returns
- the last node in the list
template<typename T , typename Allocator = allocator::Dynamic<T>>
const T& modm::DoublyLinkedList< T, Allocator >::getFront |
( |
| ) |
const |
|
inline |
- Returns
- the first node in the list
template<typename T , typename Allocator = allocator::Dynamic<T>>
std::size_t modm::DoublyLinkedList< T, Allocator >::getSize |
( |
| ) |
const |
Get number of items in the list.
Very slow for a long list as it needs to iterate through all items in the list.
The documentation for this class was generated from the following file: