nux-0.9.48
|
Iterator is used to access a double linked list. More...
#include <NuxCore/DataStruct/NList.h>
Public Member Functions | |
DIterator (NListNoDyn &List) | |
The only Constructor available accept a SRoot as parameter. | |
DIterator & | operator-- () |
DIterator | operator-- (int) |
DIterator & | operator-= (int cnt) |
DIterator & | operator++ () |
DIterator | operator++ (int) |
DIterator & | operator+= (int cnt) |
bool | operator== (const DIterator &Other) const |
bool | FindForward (const T &ToFind) |
bool | FindReverse (const T &ToFind) |
T * | RemoveCurrent (void) |
Removed the current element pointed by the Iterator internal index from the double linked list. | |
void | Begin (void) |
void | End (void) |
bool | Empty (void) const |
T * | operator* (void) const |
T * | Current (void) const |
Data Fields | |
NListNoDyn * | m_pList |
T * | m_pIndex |
Iterator is used to access a double linked list.
An Iterator is always created from a root double linked list. By default, it internal index will always point on the first element of the double linked list (the head).
NListNoDyn< T >::DIterator::DIterator | ( | NListNoDyn & | List | ) | [inline] |
The only Constructor available accept a SRoot as parameter.
References NListNoDyn< T >::DIterator::Begin(), and NListNoDyn< T >::DIterator::m_pList.
void NListNoDyn< T >::DIterator::Begin | ( | void | ) | [inline] |
References NListNoDyn< T >::Front(), NListNoDyn< T >::DIterator::m_pIndex, and NListNoDyn< T >::DIterator::m_pList.
Referenced by NListNoDyn< T >::DIterator::DIterator().
T* NListNoDyn< T >::DIterator::Current | ( | void | ) | const [inline] |
References NListNoDyn< T >::DIterator::m_pIndex.
bool NListNoDyn< T >::DIterator::Empty | ( | void | ) | const [inline] |
References NListNoDyn< T >::DIterator::m_pIndex.
Referenced by NListNoDyn< T >::DIterator::FindForward(), and NListNoDyn< T >::DIterator::FindReverse().
void NListNoDyn< T >::DIterator::End | ( | void | ) | [inline] |
bool NListNoDyn< T >::DIterator::FindForward | ( | const T & | ToFind | ) | [inline] |
References NListNoDyn< T >::DIterator::Empty(), and NListNoDyn< T >::DIterator::m_pIndex.
bool NListNoDyn< T >::DIterator::FindReverse | ( | const T & | ToFind | ) | [inline] |
References NListNoDyn< T >::DIterator::Empty(), and NListNoDyn< T >::DIterator::m_pIndex.
T* NListNoDyn< T >::DIterator::operator* | ( | void | ) | const [inline] |
References NListNoDyn< T >::DIterator::m_pIndex.
DIterator& NListNoDyn< T >::DIterator::operator++ | ( | ) | [inline] |
References NListNoDyn< T >::DIterator::m_pIndex, and nuxAssert.
DIterator NListNoDyn< T >::DIterator::operator++ | ( | int | ) | [inline] |
References NListNoDyn< T >::DIterator::m_pIndex, and nuxAssert.
DIterator& NListNoDyn< T >::DIterator::operator+= | ( | int | cnt | ) | [inline] |
References NListNoDyn< T >::DIterator::m_pIndex, and nuxAssert.
DIterator NListNoDyn< T >::DIterator::operator-- | ( | int | ) | [inline] |
References NListNoDyn< T >::DIterator::m_pIndex, and nuxAssert.
DIterator& NListNoDyn< T >::DIterator::operator-- | ( | ) | [inline] |
References NListNoDyn< T >::DIterator::m_pIndex, and nuxAssert.
DIterator& NListNoDyn< T >::DIterator::operator-= | ( | int | cnt | ) | [inline] |
References NListNoDyn< T >::DIterator::m_pIndex, and nuxAssert.
bool NListNoDyn< T >::DIterator::operator== | ( | const DIterator & | Other | ) | const [inline] |
References NListNoDyn< T >::DIterator::m_pIndex.
T* NListNoDyn< T >::DIterator::RemoveCurrent | ( | void | ) | [inline] |
Removed the current element pointed by the Iterator internal index from the double linked list.
The function will assert if there is no current element (Current() returns null or Empty() returns true).
References NListNoDyn< T >::DIterator::m_pIndex, NListNoDyn< T >::DIterator::m_pList, and nuxAssert.
T* NListNoDyn< T >::DIterator::m_pIndex |
Referenced by NListNoDyn< T >::DIterator::Begin(), NListNoDyn< T >::DIterator::Current(), NListNoDyn< T >::DIterator::Empty(), NListNoDyn< T >::DIterator::End(), NListNoDyn< T >::DIterator::FindForward(), NListNoDyn< T >::DIterator::FindReverse(), NListNoDyn< T >::DIterator::operator*(), NListNoDyn< T >::DIterator::operator++(), NListNoDyn< T >::DIterator::operator+=(), NListNoDyn< T >::DIterator::operator--(), NListNoDyn< T >::DIterator::operator-=(), NListNoDyn< T >::DIterator::operator==(), and NListNoDyn< T >::DIterator::RemoveCurrent().
NListNoDyn* NListNoDyn< T >::DIterator::m_pList |