|
| constexpr | iterator () noexcept=default |
| | Constructs an uninitialized iterator.
|
| |
| const Key & | key () const noexcept |
| | Returns the current item's key as a const reference.
|
| |
| T & | value () const noexcept |
| | Returns a modifiable reference to the current item's value.
|
| |
| T & | operator* () const noexcept |
| | Returns a modifiable reference to the current item's value.
|
| |
| T * | operator-> () const noexcept |
| | Returns a pointer to the current item's value.
|
| |
| bool | operator== (const iterator &o) const noexcept |
| |
| bool | operator!= (const iterator &o) const noexcept |
| |
| iterator & | operator++ () noexcept |
| | The prefix ++ operator (
|
| |
| iterator | operator++ (int) noexcept |
| | This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.The postfix ++ operator (
|
| |
| bool | operator== (const const_iterator &o) const noexcept |
| | Returns true if other points to the same item as this iterator; otherwise returns false.
|
| |
| bool | operator!= (const const_iterator &o) const noexcept |
| | Returns true if other points to a different item than this iterator; otherwise returns false.
|
| |
template<typename
Key, typename T>
class QMultiHash< Key, T >::iterator
\inmodule QtCore
The QMultiHash::iterator class provides an STL-style non-const iterator for QMultiHash.
QMultiHash<Key, T>iterator allows you to iterate over a QMultiHash and to modify the value (but not the key) associated with a particular key. If you want to iterate over a const QMultiHash, you should use QMultiHash::const_iterator. It is generally good practice to use QMultiHash::const_iterator on a non-const QMultiHash as well, unless you need to change the QMultiHash through the iterator. Const iterators are slightly faster, and can improve code readability.
The default QMultiHash::iterator constructor creates an uninitialized iterator. You must initialize it using a QMultiHash function like QMultiHash::begin(), QMultiHash::end(), or QMultiHash::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("December", 12);
Unlike QMap, which orders its items by key, QMultiHash stores its items in an arbitrary order.
Here's an example that increments every value stored in the QMultiHash by 2:
To remove elements from a QMultiHash you can use erase_if(QMultiHash<Key, T> &map, Predicate pred):
Multiple iterators can be used on the same hash. However, be aware that any modification performed directly on the QHash (inserting and removing items) can cause the iterators to become invalid.
Inserting items into the hash or calling methods such as QHash::reserve() or QHash::squeeze() can invalidate all iterators pointing into the hash. Iterators are guaranteed to stay valid only as long as the QHash doesn't have to grow/shrink its internal hash table. Using any iterator after a rehashing operation has occurred will lead to undefined behavior.
If you need to keep iterators over a long period of time, we recommend that you use QMultiMap rather than QHash.
- Warning
- Iterators on implicitly shared containers do not work exactly like STL-iterators. You should avoid copying a container while iterators are active on that container. For more information, read \l{Implicit sharing iterator problem}.
- See also
- QMultiHash::const_iterator, QMultiHash::key_iterator, QMultiHash::key_value_iterator
Definition at line 1787 of file qhash.h.
Collaboration diagram for QMultiHash< Key, T >::iterator:
1.10.0