Difference between revisions of "cpp/algorithm/copy"
m (→See also: + std::ranges version) |
m (Minor tweak.) |
||
(15 intermediate revisions by 9 users not shown) | |||
Line 2: | Line 2: | ||
{{cpp/algorithm/navbar}} | {{cpp/algorithm/navbar}} | ||
{{dcl begin}} | {{dcl begin}} | ||
− | {{dcl header | algorithm}} | + | {{dcl header|algorithm}} |
− | {{ | + | {{dcla|num=1|notes={{mark constexpr since c++20}}| |
template< class InputIt, class OutputIt > | template< class InputIt, class OutputIt > | ||
− | OutputIt copy( InputIt first, InputIt last, | + | OutputIt copy( InputIt first, InputIt last, |
− | + | OutputIt d_first ); | |
− | + | ||
− | + | ||
}} | }} | ||
− | {{dcl | num=2 | since=c++17 | | + | {{dcl|num=2|since=c++17| |
− | template< class ExecutionPolicy, class ForwardIt1, class ForwardIt2 > | + | template< class ExecutionPolicy, |
− | ForwardIt2 copy( ExecutionPolicy&& policy, ForwardIt1 first, ForwardIt1 last, ForwardIt2 d_first ); | + | class ForwardIt1, class ForwardIt2 > |
+ | ForwardIt2 copy( ExecutionPolicy&& policy, | ||
+ | ForwardIt1 first, ForwardIt1 last, | ||
+ | ForwardIt2 d_first ); | ||
}} | }} | ||
− | {{ | + | {{dcla|num=3|since=c++11|notes={{mark constexpr since c++20}}| |
− | template< class InputIt, class OutputIt, class | + | template< class InputIt, class OutputIt, class UnaryPred > |
OutputIt copy_if( InputIt first, InputIt last, | OutputIt copy_if( InputIt first, InputIt last, | ||
− | OutputIt d_first, | + | OutputIt d_first, UnaryPred pred ); |
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
}} | }} | ||
− | {{dcl | num=4 | + | {{dcl|num=4|since=c++17|1= |
− | template< class ExecutionPolicy, class ForwardIt1, class ForwardIt2, class | + | template< class ExecutionPolicy, |
− | ForwardIt2 copy_if( ExecutionPolicy&& policy, ForwardIt1 first, ForwardIt1 last, | + | class ForwardIt1, class ForwardIt2, class UnaryPred > |
− | + | ForwardIt2 copy_if( ExecutionPolicy&& policy, | |
− | + | ForwardIt1 first, ForwardIt1 last, | |
+ | ForwardIt2 d_first, UnaryPred pred ); | ||
}} | }} | ||
{{dcl end}} | {{dcl end}} | ||
− | Copies the elements in the range, defined by {{ | + | Copies the elements in the range, defined by {{range|first|last}}, to another range beginning at {{c|d_first}} (copy destination range). |
− | @1@ Copies all elements in the range {{ | + | |
− | @3@ Only copies the elements for which the predicate {{ | + | @1@ Copies all elements in the range {{range|first|last}} starting from {{c|first}} and proceeding to {{c|last}}. |
− | @ | + | @@ If {{c|d_first}} is in {{range|first|last}}, the behavior is undefined. In this case, {{lc|std::copy_backward}} may be used instead. |
+ | |||
+ | @2@ Copies the elements, but executed according to {{c|policy}}. | ||
+ | @@ {{cpp/algorithm/parallel overload precondition}} | ||
+ | @@ If {{range|first|last}} and the copy destination range overlaps, the behavior is undefined. | ||
+ | |||
+ | @3@ Only copies the elements for which the predicate {{c|pred}} returns {{c|true}}. This copy algorithm is stable: the relative order of the elements that are copied is preserved. | ||
+ | @@ If {{range|first|last}} and the copy destination range overlaps, the behavior is undefined. | ||
+ | |||
+ | @4@ Same as {{v|3}}, but executed according to {{c|policy}}. | ||
+ | @@ {{cpp/algorithm/parallel overload precondition}} | ||
+ | |||
===Parameters=== | ===Parameters=== | ||
{{par begin}} | {{par begin}} | ||
− | {{par | first, last | the range of elements to copy}} | + | {{par|first, last|the range of elements to copy}} |
− | {{par | d_first | the beginning of the destination range | + | {{par|d_first|the beginning of the destination range}} |
{{par exec pol}} | {{par exec pol}} | ||
− | {{par pred1 | pred | value=true | for the required elements | p1=InputIt}} | + | {{par pred1|pred|value=true|for the required elements|p1=InputIt}} |
{{par hreq}} | {{par hreq}} | ||
− | {{par req named | InputIt | InputIterator}} | + | {{par req named|InputIt|InputIterator}} |
− | {{par req named | OutputIt | OutputIterator}} | + | {{par req named|OutputIt|OutputIterator}} |
− | {{par req named | ForwardIt1, ForwardIt2 | ForwardIterator}} | + | {{par req named|ForwardIt1, ForwardIt2|ForwardIterator}} |
− | {{par req named | | + | {{par req named|UnaryPred|Predicate}} |
{{par end}} | {{par end}} | ||
===Return value=== | ===Return value=== | ||
− | |||
Output iterator to the element in the destination range, one past the last element copied. | Output iterator to the element in the destination range, one past the last element copied. | ||
===Complexity=== | ===Complexity=== | ||
+ | Given {{mathjax-or|\(\scriptsize N\)|N}} as {{c|std::distance(first, last)}}: | ||
+ | @1,2@ Exactly {{mathjax-or|\(\scriptsize N\)|N}} assignments. | ||
+ | @3,4@ Exactly {{mathjax-or|\(\scriptsize N\)|N}} applications of the predicate {{c|pred}}, and at most {{mathjax-or|\(\scriptsize N\)|N}} assignments. | ||
− | + | For the overloads with an {{tt|ExecutionPolicy}}, there may be a performance cost if {{tt|ForwardIt1}}'s value type is not {{named req|MoveConstructible}}. | |
− | + | ||
− | + | ||
− | + | ||
− | + | ||
===Exceptions=== | ===Exceptions=== | ||
− | {{cpp/algorithm/ | + | {{cpp/algorithm/parallel exceptions reporting behavior|singular=no}} |
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
===Possible implementation=== | ===Possible implementation=== | ||
− | {{eq | + | {{eq impl |
+ | |title1=copy (1)|ver1=1|1= | ||
template<class InputIt, class OutputIt> | template<class InputIt, class OutputIt> | ||
− | OutputIt copy(InputIt first, InputIt last, | + | OutputIt copy(InputIt first, InputIt last, |
OutputIt d_first) | OutputIt d_first) | ||
{ | { | ||
− | + | for (; first != last; (void)++first, (void)++d_first) | |
− | *d_first | + | *d_first = *first; |
− | + | ||
return d_first; | return d_first; | ||
} | } | ||
− | + | |title2=copy_if (3)|ver2=3|2= | |
− | template<class InputIt, class OutputIt, class | + | template<class InputIt, class OutputIt, class UnaryPred> |
− | OutputIt copy_if(InputIt first, InputIt last, | + | OutputIt copy_if(InputIt first, InputIt last, |
− | OutputIt d_first, | + | OutputIt d_first, UnaryPred pred) |
{ | { | ||
− | + | for (; first != last; ++first) | |
if (pred(*first)) | if (pred(*first)) | ||
− | *d_first | + | { |
− | + | *d_first = *first; | |
− | + | ++d_first; | |
+ | } | ||
+ | |||
return d_first; | return d_first; | ||
} | } | ||
}} | }} | ||
+ | |||
+ | ===Notes=== | ||
+ | In practice, implementations of {{tt|std::copy}} avoid multiple assignments and use bulk copy functions such as {{lc|std::memmove}} if the value type is {{named req|TriviallyCopyable}} and the iterator types satisfy {{named req|ContiguousIterator}}. | ||
+ | |||
+ | When copying overlapping ranges, {{tt|std::copy}} is appropriate when copying to the left (beginning of the destination range is outside the source range) while {{tt|std::copy_backward}} is appropriate when copying to the right (end of the destination range is outside the source range). | ||
===Example=== | ===Example=== | ||
{{example | {{example | ||
− | + | |The following code uses {{tt|std::copy}} to both copy the contents of one {{lc|std::vector}} to another and to display the resulting {{lc|std::vector}}. | |
− | + | |code= | |
#include <algorithm> | #include <algorithm> | ||
#include <iostream> | #include <iostream> | ||
− | |||
#include <iterator> | #include <iterator> | ||
#include <numeric> | #include <numeric> | ||
+ | #include <vector> | ||
int main() | int main() | ||
Line 109: | Line 117: | ||
std::vector<int> from_vector(10); | std::vector<int> from_vector(10); | ||
std::iota(from_vector.begin(), from_vector.end(), 0); | std::iota(from_vector.begin(), from_vector.end(), 0); | ||
− | + | ||
std::vector<int> to_vector; | std::vector<int> to_vector; | ||
std::copy(from_vector.begin(), from_vector.end(), | std::copy(from_vector.begin(), from_vector.end(), | ||
Line 118: | Line 126: | ||
// either way is equivalent to | // either way is equivalent to | ||
// std::vector<int> to_vector = from_vector; | // std::vector<int> to_vector = from_vector; | ||
− | + | ||
std::cout << "to_vector contains: "; | std::cout << "to_vector contains: "; | ||
− | + | ||
std::copy(to_vector.begin(), to_vector.end(), | std::copy(to_vector.begin(), to_vector.end(), | ||
std::ostream_iterator<int>(std::cout, " ")); | std::ostream_iterator<int>(std::cout, " ")); | ||
std::cout << '\n'; | std::cout << '\n'; | ||
− | + | ||
std::cout << "odd numbers in to_vector are: "; | std::cout << "odd numbers in to_vector are: "; | ||
− | + | ||
std::copy_if(to_vector.begin(), to_vector.end(), | std::copy_if(to_vector.begin(), to_vector.end(), | ||
std::ostream_iterator<int>(std::cout, " "), | std::ostream_iterator<int>(std::cout, " "), | ||
− | [](int x) { return | + | [](int x) { return x % 2 != 0; }); |
+ | std::cout << '\n'; | ||
+ | |||
+ | std::cout << "to_vector contains these multiples of 3: "; | ||
+ | |||
+ | to_vector.clear(); | ||
+ | std::copy_if(from_vector.begin(), from_vector.end(), | ||
+ | std::back_inserter(to_vector), | ||
+ | [](int x) { return x % 3 == 0; }); | ||
+ | |||
+ | for (const int x : to_vector) | ||
+ | std::cout << x << ' '; | ||
std::cout << '\n'; | std::cout << '\n'; | ||
} | } | ||
− | + | |p=true | |
+ | |output= | ||
to_vector contains: 0 1 2 3 4 5 6 7 8 9 | to_vector contains: 0 1 2 3 4 5 6 7 8 9 | ||
− | odd numbers in to_vector are: 1 3 5 7 9 | + | odd numbers in to_vector are: 1 3 5 7 9 |
+ | to_vector contains these multiples of 3: 0 3 6 9 | ||
}} | }} | ||
+ | |||
+ | ===Defect reports=== | ||
+ | {{dr list begin}} | ||
+ | {{dr list item|wg=lwg|dr=2039|std=C++11|before=the return value of {{tt|std::copy_if}} was not specified|after=specified}} | ||
+ | {{dr list item|wg=lwg|dr=2044|std=C++11|before=the stability of {{tt|std::copy_if}} was not defined|after=defined}} | ||
+ | {{dr list end}} | ||
===See also=== | ===See also=== | ||
{{dsc begin}} | {{dsc begin}} | ||
− | {{dsc inc | cpp/algorithm/dsc copy_backward}} | + | {{dsc inc|cpp/algorithm/dsc copy_backward}} |
− | {{dsc inc | cpp/algorithm/dsc reverse_copy}} | + | {{dsc inc|cpp/algorithm/dsc reverse_copy}} |
− | {{dsc inc | cpp/algorithm/dsc copy_n}} | + | {{dsc inc|cpp/algorithm/dsc copy_n}} |
− | {{dsc inc | cpp/algorithm/dsc fill}} | + | {{dsc inc|cpp/algorithm/dsc fill}} |
− | {{dsc inc | cpp/algorithm/dsc remove_copy}} | + | {{dsc inc|cpp/algorithm/dsc remove_copy}} |
− | {{dsc inc | cpp/algorithm/ranges/dsc copy}} | + | {{dsc inc|cpp/algorithm/ranges/dsc copy}} |
{{dsc end}} | {{dsc end}} | ||
{{langlinks|de|es|fr|it|ja|pt|ru|zh}} | {{langlinks|de|es|fr|it|ja|pt|ru|zh}} |
Latest revision as of 22:09, 25 March 2024
Defined in header <algorithm>
|
||
template< class InputIt, class OutputIt > OutputIt copy( InputIt first, InputIt last, |
(1) | (constexpr since C++20) |
template< class ExecutionPolicy, class ForwardIt1, class ForwardIt2 > |
(2) | (since C++17) |
template< class InputIt, class OutputIt, class UnaryPred > OutputIt copy_if( InputIt first, InputIt last, |
(3) | (since C++11) (constexpr since C++20) |
template< class ExecutionPolicy, class ForwardIt1, class ForwardIt2, class UnaryPred > |
(4) | (since C++17) |
Copies the elements in the range, defined by [
first,
last)
, to another range beginning at d_first (copy destination range).
[
first,
last)
starting from first and proceeding to last.[
first,
last)
, the behavior is undefined. In this case, std::copy_backward may be used instead.
std::is_execution_policy_v<std::decay_t<ExecutionPolicy>> is true. |
(until C++20) |
std::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>> is true. |
(since C++20) |
[
first,
last)
and the copy destination range overlaps, the behavior is undefined.[
first,
last)
and the copy destination range overlaps, the behavior is undefined.
std::is_execution_policy_v<std::decay_t<ExecutionPolicy>> is true. |
(until C++20) |
std::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>> is true. |
(since C++20) |
Contents |
[edit] Parameters
first, last | - | the range of elements to copy |
d_first | - | the beginning of the destination range |
policy | - | the execution policy to use. See execution policy for details. |
pred | - | unary predicate which returns true for the required elements. The expression pred(v) must be convertible to bool for every argument |
Type requirements | ||
-InputIt must meet the requirements of LegacyInputIterator.
| ||
-OutputIt must meet the requirements of LegacyOutputIterator.
| ||
-ForwardIt1, ForwardIt2 must meet the requirements of LegacyForwardIterator.
| ||
-UnaryPred must meet the requirements of Predicate.
|
[edit] Return value
Output iterator to the element in the destination range, one past the last element copied.
[edit] Complexity
Given N as std::distance(first, last):
For the overloads with an ExecutionPolicy
, there may be a performance cost if ForwardIt1
's value type is not MoveConstructible.
[edit] Exceptions
The overloads with a template parameter named ExecutionPolicy
report errors as follows:
- If execution of a function invoked as part of the algorithm throws an exception and
ExecutionPolicy
is 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.
[edit] Possible implementation
copy (1) |
---|
template<class InputIt, class OutputIt> OutputIt copy(InputIt first, InputIt last, OutputIt d_first) { for (; first != last; (void)++first, (void)++d_first) *d_first = *first; return d_first; } |
copy_if (3) |
template<class InputIt, class OutputIt, class UnaryPred> OutputIt copy_if(InputIt first, InputIt last, OutputIt d_first, UnaryPred pred) { for (; first != last; ++first) if (pred(*first)) { *d_first = *first; ++d_first; } return d_first; } |
[edit] Notes
In practice, implementations of std::copy
avoid multiple assignments and use bulk copy functions such as std::memmove if the value type is TriviallyCopyable and the iterator types satisfy LegacyContiguousIterator.
When copying overlapping ranges, std::copy
is appropriate when copying to the left (beginning of the destination range is outside the source range) while std::copy_backward
is appropriate when copying to the right (end of the destination range is outside the source range).
[edit] Example
The following code uses std::copy
to both copy the contents of one std::vector to another and to display the resulting std::vector.
#include <algorithm> #include <iostream> #include <iterator> #include <numeric> #include <vector> int main() { std::vector<int> from_vector(10); std::iota(from_vector.begin(), from_vector.end(), 0); std::vector<int> to_vector; std::copy(from_vector.begin(), from_vector.end(), std::back_inserter(to_vector)); // or, alternatively, // std::vector<int> to_vector(from_vector.size()); // std::copy(from_vector.begin(), from_vector.end(), to_vector.begin()); // either way is equivalent to // std::vector<int> to_vector = from_vector; std::cout << "to_vector contains: "; std::copy(to_vector.begin(), to_vector.end(), std::ostream_iterator<int>(std::cout, " ")); std::cout << '\n'; std::cout << "odd numbers in to_vector are: "; std::copy_if(to_vector.begin(), to_vector.end(), std::ostream_iterator<int>(std::cout, " "), [](int x) { return x % 2 != 0; }); std::cout << '\n'; std::cout << "to_vector contains these multiples of 3: "; to_vector.clear(); std::copy_if(from_vector.begin(), from_vector.end(), std::back_inserter(to_vector), [](int x) { return x % 3 == 0; }); for (const int x : to_vector) std::cout << x << ' '; std::cout << '\n'; }
Possible output:
to_vector contains: 0 1 2 3 4 5 6 7 8 9 odd numbers in to_vector are: 1 3 5 7 9 to_vector contains these multiples of 3: 0 3 6 9
[edit] Defect reports
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
DR | Applied to | Behavior as published | Correct behavior |
---|---|---|---|
LWG 2039 | C++11 | the return value of std::copy_if was not specified
|
specified |
LWG 2044 | C++11 | the stability of std::copy_if was not defined
|
defined |
[edit] See also
copies a range of elements in backwards order (function template) | |
creates a copy of a range that is reversed (function template) | |
(C++11) |
copies a number of elements to a new location (function template) |
copy-assigns the given value to every element in a range (function template) | |
copies a range of elements omitting those that satisfy specific criteria (function template) | |
(C++20)(C++20) |
copies a range of elements to a new location (niebloid) |