| Defined in header <algorithm>
|
||
| template< class ForwardIt, class OutputIt > OutputIt rotate_copy( ForwardIt first, ForwardIt n_first, ForwardIt last, OutputIt d_first ); |
(1) | (constexpr since C++20) |
| template< class ExecutionPolicy, class ForwardIt1, class ForwardIt2 > ForwardIt2 rotate_copy( ExecutionPolicy&& policy, ForwardIt1 first, ForwardIt1 n_first, ForwardIt1 last, ForwardIt2 d_first ); |
(2) | (since C++17) |
[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.policy.|
|
(until C++20) |
|
|
(since C++20) |
If any of the following conditions is satisfied, the behavior is undefined:
-
[first,n_first)or[n_first,last)is not a valid range. - The source and destination ranges overlap.
Parameters
| first, last | - | the range of elements to copy |
| n_first | - | an iterator to an element in [first, last) that should appear at the beginning of the new range
|
| d_first | - | beginning of the destination range |
| policy | - | the execution policy to use |
| Type requirements | ||
ForwardIt, ForwardIt1, ForwardIt2 must meet the requirements of LegacyForwardIterator.
| ||
OutputIt must meet the requirements of LegacyOutputIterator.
| ||
Return value
Output iterator to the element past the last element copied.
Complexity
Exactly std::distance(first, last) assignments.
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 and
ExecutionPolicyis one of the standard policies, std::terminate is called. For any otherExecutionPolicy, the behavior is implementation-defined. - If the algorithm fails to allocate memory, std::bad_alloc is thrown.
Possible implementation
See also the implementations in libstdc++, libc++, and MSVC STL.
Example
#include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
int main()
{
std::vector<int> src{1, 2, 3, 4, 5};
std::vector<int> dest(src.size());
auto pivot = std::find(src.begin(), src.end(), 3);
std::rotate_copy(src.begin(), pivot, src.end(), dest.begin());
for (int i : dest)
std::cout << i << ' ';
std::cout << '\n';
// copy the rotation result directly to the std::cout
pivot = std::find(dest.begin(), dest.end(), 1);
std::rotate_copy(dest.begin(), pivot, dest.end(),
std::ostream_iterator<int>(std::cout, " "));
std::cout << '\n';
}3 4 5 1 2
1 2 3 4 5See also
| rotates the order of elements in a range (function template) | |
| (C++20) |
copies and rotate a range of elements (algorithm function object) |
Content from this page on cppreference.com, licensed under CC-BY-SA 3.0 and GFDL. Modified: restyled, site navigation removed, code windows added. Offline snapshot of 9 February 2025.