Template Function thrust::inclusive_scan(InputIterator, InputIterator, OutputIterator, AssociativeOperator)¶
Function Documentation¶
-
template<typename
InputIterator, typenameOutputIterator, typenameAssociativeOperator>
OutputIteratorthrust::inclusive_scan(InputIterator first, InputIterator last, OutputIterator result, AssociativeOperator binary_op) inclusive_scancomputes an inclusive prefix sum operation. The term ‘inclusive’ means that each result includes the corresponding input operand in the partial sum. When the input and output sequences are the same, the scan is performed in-place.inclusive_scanis similar tostd::partial_sumin the STL. The primary difference between the two functions is thatstd::partial_sumguarantees a serial summation order, whileinclusive_scanrequires associativity of the binary operation to parallelize the prefix sum.The following code snippet demonstrates how to use
inclusive_scan- Return
The end of the output sequence.
- Pre
firstmay equalresultbut the range[first, last)and the range[result, result + (last - first))shall not overlap otherwise.- Parameters
first: The beginning of the input sequence.last: The end of the input sequence.result: The beginning of the output sequence.binary_op: The associatve operator used to ‘sum’ values.
- Template Parameters
InputIterator: is a model of Input Iterator andInputIterator'svalue_typeis convertible toOutputIterator'svalue_type.OutputIterator: is a model of Output Iterator andOutputIterator'svalue_typeis convertible to bothAssociativeOperator'sfirst_argument_typeandsecond_argument_type.AssociativeOperator: is a model of Binary Function andAssociativeOperator'sresult_typeis convertible toOutputIterator'svalue_type.
int data[10] = {-5, 0, 2, -3, 2, 4, 0, -1, 2, 8}; thrust::maximum<int> binary_op; thrust::inclusive_scan(data, data + 10, data, binary_op); // in-place scan // data is now {-5, 0, 2, 2, 2, 4, 4, 4, 4, 8}