tmp/tmpkeat5_oo/{from.md → to.md}
RENAMED
|
@@ -43,10 +43,29 @@ template<input_range R1, random_access_range R2, class Comp = ranges::less,
|
|
| 43 |
indirect_strict_weak_order<Comp, projected<iterator_t<R1>, Proj1>,
|
| 44 |
projected<iterator_t<R2>, Proj2>>
|
| 45 |
constexpr ranges::partial_sort_copy_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>>
|
| 46 |
ranges::partial_sort_copy(R1&& r, R2&& result_r, Comp comp = {},
|
| 47 |
Proj1 proj1 = {}, Proj2 proj2 = {});
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 48 |
```
|
| 49 |
|
| 50 |
Let N be min(`last - first`, `result_last - result_first`). Let `comp`
|
| 51 |
be `less{}`, and `proj1` and `proj2` be `identity{}` for the overloads
|
| 52 |
with no parameters by those names.
|
|
|
|
| 43 |
indirect_strict_weak_order<Comp, projected<iterator_t<R1>, Proj1>,
|
| 44 |
projected<iterator_t<R2>, Proj2>>
|
| 45 |
constexpr ranges::partial_sort_copy_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>>
|
| 46 |
ranges::partial_sort_copy(R1&& r, R2&& result_r, Comp comp = {},
|
| 47 |
Proj1 proj1 = {}, Proj2 proj2 = {});
|
| 48 |
+
|
| 49 |
+
template<execution-policy Ep, random_access_iterator I1, sized_sentinel_for<I1> S1,
|
| 50 |
+
random_access_iterator I2, sized_sentinel_for<I2> S2,
|
| 51 |
+
class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
|
| 52 |
+
requires indirectly_copyable<I1, I2> && sortable<I2, Comp, Proj2> &&
|
| 53 |
+
indirect_strict_weak_order<Comp, projected<I1, Proj1>, projected<I2, Proj2>>
|
| 54 |
+
ranges::partial_sort_copy_result<I1, I2>
|
| 55 |
+
ranges::partial_sort_copy(Ep&& exec, I1 first, S1 last, I2 result_first, S2 result_last,
|
| 56 |
+
Comp comp = {}, Proj1 proj1 = {},
|
| 57 |
+
Proj2 proj2 = {});
|
| 58 |
+
template<execution-policy Ep, sized-random-access-range R1, sized-random-access-range R2,
|
| 59 |
+
class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
|
| 60 |
+
requires indirectly_copyable<iterator_t<R1>, iterator_t<R2>> &&
|
| 61 |
+
sortable<iterator_t<R2>, Comp, Proj2> &&
|
| 62 |
+
indirect_strict_weak_order<Comp, projected<iterator_t<R1>, Proj1>,
|
| 63 |
+
projected<iterator_t<R2>, Proj2>>
|
| 64 |
+
ranges::partial_sort_copy_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>>
|
| 65 |
+
ranges::partial_sort_copy(Ep&& exec, R1&& r, R2&& result_r, Comp comp = {},
|
| 66 |
+
Proj1 proj1 = {}, Proj2 proj2 = {});
|
| 67 |
```
|
| 68 |
|
| 69 |
Let N be min(`last - first`, `result_last - result_first`). Let `comp`
|
| 70 |
be `less{}`, and `proj1` and `proj2` be `identity{}` for the overloads
|
| 71 |
with no parameters by those names.
|