std::reverse_copy

Template:cpp/algorithm/sidebar Template:ddcl list begin <tr class="t-dsc-header">

<td>

Defined in header <algorithm>

</td>

<td></td> <td></td> </tr> <tr class="t-dcl ">

<td class="t-dcl-nopad">

template< class BidirectionalIterator, class OutputIterator >
OutputIterator reverse_copy( BidirectionalIterator first, BidirectionalIterator last, OutputIterator d_first );

</td>

<td class="t-dcl-nopad"> </td> <td class="t-dcl-nopad"> </td> </tr> Template:ddcl list end

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.

Parameters

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

Return value

output iterator to the element past the last element copied.

Template:eq fun cpp Template:example cpp

Complexity

linear in the distance between first and last

See also

Template:cpp/algorithm/dcl list reverse