ticpp::Iterator< T > Class Template Reference

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

#include <ticpp.h>

Collaboration diagram for ticpp::Iterator< T >:

Public Member Functions
T *	begin (const Node *parent) const
	For for loop comparisons.
T *	end () const
	For for loop comparisons.
	Iterator (const std::string &value="")
	Constructor.
	Iterator (T *node, const std::string &value="")
	Constructor.
	Iterator (const Iterator &it)
	Constructor.
T *	Get () const
	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!= (const T *p) const
	Compares internal pointer.
bool	operator!= (const Iterator &it) const
	Compares internal pointer.
bool	operator== (T *p) const
	Compares internal pointer*.
bool	operator== (const Iterator &it) const
	Compares internal pointer.
T *	operator-> () const
	So Iterator behaves like a STL iterator.
T &	operator* () const
	So Iterator behaves like a STL iterator.

Private Attributes
T *	m_p
	Internal Pointer.
std::string	m_value
	Value for NextSibling calls.

Detailed Description

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

Iterator for conveniently stepping through Nodes and Attributes.

TinyXML++ introduces iterators:

ticpp::Iterator< ticpp::Node > child;
for ( child = child.begin( parent ); child != child.end(); child++ )

Iterators have the added advantage of filtering by type:

// Only iterates through Comment nodes
ticpp::Iterator< ticpp::Comment > child;
for ( child = child.begin( parent ); child != child.end(); child++ )

// Only iterates through Element nodes with value "ElementValue"
ticpp::Iterator< ticpp::Element > child( "ElementValue" );
for ( child = child.begin( parent ); child != child.end(); child++ )

Finally, Iterators also work with Attributes

ticpp::Iterator< ticpp::Attribute > attribute;
for ( attribute = attribute.begin( element ); attribute != attribute.end();
attribute++ )

Definition at line 1112 of file ticpp.h.

Constructor & Destructor Documentation

Iterator() [1/3]

template<class T = Node>

ticpp::Iterator< T >::Iterator ( const std::string & value = "" )

inline

Constructor.

Parameters

value

If not empty, this iterator will only visit nodes with matching value. // Only iterates through Element nodes with value "ElementValue" ticpp::Iterator< ticpp::Element > child( "ElementValue" ); for ( child = child.begin( parent ); child != child.end(); child++ )

Definition at line 1152 of file ticpp.h.

        : m_p(0)
        , m_value(value) {}

References m_p, and m_value.

Referenced by Iterator(), operator!=(), operator++(), operator++(), operator--(), operator--(), operator=(), operator=(), and operator==().

Here is the caller graph for this function:

Iterator() [2/3]

template<class T = Node>

ticpp::Iterator< T >::Iterator ( T * node, const std::string & value = "" )

inline

Constructor.

Definition at line 1157 of file ticpp.h.

        : m_p(node)
        , m_value(value) {}

References m_p, and m_value.

Iterator() [3/3]

template<class T = Node>

ticpp::Iterator< T >::Iterator ( const Iterator< T > & it )

inline

Constructor.

Definition at line 1162 of file ticpp.h.

        : m_p(it.m_p)
        , m_value(it.m_value) {}

References Iterator(), m_p, and m_value.

Here is the call graph for this function:

Member Function Documentation

begin()

template<class T = Node>

T * ticpp::Iterator< T >::begin ( const Node * parent ) const

inline

For for loop comparisons.

Parameters

parent

The parent of the nodes to iterate.

Returns

The first child of type T.

ticpp::Iterator< ticpp::Node > child;
for ( child = child.begin( parent ); child != child.end(); child++ )

Definition at line 1127 of file ticpp.h.

                                       {
      T* pointer;
      parent->IterateFirst(m_value, &pointer);
      return pointer;
    }

References ticpp::Node::IterateFirst(), and m_value.

Here is the call graph for this function:

end()

template<class T = Node>

T * ticpp::Iterator< T >::end ( ) const

inline

For for loop comparisons.

Returns

nullptr

ticpp::Iterator< ticpp::Node > child;
for ( child = child.begin( parent ); child != child.end(); child++ )

Definition at line 1141 of file ticpp.h.

{ return 0; }

Get()

template<class T = Node>

T * ticpp::Iterator< T >::Get ( ) const

inline

Gets internal pointer.

Returns

The internal pointer.

Definition at line 1170 of file ticpp.h.

{ return m_p; }

References m_p.

operator!=() [1/2]

template<class T = Node>

bool ticpp::Iterator< T >::operator!= ( const Iterator< T > & it ) const

inline

Compares internal pointer.

Definition at line 1233 of file ticpp.h.

{ return operator!=(it.m_p); }

References Iterator(), m_p, and operator!=().

Referenced by operator!=().

Here is the call graph for this function:

