460778b9d6
This PR adds a "one-liner" default implementation of parallel `std::adjacent_difference` on top of parallel binary `std::transform`. The implementation builds two iterator ranges out of the input one, so that a zip of these ranges yields adjacent pairs. Then performs a binary transform to calculate and output the adjacent differences. Part of https://github.com/llvm/llvm-project/issues/99938 |
||
|---|---|---|
| .. | ||
| accumulate.h | ||
| adjacent_difference.h | ||
| exclusive_scan.h | ||
| gcd_lcm.h | ||
| inclusive_scan.h | ||
| inner_product.h | ||
| iota.h | ||
| midpoint.h | ||
| partial_sum.h | ||
| pstl.h | ||
| ranges_iota.h | ||
| reduce.h | ||
| saturation_arithmetic.h | ||
| transform_exclusive_scan.h | ||
| transform_inclusive_scan.h | ||
| transform_reduce.h | ||