tmp/tmphjq1z5ts/{from.md → to.md}
RENAMED
|
@@ -63,14 +63,14 @@ template<input_iterator I, weakly_incrementable O>
|
|
| 63 |
```
|
| 64 |
|
| 65 |
Let N be max(0, `n`).
|
| 66 |
|
| 67 |
*Mandates:* The type `Size` is convertible to an integral
|
| 68 |
-
type
|
| 69 |
|
| 70 |
*Effects:* For each non-negative integer i < N, performs
|
| 71 |
-
`*(result + i) = *(first + i)`.
|
| 72 |
|
| 73 |
*Returns:*
|
| 74 |
|
| 75 |
- `result + `N for the overloads in namespace `std`.
|
| 76 |
- `{first + `N`, result + `N`}` for the overload in namespace `ranges`.
|
|
@@ -109,11 +109,11 @@ and N be the number of iterators `i` in the range \[`first`, `last`) for
|
|
| 109 |
which the condition E holds.
|
| 110 |
|
| 111 |
*Preconditions:* The ranges \[`first`, `last`) and \[`result`,
|
| 112 |
`result + (last - first)`) do not overlap.
|
| 113 |
|
| 114 |
-
[*Note 1*: For the overload with an `ExecutionPolicy`, there
|
| 115 |
performance cost if `iterator_traits<ForwardIterator1>::value_type` is
|
| 116 |
not *Cpp17MoveConstructible*
|
| 117 |
([[cpp17.moveconstructible]]). — *end note*]
|
| 118 |
|
| 119 |
*Effects:* Copies all of the elements referred to by the iterator `i` in
|
|
@@ -150,11 +150,13 @@ Let N be `last - first`.
|
|
| 150 |
|
| 151 |
*Preconditions:* `result` is not in the range (`first`, `last`).
|
| 152 |
|
| 153 |
*Effects:* Copies elements in the range \[`first`, `last`) into the
|
| 154 |
range \[`result - `N, `result`) starting from `last - 1` and proceeding
|
| 155 |
-
to `first`.
|
|
|
|
|
|
|
| 156 |
`*(result - `n`) = *(last - `n`)`.
|
| 157 |
|
| 158 |
*Returns:*
|
| 159 |
|
| 160 |
- `result - `N for the overload in namespace `std`.
|
|
|
|
| 63 |
```
|
| 64 |
|
| 65 |
Let N be max(0, `n`).
|
| 66 |
|
| 67 |
*Mandates:* The type `Size` is convertible to an integral
|
| 68 |
+
type [[conv.integral]], [[class.conv]].
|
| 69 |
|
| 70 |
*Effects:* For each non-negative integer i < N, performs
|
| 71 |
+
`*(result + `i`) = *(first + `i`)`.
|
| 72 |
|
| 73 |
*Returns:*
|
| 74 |
|
| 75 |
- `result + `N for the overloads in namespace `std`.
|
| 76 |
- `{first + `N`, result + `N`}` for the overload in namespace `ranges`.
|
|
|
|
| 109 |
which the condition E holds.
|
| 110 |
|
| 111 |
*Preconditions:* The ranges \[`first`, `last`) and \[`result`,
|
| 112 |
`result + (last - first)`) do not overlap.
|
| 113 |
|
| 114 |
+
[*Note 1*: For the overload with an `ExecutionPolicy`, there might be a
|
| 115 |
performance cost if `iterator_traits<ForwardIterator1>::value_type` is
|
| 116 |
not *Cpp17MoveConstructible*
|
| 117 |
([[cpp17.moveconstructible]]). — *end note*]
|
| 118 |
|
| 119 |
*Effects:* Copies all of the elements referred to by the iterator `i` in
|
|
|
|
| 150 |
|
| 151 |
*Preconditions:* `result` is not in the range (`first`, `last`).
|
| 152 |
|
| 153 |
*Effects:* Copies elements in the range \[`first`, `last`) into the
|
| 154 |
range \[`result - `N, `result`) starting from `last - 1` and proceeding
|
| 155 |
+
to `first`.[^2]
|
| 156 |
+
|
| 157 |
+
For each positive integer n ≤ N, performs
|
| 158 |
`*(result - `n`) = *(last - `n`)`.
|
| 159 |
|
| 160 |
*Returns:*
|
| 161 |
|
| 162 |
- `result - `N for the overload in namespace `std`.
|