A doublely linked list. More...
#include <List.h>
Classes | |
class | Iterator |
Iterate the nodes of the list. More... | |
Public Member Functions | |
List (const List< T > &list) | |
List< T > & | operator= (const List< T > &list) |
bool | IsEmpty () const |
void | Clear () |
void | Add (T data) |
Iterator | Begin () |
T & | ElementAt (const int index) const |
T & | operator[] (const int idx) const |
void | RemoveCurrent (Iterator &iter) |
T | Pop () |
T | Peek () const |
T & | PeekRef () const |
T | Tail () const |
T & | TailRef () const |
void | RemoveTail () |
void | Remove (const T &data) |
int | Count () const |
RefCountPtr< Array< T > > | ToArray () const |
void | ValidateMem () const |
void | CheckMem () const |
Protected Member Functions | |
virtual RefCountPtr< IIterator < T > > | IteratorPtr () |
Protected Attributes | |
_listnode< T > | m_head |
_listnode< T > | m_tail |
int | m_count |
A doublely linked list.
Definition at line 48 of file List.h.