The QHash::const_iterator class provides an STL-style const iterator for QHash and QMultiHash. More...
#include <QHash>
| const_iterator () | |
| const_iterator ( const iterator & other ) | |
| const Key & | key () const |
| const T & | value () const |
| bool | operator!= ( const const_iterator & other ) const |
| const T & | operator* () const |
| const_iterator | operator+ ( int j ) const |
| const_iterator & | operator++ () |
| const_iterator | operator++ ( int ) |
| const_iterator & | operator+= ( int j ) |
| const_iterator | operator- ( int j ) const |
| const_iterator & | operator-- () |
| const_iterator | operator-- ( int ) |
| const_iterator & | operator-= ( int j ) |
| const T * | operator-> () const |
| bool | operator== ( const const_iterator & other ) const |
The QHash::const_iterator class provides an STL-style const iterator for QHash and QMultiHash.
QHash features both STL-style iterators and Java-style iterators. The STL-style iterators are more low-level and more cumbersome to use; on the other hand, they are slightly faster and, for developers who already know STL, have the advantage of familiarity.
QHash<Key, T>::const_iterator allows you to iterate over a QHash (or a QMultiHash). If you want to modify the QHash as you iterate over it, you must use QHash::iterator instead. It is generally good practice to use QHash::const_iterator on a non-const QHash as well, unless you need to change the QHash through the iterator. Const iterators are slightly faster, and can improve code readability.
The default QHash::const_iterator constructor creates an uninitialized iterator. You must initialize it using a QHash function like QHash::constBegin(), QHash::constEnd(), or QHash::find() before you can start iterating. Here's a typical loop that prints all the (key, value) pairs stored in a hash:
QHash<QString, int> hash; hash.insert("January", 1); hash.insert("February", 2); ... hash.insert("December", 12); QHash<QString, int>::const_iterator i; for (i = hash.constBegin(); i != hash.constEnd(); ++i) cout << i.key() << ": " << i.value() << endl;
Unlike QMap, which orders its items by key, QHash stores its items in an arbitrary order. The only guarantee is that items that share the same key (because they were inserted using QHash::insertMulti()) will appear consecutively, from the most recently to the least recently inserted value.
Multiple iterators can be used on the same hash. However, be aware that any modification performed directly on the QHash has the potential of dramatically changing the order in which the items are stored in the hash, as they might cause QHash to rehash its internal data structure. If you need to keep iterators over a long period of time, we recommend that you use QMap rather than QHash.
See also QHash::iterator and QHashIterator.
Constructs an uninitialized iterator.
Functions like key(), value(), and operator++() must not be called on an uninitialized iterator. Use operator=() to assign a value to it before using it.
See also QHash::constBegin() and QHash::constEnd().
Constructs a copy of other.
Returns the current item's key.
See also value().
Returns the current item's value.
See also key() and operator*().
Returns true if other points to a different item than this iterator; otherwise returns false.
See also operator==().
Returns the current item's value.
Same as value().
See also key().
Returns an iterator to the item at j positions forward from this iterator. (If j is negative, the iterator goes backward.)
This operation can be slow for large j values.
See also operator-().
The prefix ++ operator (++i) advances the iterator to the next item in the hash and returns an iterator to the new current item.
Calling this function on QHash::end() leads to undefined results.
See also operator--().
This is an overloaded function.
The postfix ++ operator (i++) advances the iterator to the next item in the hash and returns an iterator to the previously current item.
Advances the iterator by j items. (If j is negative, the iterator goes backward.)
This operation can be slow for large j values.
See also operator-=() and operator+().
Returns an iterator to the item at j positions backward from this iterator. (If j is negative, the iterator goes forward.)
This operation can be slow for large j values.
See also operator+().
The prefix -- operator (--i) makes the preceding item current and returns an iterator pointing to the new current item.
Calling this function on QHash::begin() leads to undefined results.
See also operator++().
This is an overloaded function.
The postfix -- operator (i--) makes the preceding item current and returns an iterator pointing to the previously current item.
Makes the iterator go back by j items. (If j is negative, the iterator goes forward.)
This operation can be slow for large j values.
See also operator+=() and operator-().
Returns a pointer to the current item's value.
See also value().
Returns true if other points to the same item as this iterator; otherwise returns false.
See also operator!=().