#include <ticpp.h>
Public Member Functions | |
T * | end () |
For for loop comparisons. | |
Iterator (const std::string &value="") | |
Constructor. | |
Iterator (T *node, const std::string &value="") | |
Constructor. | |
Iterator (const Iterator &it, const std::string &value="") | |
Constructor. | |
T * | Get () |
Gets internal pointer. | |
Iterator & | operator= (const Iterator &it) |
Sets internal pointer. | |
Iterator & | operator= (T *p) |
Sets internal pointer. | |
Iterator & | operator++ () |
Sets internal pointer to the Next Sibling, or Iterator::END, if there are no more siblings. | |
Iterator & | operator++ (int) |
Sets internal pointer to the Next Sibling, or Iterator::END, if there are no more siblings. | |
Iterator & | operator-- () |
Sets internal pointer to the Previous Sibling, or Iterator::END, if there are no prior siblings. | |
Iterator & | operator-- (int) |
Sets internal pointer to the Previous Sibling, or Iterator::END, if there are no prior siblings. | |
bool | operator!= (T *p) |
Compares internal pointer. | |
bool | operator!= (const Iterator &it) |
Compares internal pointer. | |
bool | operator== (T *p) |
Compares internal pointer*. | |
bool | operator== (const Iterator &it) |
Compares internal pointer. | |
T * | operator-> () |
So Iterator behaves like a STL iterator. | |
T & | operator * () |
So Iterator behaves like a STL iterator. |
T* ticpp::Iterator< T >::Get | ( | ) | [inline] |
Gets internal pointer.