Namespaces
Variants
Views
Actions

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

From cppreference.com
< cpp‎ | algorithm
(+exception)
(Iterator -> It; fmt declarations)
Line 4: Line 4:
 
{{dcl header | numeric}}
 
{{dcl header | numeric}}
 
{{dcl | since=c++17 | num= 1 |1=  
 
{{dcl | since=c++17 | num= 1 |1=  
template< class InputIterator, class OutputIterator, class T >
+
template< class InputIt, class OutputIt, class T >
OutputIterator exclusive_scan( InputIterator first, InputIterator last,
+
OutputIt exclusive_scan( InputIt first, InputIt last,
                              OutputIterator result, T init );
+
                        OutputIt result, T init );
 
}}
 
}}
 
{{dcl | since=c++17 | num= 2 |1=
 
{{dcl | since=c++17 | num= 2 |1=
template< class ExecutionPolicy, class InputIterator, class OutputIterator, class T >
+
template< class ExecutionPolicy, class InputIt, class OutputIt, class T >
OutputIterator exclusive_scan( ExecutionPolicy&& policy, InputIterator first, InputIterator last,
+
OutputIt exclusive_scan( ExecutionPolicy&& policy, InputIt first, InputIt last,
                              OutputIterator result, T init);}}
+
                        OutputIt result, T init);}}
 
{{dcl | since=c++17 | num= 3 |1=  
 
{{dcl | since=c++17 | num= 3 |1=  
template< class InputIterator, class OutputIterator, class T, class BinaryOperation >
+
template< class InputIt, class OutputIt,  
OutputIterator exclusive_scan( InputIterator first, InputIterator last,
+
          class T, class BinaryOperation >
                              OutputIterator result, T init, BinaryOperation binary_op );
+
OutputIt exclusive_scan( InputIt first, InputIt last,
 +
                        OutputIt result, T init, BinaryOperation binary_op );
 
}}
 
}}
 
{{dcl | since=c++17 | num= 4 |1=
 
{{dcl | since=c++17 | num= 4 |1=
template< class ExecutionPolicy, class InputIterator, class OutputIterator, class T, class BinaryOperation >
+
template< class ExecutionPolicy, class InputIt, class OutputIt,
OutputIterator exclusive_scan( ExecutionPolicy&& policy, InputIterator first, InputIterator last,
+
          class T, class BinaryOperation >
                              OutputIterator result, T init, BinaryOperation binary_op );}}
+
OutputIt exclusive_scan( ExecutionPolicy&& policy, InputIt first, InputIt last,
 +
                        OutputIt result, T init, BinaryOperation binary_op );}}
 
{{dcl end}}
 
{{dcl end}}
  

Revision as of 16:11, 21 March 2016

 
 
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 result, T init );
(1) (since C++17)
template< class ExecutionPolicy, class InputIt, class OutputIt, class T >

OutputIt exclusive_scan( ExecutionPolicy&& policy, InputIt first, InputIt last,

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

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

                         OutputIt result, T init, BinaryOperation binary_op );
(3) (since C++17)
template< class ExecutionPolicy, class InputIt, class OutputIt,

          class T, class BinaryOperation >
OutputIt exclusive_scan( ExecutionPolicy&& policy, InputIt first, InputIt last,

                         OutputIt result, T init, BinaryOperation binary_op );
(4) (since C++17)

Computes an exclusive prefix sum operation using binary_op (or std::plus<>() for overloads (1-2)) for the range [first, last), and writes them to the range beginning at result. "exclusive" means that the i-th input element is not included in the i-th sum.

Formally, assigns through each iterator i in [result, result + (last - first)) the value of the generalized noncommutative sum of init, *j... for every j in [first, first + (i - result)) over binary_op,

where generalized noncommutative sum GNSUM(op, a1, ..., aN) is defined as follows:

  • if N=1, a1
  • if N > 1, op(GNSUM(op, a1, ..., aK), GNSUM(op, aM, ..., aN)) for any K where 1 < K+1 = M ≤ N

In other words, the summation operations may be performed in arbitrary order.

The behavior is nondeterministic if binary_op is not associative.

Overloads (2,4) are executed according to policy. These overloads do not participate in overload resolution unless std::is_execution_policy_v<std::decay_t<ExecutionPolicy>> is true.

binary_op shall not invalidate iterators or subranges, nor modify elements in the ranges [first, last) or [result, result + (last - first)). Otherwise, the behavior is undefined.

Contents

Parameters

first, last - the range of elements to sum
result - the beginning of the destination range
policy - the execution policy to use. See execution policy for details.
init - The initial value
binary_op - binary Template:concept that will be applied in to the result of dereferencing the input iterators, the results of other binary_op, and init.
Type requirements

Template:par req concept Template:par req concept

Return value

Iterator to the element past the last element written.

Complexity

O(last - first) applications of the binary operation

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.

Example

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]