![]() |
| ||
Classes - Annotated - Tree - Functions - Home - Structure |
The QDictIterator class provides an iterator for QDict collections. More...
#include <qdict.h>
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 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.
See also isEmpty().
See also count().
If the current iterator item was the last item in the dictionary or if it was null, null is returned.
If the current iterator item was the last item in the dictionary or if it was null, null is returned.
If that item is beyond the last item or if the dictionary is empty, it sets the current item to null and returns null.
Search the documentation, FAQ, qt-interest archive and more (uses
www.trolltech.com):
This file is part of the Qt toolkit, copyright © 1995-2000 Trolltech, all rights reserved.
Copyright © 2000 Trolltech | Trademarks | Qt version main-beta1
|