<?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/berkeley/qxtbdbtree.cpp -->
<head>
<title>QxtBdbTreeIterator 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">QxtBdbTreeIterator Class Reference<br /><span class="small-subtitle">[<a href="qxtberkeley.html">QxtBerkeley</a> module]</span>
</h1>
<p>The QxtBdbTreeIterator class provides a tree iterator on QxtBdbtree <a href="#details">More...</a></p>
<pre> #include <QxtBdbTreeIterator></pre><ul>
<li><a href="qxtbdbtreeiterator-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="qxtbdbtreeiterator.html#QxtBdbTreeIterator">QxtBdbTreeIterator</a></b> ()</li>
<li><div class="fn"></div><b><a href="qxtbdbtreeiterator.html#QxtBdbTreeIterator-2">QxtBdbTreeIterator</a></b> ( const QxtBdbTreeIterator<T> & <i>other</i> )</li>
<li><div class="fn"></div><b><a href="qxtbdbtreeiterator.html#dtor.QxtBdbTreeIterator">~QxtBdbTreeIterator</a></b> ()</li>
<li><div class="fn"></div>QxtBdbTreeIterator<T> <b><a href="qxtbdbtreeiterator.html#append">append</a></b> ( const T & <i>item</i> )</li>
<li><div class="fn"></div>QxtBdbTreeIterator<T> <b><a href="qxtbdbtreeiterator.html#child">child</a></b> () const</li>
<li><div class="fn"></div>QxtBdbTreeIterator<T> <b><a href="qxtbdbtreeiterator.html#erase">erase</a></b> ()</li>
<li><div class="fn"></div>bool <b><a href="qxtbdbtreeiterator.html#isValid">isValid</a></b> () const</li>
<li><div class="fn"></div>QxtBdbTreeIterator<T> <b><a href="qxtbdbtreeiterator.html#next">next</a></b> () const</li>
<li><div class="fn"></div>QxtBdbTreeIterator<T> <b><a href="qxtbdbtreeiterator.html#parent">parent</a></b> () const</li>
<li><div class="fn"></div>QxtBdbTreeIterator<T> <b><a href="qxtbdbtreeiterator.html#prepend">prepend</a></b> ( const T & <i>t</i> )</li>
<li><div class="fn"></div>QxtBdbTreeIterator<T> <b><a href="qxtbdbtreeiterator.html#previous">previous</a></b> () const</li>
<li><div class="fn"></div>bool <b><a href="qxtbdbtreeiterator.html#setValue">setValue</a></b> ( T <i>value</i> )</li>
<li><div class="fn"></div>T <b><a href="qxtbdbtreeiterator.html#value">value</a></b> () const</li>
<li><div class="fn"></div><b><a href="qxtbdbtreeiterator.html#operator-T">operator T</a></b> () const</li>
<li><div class="fn"></div>QxtBdbTreeIterator<T> <b><a href="qxtbdbtreeiterator.html#operator-2b">operator+</a></b> ( int <i>j</i> ) const</li>
<li><div class="fn"></div>QxtBdbTreeIterator<T> & <b><a href="qxtbdbtreeiterator.html#operator-2b-2b">operator++</a></b> ()</li>
<li><div class="fn"></div>QxtBdbTreeIterator<T> <b><a href="qxtbdbtreeiterator.html#operator-2b-2b-2">operator++</a></b> ( int )</li>
<li><div class="fn"></div>QxtBdbTreeIterator<T> & <b><a href="qxtbdbtreeiterator.html#operator-2b-eq">operator+=</a></b> ( int <i>j</i> )</li>
<li><div class="fn"></div>QxtBdbTreeIterator<T> <b><a href="qxtbdbtreeiterator.html#operator-">operator-</a></b> ( int <i>j</i> ) const</li>
<li><div class="fn"></div>QxtBdbTreeIterator<T> & <b><a href="qxtbdbtreeiterator.html#operator--">operator--</a></b> ()</li>
<li><div class="fn"></div>QxtBdbTreeIterator<T> <b><a href="qxtbdbtreeiterator.html#operator---2">operator--</a></b> ( int )</li>
<li><div class="fn"></div>QxtBdbTreeIterator<T> & <b><a href="qxtbdbtreeiterator.html#operator--eq">operator-=</a></b> ( int <i>j</i> )</li>
<li><div class="fn"></div>QxtBdbTreeIterator<T> & <b><a href="qxtbdbtreeiterator.html#operator-eq">operator=</a></b> ( const QxtBdbTreeIterator<T> & <i>other</i> )</li>
</ul>
<a name="protected-functions"></a>
<h3>Protected Functions</h3>
<ul>
<li><div class="fn"></div>void <b><a href="qxtbdbtreeiterator.html#invalidate">invalidate</a></b> ()</li>
<li><div class="fn"></div>quint64 <b><a href="qxtbdbtreeiterator.html#level">level</a></b> () const</li>
</ul>
<a name="details"></a>
<hr />
<h2>Detailed Description</h2>
<p>The QxtBdbTreeIterator class provides a tree iterator on QxtBdbtree</p>
<p>TODO: {implicitshared}</p>
<p>See also <a href="qxtbdbtree.html">QxtBdbTree</a>.</p>
<hr />
<h2>Member Function Documentation</h2>
<h3 class="fn"><a name="QxtBdbTreeIterator"></a>QxtBdbTreeIterator::QxtBdbTreeIterator ()</h3>
<p>Constructs an invalid <a href="qxtbdbtreeiterator.html">QxtBdbTreeIterator</a></p>
<p>It's an error to use this to iterate, access data, etc..</p>
<h3 class="fn"><a name="QxtBdbTreeIterator-2"></a>QxtBdbTreeIterator::QxtBdbTreeIterator ( const QxtBdbTreeIterator<T> & <i>other</i> )</h3>
<p>Copies the <i>other</i> iterator.</p>
<p>The underlying cursor is duped, meaning the position will be copied, but the copy can be used independently.</p>
<h3 class="fn"><a name="dtor.QxtBdbTreeIterator"></a>QxtBdbTreeIterator::~QxtBdbTreeIterator ()</h3>
<p>Destructs the iterator.</p>
<p>The underlying cursors will be closed.</p>
<h3 class="fn"><a name="append"></a>QxtBdbTreeIterator<T> QxtBdbTreeIterator::append ( const T & <i>item</i> )</h3>
<p>Appends an <i>item</i> to the children of this one, and returns an iterator to it. If insertion fails, an invalid iterator is returned.</p>
<h3 class="fn"><a name="child"></a>QxtBdbTreeIterator<T> QxtBdbTreeIterator::child () const</h3>
<p>Returns the first child of this item, or an invalid <a href="qxtbdbtreeiterator.html">QxtBdbTreeIterator</a> if there are none.</p>
<h3 class="fn"><a name="erase"></a>QxtBdbTreeIterator<T> QxtBdbTreeIterator::erase ()</h3>
<p>TODO returns</p>
<h3 class="fn"><a name="invalidate"></a>void QxtBdbTreeIterator::invalidate () <tt> [protected]</tt></h3>
<p>TODO</p>
<h3 class="fn"><a name="isValid"></a>bool QxtBdbTreeIterator::isValid () const</h3>
<p>Returns <tt>true</tt> if the iterator seems to point to a valid location.</p>
<p>Calls to <a href="qxtbdbtreeiterator.html#value">value</a>() might fail anyway (but not crash), in case of concurrent access. If you want to be 100% sure <a href="qxtbdbtreeiterator.html#value">value</a>() will return valid data, while using multiple threads, then you have to track changes yourself.</p>
<h3 class="fn"><a name="level"></a><a href="http://doc.qtsoftware.com/4.5/qtglobal.html#quint64-typedef">quint64</a> QxtBdbTreeIterator::level () const <tt> [protected]</tt></h3>
<p>TODO returns</p>
<h3 class="fn"><a name="next"></a>QxtBdbTreeIterator<T> QxtBdbTreeIterator::next () const</h3>
<p>Returns the next sibling of this item, or an invalid <a href="qxtbdbtreeiterator.html">QxtBdbTreeIterator</a> if this is the last one.</p>
<h3 class="fn"><a name="parent"></a>QxtBdbTreeIterator<T> QxtBdbTreeIterator::parent () const</h3>
<p>Returns the parent of this item, or an invalid <a href="qxtbdbtreeiterator.html">QxtBdbTreeIterator</a> if this is the root item.</p>
<h3 class="fn"><a name="prepend"></a>QxtBdbTreeIterator<T> QxtBdbTreeIterator::prepend ( const T & <i>t</i> )</h3>
<p>TODO <i>t</i></p>
<h3 class="fn"><a name="previous"></a>QxtBdbTreeIterator<T> QxtBdbTreeIterator::previous () const</h3>
<p>Returns the previous sibling of this item, or an invalid <a href="qxtbdbtreeiterator.html">QxtBdbTreeIterator</a> if this is the last one.</p>
<h3 class="fn"><a name="setValue"></a>bool QxtBdbTreeIterator::setValue ( T <i>value</i> )</h3>
<p>TODO <i>value</i></p>
<p>See also <a href="qxtbdbtreeiterator.html#value">value</a>().</p>
<h3 class="fn"><a name="value"></a>T QxtBdbTreeIterator::value () const</h3>
<p>Returns the value, the iterator is currently pointing to. It is an error to call value() when <a href="qxtbdbtreeiterator.html#isValid">isValid</a>() returns <tt>false</tt>. In case an database error ocures, like the item been deleted, value() will return a default constructed T.</p>
<p>See also <a href="qxtbdbtreeiterator.html#setValue">setValue</a>().</p>
<h3 class="fn"><a name="operator-T"></a>QxtBdbTreeIterator::operator T () const</h3>
<p>See also <a href="qxtbdbtreeiterator.html#value">value</a>().</p>
<h3 class="fn"><a name="operator-2b"></a>QxtBdbTreeIterator<T> QxtBdbTreeIterator::operator+ ( int <i>j</i> ) const</h3>
<p>Returns an iterator, <i>j</i> items next to this one. If there is no such item, the returned iterator is invalid.</p>
<p>See also <a href="qxtbdbtreeiterator.html#next">next</a>().</p>
<h3 class="fn"><a name="operator-2b-2b"></a>QxtBdbTreeIterator<T> & QxtBdbTreeIterator::operator++ ()</h3>
<p>This prefix operator increments the item by one. If there are no more items, the iterator becomes invalid.</p>
<h3 class="fn"><a name="operator-2b-2b-2"></a>QxtBdbTreeIterator<T> QxtBdbTreeIterator::operator++ ( int )</h3>
<p>This postfix operator makes a copy of the item, then increments itself and returns the copy. If there are no more items, the iterator becomes invalid.</p>
<h3 class="fn"><a name="operator-2b-eq"></a>QxtBdbTreeIterator<T> & QxtBdbTreeIterator::operator+= ( int <i>j</i> )</h3>
<p>Increments the item by <i>j</i>. If there are no more items, the iterator becomes invalid.</p>
<h3 class="fn"><a name="operator-"></a>QxtBdbTreeIterator<T> QxtBdbTreeIterator::operator- ( int <i>j</i> ) const</h3>
<p>Returns an iterator, <i>j</i> previous next to this one. If there is no such item, the returnediterator is invalid.</p>
<p>See also <a href="qxtbdbtreeiterator.html#previous">previous</a>().</p>
<h3 class="fn"><a name="operator--"></a>QxtBdbTreeIterator<T> & QxtBdbTreeIterator::operator-- ()</h3>
<p>This prefix operator decrements the item by one. If there are no more items, the iterator becomes invalid.</p>
<h3 class="fn"><a name="operator---2"></a>QxtBdbTreeIterator<T> QxtBdbTreeIterator::operator-- ( int )</h3>
<p>This postfix operator makes a copy of the item, then decrements itself and returns the copy. If there are no more items, the iterator becomes invalid.</p>
<h3 class="fn"><a name="operator--eq"></a>QxtBdbTreeIterator<T> & QxtBdbTreeIterator::operator-= ( int <i>j</i> )</h3>
<p>Decrements the item by <i>j</i>. If there are no more items, the iterator becomes invalid.</p>
<h3 class="fn"><a name="operator-eq"></a>QxtBdbTreeIterator<T> & QxtBdbTreeIterator::operator= ( const QxtBdbTreeIterator<T> & <i>other</i> )</h3>
<p>Copies the <i>other</i> iterator.</p>
<p>The underlying cursor is duped, meaning the position will be copied, but the copy can be used independently</p>
<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>
