|
| iterator | begin () const |
| | Returns an iterator to the first element in the container.
|
| |
| iterator | end () const |
| | Returns an iterator to the one-past-last element in the container.
|
| |
| reverse_iterator | rbegin () const |
| | Returns a reverse iterator to the last element in the container.
|
| |
| reverse_iterator | rend () const |
| | Returns a reverse iterator to the one-before-first element in the container.
|
| |
| int | size () const |
| | Returns the number of elements in the container.
|
| |
| | List () |
| | Constructs an empty doubly linked list.
|
| |
| | List (const List< E > &L) |
| | Constructs a doubly linked list that is a copy of L.
|
| |
| | List (List< E > &&L) noexcept |
| | Constructs a doubly linked list containing the elements of L (move semantics).
|
| |
| | List (std::initializer_list< E > init) |
| | Constructs a doubly linked list containing the elements in init.
|
| |
| const ListPure< E > & | getListPure () const |
| | Conversion to const ListPure.
|
| |
| List< E > & | operator= (const List< E > &L) |
| | Assignment operator.
|
| |
| List< E > & | operator= (List< E > &&L) |
| | Assignment operator (move semantics).
|
| |
| bool | operator== (const List< E > &L) const |
| | Equality operator.
|
| |
| bool | operator!= (const List< E > &L) const |
| | Inequality operator.
|
| |
| iterator | pushFront (const E &x) |
| | Adds element x at the beginning of the list.
|
| |
| template<class... Args> |
| iterator | emplaceFront (Args &&... args) |
| | Adds a new element at the beginning of the list.
|
| |
| iterator | pushBack (const E &x) |
| | Adds element x at the end of the list.
|
| |
| template<class... Args> |
| iterator | emplaceBack (Args &&... args) |
| | Adds a new element at the end of the list.
|
| |
| iterator | insert (const E &x, iterator it, Direction dir=Direction::after) |
| | Inserts element x before or after it.
|
| |
| iterator | insertBefore (const E &x, iterator it) |
| | Inserts element x before it.
|
| |
| iterator | insertAfter (const E &x, iterator it) |
| | Inserts element x after it.
|
| |
| void | popFront () |
| | Removes the first element from the list.
|
| |
| E | popFrontRet () |
| | Removes the first element from the list and returns it.
|
| |
| void | popBack () |
| | Removes the last element from the list.
|
| |
| E | popBackRet () |
| | Removes the last element from the list and returns it.
|
| |
| void | del (iterator it) |
| | Removes it from the list.
|
| |
| bool | removeFirst (const E &x) |
| | Removes the first occurrence of x (if any) from the list.
|
| |
| void | clear () |
| | Removes all elements from the list.
|
| |
| void | moveToFront (iterator it, List< E > &L2) |
| | Moves it to the begin of the list.
|
| |
| void | moveToBack (iterator it, List< E > &L2) |
| | Moves it to the end of the list.
|
| |
| void | moveToSucc (iterator it, List< E > &L2, iterator itBefore) |
| | Moves it after itBefore.
|
| |
| void | moveToPrec (iterator it, List< E > &L2, iterator itAfter) |
| | Moves it before itAfter.
|
| |
| void | conc (List< E > &L2) |
| | Appends L2 to this list and makes L2 empty.
|
| |
| void | concFront (List< E > &L2) |
| | Prepends L2 to this list and makes L2 empty.
|
| |
| void | swap (List< E > &other) |
| | Exchanges the contents of this list and other in constant time.
|
| |
| void | split (iterator it, List< E > &L1, List< E > &L2, Direction dir=Direction::before) |
| | Splits the list at element it into lists L1 and L2.
|
| |
template<class E, class
Master>
class ogdf::ListContainer< E, Master >
Definition at line 1828 of file List.h.
Inheritance diagram for ogdf::ListContainer< E, Master >:
