![]() |
| ||
Classes - Annotated - Tree - Functions - Home - Structure |
The QAsciiDictIterator class provides an iterator for QAsciiDict collections. More...
#include <qasciidict.h>
QAsciiDictIterator is implemented as a template class. Define a template instance QAsciiDictIterator<X> to create a dictionary iterator that operates on QAsciiDict<X> (dictionary of X*).
Example:
#include <qasciidict.h> #include <stdio.h> int main() { // Creates a dictionary that maps char* ==> char* (case insensitive) QAsciiDict<char> dict( 17, FALSE ); dict.insert( "France", "Paris" ); dict.insert( "Russia", "Moscow" ); dict.insert( "Norway", "Oslo" ); QAsciiDictIterator<char> it( dict ); // iterator for dict while ( it.current() ) { printf( "%s -> %s\n", it.currentKey(), it.current() ); ++it; } return 0; }
Program output:
Russia -> Moscow Norway -> Oslo France -> Paris
Note that the traversal order is arbitrary; you are not guaranteed any particular order.
Multiple iterators may independently traverse the same dictionary. A QAsciiDict knows about all the iterators that are operating on the dictionary. When an item is removed from the dictionary, QAsciiDict updates all the iterators that are referring the removed item to point to the next item in the (arbitrary) traversal order.
See also QAsciiDict 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-2001 Trolltech, all rights reserved.
Copyright © 2001 Trolltech | Trademarks | Qt version 3.0.0-beta2
|