tmp/tmpi_7jsmzr/{from.md → to.md}
RENAMED
|
@@ -15,11 +15,11 @@ those same elements but as members of `*this`. Iterators referring to
|
|
| 15 |
the moved elements will continue to refer to their elements, but they
|
| 16 |
now behave as iterators into `*this`, not into `x`.
|
| 17 |
|
| 18 |
*Throws:* Nothing.
|
| 19 |
|
| 20 |
-
*Complexity:* 𝑂(distance(x.begin(), x.end()))
|
| 21 |
|
| 22 |
``` cpp
|
| 23 |
void splice_after(const_iterator position, forward_list& x, const_iterator i);
|
| 24 |
void splice_after(const_iterator position, forward_list&& x, const_iterator i);
|
| 25 |
```
|
|
@@ -58,20 +58,20 @@ dereferenceable. `position` is not an iterator in the range (`first`,
|
|
| 58 |
the moved elements of `x` now refer to those same elements but as
|
| 59 |
members of `*this`. Iterators referring to the moved elements will
|
| 60 |
continue to refer to their elements, but they now behave as iterators
|
| 61 |
into `*this`, not into `x`.
|
| 62 |
|
| 63 |
-
*Complexity:* 𝑂(distance(first, last))
|
| 64 |
|
| 65 |
``` cpp
|
| 66 |
void remove(const T& value);
|
| 67 |
template <class Predicate> void remove_if(Predicate pred);
|
| 68 |
```
|
| 69 |
|
| 70 |
*Effects:* Erases all the elements in the list referred by a list
|
| 71 |
iterator `i` for which the following conditions hold: `*i == value` (for
|
| 72 |
-
`remove()`), `pred(*i)` is true (for `remove_if()`). Invalidates only
|
| 73 |
the iterators and references to the erased elements.
|
| 74 |
|
| 75 |
*Throws:* Nothing unless an exception is thrown by the equality
|
| 76 |
comparison or the predicate.
|
| 77 |
|
|
@@ -117,11 +117,11 @@ references to the moved elements of `x` now refer to those same elements
|
|
| 117 |
but as members of `*this`. Iterators referring to the moved elements
|
| 118 |
will continue to refer to their elements, but they now behave as
|
| 119 |
iterators into `*this`, not into `x`.
|
| 120 |
|
| 121 |
*Remarks:* Stable ([[algorithm.stable]]). The behavior is undefined if
|
| 122 |
-
`
|
| 123 |
|
| 124 |
*Complexity:* At most
|
| 125 |
`distance(begin(), end()) + distance(x.begin(), x.end()) - 1`
|
| 126 |
comparisons.
|
| 127 |
|
|
@@ -133,11 +133,11 @@ template <class Compare> void sort(Compare comp);
|
|
| 133 |
*Requires:* `operator<` (for the version with no arguments) or `comp`
|
| 134 |
(for the version with a comparison argument) defines a strict weak
|
| 135 |
ordering ([[alg.sorting]]).
|
| 136 |
|
| 137 |
*Effects:* Sorts the list according to the `operator<` or the `comp`
|
| 138 |
-
function object. If an exception is thrown the order of the elements in
|
| 139 |
`*this` is unspecified. Does not affect the validity of iterators and
|
| 140 |
references.
|
| 141 |
|
| 142 |
*Remarks:* Stable ([[algorithm.stable]]).
|
| 143 |
|
|
|
|
| 15 |
the moved elements will continue to refer to their elements, but they
|
| 16 |
now behave as iterators into `*this`, not into `x`.
|
| 17 |
|
| 18 |
*Throws:* Nothing.
|
| 19 |
|
| 20 |
+
*Complexity:* 𝑂(`distance(x.begin(), x.end())`)
|
| 21 |
|
| 22 |
``` cpp
|
| 23 |
void splice_after(const_iterator position, forward_list& x, const_iterator i);
|
| 24 |
void splice_after(const_iterator position, forward_list&& x, const_iterator i);
|
| 25 |
```
|
|
|
|
| 58 |
the moved elements of `x` now refer to those same elements but as
|
| 59 |
members of `*this`. Iterators referring to the moved elements will
|
| 60 |
continue to refer to their elements, but they now behave as iterators
|
| 61 |
into `*this`, not into `x`.
|
| 62 |
|
| 63 |
+
*Complexity:* 𝑂(`distance(first, last)`)
|
| 64 |
|
| 65 |
``` cpp
|
| 66 |
void remove(const T& value);
|
| 67 |
template <class Predicate> void remove_if(Predicate pred);
|
| 68 |
```
|
| 69 |
|
| 70 |
*Effects:* Erases all the elements in the list referred by a list
|
| 71 |
iterator `i` for which the following conditions hold: `*i == value` (for
|
| 72 |
+
`remove()`), `pred(*i)` is `true` (for `remove_if()`). Invalidates only
|
| 73 |
the iterators and references to the erased elements.
|
| 74 |
|
| 75 |
*Throws:* Nothing unless an exception is thrown by the equality
|
| 76 |
comparison or the predicate.
|
| 77 |
|
|
|
|
| 117 |
but as members of `*this`. Iterators referring to the moved elements
|
| 118 |
will continue to refer to their elements, but they now behave as
|
| 119 |
iterators into `*this`, not into `x`.
|
| 120 |
|
| 121 |
*Remarks:* Stable ([[algorithm.stable]]). The behavior is undefined if
|
| 122 |
+
`get_allocator() != x.get_allocator()`.
|
| 123 |
|
| 124 |
*Complexity:* At most
|
| 125 |
`distance(begin(), end()) + distance(x.begin(), x.end()) - 1`
|
| 126 |
comparisons.
|
| 127 |
|
|
|
|
| 133 |
*Requires:* `operator<` (for the version with no arguments) or `comp`
|
| 134 |
(for the version with a comparison argument) defines a strict weak
|
| 135 |
ordering ([[alg.sorting]]).
|
| 136 |
|
| 137 |
*Effects:* Sorts the list according to the `operator<` or the `comp`
|
| 138 |
+
function object. If an exception is thrown, the order of the elements in
|
| 139 |
`*this` is unspecified. Does not affect the validity of iterators and
|
| 140 |
references.
|
| 141 |
|
| 142 |
*Remarks:* Stable ([[algorithm.stable]]).
|
| 143 |
|