thrust::exclusive_scan
Defined in thrust/scan.h
-
template<typename InputIterator, typename OutputIterator, typename T, typename AssociativeOperator>
OutputIterator thrust::exclusive_scan(InputIterator first, InputIterator last, OutputIterator result, T init, AssociativeOperator binary_op) exclusive_scancomputes an exclusive prefix sum operation. The term ‘exclusive’ means that each result does not include the corresponding input operand in the partial sum. More precisely,initis assigned to*resultand the valuebinary_op(init, *first)is assigned to*(result + 1), and so on. This version of the function requires both an associative operator and an initial valueinit. When the input and output sequences are the same, the scan is performed in-place.Results are not deterministic for pseudo-associative operators (e.g., addition of floating-point types). Results for pseudo-associative operators may vary from run to run.
The following code snippet demonstrates how to use
exclusive_scan#include <thrust/scan.h> #include <thrust/functional.h> int data[10] = {-5, 0, 2, -3, 2, 4, 0, -1, 2, 8}; thrust::maximum<int> binary_op; thrust::exclusive_scan(data, data + 10, data, 1, binary_op); // in-place scan // data is now {1, 1, 1, 2, 2, 2, 4, 4, 4, 4 }
- Parameters
first – The beginning of the input sequence.
last – The end of the input sequence.
result – The beginning of the output sequence.
init – The initial value.
binary_op – The associative operator used to ‘sum’ values.
- Template Parameters
InputIterator – is a model of Input Iterator and
InputIterator'svalue_typeis convertible toOutputIterator'svalue_type.OutputIterator – is a model of Output Iterator and
OutputIterator'svalue_typeis convertible to bothAssociativeOperator'sfirst and second argument type.T – is convertible to
OutputIterator'svalue_type.AssociativeOperator – The function’s return type must be convertible to
OutputIterator'svalue_type.
- Returns
The end of the output sequence.
- Pre
firstmay equalresultbut the range[first, last)and the range[result, result + (last - first))shall not overlap otherwise.