OutputIt partial_sum( InputIt first, InputIt last,
OutputIt partial_sum( InputIt first, InputIt last,
1) If [
first,
last)
is empty, does nothing.
Otherwise, performs the following operations in order:
InputIt
, and initializes it with *first.[
1,
std::distance(first, last))
, performs the following operations in order:a) Computes acc + *iter(until C++20)std::move(acc) + *iter(since C++20), where iter is the next ith iterator of first.
b) Assigns the result to acc.
c)Assigns
acc[1]to
*dest, where
destis the next
ithiterator of
d_first.
2) Same as (1), but computes op(acc, *iter)(until C++20)op(std::move(acc), *iter)(since C++20) instead.
Given binary_op as the actual binary operation:
InputIt
is not constructible from *first.InputIt
.[
first,
last)
or [
d_first,
d_last)
.[
first,
last]
or [
d_first,
d_last]
.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 &.
The type Type1 must be such that an object of type std::iterator_traits<InputIt>::value_type can be implicitly converted to Type1. The type Type2 must be such that an object of type InputIt can be dereferenced and then implicitly converted to Type2. The type Ret must be such that an object of type InputIt can be dereferenced and assigned a value of type Ret. â
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.
Given \(\scriptsize N\)N as std::distance(first, last):
1) Exactly \(\scriptsize N-1\)N-1 applications of operator+.
2) Exactly \(\scriptsize N-1\)N-1 applications of the binary function op.
[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:
InputIt
OutputIt
acc serves as the intermediate object to store and provide the values for each step of the computation:
InputIt
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 resultRetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4