std::reverse
From Cppreference
| Defined in header <algorithm>
|
||
| template< class BidirectionalIterator >
void reverse( BidirectionalIterator first, BidirectionalIterator last ); |
||
Reverses the order of the elements in the range [first, last).
Contents |
[edit] Parameters
| first, last | - | the range of elements to reverse |
[edit] Return value
(none)
[edit] Equivalent function
template<class BidirectionalIterator> void reverse(BidirectionalIterator first, BidirectionalIterator last) { while ((first != last) && (first != --last)) { std::swap(*first++, *last); } } |
[edit] Example
| This section is incomplete |
[edit] Complexity
linear in the distance between first and last
[edit] See also
|
creates a copy of a range that is reversed (function template) |
|