const_iterator Class▲
-
Header: const_iterator
-
CMake:
find_package(Qt6 REQUIRED COMPONENTS Core)
target_link_libraries(mytarget PRIVATE Qt6::Core)
-
qmake: QT += core
Detailed Description▲
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. 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() << Qt::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 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 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.
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 Implicit sharing iterator problem.
See Also▲
See also QHash::iterator, QHashIterator
Member Function Documentation▲
[constexpr] const_iterator::const_iterator()▲
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▲
See also QHash::constBegin(), QHash::constEnd()
const_iterator::const_iterator(const iterator &other)▲
Constructs a copy of other.
const Key &const_iterator::key() const▲
const T &const_iterator::value() const▲
bool const_iterator::operator!=(const const_iterator &other) const▲
Returns true if other points to a different item than this iterator; otherwise returns false.
See Also▲
See also operator==()
const T &const_iterator::operator*() const▲
const_iterator &const_iterator::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.
const_iterator const_iterator::operator++(int)▲
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.
const T *const_iterator::operator->() const▲
bool const_iterator::operator==(const const_iterator &other) const▲
Returns true if other points to the same item as this iterator; otherwise returns false.
See Also▲
See also operator!=()