< cpp‎ | algorithm
Algorithm library
Execution policies (C++17)
Non-modifying sequence operations
Modifying sequence operations
Operations on uninitialized storage
Partitioning operations
Sorting operations
Binary search operations
Set operations (on sorted ranges)
Heap operations
Minimum/maximum operations

Numeric operations
C library
Defined in header <algorithm>
template< class BidirIt, class OutputIt >
OutputIt reverse_copy( BidirIt first, BidirIt last, OutputIt d_first );
template< class ExecutionPolicy, class BidirIt, class OutputIt >
OutputIt reverse_copy( ExecutionPolicy&& policy, BidirIt first, BidirIt last, OutputIt d_first );
(2) (since C++17)
1) Copies the elements from the range [first, last) to another range beginning at d_first in such a way that the elements in the new range are in reverse order.
Behaves as if by executing the assignment *(d_first + (last - first) - 1 - i) = *(first + i) once for each non-negative i < (last - first)
If the source and destination ranges (that is, [first, last) and [d_first, d_first+(last-first)) respectively) overlap, the behavior is undefined.
2) Same as (1), but executed according to policy. This overload does not participate in overload resolution unless std::is_execution_policy_v<std::decay_t<ExecutionPolicy>> is true


[edit] Parameters

first, last - the range of elements to copy
d_first - the beginning of the destination range
Type requirements
BidirIt must meet the requirements of BidirectionalIterator.
OutputIt must meet the requirements of OutputIterator.

[edit] Return value

Output iterator to the element past the last element copied.

[edit] 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, std::terminate is called.
  • If the algorithm fails to allocate memory, std::bad_alloc is thrown.

[edit] Possible implementation

template<class BidirIt, class OutputIt>
OutputIt reverse_copy(BidirIt first, BidirIt last, OutputIt d_first)
    while (first != last) {
        *(d_first++) = *(--last);
    return d_first;

[edit] Example

#include <vector>
#include <iostream>
#include <algorithm>
int main()
    std::vector<int> v({1,2,3});
    for (const auto& value : v) {
        std::cout << value << " ";
    std::cout << '\n';
    std::vector<int> destination(3);
    std::reverse_copy(std::begin(v), std::end(v), std::begin(destination));
    for (const auto& value : destination) {
        std::cout << value << " ";
    std::cout << '\n';


1 2 3 
3 2 1

[edit] Complexity

Linear in the distance between first and last

[edit] See also

reverses the order of elements in a range
(function template) [edit]
parallelized version of std::reverse_copy
(function template) [edit]