Here is the caller graph for this function:

operator!=() [2/2]

template<class T = Node>

bool ticpp::Iterator< T >::operator!= ( const T * p ) const

inline

Compares internal pointer.

Definition at line 1220 of file ticpp.h.

                                    {
      if (m_p == p) {
        return false;
      }
 
      if (0 == m_p || 0 == p) {
        return true;
      }
 
      return *m_p != *p;
    }

References m_p.

operator*()

template<class T = Node>

T & ticpp::Iterator< T >::operator* ( ) const

inline

So Iterator behaves like a STL iterator.

Definition at line 1255 of file ticpp.h.

{ return *m_p; }

References m_p.

operator++() [1/2]

template<class T = Node>

Iterator & ticpp::Iterator< T >::operator++ ( )

inline

Sets internal pointer to the Next Sibling, or Iterator::END, if there are no more siblings.

Definition at line 1188 of file ticpp.h.

                           {
      m_p->IterateNext(m_value, &m_p);
      return *this;
    }

References Iterator(), m_p, and m_value.

Here is the call graph for this function:

operator++() [2/2]

template<class T = Node>

Iterator ticpp::Iterator< T >::operator++ ( int )

inline

Sets internal pointer to the Next Sibling, or Iterator::END, if there are no more siblings.

Definition at line 1196 of file ticpp.h.

                             {
      Iterator tmp(*this);
      ++(*this);
      return tmp;
    }

References Iterator().

Here is the call graph for this function:

operator--() [1/2]

template<class T = Node>

Iterator & ticpp::Iterator< T >::operator-- ( )

inline

Sets internal pointer to the Previous Sibling, or Iterator::END, if there are no prior siblings.

Definition at line 1205 of file ticpp.h.

                           {
      m_p->IteratePrevious(m_value, &m_p);
      return *this;
    }

References Iterator(), m_p, and m_value.

Here is the call graph for this function:

operator--() [2/2]

template<class T = Node>

Iterator ticpp::Iterator< T >::operator-- ( int )

inline

Sets internal pointer to the Previous Sibling, or Iterator::END, if there are no prior siblings.

Definition at line 1213 of file ticpp.h.

                             {
      Iterator tmp(*this);
      --(*this);
      return tmp;
    }

References Iterator().

Here is the call graph for this function:

operator->()

template<class T = Node>

T * ticpp::Iterator< T >::operator-> ( ) const

inline

So Iterator behaves like a STL iterator.

Definition at line 1252 of file ticpp.h.

{ return m_p; }

References m_p.

operator=() [1/2]

template<class T = Node>

Iterator & ticpp::Iterator< T >::operator= ( const Iterator< T > & it )

inline

Sets internal pointer.

Definition at line 1173 of file ticpp.h.

                                          {
      m_p = it.m_p;
      m_value = it.m_value;
      return *this;
    }

References Iterator(), m_p, and m_value.

Here is the call graph for this function:

operator=() [2/2]

template<class T = Node>

Iterator & ticpp::Iterator< T >::operator= ( T * p )

inline

Sets internal pointer.

Definition at line 1180 of file ticpp.h.

                            {
      m_p = p;
      return *this;
    }

References Iterator(), and m_p.

Here is the call graph for this function:

operator==() [1/2]

template<class T = Node>

bool ticpp::Iterator< T >::operator== ( const Iterator< T > & it ) const

inline

Compares internal pointer.

Definition at line 1249 of file ticpp.h.

{ return operator==(it.m_p); }

References Iterator(), m_p, and operator==().

Referenced by operator==().

Here is the call graph for this function:

Here is the caller graph for this function:

operator==() [2/2]

template<class T = Node>

bool ticpp::Iterator< T >::operator== ( T * p ) const

inline

Compares internal pointer*.

Definition at line 1236 of file ticpp.h.

                              {
      if (m_p == p) {
        return true;
      }
 
      if (0 == m_p || 0 == p) {
        return false;
      }
 
      return *m_p == *p;
    }

References m_p.

Member Data Documentation

m_p

template<class T = Node>

T* ticpp::Iterator< T >::m_p

private

Internal Pointer.

Definition at line 1114 of file ticpp.h.

Referenced by Iterator(), Iterator(), Iterator(), Get(), operator!=(), operator!=(), operator*(), operator++(), operator--(), operator->(), operator=(), operator=(), operator==(), and operator==().

m_value

template<class T = Node>

std::string ticpp::Iterator< T >::m_value

private

Value for NextSibling calls.

Definition at line 1115 of file ticpp.h.

Referenced by Iterator(), Iterator(), Iterator(), begin(), operator++(), operator--(), and operator=().

---

The documentation for this class was generated from the following file:

• agrum/base/external/tinyxml/ticpp/ticpp.h