Namespaces
Variants
Views
Actions

std::reverse_copy

From cppreference.com
 
 
 
Defined in header <algorithm>
template< class BidirectionalIterator, class OutputIterator >
OutputIterator reverse_copy( BidirectionalIterator first, BidirectionalIterator last, OutputIterator d_first );

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.

Contents

[edit] Parameters

first, last - the range of elements to copy
d_first - the beginning of the destination range

[edit] Return value

output iterator to the element past the last element copied.

[edit] Possible implementation

[edit] Example

#include <vector>
#include <iostream>
#include <algorithm>
 
int main()
{
    std::vector<int> v({1,2,3});
    std::for_each(std::begin(v), std::end(v),
                  [&](int value){ std::cout << value << " "; });
    std::cout << std::endl;
 
    std::vector<int> destiny(3);
    std::reverse_copy(std::begin(v), std::end(v), std::begin(destiny));
    std::for_each(std::begin(destiny), std::end(destiny),
                  [&](int value){ std::cout << value << " "; });
    std::cout << std::endl;
}

Output:

1 2 3 
3 2 1

[edit] Complexity

linear in the distance between first and last

[edit] See also

reverses the order elements in a range
(function template) [edit]