tmp/tmpczsow5gj/{from.md → to.md}
RENAMED
|
@@ -75,11 +75,11 @@ iterator `i` for which the following conditions hold:
|
|
| 75 |
references to the erased elements.
|
| 76 |
|
| 77 |
*Throws:* Nothing unless an exception is thrown by `*i == value` or
|
| 78 |
`pred(*i) != false`.
|
| 79 |
|
| 80 |
-
*Remarks:* Stable.
|
| 81 |
|
| 82 |
*Complexity:* Exactly `size()` applications of the corresponding
|
| 83 |
predicate.
|
| 84 |
|
| 85 |
``` cpp
|
|
@@ -92,11 +92,11 @@ of equal elements referred to by the iterator `i` in the range
|
|
| 92 |
\[`first + 1`, `last`) for which `*i == *(i-1)` (for the version of
|
| 93 |
`unique` with no arguments) or `pred(*i, *(i - 1))` (for the version of
|
| 94 |
`unique` with a predicate argument) holds. Invalidates only the
|
| 95 |
iterators and references to the erased elements.
|
| 96 |
|
| 97 |
-
*Throws:* Nothing unless an exception
|
| 98 |
`pred(*i, *(i - 1))`
|
| 99 |
|
| 100 |
*Complexity:* If the range `[first, last)` is not empty, exactly
|
| 101 |
`(last - first) - 1` applications of the corresponding predicate,
|
| 102 |
otherwise no applications of the predicate.
|
|
@@ -121,13 +121,14 @@ according to the ordering defined by `comp`; that is, for every iterator
|
|
| 121 |
elements of `x` now refer to those same elements but as members of
|
| 122 |
`*this`. Iterators referring to the moved elements will continue to
|
| 123 |
refer to their elements, but they now behave as iterators into `*this`,
|
| 124 |
not into `x`.
|
| 125 |
|
| 126 |
-
*Remarks:* Stable. If `(&x != this)` the range
|
| 127 |
-
empty after the merge. No elements are copied
|
| 128 |
-
behavior is undefined if
|
|
|
|
| 129 |
|
| 130 |
*Complexity:* At most `size() + x.size() - 1` applications of `comp` if
|
| 131 |
`(&x != this)`; otherwise, no applications of `comp` are performed. If
|
| 132 |
an exception is thrown other than by a comparison there are no effects.
|
| 133 |
|
|
@@ -150,9 +151,9 @@ second version) shall define a strict weak ordering ([[alg.sorting]]).
|
|
| 150 |
|
| 151 |
*Effects:* Sorts the list according to the `operator<` or a `Compare`
|
| 152 |
function object. Does not affect the validity of iterators and
|
| 153 |
references.
|
| 154 |
|
| 155 |
-
*Remarks:* Stable.
|
| 156 |
|
| 157 |
*Complexity:* Approximately N log(N) comparisons, where `N == size()`.
|
| 158 |
|
|
|
|
| 75 |
references to the erased elements.
|
| 76 |
|
| 77 |
*Throws:* Nothing unless an exception is thrown by `*i == value` or
|
| 78 |
`pred(*i) != false`.
|
| 79 |
|
| 80 |
+
*Remarks:* Stable ([[algorithm.stable]]).
|
| 81 |
|
| 82 |
*Complexity:* Exactly `size()` applications of the corresponding
|
| 83 |
predicate.
|
| 84 |
|
| 85 |
``` cpp
|
|
|
|
| 92 |
\[`first + 1`, `last`) for which `*i == *(i-1)` (for the version of
|
| 93 |
`unique` with no arguments) or `pred(*i, *(i - 1))` (for the version of
|
| 94 |
`unique` with a predicate argument) holds. Invalidates only the
|
| 95 |
iterators and references to the erased elements.
|
| 96 |
|
| 97 |
+
*Throws:* Nothing unless an exception is thrown by `*i == *(i-1)` or
|
| 98 |
`pred(*i, *(i - 1))`
|
| 99 |
|
| 100 |
*Complexity:* If the range `[first, last)` is not empty, exactly
|
| 101 |
`(last - first) - 1` applications of the corresponding predicate,
|
| 102 |
otherwise no applications of the predicate.
|
|
|
|
| 121 |
elements of `x` now refer to those same elements but as members of
|
| 122 |
`*this`. Iterators referring to the moved elements will continue to
|
| 123 |
refer to their elements, but they now behave as iterators into `*this`,
|
| 124 |
not into `x`.
|
| 125 |
|
| 126 |
+
*Remarks:* Stable ([[algorithm.stable]]). If `(&x != this)` the range
|
| 127 |
+
`[x.begin(), x.end())` is empty after the merge. No elements are copied
|
| 128 |
+
by this operation. The behavior is undefined if
|
| 129 |
+
`this->get_allocator() != x.get_allocator()`.
|
| 130 |
|
| 131 |
*Complexity:* At most `size() + x.size() - 1` applications of `comp` if
|
| 132 |
`(&x != this)`; otherwise, no applications of `comp` are performed. If
|
| 133 |
an exception is thrown other than by a comparison there are no effects.
|
| 134 |
|
|
|
|
| 151 |
|
| 152 |
*Effects:* Sorts the list according to the `operator<` or a `Compare`
|
| 153 |
function object. Does not affect the validity of iterators and
|
| 154 |
references.
|
| 155 |
|
| 156 |
+
*Remarks:* Stable ([[algorithm.stable]]).
|
| 157 |
|
| 158 |
*Complexity:* Approximately N log(N) comparisons, where `N == size()`.
|
| 159 |
|