Home · Modules · Classes · Namespaces · Functions

QxtBdbTreeIterator Class Reference
[QxtBerkeley module]

The QxtBdbTreeIterator class provides a tree iterator on QxtBdbtree More...

    #include <QxtBdbTreeIterator>

Public Functions

Protected Functions


Detailed Description

The QxtBdbTreeIterator class provides a tree iterator on QxtBdbtree

TODO: {implicitshared}

See also QxtBdbTree.


Member Function Documentation

QxtBdbTreeIterator::QxtBdbTreeIterator ()

Constructs an invalid QxtBdbTreeIterator

It's an error to use this to iterate, access data, etc..

QxtBdbTreeIterator::QxtBdbTreeIterator ( const QxtBdbTreeIterator<T> & other )

Copies the other iterator.

The underlying cursor is duped, meaning the position will be copied, but the copy can be used independently.

QxtBdbTreeIterator::~QxtBdbTreeIterator ()

Destructs the iterator.

The underlying cursors will be closed.

QxtBdbTreeIterator<T> QxtBdbTreeIterator::append ( const T & item )

Appends an item to the children of this one, and returns an iterator to it. If insertion fails, an invalid iterator is returned.

QxtBdbTreeIterator<T> QxtBdbTreeIterator::child () const

Returns the first child of this item, or an invalid QxtBdbTreeIterator if there are none.

QxtBdbTreeIterator<T> QxtBdbTreeIterator::erase ()

TODO returns

void QxtBdbTreeIterator::invalidate ()   [protected]

TODO

bool QxtBdbTreeIterator::isValid () const

Returns true if the iterator seems to point to a valid location.

Calls to value() might fail anyway (but not crash), in case of concurrent access. If you want to be 100% sure value() will return valid data, while using multiple threads, then you have to track changes yourself.

quint64 QxtBdbTreeIterator::level () const   [protected]

TODO returns

QxtBdbTreeIterator<T> QxtBdbTreeIterator::next () const

Returns the next sibling of this item, or an invalid QxtBdbTreeIterator if this is the last one.

QxtBdbTreeIterator<T> QxtBdbTreeIterator::parent () const

Returns the parent of this item, or an invalid QxtBdbTreeIterator if this is the root item.

QxtBdbTreeIterator<T> QxtBdbTreeIterator::prepend ( const T & t )

TODO t

QxtBdbTreeIterator<T> QxtBdbTreeIterator::previous () const

Returns the previous sibling of this item, or an invalid QxtBdbTreeIterator if this is the last one.

bool QxtBdbTreeIterator::setValue ( T value )

TODO value

See also value().

T QxtBdbTreeIterator::value () const

Returns the value, the iterator is currently pointing to. It is an error to call value() when isValid() returns false. In case an database error ocures, like the item been deleted, value() will return a default constructed T.

See also setValue().

QxtBdbTreeIterator::operator T () const

See also value().

QxtBdbTreeIterator<T> QxtBdbTreeIterator::operator+ ( int j ) const

Returns an iterator, j items next to this one. If there is no such item, the returned iterator is invalid.

See also next().

QxtBdbTreeIterator<T> & QxtBdbTreeIterator::operator++ ()

This prefix operator increments the item by one. If there are no more items, the iterator becomes invalid.

QxtBdbTreeIterator<T> QxtBdbTreeIterator::operator++ ( int )

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.

QxtBdbTreeIterator<T> & QxtBdbTreeIterator::operator+= ( int j )

Increments the item by j. If there are no more items, the iterator becomes invalid.

QxtBdbTreeIterator<T> QxtBdbTreeIterator::operator- ( int j ) const

Returns an iterator, j previous next to this one. If there is no such item, the returnediterator is invalid.

See also previous().

QxtBdbTreeIterator<T> & QxtBdbTreeIterator::operator-- ()

This prefix operator decrements the item by one. If there are no more items, the iterator becomes invalid.

QxtBdbTreeIterator<T> QxtBdbTreeIterator::operator-- ( int )

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.

QxtBdbTreeIterator<T> & QxtBdbTreeIterator::operator-= ( int j )

Decrements the item by j. If there are no more items, the iterator becomes invalid.

QxtBdbTreeIterator<T> & QxtBdbTreeIterator::operator= ( const QxtBdbTreeIterator<T> & other )

Copies the other iterator.

The underlying cursor is duped, meaning the position will be copied, but the copy can be used independently


Copyright © 2007-2011 Qxt Foundation
Qxt 0.6.2