tmp/tmpko0hmho4/{from.md → to.md}
RENAMED
|
@@ -4,33 +4,47 @@
|
|
| 4 |
template<class InputIterator, class RandomAccessIterator>
|
| 5 |
RandomAccessIterator
|
| 6 |
partial_sort_copy(InputIterator first, InputIterator last,
|
| 7 |
RandomAccessIterator result_first,
|
| 8 |
RandomAccessIterator result_last);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 9 |
|
| 10 |
template<class InputIterator, class RandomAccessIterator,
|
| 11 |
class Compare>
|
| 12 |
RandomAccessIterator
|
| 13 |
partial_sort_copy(InputIterator first, InputIterator last,
|
| 14 |
RandomAccessIterator result_first,
|
| 15 |
RandomAccessIterator result_last,
|
| 16 |
Compare comp);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 17 |
```
|
| 18 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 19 |
*Effects:* Places the first
|
| 20 |
`min(last - first, result_last - result_first)` sorted elements into the
|
| 21 |
range \[`result_first`,
|
| 22 |
`result_first + min(last - first, result_last - result_first)`).
|
| 23 |
|
| 24 |
*Returns:* The smaller of: `result_last` or
|
| 25 |
`result_first + (last - first)`.
|
| 26 |
|
| 27 |
-
*Requires:* `RandomAccessIterator` shall satisfy the requirements of
|
| 28 |
-
`ValueSwappable` ([[swappable.requirements]]). The type of
|
| 29 |
-
`*result_first` shall satisfy the requirements of `MoveConstructible`
|
| 30 |
-
(Table [[moveconstructible]]) and of `MoveAssignable`
|
| 31 |
-
(Table [[moveassignable]]).
|
| 32 |
-
|
| 33 |
*Complexity:* Approximately
|
| 34 |
`(last - first) * log(min(last - first, result_last - result_first))`
|
| 35 |
comparisons.
|
| 36 |
|
|
|
|
| 4 |
template<class InputIterator, class RandomAccessIterator>
|
| 5 |
RandomAccessIterator
|
| 6 |
partial_sort_copy(InputIterator first, InputIterator last,
|
| 7 |
RandomAccessIterator result_first,
|
| 8 |
RandomAccessIterator result_last);
|
| 9 |
+
template<class ExecutionPolicy, class ForwardIterator, class RandomAccessIterator>
|
| 10 |
+
RandomAccessIterator
|
| 11 |
+
partial_sort_copy(ExecutionPolicy&& exec,
|
| 12 |
+
ForwardIterator first, ForwardIterator last,
|
| 13 |
+
RandomAccessIterator result_first,
|
| 14 |
+
RandomAccessIterator result_last);
|
| 15 |
|
| 16 |
template<class InputIterator, class RandomAccessIterator,
|
| 17 |
class Compare>
|
| 18 |
RandomAccessIterator
|
| 19 |
partial_sort_copy(InputIterator first, InputIterator last,
|
| 20 |
RandomAccessIterator result_first,
|
| 21 |
RandomAccessIterator result_last,
|
| 22 |
Compare comp);
|
| 23 |
+
template<class ExecutionPolicy, class ForwardIterator, class RandomAccessIterator,
|
| 24 |
+
class Compare>
|
| 25 |
+
RandomAccessIterator
|
| 26 |
+
partial_sort_copy(ExecutionPolicy&& exec,
|
| 27 |
+
ForwardIterator first, ForwardIterator last,
|
| 28 |
+
RandomAccessIterator result_first,
|
| 29 |
+
RandomAccessIterator result_last,
|
| 30 |
+
Compare comp);
|
| 31 |
```
|
| 32 |
|
| 33 |
+
*Requires:* `RandomAccessIterator` shall satisfy the requirements of
|
| 34 |
+
`ValueSwappable` ([[swappable.requirements]]). The type of
|
| 35 |
+
`*result_first` shall satisfy the requirements of `MoveConstructible`
|
| 36 |
+
(Table [[tab:moveconstructible]]) and of `MoveAssignable`
|
| 37 |
+
(Table [[tab:moveassignable]]).
|
| 38 |
+
|
| 39 |
*Effects:* Places the first
|
| 40 |
`min(last - first, result_last - result_first)` sorted elements into the
|
| 41 |
range \[`result_first`,
|
| 42 |
`result_first + min(last - first, result_last - result_first)`).
|
| 43 |
|
| 44 |
*Returns:* The smaller of: `result_last` or
|
| 45 |
`result_first + (last - first)`.
|
| 46 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 47 |
*Complexity:* Approximately
|
| 48 |
`(last - first) * log(min(last - first, result_last - result_first))`
|
| 49 |
comparisons.
|
| 50 |
|