Книга: Standard Template Library Programmer

reverse

reverse

Category: algorithms

Component type: function

template <class BidirectionalIterator>
void reverse(BidirectionalIterator first, BidirectionalIterator last);

Reverse reverses a range. That is: for every i such that 0 <= i <= (last – first) / 2), it exchanges *(first + i) and *(last – (i + 1)).

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

• BidirectionalIterator is a model of Bidirectional Iterator.

• BidirectionalIterator is mutable.

• [first, last) is a valid range.

Linear: reverse(first, last) makes (last – first) / 2 calls to swap.

vector<int> V;
V.push_back(0);
V.push_back(1);
V.push_back(2);
copy(V.begin(), V.end(), ostream_iterator<int>(cout, " "));
// Output: 0 1 2
reverse(V.begin(), V.end());
copy(V.begin(), V.end(), ostream_iterator<int>(cout, " "));
// Output: 2 1 0

reverse_copy

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