IdentifiantMot de passe
Loading...
Mot de passe oublié ?Je m'inscris ! (gratuit)

QMutableVectorIterator Class

The QMutableVectorIterator class provides a Java-style non-const iterator for QVector and QStack.

Article lu   fois.

L'auteur

Liens sociaux

Viadeo Twitter Facebook Share on Google+   

QMutableVectorIterator Class

  • Header: QMutableVectorIterator

  • qmake: QT += core

Detailed Description

QVector has both Java-style iterators and STL-style iterators. The Java-style iterators are more high-level and easier to use than the STL-style iterators; on the other hand, they are slightly less efficient.

An alternative to using iterators is to use index positions. Most QVector member functions take an index as their first parameter, making it possible to access, insert, and remove items without using iterators.

QMutableVectorIterator<T> allows you to iterate over a QVector<T> and modify the vector. If you don't want to modify the vector (or have a const QVector), use the slightly faster QVectorIterator<T> instead.

The QMutableVectorIterator constructor takes a QVector as argument. After construction, the iterator is located at the very beginning of the list (before the first item). Here's how to iterate over all the elements sequentially:

 
Sélectionnez
QVector&lt;float&gt; vector;
...
QMutableVectorIterator&lt;float&gt; i(vector);
while (i.hasNext())
    qDebug() &lt;&lt; i.next();

The next() function returns the next item in the vector and advances the iterator. 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, returning the second item; and so on.

Image non disponible

Here's how to iterate over the elements in reverse order:

 
Sélectionnez
QMutableVectorIterator&lt;float&gt; i(vector);
i.toBack();
while (i.hasPrevious())
    qDebug() &lt;&lt; i.previous();

If you want to find all occurrences of a particular value, use findNext() or findPrevious() in a loop.

If you want to remove items as you iterate over the vector, use remove(). If you want to modify the value of an item, use setValue(). If you want to insert a new item in the vector, use insert().

Example:

 
Sélectionnez
QMutableVectorIterator&lt;int&gt; i(vector);
while (i.hasNext()) {
    int val = i.next();
    if (val &lt; 0) {
        i.setValue(-val);
    } else if (val == 0) {
        i.remove();
    }
}

The example traverses a vector, replacing negative numbers with their absolute values, and eliminating zeroes.

Only one mutable iterator can be active on a given vector at any time. Furthermore, no changes should be done directly to the vector while the iterator is active (as opposed to through the iterator), since this could invalidate the iterator and lead to undefined behavior.

See Also

Member Function Documentation

 

QMutableVectorIterator::QMutableVectorIterator(QVector<T> &vector)

Constructs an iterator for traversing vector. The iterator is set to be at the front of the vector (before the first item).

See Also

See also operator=()

QMutableVectorIterator<T> &QMutableVectorIterator::operator=(QVector<T> &container)

Makes the iterator operate on vector. The iterator is set to be at the front of the vector (before the first item).

See Also

See also toFront(), toBack()

void QMutableVectorIterator::toFront()

Moves the iterator to the front of the container (before the first item).

See Also

See also toBack(), next()

void QMutableVectorIterator::toBack()

Moves the iterator to the back of the container (after the last item).

See Also

See also toFront(), previous()

bool QMutableVectorIterator::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 hasPrevious(), next()

T &QMutableVectorIterator::next()

Returns a reference to the next item, and advances the iterator by one position.

Calling this function on an iterator located at the back of the container leads to undefined results.

See Also

See also hasNext(), peekNext(), previous()

T &QMutableVectorIterator::peekNext() const

Returns a reference to the next item, without moving the iterator.

Calling this function on an iterator located at the back of the container leads to undefined results.

See Also

See also hasNext(), next(), peekPrevious()

bool QMutableVectorIterator::hasPrevious() const

Returns true if there is at least one item behind the iterator, i.e. the iterator is not at the front of the container; otherwise returns false.

See Also

See also hasNext(), previous()

T &QMutableVectorIterator::previous()

Returns a reference to the previous item and moves the iterator back by one position.

Calling this function on an iterator located at the front of the container leads to undefined results.

See Also

See also hasPrevious(), peekPrevious(), next()

T &QMutableVectorIterator::peekPrevious() const

Returns a reference to the previous item, without moving the iterator.

Calling this function on an iterator located at the front of the container leads to undefined results.

See Also

See also hasPrevious(), previous(), peekNext()

bool QMutableVectorIterator::findNext(const T &value)

Searches for value starting from the current iterator position forward. Returns true if 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.

See Also

See also findPrevious()

bool QMutableVectorIterator::findPrevious(const T &value)

Searches for value starting from the current iterator position backward. Returns true if value is found; otherwise returns false.

After the call, if value was found, the iterator is positioned just before the matching item; otherwise, the iterator is positioned at the front of the container.

See Also

See also findNext()

const T &QMutableVectorIterator::value() const

Returns the value of the last item that was jumped over using one of the traversal functions (next(), previous(), findNext(), findPrevious()).

After a call to next() or findNext(), value() is equivalent to peekPrevious(). After a call to previous() or findPrevious(), value() is equivalent to peekNext().

T &QMutableVectorIterator::value()

This is an overloaded function.

Returns a non-const reference to the value of the last item that was jumped over using one of the traversal functions.

void QMutableVectorIterator::insert(const T &value)

Inserts value at the current iterator position. After the call, the iterator is located just after the inserted item.

See Also

See also remove(), setValue()

void QMutableVectorIterator::remove()

Removes the last item that was jumped over using one of the traversal functions (next(), previous(), findNext(), findPrevious()).

Example:

 
Sélectionnez
QMutableVectorIterator&lt;int&gt; i(vector);
while (i.hasNext()) {
    int val = i.next();
    if (val &lt; -32768 || val &gt; 32767)
        i.remove();
}
See Also

See also insert(), setValue()

void QMutableVectorIterator::setValue(const T &value) const

Replaces the value of the last item that was jumped over using one of the traversal functions with value.

The traversal functions are next(), previous(), findNext(), and findPrevious().

Example:

 
Sélectionnez
QMutableVectorIterator&lt;double&gt; i(list);
while (i.hasNext()) {
    double val = i.next();
    i.setValue(std::sqrt(val));
}
See Also

See also value(), remove(), insert()

Vous avez aimé ce tutoriel ? Alors partagez-le en cliquant sur les boutons suivants : Viadeo Twitter Facebook Share on Google+