|
| constexpr | const_iterator () noexcept=default |
| | Constructs an uninitialized iterator.
|
| |
| | const_iterator (const iterator &o) noexcept |
| | Constructs a copy of other.
|
| |
| const Key & | key () const noexcept |
| | Returns the current item's key.
|
| |
| T & | value () const noexcept |
| | Returns the current item's value.
|
| |
| T & | operator* () const noexcept |
| | Returns the current item's value.
|
| |
| T * | operator-> () const noexcept |
| | Returns a pointer to the current item's value.
|
| |
| 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.
|
| |
| const_iterator & | operator++ () noexcept |
| | The prefix ++ operator (
|
| |
| const_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 (
|
| |
template<typename
Key, typename T>
class QMultiHash< Key, T >::const_iterator
\inmodule QtCore
The QMultiHash::const_iterator class provides an STL-style const iterator for QMultiHash.
QMultiHash<Key, T>const_iterator allows you to iterate over a QMultiHash. If you want to modify the QMultiHash as you iterate over it, you must use QMultiHash::iterator instead. 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::const_iterator constructor creates an uninitialized iterator. You must initialize it using a QMultiHash function like QMultiHash::cbegin(), QMultiHash::cend(), or QMultiHash::constFind() 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. The only guarantee is that items that share the same key (because they were inserted using a QMultiHash) 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 QMultiHash (inserting and removing items) can cause the iterators to become invalid.
Inserting items into the hash or calling methods such as QMultiHash::reserve() or QMultiHash::squeeze() can invalidate all iterators pointing into the hash. Iterators are guaranteed to stay valid only as long as the QMultiHash doesn't have to grow/shrink it's internal hash table. Using any iterator after a rehashing operation ahs 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 QMultiHash.
- 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::iterator, QMultiHash::key_iterator, QMultiHash::const_key_value_iterator
Definition at line 1839 of file qhash.h.
Collaboration diagram for QMultiHash< Key, T >::const_iterator:
1.10.0