QDictIterator(3qt)QDictIterator(3qt)NAMEQDictIterator - Iterator for
#include <qdict.h>
Inherits QGDictIterator.
Public Members
QDictIterator ( const QDict<type> & dict )
~QDictIterator ()
uint count () const
bool isEmpty () const
type* toFirst ()
operator type* ()const
type* current () const
QString currentKey () const
type* operator ()
type* operator++ ()
type* operator+= ( uint jump )
DESCRIPTION
The QDictIterator class provides an iterator for QDict
collections.
QDictIterator is implemented as a template class. Define a
template instance QDictIterator<X> to create a dictionary
iterator that operates on QDict<X> (dictionary of X*).
Example:
#include <qdict.h>
#include <stdio.h>
void main()
{
// Creates a dictionary that maps QString ==> char* (case insensitive)
QDict<char> dict( 17, FALSE );
dict.insert( "France", "Paris" );
dict.insert( "Russia", "Moscow" );
dict.insert( "Norway", "Oslo" );
QDictIterator<char> it( dict ); // iterator for dict
while ( it.current() ) {
printf( "%s -> %s\n", it.currentKey().latin1(), it.current() );
++it;
}
}
Program output:
Russia -> Moscow
Norway -> Oslo
France -> Paris
Note that the traversal order is arbitrary, you are not
Trolltech AS 13 June 2001 1
QDictIterator(3qt)QDictIterator(3qt)
guaranteed the order above.
Multiple iterators may independently traverse the same
dictionary. A QDict knows about all iterators that are
operating on the dictionary. When an item is removed from
the dictionary, QDict update all iterators that are
referring the removed item to point to the next item in
the traversing order.
See also QDict and Collection Classes
MEMBER FUNCTION DOCUMENTATIONQDictIterator::QDictIterator ( const QDict<;type> & dict )
Constructs an iterator for dict. The current iterator item
is set to point on the first item in the dict.
QDictIterator::~QDictIterator ()
Destroys the iterator.
QDictIterator::operator type * () const
Cast operator. Returns a pointer to the current iterator
item. Same as current().
uint QDictIterator::count () const
Returns the number of items in the dictionary this
iterator operates on.
See also isEmpty().
type * QDictIterator::current () const
Returns a pointer to the current iterator item.
QString QDictIterator::currentKey () const
Returns a pointer to the key for the current iterator
item.
bool QDictIterator::isEmpty () const
Returns TRUE if the dictionary is empty, i.e. count() ==
0, otherwise FALSE.
See also count().
type * QDictIterator::operator() ()
Makes the succeeding item current and returns the original
current item.
If the current iterator item was the last item in the
dictionary or if it was null, null is returned.
type * QDictIterator::operator++ ()
Prefix ++ makes the succeeding item current and returns
the new current item.
If the current iterator item was the last item in the
Trolltech AS 13 June 2001 2
QDictIterator(3qt)QDictIterator(3qt)
dictionary or if it was null, null is returned.
type * QDictIterator::operator+= ( uint jump )
Sets the current item to the item jump positions after the
current item, and returns a pointer to that item.
If that item is beyond the last item or if the dictionary
is empty, it sets the current item to null and returns
null.
type * QDictIterator::toFirst ()
Sets the current iterator item to point to the first item
in the dictionary and returns a pointer to the item. If
the dictionary is empty it sets the current item to null
and returns null.
SEE ALSO
http://doc.trolltech.com/qdictiterator.html
http://www.trolltech.com/faq/tech.html
COPYRIGHT
Copyright 1992-2001 Trolltech AS,
http://www.trolltech.com. See the license file included
in the distribution for a complete license statement.
AUTHOR
Generated automatically from the source code.
BUGS
If you find a bug in Qt, please report it as described in
http://doc.trolltech.com/bughowto.html. Good bug reports
make our job much simpler. Thank you.
In case of content or formattting problems with this
manual page, please report them to qt-bugs@trolltech.com.
Please include the name of the manual page
(qdictiterator.3qt) and the Qt version (2.3.1).
Trolltech AS 13 June 2001 3
