QHashIterator Class▲
-
Header: QHashIterator
-
CMake:
find_package(Qt6 REQUIRED COMPONENTS Core)
target_link_libraries(mytarget PRIVATE Qt6::Core)
-
qmake: QT += core
Detailed Description▲
QHash has both Java-style iterators and STL-style iterators. STL-style iterators are more efficient and should be preferred.
QHashIterator<Key, T> allows you to iterate over a QHash (or a QMultiHash). If you want to modify the hash as you iterate over it, use QMutableHashIterator instead.
The QHashIterator constructor takes a QHash as argument. After construction, the iterator is located at the very beginning of the hash (before the first item). Here's how to iterate over all the elements sequentially:
QHash<int, QWidget *> hash;
...
QHashIterator<int, QWidget *> i(hash);
while (i.hasNext()) {
i.next();
qDebug() << i.key() << ": " << i.value();
}The next() function returns the next item in the hash and advances the iterator. The key() and value() functions return the key and value of the last item that was jumped over.
Unlike STL-style iterators, Java-style iterators point between items rather than directly at items. The first call to next() advances the iterator to the position between the first and second item, and returns the first item; the second call to next() advances the iterator to the position between the second and third item; and so on.
If you want to find all occurrences of a particular value, use findNext() in a loop. For example:
QHashIterator<int, QWidget *> i(hash);
while (i.findNext(widget)) {
qDebug() << "Found widget " << widget << " under key "
<< i.key();
}Multiple iterators can be used on the same hash. If the hash is modified while a QHashIterator is active, the QHashIterator will continue iterating over the original hash, ignoring the modified copy.
See Also▲
See also QMutableHashIterator, QHash::const_iterator
Member Function Documentation▲
QHashIterator::QHashIterator(const QHash<Key, T> &hash)▲
Constructs an iterator for traversing hash. The iterator is set to be at the front of the hash (before the first item).
See Also▲
See also operator=()
QHashIterator<Key, T> &QHashIterator::operator=(const QHash<Key, T> &container)▲
Makes the iterator operate on hash. The iterator is set to be at the front of the hash (before the first item).
See Also▲
void QHashIterator::toFront()▲
Moves the iterator to the front of the container (before the first item).
See Also▲
void QHashIterator::toBack()▲
bool QHashIterator::hasNext() const▲
Returns true if there is at least one item ahead of the iterator, i.e. the iterator is not at the back of the container; otherwise returns false.
See Also▲
See also next()
const Key &QHashIterator::key() const▲
Returns the key of the last item that was jumped over using one of the traversal functions (next(), findNext()).
See Also▲
See also value()
bool QHashIterator::findNext(const T &value)▲
Searches for value starting from the current iterator position forward. Returns true if a (key, value) pair with value value is found; otherwise returns false.
After the call, if value was found, the iterator is positioned just after the matching item; otherwise, the iterator is positioned at the back of the container.
QHashIterator::Item QHashIterator::next()▲
Returns the next item and advances the iterator by one position.
Call key() on the return value to obtain the item's key, and value() to obtain the value.
Calling this function on an iterator located at the back of the container leads to undefined results.
See Also▲
QHashIterator::Item QHashIterator::peekNext() const▲
Returns the next item without moving the iterator.
Call key() on the return value to obtain the item's key, and value() to obtain the value.
Calling this function on an iterator located at the back of the container leads to undefined results.