#include <list.h>
Public Member Functions | |
T & | back () |
ListIterator< T > | backIterator () |
bool | empty () |
void | erase (ListNode< T > *node) |
T & | front () |
ListIterator< T > | frontIterator () |
ListNode< T > * | getBackPointer () |
ListNode< T > * | getFrontPointer () |
List () | |
void | moveToBack (ListNode< T > *node) |
void | moveToFront (ListNode< T > *node) |
void | pop_back () |
void | pop_front () |
void | push_back (const T &object) |
void | push_front (const T &object) |
void | spliceToBack (List &splice_list) |
~List () | |
Private Attributes | |
ListNode< T > * | list_back |
ListNode< T > * | list_front |
megatree::List< T >::List | ( | ) | [inline] |
megatree::List< T >::~List | ( | ) | [inline] |
T& megatree::List< T >::back | ( | ) | [inline] |
ListIterator<T> megatree::List< T >::backIterator | ( | ) | [inline] |
bool megatree::List< T >::empty | ( | ) | [inline] |
void megatree::List< T >::erase | ( | ListNode< T > * | node | ) | [inline] |
T& megatree::List< T >::front | ( | ) | [inline] |
ListIterator<T> megatree::List< T >::frontIterator | ( | ) | [inline] |
ListNode<T>* megatree::List< T >::getBackPointer | ( | ) | [inline] |
ListNode<T>* megatree::List< T >::getFrontPointer | ( | ) | [inline] |
void megatree::List< T >::moveToBack | ( | ListNode< T > * | node | ) | [inline] |
void megatree::List< T >::moveToFront | ( | ListNode< T > * | node | ) | [inline] |
void megatree::List< T >::pop_back | ( | ) | [inline] |
void megatree::List< T >::pop_front | ( | ) | [inline] |
void megatree::List< T >::push_back | ( | const T & | object | ) | [inline] |
void megatree::List< T >::push_front | ( | const T & | object | ) | [inline] |
void megatree::List< T >::spliceToBack | ( | List< T > & | splice_list | ) | [inline] |
ListNode<T>* megatree::List< T >::list_back [private] |
ListNode<T>* megatree::List< T >::list_front [private] |