ticpp::Iterator< T > Class Template Reference

Iterator for conveniently stepping through Nodes and Attributes. More...

#include <ticpp.h>

List of all members.

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.
Iteratoroperator= (const Iterator &it)
 Sets internal pointer.
Iteratoroperator= (T *p)
 Sets internal pointer.
Iteratoroperator++ ()
 Sets internal pointer to the Next Sibling, or Iterator::END, if there are no more siblings.
Iteratoroperator++ (int)
 Sets internal pointer to the Next Sibling, or Iterator::END, if there are no more siblings.
Iteratoroperator-- ()
 Sets internal pointer to the Previous Sibling, or Iterator::END, if there are no prior siblings.
Iteratoroperator-- (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.


Detailed Description

template<class T = Node>
class ticpp::Iterator< T >

Iterator for conveniently stepping through Nodes and Attributes.


Member Function Documentation

template<class T = Node>
T* ticpp::Iterator< T >::Get (  )  [inline]

Gets internal pointer.

Returns:
The internal pointer.


The documentation for this class was generated from the following file:
Generated on Thu Sep 7 14:23:33 2006 for TinyXml by  doxygen 1.4.7