Difference between revisions of "cpp/algorithm/partial sum"
(→Equivalent function: fix duplication) |
m (Text replace - "===Equivalent function===" to "===Possible implementation===") |
||
| Line 38: | Line 38: | ||
Exactly {{tt|(last - first) - 1}} applications of the binary operation | Exactly {{tt|(last - first) - 1}} applications of the binary operation | ||
| − | === | + | ===Possible implementation=== |
{{eq fun cpp | {{eq fun cpp | ||
| 1= | | 1= | ||
Revision as of 11:55, 19 March 2012
Template:cpp/algorithm/sidebar Template:ddcl list begin <tr class="t-dsc-header">
<td><numeric>
<td></td> <td></td> </tr> <tr class="t-dcl ">
<td >OutputIterator partial_sum( InputIterator first, InputIterator last, OutputIterator d_first );
<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">
<td >OutputIterator partial_sum( InputIterator first, InputIterator last, OutputIterator d_first,
<td > (2) </td> <td class="t-dcl-nopad"> </td> </tr> Template:ddcl list end
Computes the partial sums of the elements in the subranges of the range [first, last) and writes them to the range beginning at d_first. The first version uses operator+ to sum up the elements, the second version uses the given binary function op.
Equivalent operation:
Contents |
Parameters
| first, last | - | the range of elements to sum |
| d_first | - | the beginning of the destination range |
| 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 &. |
Return value
Iterator to the element past the last element written.
Complexity
Exactly (last - first) - 1 applications of the binary operation
