Difference between revisions of "cpp/algorithm/reverse copy"
From cppreference.com
m (Text replace - "{{returns}}" to "===Return value===") |
m (Text replace - "{{see also}}" to "===See also===") |
||
| Line 45: | Line 45: | ||
<!-- ======== --> | <!-- ======== --> | ||
| − | + | ===See also=== | |
{{dcl list begin}} | {{dcl list begin}} | ||
{{dcl list template | cpp/algorithm/dcl list reverse}} | {{dcl list template | cpp/algorithm/dcl list reverse}} | ||
{{dcl list end}} | {{dcl list end}} | ||
Revision as of 17:53, 2 August 2011
Template:cpp/algorithm/sidebar Template:ddcl list begin <tr class="t-dsc-header">
<td>Defined in header
</td>
<algorithm>
<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>
OutputIterator reverse_copy( BidirectionalIterator first, BidirectionalIterator last, OutputIterator d_first );
<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.
| This section is incomplete Reason: no eq fun |
| This section is incomplete Reason: no example |
linear in the distance between first and last
