wash added a comment.
Here's `partial_sum`:
template
inline _LIBCPP_INLINE_VISIBILITY
_OutputIterator
partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator
__result,
_BinaryOperation __binary_op)
{
if (__first != __last)
{
typen
wash added a comment.
So, `inclusive_scan` should be equivalent to `partial_sum` for the non-parallel
version.
https://reviews.llvm.org/D34007
___
cfe-commits mailing list
cfe-commits@lists.llvm.org
http://lists.llvm.org/cgi-bin/mailman/listinfo/cf
wash added a comment.
Minor note: there's a mix of tabs and spaces in this diff.
https://reviews.llvm.org/D34007
___
cfe-commits mailing list
cfe-commits@lists.llvm.org
http://lists.llvm.org/cgi-bin/mailman/listinfo/cfe-commits
mclow.lists abandoned this revision.
mclow.lists added a comment.
I don't think that this is a correct implementation. Also, I need tests for
when the result overwrites the source.
As they say .. I'll be back :-)
https://reviews.llvm.org/D34007
___
mclow.lists added a comment.
Re-reading this, I may have implemented `exclusive_scan` instead of
`inclusive_scan` here.
https://reviews.llvm.org/D34007
___
cfe-commits mailing list
cfe-commits@lists.llvm.org
http://lists.llvm.org/cgi-bin/mailman/li
mclow.lists created this revision.
Like https://reviews.llvm.org/D33997, this implements the non-parallel versions
of these algorithms
https://reviews.llvm.org/D33997 implemented `reduce` and `transform_reduce`,
this adds `inclusive_scan` and `transform_inclusive_scan`.
There will be another p
