Difference between revisions of "cpp/algorithm/exclusive scan"
(→See also: drop those for now) |
m (Minor fix.) |
||
(21 intermediate revisions by 12 users not shown) | |||
Line 1: | Line 1: | ||
{{cpp/title|exclusive_scan}} | {{cpp/title|exclusive_scan}} | ||
− | {{cpp/algorithm/navbar}} | + | {{cpp/algorithm/numeric/navbar}} |
{{dcl begin}} | {{dcl begin}} | ||
− | {{dcl header | numeric}} | + | {{dcl header|numeric}} |
− | {{dcl | since=c++17 | | + | {{dcl|num=1|since=c++17|notes={{mark constexpr since c++20}}| |
template< class InputIt, class OutputIt, class T > | template< class InputIt, class OutputIt, class T > | ||
OutputIt exclusive_scan( InputIt first, InputIt last, | OutputIt exclusive_scan( InputIt first, InputIt last, | ||
OutputIt d_first, T init ); | OutputIt d_first, T init ); | ||
}} | }} | ||
− | {{dcl | since=c++17 | | + | {{dcl|num=2|since=c++17| |
− | template< class ExecutionPolicy, class | + | template< class ExecutionPolicy, |
− | + | class ForwardIt1, class ForwardIt2, class T > | |
− | + | ForwardIt2 exclusive_scan( ExecutionPolicy&& policy, | |
− | {{dcl | since=c++17 | | + | ForwardIt1 first, ForwardIt1 last, |
− | template< class InputIt, class OutputIt, | + | ForwardIt2 d_first, T init ); |
− | class T, class | + | }} |
+ | {{dcl|num=3|since=c++17|notes={{mark constexpr since c++20}}| | ||
+ | template< class InputIt, class OutputIt, | ||
+ | class T, class BinaryOp > | ||
OutputIt exclusive_scan( InputIt first, InputIt last, | OutputIt exclusive_scan( InputIt first, InputIt last, | ||
− | OutputIt d_first, T init, | + | OutputIt d_first, T init, BinaryOp op ); |
+ | }} | ||
+ | {{dcl|num=4|since=c++17| | ||
+ | template< class ExecutionPolicy, | ||
+ | class ForwardIt1, class ForwardIt2, | ||
+ | class T, class BinaryOp > | ||
+ | ForwardIt2 exclusive_scan( ExecutionPolicy&& policy, | ||
+ | ForwardIt1 first, ForwardIt1 last, | ||
+ | ForwardIt2 d_first, T init, BinaryOp op ); | ||
}} | }} | ||
− | |||
− | |||
− | |||
− | |||
− | |||
{{dcl end}} | {{dcl end}} | ||
− | + | @1@ Equivalent to {{c|exclusive_scan(first, last, d_first, init, std::plus<>()}}. | |
− | + | @3@ Computes the exclusive prefix sum using {{c|op}}. | |
− | + | @@ For each integer {{c|i}} in {{range|0|std::distance(first, last)}}, performs the following operations in order: | |
+ | # Creates a sequence which is formed by {{c|init}} followed by the elements of {{range|first|iter}} in order, where {{c|iter}} is the next {{c|i}}{{su|b=th}} iterator of {{c|first}}. | ||
+ | # Computes the generalized noncommutative sum of the sequence over {{c|op}}. | ||
+ | # Assigns the result to {{c|*dest}}, where {{c|dest}} is the next {{c|i}}{{su|b=th}} iterator of {{c|d_first}}. | ||
− | + | @2,4@ Same as {{v|1,3}}, but executed according to {{c|policy}}. | |
− | + | @@ {{cpp/algorithm/parallel overload precondition|plural=yes}} | |
− | + | ||
− | + | The ''generalized noncommutative sum'' of a sequence of elements over a binary operation {{c|binary_op}} is defined as follows: | |
+ | * If the sequence only has one element, the sum is the value of the element. | ||
+ | * Otherwise, performs the following operations in order: | ||
+ | # Selects any two adjacent elements {{c|elem1}} and {{c|elem2}} from the sequence. | ||
+ | # Calculates {{c|binary_op(elem1, elem2)}} and replaces the two elements in the sequence with the result. | ||
+ | # Repeats steps 1 and 2 until there is only one element in the sequence. | ||
− | |||
− | + | Given {{c|binary_op}} as the actual binary operation: | |
− | {{ | + | * The result is non-deterministic if the {{c|binary_op}} is not associative (such as floating-point addition). |
− | {{ | + | |
+ | * If any of the following values is not convertible to {{tt|T}}, the program is ill-formed: | ||
+ | :* {{c|binary_op(init, *first)}} | ||
+ | :* {{c|binary_op(init, init)}} | ||
+ | :* {{c|binary_op(*first, *first)}} | ||
+ | |||
+ | * If any of the following conditions is satisfied, the behavior is undefined: | ||
+ | :* {{tt|T}} is not {{named req|MoveConstructible}}. | ||
+ | :* {{c|binary_op}} modifies any element of {{range|first|last}}. | ||
+ | :* {{c|binary_op}} invalidates any iterator or subrange of {{closed range|first|last}}. | ||
===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 exec pol}} | {{par exec pol}} | ||
− | {{par | init | the initial value}} | + | {{par|init|the initial value}} |
− | {{par | | + | {{par|op|binary {{named req|FunctionObject}} that will be applied in to the result of dereferencing the input iterators, the results of other {{c|op}}, and {{c|init}}}} |
{{par hreq}} | {{par hreq}} | ||
− | {{par req | + | {{par req named|InputIt|InputIterator}} |
− | {{par req | + | {{par req named|OutputIt|OutputIterator}} |
+ | {{par req named|ForwardIt1, ForwardIt2|ForwardIterator}} | ||
{{par end}} | {{par end}} | ||
Line 59: | Line 81: | ||
===Complexity=== | ===Complexity=== | ||
− | {{ | + | Given {{mathjax-or|\(\scriptsize N\)|N}} as {{c|std::distance(first, last)}}: |
+ | |||
+ | @1,2@ {{mathjax-or|\(\scriptsize O(N)\)|O(N)}} applications of {{c|std::plus<>()}}. | ||
+ | |||
+ | @3,4@ {{mathjax-or|\(\scriptsize O(N)\)|O(N)}} applications of {{c|op}}. | ||
===Exceptions=== | ===Exceptions=== | ||
− | {{cpp/algorithm/ | + | {{cpp/algorithm/parallel exceptions reporting behavior|singular=no}} |
===Example=== | ===Example=== | ||
− | {{example | + | {{cpp/algorithm/scan example}} |
− | }} | + | |
===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 partial_sum}} | + | {{dsc inc|cpp/algorithm/dsc partial_sum}} |
− | {{dsc inc | cpp/algorithm/dsc transform_exclusive_scan}} | + | {{dsc inc|cpp/algorithm/dsc transform_exclusive_scan}} |
− | {{dsc inc | cpp/algorithm/dsc inclusive_scan}} | + | {{dsc inc|cpp/algorithm/dsc inclusive_scan}} |
{{dsc end}} | {{dsc end}} | ||
+ | |||
+ | {{langlinks|es|ja|zh}} |
Latest revision as of 00:24, 18 April 2024
Defined in header <numeric>
|
||
template< class InputIt, class OutputIt, class T > OutputIt exclusive_scan( InputIt first, InputIt last, |
(1) | (since C++17) (constexpr since C++20) |
template< class ExecutionPolicy, class ForwardIt1, class ForwardIt2, class T > |
(2) | (since C++17) |
template< class InputIt, class OutputIt, class T, class BinaryOp > |
(3) | (since C++17) (constexpr since C++20) |
template< class ExecutionPolicy, class ForwardIt1, class ForwardIt2, |
(4) | (since C++17) |
[
0,
std::distance(first, last))
, performs the following operations in order:
- Creates a sequence which is formed by init followed by the elements of
[
first,
iter)
in order, where iter is the next ith iterator of first. - Computes the generalized noncommutative sum of the sequence over op.
- Assigns the result to *dest, where dest is the next ith iterator of d_first.
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) |
The generalized noncommutative sum of a sequence of elements over a binary operation binary_op is defined as follows:
- If the sequence only has one element, the sum is the value of the element.
- Otherwise, performs the following operations in order:
- Selects any two adjacent elements elem1 and elem2 from the sequence.
- Calculates binary_op(elem1, elem2) and replaces the two elements in the sequence with the result.
- Repeats steps 1 and 2 until there is only one element in the sequence.
Given binary_op as the actual binary operation:
- The result is non-deterministic if the binary_op is not associative (such as floating-point addition).
- If any of the following values is not convertible to
T
, the program is ill-formed:
- binary_op(init, *first)
- binary_op(init, init)
- binary_op(*first, *first)
- If any of the following conditions is satisfied, the behavior is undefined:
-
T
is not MoveConstructible. - binary_op modifies any element of
[
first,
last)
. - binary_op invalidates any iterator or subrange of
[
first,
last]
.
-
Contents |
[edit] Parameters
first, last | - | the range of elements to sum |
d_first | - | the beginning of the destination range; may be equal to first |
policy | - | the execution policy to use. See execution policy for details. |
init | - | the initial value |
op | - | binary FunctionObject that will be applied in to the result of dereferencing the input iterators, the results of other op, and init |
Type requirements | ||
-InputIt must meet the requirements of LegacyInputIterator.
| ||
-OutputIt must meet the requirements of LegacyOutputIterator.
| ||
-ForwardIt1, ForwardIt2 must meet the requirements of LegacyForwardIterator.
|
[edit] Return value
Iterator to the element past the last element written.
[edit] Complexity
Given N as std::distance(first, last):
[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] Example
#include <functional> #include <iostream> #include <iterator> #include <numeric> #include <vector> int main() { std::vector data{3, 1, 4, 1, 5, 9, 2, 6}; std::cout << "Exclusive sum: "; std::exclusive_scan(data.begin(), data.end(), std::ostream_iterator<int>(std::cout, " "), 0); std::cout << "\nInclusive sum: "; std::inclusive_scan(data.begin(), data.end(), std::ostream_iterator<int>(std::cout, " ")); std::cout << "\n\nExclusive product: "; std::exclusive_scan(data.begin(), data.end(), std::ostream_iterator<int>(std::cout, " "), 1, std::multiplies<>{}); std::cout << "\nInclusive product: "; std::inclusive_scan(data.begin(), data.end(), std::ostream_iterator<int>(std::cout, " "), std::multiplies<>{}); }
Output:
Exclusive sum: 0 3 4 8 9 14 23 25 Inclusive sum: 3 4 8 9 14 23 25 31 Exclusive product: 1 3 3 12 12 60 540 1080 Inclusive product: 3 3 12 12 60 540 1080 6480
[edit] See also
computes the differences between adjacent elements in a range (function template) | |
sums up or folds a range of elements (function template) | |
computes the partial sum of a range of elements (function template) | |
(C++17) |
applies an invocable, then calculates exclusive scan (function template) |
(C++17) |
similar to std::partial_sum, includes the ith input element in the ith sum (function template) |