tmp/tmp8nez75fs/{from.md → to.md}
RENAMED
|
@@ -30,11 +30,11 @@ range shall not overlap with either of the original ranges.
|
|
| 30 |
*Returns:* `result + (last1 - first1) + (last2 - first2)`.
|
| 31 |
|
| 32 |
*Complexity:* At most `(last1 - first1) + (last2 - first2) - 1`
|
| 33 |
comparisons.
|
| 34 |
|
| 35 |
-
*Remarks:* Stable.
|
| 36 |
|
| 37 |
``` cpp
|
| 38 |
template<class BidirectionalIterator>
|
| 39 |
void inplace_merge(BidirectionalIterator first,
|
| 40 |
BidirectionalIterator middle,
|
|
@@ -64,7 +64,7 @@ shall satisfy the requirements of `MoveConstructible`
|
|
| 64 |
*Complexity:* When enough additional memory is available,
|
| 65 |
`(last - first) - 1` comparisons. If no additional memory is available,
|
| 66 |
an algorithm with complexity N log(N) (where `N` is equal to
|
| 67 |
`last - first`) may be used.
|
| 68 |
|
| 69 |
-
*Remarks:* Stable.
|
| 70 |
|
|
|
|
| 30 |
*Returns:* `result + (last1 - first1) + (last2 - first2)`.
|
| 31 |
|
| 32 |
*Complexity:* At most `(last1 - first1) + (last2 - first2) - 1`
|
| 33 |
comparisons.
|
| 34 |
|
| 35 |
+
*Remarks:* Stable ([[algorithm.stable]]).
|
| 36 |
|
| 37 |
``` cpp
|
| 38 |
template<class BidirectionalIterator>
|
| 39 |
void inplace_merge(BidirectionalIterator first,
|
| 40 |
BidirectionalIterator middle,
|
|
|
|
| 64 |
*Complexity:* When enough additional memory is available,
|
| 65 |
`(last - first) - 1` comparisons. If no additional memory is available,
|
| 66 |
an algorithm with complexity N log(N) (where `N` is equal to
|
| 67 |
`last - first`) may be used.
|
| 68 |
|
| 69 |
+
*Remarks:* Stable ([[algorithm.stable]]).
|
| 70 |
|