Книга: Standard Template Library Programmer

advance

advance

Categories: algorithms, iterators

Component type: function

template <class InputIterator, class Distance>
void advance(InputIterator& i, Distance n);

Advance(i, n) increments the iterator i by the distance n . If n > 0 it is equivalent to executing ++i n times, and if n < 0 it is equivalent to executing --i n times. If n == 0 , the call has no effect.

Defined in the standard header iterator, and in the nonstandard backward-compatibility header iterator.h.

• InputIterator is a model of Input Iterator.

• Distance is an integral type that is convertible to InputIterator's distance type.

• i is nonsingular.

• Every iterator between i and i+n (inclusive) is nonsingular.

• If InputIterator is a model of input iterator or forward iterator, then n must be nonnegative. If InputIterator is a model of bidirectional iterator or random access iterator, then this precondition does not apply.

Constant time if InputIterator is a model of random access iterator, otherwise linear time.

list<int> L;
L.push_back(0);
L.push_back(1);
list<int>::iterator i = L.begin();
advance(i, 2);
assert(i == L.end());

distance, Input iterator, Bidirectional Iterator, Random access iterator, iterator_traits, Iterator overview.

Оглавление книги