<?xml version="1.0" encoding="iso-8859-1"?>
<!DOCTYPE html
PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "DTD/xhtml1-strict.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
<!-- /builddir/build/BUILD/libqxt/src/core/qxtlinkedtree.cpp -->
<head>
<title>QxtLinkedTreeIterator Class Reference</title>
<link href="stylesheet.css" rel="stylesheet" type="text/css" />
</head>
<body>
<table border="0" cellpadding="0" cellspacing="0" width="100%">
<tr>
<td align="left" valign="top" width="32"><a href="http://libqxt.org"><img src="images/qxt-logo.png" width="50" height="40" align="left" border="0" /></a></td>
<td width="1"> </td><td class="postheader" valign="center"><a href="index.html"><font color="#004faf">Home</font></a> · <a href="modules.html"><font color="#004faf">Modules</font></a> · <a href="classes.html"><font color="#004faf">Classes</font></a> · <a href="namespaces.html"><font color="#004faf">Namespaces</font></a> · <a href="functions.html"><font color="#004faf">Functions</font></a></td>
<td align="right" valign="top" width="230"></td></tr></table><h1 class="title">QxtLinkedTreeIterator Class Reference<br /><span class="small-subtitle">[<a href="qxtcore.html">QxtCore</a> module]</span>
</h1>
<p>The QxtLinkedTreeIterator class provides fast access to an <a href="qxtlinkedtree.html">QxtLinkedTree</a> <a href="#details">More...</a></p>
<pre> #include <QxtLinkedTreeIterator></pre><ul>
<li><a href="qxtlinkedtreeiterator-members.html">List of all members, including inherited members</a></li>
</ul>
<a name="public-functions"></a>
<h3>Public Functions</h3>
<ul>
<li><div class="fn"></div><b><a href="qxtlinkedtreeiterator.html#QxtLinkedTreeIterator">QxtLinkedTreeIterator</a></b> ()</li>
<li><div class="fn"></div><b><a href="qxtlinkedtreeiterator.html#QxtLinkedTreeIterator-2">QxtLinkedTreeIterator</a></b> ( const QxtLinkedTreeIterator<T> & <i>other</i> )</li>
<li><div class="fn"></div>QxtLinkedTreeIterator <b><a href="qxtlinkedtreeiterator.html#append">append</a></b> ( const T & <i>value</i> )</li>
<li><div class="fn"></div>QxtLinkedTreeIterator <b><a href="qxtlinkedtreeiterator.html#child">child</a></b> () const</li>
<li><div class="fn"></div>int <b><a href="qxtlinkedtreeiterator.html#children">children</a></b> () const</li>
<li><div class="fn"></div>QxtLinkedTreeIterator <b><a href="qxtlinkedtreeiterator.html#erase">erase</a></b> ()</li>
<li><div class="fn"></div>QxtLinkedTreeIterator <b><a href="qxtlinkedtreeiterator.html#insert">insert</a></b> ( int <i>i</i>, const T & <i>value</i> )</li>
<li><div class="fn"></div>bool <b><a href="qxtlinkedtreeiterator.html#isValid">isValid</a></b> () const</li>
<li><div class="fn"></div>QxtLinkedTreeIterator <b><a href="qxtlinkedtreeiterator.html#next">next</a></b> () const</li>
<li><div class="fn"></div>QxtLinkedTreeIterator <b><a href="qxtlinkedtreeiterator.html#parent">parent</a></b> () const</li>
<li><div class="fn"></div>QxtLinkedTreeIterator <b><a href="qxtlinkedtreeiterator.html#previous">previous</a></b> () const</li>
<li><div class="fn"></div><b><a href="qxtlinkedtreeiterator.html#operator-T">operator T</a></b> () const</li>
<li><div class="fn"></div>bool <b><a href="qxtlinkedtreeiterator.html#operator-not-eq">operator!=</a></b> ( const QxtLinkedTreeIterator<T> & <i>other</i> ) const</li>
<li><div class="fn"></div>T & <b><a href="qxtlinkedtreeiterator.html#operator-2a">operator*</a></b> () const</li>
<li><div class="fn"></div>QxtLinkedTreeIterator <b><a href="qxtlinkedtreeiterator.html#operator-2b">operator+</a></b> ( int <i>j</i> ) const</li>
<li><div class="fn"></div>QxtLinkedTreeIterator & <b><a href="qxtlinkedtreeiterator.html#operator-2b-2b">operator++</a></b> ()</li>
<li><div class="fn"></div>QxtLinkedTreeIterator <b><a href="qxtlinkedtreeiterator.html#operator-2b-2b-2">operator++</a></b> ( int )</li>
<li><div class="fn"></div>QxtLinkedTreeIterator & <b><a href="qxtlinkedtreeiterator.html#operator-2b-eq">operator+=</a></b> ( int <i>j</i> )</li>
<li><div class="fn"></div>QxtLinkedTreeIterator <b><a href="qxtlinkedtreeiterator.html#operator-">operator-</a></b> ( int <i>j</i> ) const</li>
<li><div class="fn"></div>QxtLinkedTreeIterator & <b><a href="qxtlinkedtreeiterator.html#operator--">operator--</a></b> ()</li>
<li><div class="fn"></div>QxtLinkedTreeIterator <b><a href="qxtlinkedtreeiterator.html#operator---2">operator--</a></b> ( int )</li>
<li><div class="fn"></div>QxtLinkedTreeIterator & <b><a href="qxtlinkedtreeiterator.html#operator--eq">operator-=</a></b> ( int <i>j</i> )</li>
<li><div class="fn"></div>T * <b><a href="qxtlinkedtreeiterator.html#operator--gt">operator-></a></b> () const</li>
<li><div class="fn"></div>QxtLinkedTreeIterator & <b><a href="qxtlinkedtreeiterator.html#operator-eq">operator=</a></b> ( const QxtLinkedTreeIterator<T> & <i>other</i> )</li>
<li><div class="fn"></div>bool <b><a href="qxtlinkedtreeiterator.html#operator-eq-eq">operator==</a></b> ( const QxtLinkedTreeIterator<T> & <i>other</i> ) const</li>
</ul>
<a name="details"></a>
<hr />
<h2>Detailed Description</h2>
<p>The QxtLinkedTreeIterator class provides fast access to an <a href="qxtlinkedtree.html">QxtLinkedTree</a></p>
<hr />
<h2>Member Function Documentation</h2>
<h3 class="fn"><a name="QxtLinkedTreeIterator"></a>QxtLinkedTreeIterator::QxtLinkedTreeIterator ()</h3>
<h3 class="fn"><a name="QxtLinkedTreeIterator-2"></a>QxtLinkedTreeIterator::QxtLinkedTreeIterator ( const QxtLinkedTreeIterator<T> & <i>other</i> )</h3>
<h3 class="fn"><a name="append"></a>QxtLinkedTreeIterator QxtLinkedTreeIterator::append ( const T & <i>value</i> )</h3>
<h3 class="fn"><a name="child"></a>QxtLinkedTreeIterator QxtLinkedTreeIterator::child () const</h3>
<p>returns an iterator to the first child item of this or an invalid iterator when there are no children</p>
<h3 class="fn"><a name="children"></a>int QxtLinkedTreeIterator::children () const</h3>
<p>returns the amount of childnodes.</p>
<h3 class="fn"><a name="erase"></a>QxtLinkedTreeIterator QxtLinkedTreeIterator::erase ()</h3>
<h3 class="fn"><a name="insert"></a>QxtLinkedTreeIterator QxtLinkedTreeIterator::insert ( int <i>i</i>, const T & <i>value</i> )</h3>
<h3 class="fn"><a name="isValid"></a>bool QxtLinkedTreeIterator::isValid () const</h3>
<p>verfies if this iterator points to a valid location inside the tree an invalid node is decoupled from the iteration. it can not be used for anything anymore.</p>
<pre> QxtLinkedTree<int> tree(1);
QxtLinkedTreeIterator<int> it= tree.begin();
it++; <span class="comment">//invalid. there are no siblings.</span>
it--; <span class="comment">//still invalid</span>!</pre>
<h3 class="fn"><a name="next"></a>QxtLinkedTreeIterator QxtLinkedTreeIterator::next () const</h3>
<p>returns an iterator to the next item of this in the previous/next chain or an invalid iterator when this is the last one</p>
<h3 class="fn"><a name="parent"></a>QxtLinkedTreeIterator QxtLinkedTreeIterator::parent () const</h3>
<p>returns an iterator to the parent item of this. or an invalid iterator when this is the root node</p>
<h3 class="fn"><a name="previous"></a>QxtLinkedTreeIterator QxtLinkedTreeIterator::previous () const</h3>
<p>returns an iterator to the previous item of this or an invalid iterator when this is the first one in the next/previous chain</p>
<h3 class="fn"><a name="operator-T"></a>QxtLinkedTreeIterator::operator T () const</h3>
<h3 class="fn"><a name="operator-not-eq"></a>bool QxtLinkedTreeIterator::operator!= ( const QxtLinkedTreeIterator<T> & <i>other</i> ) const</h3>
<h3 class="fn"><a name="operator-2a"></a>T & QxtLinkedTreeIterator::operator* () const</h3>
<p>Returns a modifiable reference to the current item. You can change the value of an item by using operator*() on the left side of an assignment, for example:</p>
<pre> if (*it == "Hello")
*it = "Bonjour";</pre>
<h3 class="fn"><a name="operator-2b"></a>QxtLinkedTreeIterator QxtLinkedTreeIterator::operator+ ( int <i>j</i> ) const</h3>
<h3 class="fn"><a name="operator-2b-2b"></a>QxtLinkedTreeIterator & QxtLinkedTreeIterator::operator++ ()</h3>
<h3 class="fn"><a name="operator-2b-2b-2"></a>QxtLinkedTreeIterator QxtLinkedTreeIterator::operator++ ( int )</h3>
<h3 class="fn"><a name="operator-2b-eq"></a>QxtLinkedTreeIterator & QxtLinkedTreeIterator::operator+= ( int <i>j</i> )</h3>
<h3 class="fn"><a name="operator-"></a>QxtLinkedTreeIterator QxtLinkedTreeIterator::operator- ( int <i>j</i> ) const</h3>
<h3 class="fn"><a name="operator--"></a>QxtLinkedTreeIterator & QxtLinkedTreeIterator::operator-- ()</h3>
<h3 class="fn"><a name="operator---2"></a>QxtLinkedTreeIterator QxtLinkedTreeIterator::operator-- ( int )</h3>
<h3 class="fn"><a name="operator--eq"></a>QxtLinkedTreeIterator & QxtLinkedTreeIterator::operator-= ( int <i>j</i> )</h3>
<h3 class="fn"><a name="operator--gt"></a>T * QxtLinkedTreeIterator::operator-> () const</h3>
<h3 class="fn"><a name="operator-eq"></a>QxtLinkedTreeIterator & QxtLinkedTreeIterator::operator= ( const QxtLinkedTreeIterator<T> & <i>other</i> )</h3>
<h3 class="fn"><a name="operator-eq-eq"></a>bool QxtLinkedTreeIterator::operator== ( const QxtLinkedTreeIterator<T> & <i>other</i> ) const</h3>
<p /><address><hr /><div align="center">
<table width="100%" cellspacing="0" border="0"><tr class="address">
<td align="left">Copyright © 2007-2010
<a href="mailto:foundation@libqxt.org">Qxt Foundation</a></td>
<td align="right"><div align="right">
<a href="http://libqxt.org">Qxt</a> 0.6.1</div></td>
</tr></table></div></address></body>
</html>
