On this page
std::reverse
Defined in header <algorithm> |
||
---|---|---|
(1) | ||
|
(until C++20) | |
|
(since C++20) | |
|
(2) | (since C++17) |
[
first
,
last
)
.
std::iter_swap
to every pair of iterators first + i
and (last - i) - 1
for each integer i
in [
0
,
std::distance(first, last) / 2
)
.
policy
. This overload does not participate in overload resolution unless
|
(until C++20) |
|
(since C++20) |
Parameters
first, last | - | the range of elements to reverse |
policy | - | the execution policy to use. See execution policy for details. |
Type requirements | ||
-BidirIt must meet the requirements of ValueSwappable and LegacyBidirectionalIterator. |
Return value
(none)
Complexity
Exactly std::distance(first, last) / 2
swaps.
Exceptions
The overload with a template parameter named ExecutionPolicy
reports errors as follows:
- If execution of a function invoked as part of the algorithm throws an exception and
ExecutionPolicy
is one of the standard policies,std::terminate
is called. For any otherExecutionPolicy
, the behavior is implementation-defined. - If the algorithm fails to allocate memory,
std::bad_alloc
is thrown.
Notes
Implementations (e.g. MSVC STL) may enable vectorization when the iterator type satisfies LegacyContiguousIterator and swapping its value type calls neither non-trivial special member function nor ADL-found swap
.
Possible implementation
See also the implementations in libstdc++, libc++, and MSVC STL.
|
Example
#include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
void println(auto rem, auto const& v)
{
for (std::cout << rem; auto e : v)
std::cout << e << ' ';
std::cout << '\n';
}
int main()
{
std::vector<int> v {1, 2, 3};
std::reverse(v.begin(), v.end());
println("after reverse, v = ", v);
int a[] = {4, 5, 6, 7};
std::reverse(std::begin(a), std::end(a));
println("after reverse, a = ", a);
}
Output:
after reverse, v = 3 2 1
after reverse, a = 7 6 5 4
Defect reports
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
DR | Applied to | Behavior as published | Correct behavior |
---|---|---|---|
LWG 223 | C++98 | std::swap was applied to each pair of iterators |
applies std::iter_swap instead |
LWG 2039 | C++98 | std::iter_swap was also applied when i equals std::distance(first, last) / 2 |
not applied |
See also
creates a copy of a range that is reversed (function template) |
|
(C++20)
|
reverses the order of elements in a range (niebloid) |
© cppreference.com
Licensed under the Creative Commons Attribution-ShareAlike Unported License v3.0.
https://en.cppreference.com/w/cpp/algorithm/reverse