Difference between revisions of "cpp/algorithm/partial sum"
m (Update links.) |
(Ditto, not DR) |
||
(34 intermediate revisions by 13 users not shown) | |||
Line 1: | Line 1: | ||
{{cpp/title|partial_sum}} | {{cpp/title|partial_sum}} | ||
− | {{cpp/algorithm/navbar}} | + | {{cpp/algorithm/numeric/navbar}} |
{{dcl begin}} | {{dcl begin}} | ||
− | {{dcl header | numeric}} | + | {{dcl header|numeric}} |
− | {{ | + | {{dcla|num=1|notes={{mark constexpr since c++20}}| |
template< class InputIt, class OutputIt > | template< class InputIt, class OutputIt > | ||
− | OutputIt partial_sum( InputIt first, InputIt last, OutputIt d_first ); | + | OutputIt partial_sum( InputIt first, InputIt last, |
+ | OutputIt d_first ); | ||
}} | }} | ||
− | {{ | + | {{dcla|num=2|notes={{mark constexpr since c++20}}| |
− | template< class InputIt, class OutputIt, class | + | template< class InputIt, class OutputIt, class BinaryOp > |
− | OutputIt partial_sum( InputIt first, InputIt last, OutputIt d_first, | + | OutputIt partial_sum( InputIt first, InputIt last, |
− | + | OutputIt d_first, BinaryOp op ); | |
}} | }} | ||
{{dcl end}} | {{dcl end}} | ||
− | + | @1@ If {{range|first|last}} is empty, does nothing. | |
+ | @@ Otherwise, performs the following operations in order: | ||
+ | # Creates an accumulator {{c|acc}}, whose type is the [[cpp/iterator#Types and writability|value type]] of {{tt|InputIt}}, and initializes it with {{c|*first}}. | ||
+ | # Assigns {{c|acc}} to {{c|*d_first}}. | ||
+ | # For each integer {{c|i}} in {{range|1|std::distance(first, last)}}, performs the following operations in order: | ||
+ | ::@a@ Computes {{rev inl|until=c++20|{{c|acc + *iter}}}}{{rev inl|since=c++20|{{c|std::move(acc) + *iter}}}}, where {{c|iter}} is the next {{c|i}}{{su|b=th}} iterator of {{c|first}}. | ||
+ | ::@b@ Assigns the result to {{c|acc}}. | ||
+ | ::@c@ Assigns {{c|acc}}<ref>The actual value to be assigned is the result of the assignment in the previous step. We assume the assignment result is {{c|acc}} here.</ref> to {{c|*dest}}, where {{c|dest}} is the next {{c|i}}{{su|b=th}} iterator of {{c|d_first}}. | ||
− | + | @2@ Same as {{v|1}}, but computes {{rev inl|until=c++20|{{c|op(acc, *iter)}}}}{{rev inl|since=c++20|{{c|op(std::move(acc), *iter)}}}} instead. | |
+ | |||
+ | Given {{c|binary_op}} as the actual binary operation: | ||
+ | |||
+ | * If any of the following conditions is satisfied, the program is ill-formed: | ||
+ | :* The value type of {{tt|InputIt}} is not constructible from {{c|*first}}. | ||
+ | :* {{c|acc}} is not [[cpp/iterator#Types and writability|writable]] to {{c|d_first}}. | ||
+ | :* The result of {{rev inl|until=c++20|{{c|binary_op(acc, *iter)}}}}{{rev inl|since=c++20|{{c|binary_op(std::move(acc), *iter)}}}} is not implicitly convertible to the value type of {{tt|InputIt}}. | ||
+ | |||
+ | * Given {{c|d_last}} as the iterator to be [[#Return value|returned]], if any of the following conditions is satisfied, the behavior is undefined: | ||
+ | :* {{c|binary_op}} modifies any element of {{range|first|last}} or {{range|d_first|d_last}}. | ||
+ | :* {{c|binary_op}} invalidates any iterator or subrange in {{closed range|first|last}} or {{closed range|d_first|d_last}}. | ||
+ | |||
+ | |||
+ | <references/> | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
===Parameters=== | ===Parameters=== | ||
{{par begin}} | {{par begin}} | ||
− | {{par | first, last | the range of elements to sum}} | + | {{par|first, last|the range of elements to sum}} |
− | {{par | d_first | the beginning of the destination range}} | + | {{par|d_first|the beginning of the destination range; may be equal to {{c|first}}}} |
− | {{par op2 | op | t1=iterator_traits<InputIt>::value_type | p2=InputIt | | + | {{par op2|op|t1=std::iterator_traits<InputIt>::value_type|p2=InputIt|rp=InputIt}} |
{{par hreq}} | {{par hreq}} | ||
− | {{par req | + | {{par req named|InputIt|InputIterator}} |
− | {{par req | + | {{par req named|OutputIt|OutputIterator}} |
{{par end}} | {{par end}} | ||
===Return value=== | ===Return value=== | ||
− | Iterator to the element past the last element written. | + | Iterator to the element past the last element written, or {{c|d_first}} if {{range|first|last}} is empty. |
===Complexity=== | ===Complexity=== | ||
− | + | Given {{mathjax-or|\(\scriptsize N\)|N}} as {{c|std::distance(first, last)}}: | |
− | + | @1@ Exactly {{mathjax-or|\(\scriptsize N-1\)|N-1}} applications of {{c/core|operator+}}. | |
+ | @2@ Exactly {{mathjax-or|\(\scriptsize N-1\)|N-1}} applications of the binary function {{c|op}}. | ||
+ | |||
===Possible implementation=== | ===Possible implementation=== | ||
− | {{eq | + | {{eq impl |
− | + | |title1=partial_sum (1)|ver1=1|1= | |
template<class InputIt, class OutputIt> | template<class InputIt, class OutputIt> | ||
− | OutputIt partial_sum(InputIt first, InputIt last, | + | constexpr // since C++20 |
− | + | OutputIt partial_sum(InputIt first, InputIt last, OutputIt d_first) | |
{ | { | ||
− | return std::partial_sum(first, last, d_first, | + | if (first == last) |
− | + | return d_first; | |
+ | |||
+ | typename std::iterator_traits<InputIt>::value_type sum = *first; | ||
+ | *d_first = sum; | ||
+ | |||
+ | while (++first != last) | ||
+ | { | ||
+ | sum = std::move(sum) + *first; // std::move since C++20 | ||
+ | *++d_first = sum; | ||
+ | } | ||
+ | |||
+ | return ++d_first; | ||
+ | |||
+ | // or, since C++14: | ||
+ | // return std::partial_sum(first, last, d_first, std::plus<>()); | ||
} | } | ||
− | + | |title2=partial_sum (2)|ver2=2|2= | |
− | template<class InputIt, class OutputIt, class | + | template<class InputIt, class OutputIt, class BinaryOp> |
+ | constexpr // since C++20 | ||
OutputIt partial_sum(InputIt first, InputIt last, | OutputIt partial_sum(InputIt first, InputIt last, | ||
− | + | OutputIt d_first, BinaryOp op) | |
{ | { | ||
− | if (first == last) return d_first; | + | if (first == last) |
− | + | return d_first; | |
− | typename std::iterator_traits<InputIt>::value_type | + | |
− | *d_first = | + | typename std::iterator_traits<InputIt>::value_type acc = *first; |
− | + | *d_first = acc; | |
− | while (++first != last) { | + | |
− | + | while (++first != last) | |
− | + | { | |
+ | acc = op(std::move(acc), *first); // std::move since C++20 | ||
+ | *++d_first = acc; | ||
} | } | ||
+ | |||
return ++d_first; | return ++d_first; | ||
} | } | ||
+ | }} | ||
+ | |||
+ | ===Notes=== | ||
+ | {{c|acc}} was introduced because of the resolution of {{lwg|539}}. The reason of using {{c|acc}} rather than directly summing up the results (i.e. {{c|1=*(d_first + 2) = (*first + *(first + 1)) + *(first + 2);}}) is because the semantic of the latter is confusing if the following types mismatch: | ||
+ | * the value type of {{tt|InputIt}} | ||
+ | * the writable type(s) of {{tt|OutputIt}} | ||
+ | * the types of the parameters of {{c/core|operator+}} or {{c|op}} | ||
+ | * the return type of {{c/core|operator+}} or {{c|op}} | ||
+ | |||
+ | {{c|acc}} serves as the intermediate object to store and provide the values for each step of the computation: | ||
+ | * its type is the value type of {{tt|InputIt}} | ||
+ | * it is written to {{c|d_first}} | ||
+ | * its value is passed to {{c/core|operator+}} or {{c|op}} | ||
+ | * it stores the return value of {{c/core|operator+}} or {{c|op}} | ||
+ | |||
+ | {{source|1= | ||
+ | enum not_int { x = 1, y = 2 }; | ||
+ | |||
+ | char i_array[4] = {100, 100, 100, 100}; | ||
+ | not_int e_array[4] = {x, x, y, y}; | ||
+ | int o_array[4]; | ||
+ | |||
+ | // OK: uses operator+(char, char) and assigns char values to int array | ||
+ | std::partial_sum(i_array, i_array + 4, o_array); | ||
+ | |||
+ | // Error: cannot assign not_int values to int array | ||
+ | std::partial_sum(e_array, e_array + 4, o_array); | ||
+ | |||
+ | // OK: performs conversions when needed | ||
+ | // 1. creates “acc” of type char (the value type) | ||
+ | // 2. the char arguments are used for long multiplication (char -> long) | ||
+ | // 3. the long product is assigned to “acc” (long -> char) | ||
+ | // 4. “acc” is assigned to an element of “o_array” (char -> int) | ||
+ | // 5. go back to step 2 to process the remaining elements in the input range | ||
+ | std::partial_sum(i_array, i_array + 4, o_array, std::multiplies<long>{}); | ||
}} | }} | ||
===Example=== | ===Example=== | ||
{{example | {{example | ||
− | + | | | |
− | + | |code= | |
− | #include < | + | #include <functional> |
− | + | ||
#include <iostream> | #include <iostream> | ||
#include <iterator> | #include <iterator> | ||
− | #include < | + | #include <numeric> |
+ | #include <vector> | ||
int main() | int main() | ||
{ | { | ||
− | std::vector<int> v = {2, 2, 2, 2, 2, 2, 2, 2, 2, 2} | + | std::vector<int> v(10, 2); // v = {2, 2, 2, 2, 2, 2, 2, 2, 2, 2} |
− | + | ||
− | std::cout << "The first | + | std::cout << "The first " << v.size() << " even numbers are: "; |
− | std::partial_sum(v. | + | // write the result to the cout stream |
+ | std::partial_sum(v.cbegin(), v.cend(), | ||
std::ostream_iterator<int>(std::cout, " ")); | std::ostream_iterator<int>(std::cout, " ")); | ||
std::cout << '\n'; | std::cout << '\n'; | ||
− | + | ||
− | std::partial_sum(v. | + | // write the result back to the vector v |
− | std::cout << "The first | + | std::partial_sum(v.cbegin(), v.cend(), |
− | for ( | + | v.begin(), std::multiplies<int>()); |
− | std::cout << n << | + | |
− | + | std::cout << "The first " << v.size() << " powers of 2 are: "; | |
+ | for (int n : v) | ||
+ | std::cout << n << ' '; | ||
std::cout << '\n'; | std::cout << '\n'; | ||
} | } | ||
− | + | |output= | |
The first 10 even numbers are: 2 4 6 8 10 12 14 16 18 20 | The first 10 even numbers are: 2 4 6 8 10 12 14 16 18 20 | ||
The first 10 powers of 2 are: 2 4 8 16 32 64 128 256 512 1024 | The first 10 powers of 2 are: 2 4 8 16 32 64 128 256 512 1024 | ||
}} | }} | ||
+ | |||
+ | ===Defect reports=== | ||
+ | {{dr list begin}} | ||
+ | {{dr list item|wg=lwg|dr=242|std=C++98|before={{c|op}} could not have side effects|after=it cannot modify the ranges involved}} | ||
+ | {{dr list item|wg=lwg|dr=539|std=C++98|before=the type requirements needed for the result<br>evaluations and assignments to be valid were missing|after=added}} | ||
+ | {{dr list end}} | ||
===See also=== | ===See also=== | ||
{{dsc begin}} | {{dsc begin}} | ||
− | {{dsc inc | cpp/algorithm/dsc adjacent_difference}} | + | {{dsc inc|cpp/algorithm/dsc adjacent_difference}} |
− | {{dsc inc | cpp/algorithm/dsc accumulate}} | + | {{dsc inc|cpp/algorithm/dsc accumulate}} |
+ | {{dsc inc|cpp/algorithm/dsc inclusive_scan}} | ||
+ | {{dsc inc|cpp/algorithm/dsc exclusive_scan}} | ||
{{dsc end}} | {{dsc end}} | ||
− | + | {{langlinks|de|es|fr|it|ja|pt|ru|zh}} | |
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + |
Latest revision as of 05:02, 14 September 2024
Defined in header <numeric>
|
||
template< class InputIt, class OutputIt > OutputIt partial_sum( InputIt first, InputIt last, |
(1) | (constexpr since C++20) |
template< class InputIt, class OutputIt, class BinaryOp > OutputIt partial_sum( InputIt first, InputIt last, |
(2) | (constexpr since C++20) |
[
first,
last)
is empty, does nothing.- Creates an accumulator acc, whose type is the value type of
InputIt
, and initializes it with *first. - Assigns acc to *d_first.
- For each integer i in
[
1,
std::distance(first, last))
, performs the following operations in order:
Given binary_op as the actual binary operation:
- If any of the following conditions is satisfied, the program is ill-formed:
- The value type of
InputIt
is not constructible from *first. - acc is not writable to d_first.
- The result of binary_op(acc, *iter)(until C++20)binary_op(std::move(acc), *iter)(since C++20) is not implicitly convertible to the value type of
InputIt
.
- The value type of
- Given d_last as the iterator to be returned, if any of the following conditions is satisfied, the behavior is undefined:
- binary_op modifies any element of
[
first,
last)
or[
d_first,
d_last)
. - binary_op invalidates any iterator or subrange in
[
first,
last]
or[
d_first,
d_last]
.
- binary_op modifies any element of
- ↑ The actual value to be assigned is the result of the assignment in the previous step. We assume the assignment result is acc here.
Contents |
[edit] Parameters
first, last | - | the range of elements to sum |
d_first | - | the beginning of the destination range; may be equal to first |
op | - | binary operation function object that will be applied. The signature of the function should be equivalent to the following: Ret fun(const Type1 &a, const Type2 &b); The signature does not need to have const &. |
Type requirements | ||
-InputIt must meet the requirements of LegacyInputIterator.
| ||
-OutputIt must meet the requirements of LegacyOutputIterator.
|
[edit] Return value
Iterator to the element past the last element written, or d_first if [
first,
last)
is empty.
[edit] Complexity
Given N as std::distance(first, last):
[edit] Possible implementation
partial_sum (1) |
---|
template<class InputIt, class OutputIt> constexpr // since C++20 OutputIt partial_sum(InputIt first, InputIt last, OutputIt d_first) { if (first == last) return d_first; typename std::iterator_traits<InputIt>::value_type sum = *first; *d_first = sum; while (++first != last) { sum = std::move(sum) + *first; // std::move since C++20 *++d_first = sum; } return ++d_first; // or, since C++14: // return std::partial_sum(first, last, d_first, std::plus<>()); } |
partial_sum (2) |
template<class InputIt, class OutputIt, class BinaryOp> constexpr // since C++20 OutputIt partial_sum(InputIt first, InputIt last, OutputIt d_first, BinaryOp op) { if (first == last) return d_first; typename std::iterator_traits<InputIt>::value_type acc = *first; *d_first = acc; while (++first != last) { acc = op(std::move(acc), *first); // std::move since C++20 *++d_first = acc; } return ++d_first; } |
[edit] Notes
acc was introduced because of the resolution of LWG issue 539. The reason of using acc rather than directly summing up the results (i.e. *(d_first + 2) = (*first + *(first + 1)) + *(first + 2);) is because the semantic of the latter is confusing if the following types mismatch:
- the value type of
InputIt
- the writable type(s) of
OutputIt
- the types of the parameters of operator+ or op
- the return type of operator+ or op
acc serves as the intermediate object to store and provide the values for each step of the computation:
- its type is the value type of
InputIt
- it is written to d_first
- its value is passed to operator+ or op
- it stores the return value of operator+ or op
enum not_int { x = 1, y = 2 }; char i_array[4] = {100, 100, 100, 100}; not_int e_array[4] = {x, x, y, y}; int o_array[4]; // OK: uses operator+(char, char) and assigns char values to int array std::partial_sum(i_array, i_array + 4, o_array); // Error: cannot assign not_int values to int array std::partial_sum(e_array, e_array + 4, o_array); // OK: performs conversions when needed // 1. creates “acc” of type char (the value type) // 2. the char arguments are used for long multiplication (char -> long) // 3. the long product is assigned to “acc” (long -> char) // 4. “acc” is assigned to an element of “o_array” (char -> int) // 5. go back to step 2 to process the remaining elements in the input range std::partial_sum(i_array, i_array + 4, o_array, std::multiplies<long>{});
[edit] Example
#include <functional> #include <iostream> #include <iterator> #include <numeric> #include <vector> int main() { std::vector<int> v(10, 2); // v = {2, 2, 2, 2, 2, 2, 2, 2, 2, 2} std::cout << "The first " << v.size() << " even numbers are: "; // write the result to the cout stream std::partial_sum(v.cbegin(), v.cend(), std::ostream_iterator<int>(std::cout, " ")); std::cout << '\n'; // write the result back to the vector v std::partial_sum(v.cbegin(), v.cend(), v.begin(), std::multiplies<int>()); std::cout << "The first " << v.size() << " powers of 2 are: "; for (int n : v) std::cout << n << ' '; std::cout << '\n'; }
Output:
The first 10 even numbers are: 2 4 6 8 10 12 14 16 18 20 The first 10 powers of 2 are: 2 4 8 16 32 64 128 256 512 1024
[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 242 | C++98 | op could not have side effects | it cannot modify the ranges involved |
LWG 539 | C++98 | the type requirements needed for the result evaluations and assignments to be valid were missing |
added |
[edit] See also
computes the differences between adjacent elements in a range (function template) | |
sums up or folds a range of elements (function template) | |
(C++17) |
similar to std::partial_sum, includes the ith input element in the ith sum (function template) |
(C++17) |
similar to std::partial_sum, excludes the ith input element from the ith sum (function template) |