From Jason Turner

[sort]

Diff to HTML by rtfpessoa

tmp/tmp3gu173_v/{from.md → to.md} RENAMED
@@ -22,10 +22,19 @@ template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
22
  ranges::sort(I first, S last, Comp comp = {}, Proj proj = {});
23
  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
24
  requires sortable<iterator_t<R>, Comp, Proj>
25
  constexpr borrowed_iterator_t<R>
26
  ranges::sort(R&& r, Comp comp = {}, Proj proj = {});
 
 
 
 
 
 
 
 
 
27
  ```
28
 
29
  Let `comp` be `less{}` and `proj` be `identity{}` for the overloads with
30
  no parameters by those names.
31
 
 
22
  ranges::sort(I first, S last, Comp comp = {}, Proj proj = {});
23
  template<random_access_range R, class Comp = ranges::less, class Proj = identity>
24
  requires sortable<iterator_t<R>, Comp, Proj>
25
  constexpr borrowed_iterator_t<R>
26
  ranges::sort(R&& r, Comp comp = {}, Proj proj = {});
27
+
28
+ template<execution-policy Ep, random_access_iterator I, sized_sentinel_for<I> S,
29
+ class Comp = ranges::less, class Proj = identity>
30
+ requires sortable<I, Comp, Proj>
31
+ I ranges::sort(Ep&& exec, I first, S last, Comp comp = {}, Proj proj = {});
32
+ template<execution-policy Ep, sized-random-access-range R, class Comp = ranges::less,
33
+ class Proj = identity>
34
+ requires sortable<iterator_t<R>, Comp, Proj>
35
+ borrowed_iterator_t<R> ranges::sort(Ep&& exec, R&& r, Comp comp = {}, Proj proj = {});
36
  ```
37
 
38
  Let `comp` be `less{}` and `proj` be `identity{}` for the overloads with
39
  no parameters by those names.
40