tmp/tmpnxbl4rdu/{from.md → to.md}
RENAMED
|
@@ -52,15 +52,15 @@ the range \[`first`, `last`) for which E holds.
|
|
| 52 |
*Returns:* Let j be the end of the resulting range. Returns:
|
| 53 |
|
| 54 |
- j for the overloads in namespace `std`.
|
| 55 |
- `{`j`, last}` for the overloads in namespace `ranges`.
|
| 56 |
|
| 57 |
-
*Remarks:* Stable [[algorithm.stable]].
|
| 58 |
-
|
| 59 |
*Complexity:* Exactly `last - first` applications of the corresponding
|
| 60 |
predicate and any projection.
|
| 61 |
|
|
|
|
|
|
|
| 62 |
[*Note 1*: Each element in the range \[`ret`, `last`), where `ret` is
|
| 63 |
the returned value, has a valid but unspecified state, because the
|
| 64 |
algorithms can eliminate elements by moving from elements that were
|
| 65 |
originally in that range. — *end note*]
|
| 66 |
|
|
@@ -124,14 +124,14 @@ Let N be the number of elements in \[`first`, `last`) for which E is
|
|
| 124 |
`result`.
|
| 125 |
|
| 126 |
*Preconditions:* The ranges \[`first`, `last`) and \[`result`,
|
| 127 |
`result + (last - first)`) do not overlap.
|
| 128 |
|
| 129 |
-
[*Note 2*: For the overloads with an `ExecutionPolicy`, there
|
| 130 |
-
performance cost if `iterator_traits<ForwardIterator1>::value_type`
|
| 131 |
-
not meet the *Cpp17MoveConstructible*
|
| 132 |
-
requirements. — *end note*]
|
| 133 |
|
| 134 |
*Effects:* Copies all the elements referred to by the iterator `i` in
|
| 135 |
the range \[`first`, `last`) for which E is `false`.
|
| 136 |
|
| 137 |
*Returns:*
|
|
|
|
| 52 |
*Returns:* Let j be the end of the resulting range. Returns:
|
| 53 |
|
| 54 |
- j for the overloads in namespace `std`.
|
| 55 |
- `{`j`, last}` for the overloads in namespace `ranges`.
|
| 56 |
|
|
|
|
|
|
|
| 57 |
*Complexity:* Exactly `last - first` applications of the corresponding
|
| 58 |
predicate and any projection.
|
| 59 |
|
| 60 |
+
*Remarks:* Stable [[algorithm.stable]].
|
| 61 |
+
|
| 62 |
[*Note 1*: Each element in the range \[`ret`, `last`), where `ret` is
|
| 63 |
the returned value, has a valid but unspecified state, because the
|
| 64 |
algorithms can eliminate elements by moving from elements that were
|
| 65 |
originally in that range. — *end note*]
|
| 66 |
|
|
|
|
| 124 |
`result`.
|
| 125 |
|
| 126 |
*Preconditions:* The ranges \[`first`, `last`) and \[`result`,
|
| 127 |
`result + (last - first)`) do not overlap.
|
| 128 |
|
| 129 |
+
[*Note 2*: For the overloads with an `ExecutionPolicy`, there might be
|
| 130 |
+
a performance cost if `iterator_traits<ForwardIterator1>::value_type`
|
| 131 |
+
does not meet the *Cpp17MoveConstructible*
|
| 132 |
+
([[cpp17.moveconstructible]]) requirements. — *end note*]
|
| 133 |
|
| 134 |
*Effects:* Copies all the elements referred to by the iterator `i` in
|
| 135 |
the range \[`first`, `last`) for which E is `false`.
|
| 136 |
|
| 137 |
*Returns:*
|