tmp/tmp9yb4okfo/{from.md → to.md}
RENAMED
|
@@ -52,12 +52,12 @@ every iterator `i` in \[`first + 1`, `last`) in order, creates an object
|
|
| 52 |
`val` whose type is `T`, initializes it with `*i`, computes
|
| 53 |
`binary_op(val, std::move(acc))`, assigns the result to
|
| 54 |
`*(result + (i - first))`, and move assigns from `val` to `acc`.
|
| 55 |
|
| 56 |
For the overloads with an `ExecutionPolicy` and a non-empty range,
|
| 57 |
-
performs `*result = *first`. Then, for every `d` in
|
| 58 |
-
`
|
| 59 |
`*(result + d) = binary_op(*(first + d), *(first + (d - 1)))`.
|
| 60 |
|
| 61 |
*Returns:* `result + (last - first)`.
|
| 62 |
|
| 63 |
*Complexity:* Exactly `(last - first) - 1` applications of the binary
|
|
|
|
| 52 |
`val` whose type is `T`, initializes it with `*i`, computes
|
| 53 |
`binary_op(val, std::move(acc))`, assigns the result to
|
| 54 |
`*(result + (i - first))`, and move assigns from `val` to `acc`.
|
| 55 |
|
| 56 |
For the overloads with an `ExecutionPolicy` and a non-empty range,
|
| 57 |
+
performs `*result = *first`. Then, for every `d` in \[`1`,
|
| 58 |
+
`last - first - 1`\], performs
|
| 59 |
`*(result + d) = binary_op(*(first + d), *(first + (d - 1)))`.
|
| 60 |
|
| 61 |
*Returns:* `result + (last - first)`.
|
| 62 |
|
| 63 |
*Complexity:* Exactly `(last - first) - 1` applications of the binary
|