Namespaces
Variants
Views
Actions

Difference between revisions of "cpp/algorithm/exclusive scan"

From cppreference.com
< cpp‎ | algorithm
m (Text replace - "par req concept" to "par req named")
m (Minor fix.)
 
(14 intermediate revisions by 10 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 | num= 1 |1=
+
{{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 | num= 2 |1=
+
{{dcl|num=2|since=c++17|
template< class ExecutionPolicy, class ForwardIt1, class ForwardIt2, class T >
+
template< class ExecutionPolicy,
ForwardIt2 exclusive_scan( ExecutionPolicy&& policy, ForwardIt1 first, ForwardIt1 last,
+
          class ForwardIt1, class ForwardIt2, class T >
                           ForwardIt2 d_first, T init);}}
+
ForwardIt2 exclusive_scan( ExecutionPolicy&& policy,
{{dcl | since=c++17 | num= 3 |1=
+
                          ForwardIt1 first, ForwardIt1 last,
template< class InputIt, class OutputIt,  
+
                           ForwardIt2 d_first, T init );
           class T, class BinaryOperation >
+
}}
 +
{{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, BinaryOperation binary_op );
+
                         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 | since=c++17 | num= 4 |1=
 
template< class ExecutionPolicy, class ForwardIt1, class ForwardIt2,
 
          class T, class BinaryOperation >
 
ForwardIt2 exclusive_scan( ExecutionPolicy&& policy, ForwardIt1 first, ForwardIt1 last,
 
                          ForwardIt2 d_first, T init, BinaryOperation binary_op );}}
 
 
{{dcl end}}
 
{{dcl end}}
  
Computes an exclusive prefix sum operation using {{tt|binary_op}} (or {{c|std::plus<>()}} for overloads {{v|1-2}}) for the range {{tt|[first, last)}}, using {{tt|init}} as the initial value, and writes the results to the range beginning at {{tt|d_first}}. "exclusive" means that the i-th input element is not included in the i-th sum.  
+
@1@ Equivalent to {{c|exclusive_scan(first, last, d_first, init, std::plus<>()}}.
  
Formally, assigns through each iterator {{tt|i}} in {{math|[d_first, d_first + (last - first))}} the value of the generalized noncommutative sum of {{tt|init, *j...}} for every {{tt|j}} in {{math|[first, first + (i - d_first))}} over {{tt|binary_op}},
+
@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}}.
  
where generalized noncommutative sum {{math|GNSUM(op, a{{su|b=1}}, ..., a{{su|b=N}})}} is defined as follows:
+
@2,4@ Same as {{v|1,3}}, but executed according to {{c|policy}}.
* if {{math|N{{=}}1}}, {{math|a{{su|b=1}}}}
+
@@ {{cpp/algorithm/parallel overload precondition|plural=yes}}
* if {{math|N > 1}}, {{math|op(GNSUM(op, a{{su|b=1}}, ..., a{{su|b=K}}), GNSUM(op, a{{su|b=M}}, ..., a{{su|b=N}}))}} for any K where {{math|1 < K+1 {{=}} M ≤ N}}
+
  
In other words, the summation operations may be performed in arbitrary order, and the behavior is nondeterministic if {{tt|binary_op}} is not associative.
+
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.
  
Overloads {{v|2,4}} are executed according to {{tt|policy}}. {{cpp/enable_if| {{c|std::is_execution_policy_v<std::decay_t<ExecutionPolicy>>}} is true.}}
 
  
{{tt|binary_op}} shall not invalidate iterators (including the end iterators) or subranges, nor modify elements in the ranges {{math|[first, last)}} or {{math|[d_first, d_first + (last - first))}}. Otherwise, the behavior is undefined.
+
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; may be equal to {{tt|first}} }}
+
{{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 | binary_op | binary {{named req|FunctionObject}} that will be applied in to the result of dereferencing the input iterators, the results of other {{tt|binary_op}}, and {{tt|init}}.}}
+
{{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 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 | T | MoveConstructible | notes=and {{tt|binary_op(init, *first)}}, {{tt|binary_op(init, init)}}, and {{tt|binary_op(*first, *first)}} must be convertible to {{tt|T}}}}
+
 
{{par end}}
 
{{par end}}
  
Line 57: Line 81:
  
 
===Complexity===
 
===Complexity===
{{math|O(last - first)}} applications of the binary operation
+
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/parallel_exceptions_reporting_behavior|singular=no}}
+
{{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|zh}}
+
{{langlinks|es|ja|zh}}

Latest revision as of 00:24, 18 April 2024

 
 
Algorithm library
Constrained algorithms and algorithms on ranges (C++20)
Constrained algorithms, e.g. ranges::copy, ranges::sort, ...
Execution policies (C++17)
Non-modifying sequence operations
Batch operations
(C++17)
Search operations
(C++11)                (C++11)(C++11)

Modifying sequence operations
Copy operations
(C++11)
(C++11)
Swap operations
Transformation operations
Generation operations
Removing operations
Order-changing operations
(until C++17)(C++11)
(C++20)(C++20)
Sampling operations
(C++17)

Sorting and related operations
Partitioning operations
Sorting operations
Binary search operations
(on partitioned ranges)
Set operations (on sorted ranges)
Merge operations (on sorted ranges)
Heap operations
Minimum/maximum operations
(C++11)
(C++17)
Lexicographical comparison operations
Permutation operations
C library
Numeric operations
(C++17)   
exclusive_scan
(C++17)
Operations on uninitialized memory
 
 
Defined in header <numeric>
template< class InputIt, class OutputIt, class T >

OutputIt exclusive_scan( InputIt first, InputIt last,

                         OutputIt d_first, T init );
(1) (since C++17)
(constexpr since C++20)
template< class ExecutionPolicy,

          class ForwardIt1, class ForwardIt2, class T >
ForwardIt2 exclusive_scan( ExecutionPolicy&& policy,
                           ForwardIt1 first, ForwardIt1 last,

                           ForwardIt2 d_first, T init );
(2) (since C++17)
template< class InputIt, class OutputIt,

          class T, class BinaryOp >
OutputIt exclusive_scan( InputIt first, InputIt last,

                         OutputIt d_first, T init, BinaryOp op );
(3) (since C++17)
(constexpr since C++20)
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 );
(4) (since C++17)
1) Equivalent to exclusive_scan(first, last, d_first, init, std::plus<>().
3) Computes the exclusive prefix sum using op.
For each integer i in [0std::distance(first, last)), performs the following operations in order:
  1. Creates a sequence which is formed by init followed by the elements of [firstiter) in order, where iter is the next ith iterator of first.
  2. Computes the generalized noncommutative sum of the sequence over op.
  3. Assigns the result to *dest, where dest is the next ith iterator of d_first.
2,4) Same as (1,3), but executed according to policy.
These overloads participate in overload resolution only if

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:
  1. Selects any two adjacent elements elem1 and elem2 from the sequence.
  2. Calculates binary_op(elem1, elem2) and replaces the two elements in the sequence with the result.
  3. 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 [firstlast).
  • binary_op invalidates any iterator or subrange of [firstlast].

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):

1,2) O(N) applications of std::plus<>().
3,4) O(N) applications of op.

[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 other ExecutionPolicy, 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) [edit]
sums up or folds a range of elements
(function template) [edit]
computes the partial sum of a range of elements
(function template) [edit]
applies an invocable, then calculates exclusive scan
(function template) [edit]
similar to std::partial_sum, includes the ith input element in the ith sum
(function template) [edit]