Difference between revisions of "cpp/algorithm/rotate copy"
From cppreference.com
Timmoore9999 (Talk | contribs) (Undo revision 19223 by Timmoore9999 (talk)) |
m (Text replace - "===Equivalent function===" to "===Possible implementation===") |
||
| Line 23: | Line 23: | ||
output iterator to the element past the last element copied. | output iterator to the element past the last element copied. | ||
| − | === | + | ===Possible implementation=== |
{{eq fun cpp | 1= | {{eq fun cpp | 1= | ||
template<class ForwardIterator, class OutputIterator> | template<class ForwardIterator, class OutputIterator> | ||
Revision as of 11:56, 19 March 2012
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 ForwardIterator, class OutputIterator >
</td>
OutputIterator rotate_copy( ForwardIterator first, ForwardIterator n_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 element n_first becomes the first element of the new range and n_first - 1 becomes the last element.
Contents |
Parameters
| first, last | - | the range of elements to copy |
| n_first | - | the element to move to the beginning of the new range |
| d_first | - | beginning of the destination range |
Return value
output iterator to the element past the last element copied.
Possible implementation
Example
Complexity
linear in the distance between first and last
