|
| 1 | +<?xml version='1.0' encoding='utf-8' standalone='no'?> |
| 2 | +<!DOCTYPE issue SYSTEM "lwg-issue.dtd"> |
| 3 | + |
| 4 | +<issue num="4441" status="New"> |
| 5 | +<title><tt>ranges::rotate</tt> do not handle sized-but-not-sized-sentinel ranges correctly</title> |
| 6 | +<section> |
| 7 | +<sref ref="[alg.rotate]"/> |
| 8 | +<sref ref="[partial.sort]"/> |
| 9 | +<sref ref="[alg.nth.element]"/> |
| 10 | +<sref ref="[alg.merge]"/> |
| 11 | +</section> |
| 12 | +<submitter>Tomasz Kamiński</submitter> |
| 13 | +<date>03 Nov 2025</date> |
| 14 | +<priority>99</priority> |
| 15 | + |
| 16 | +<discussion> |
| 17 | +<b>Addresses US 161-258</b> |
| 18 | +<p>These do not handle sized-but-not-sized-sentinel ranges correctly.</p> |
| 19 | +</discussion> |
| 20 | + |
| 21 | +<resolution> |
| 22 | +<p> |
| 23 | +This wording is relative to <paper num="N5014"/>. |
| 24 | +</p> |
| 25 | + |
| 26 | +<ol> |
| 27 | + |
| 28 | +<li><p>Modify <sref ref="[alg.rotate]"/> as indicated:</p> |
| 29 | + |
| 30 | +<pre> |
| 31 | +template<execution-policy Ep, <i>sized-random-access-range</i> R> |
| 32 | + requires permutable<iterator_t<R>> |
| 33 | + borrowed_subrange_t<R> ranges::rotate(Ep&& exec, R&& r, iterator_t<R> middle); |
| 34 | + |
| 35 | +</pre> |
| 36 | +<blockquote> |
| 37 | +<p>-6- <i>Effects</i> Equivalent to: |
| 38 | +<tt>return ranges::rotate(std::forward<Ep>(exec), ranges::begin(r), middle, |
| 39 | +<del>ranges::end(r)</del><ins>ranges::begin(r) + ranges::distance(r)</ins>);</tt> |
| 40 | +</p> |
| 41 | +</blockquote> |
| 42 | + |
| 43 | +[…] |
| 44 | + |
| 45 | +<pre> |
| 46 | +template<execution-policy Ep, <i>sized-random-access-range</i> R, <i>sized-random-access-range</i> OutR> |
| 47 | + requires indirectly_copyable<iterator_t<R>, iterator_t<OutR>> |
| 48 | + ranges::rotate_copy_truncated_result<borrowed_iterator_t<R>, borrowed_iterator_t<OutR>> |
| 49 | + ranges::rotate_copy(Ep&& exec, R&& r, iterator_t<R> middle, OutR&& result_r); |
| 50 | +</pre> |
| 51 | +<blockquote> |
| 52 | +<p>-18- <i>Effects</i> Equivalent to: |
| 53 | +<tt>return ranges::rotate(std::forward<Ep>(exec), ranges::begin(r), middle, |
| 54 | +<del>ranges::end(r)</del><ins>ranges::begin(r)+ranges::distance(r)</ins> |
| 55 | +ranges::begin(result_r), <del>ranges::end(result_r)</del><ins>ranges::begin(result_r) + ranges::distance(result_r)</ins>);</tt> |
| 56 | +</p> |
| 57 | +</blockquote> |
| 58 | + |
| 59 | +</li> |
| 60 | + |
| 61 | +<li><p>Modify <sref ref="[partial.sort]"/> as indicated:</p> |
| 62 | + |
| 63 | +<pre> |
| 64 | +template<execution-policy Ep, sized-random-access-range R, |
| 65 | + class Comp = ranges::less, class Proj = identity> |
| 66 | + requires sortable<iterator_t<R>, Comp, Proj> |
| 67 | + borrowed_iterator_t<R> |
| 68 | + ranges::partial_sort(Ep&& exec, R&& r, iterator_t<R> middle, Comp comp = {}, |
| 69 | + Proj proj = {}); |
| 70 | +</pre> |
| 71 | +<blockquote> |
| 72 | +<p>-7- <i>Effects</i> Equivalent to: |
| 73 | +<tt>return ranges::partial_sort(std::forward<Ep>(exec), ranges::begin(r), middle, |
| 74 | +<del>ranges::end(r)</del><ins>ranges::begin(r) + ranges::distance(r)</ins>, comp, proj);</tt> |
| 75 | +</p> |
| 76 | +</blockquote> |
| 77 | + |
| 78 | +</li> |
| 79 | + |
| 80 | +<li><p>Modify <sref ref="[alg.nth.element]"/> as indicated:</p> |
| 81 | + |
| 82 | +<pre> |
| 83 | +template<execution-policy Ep, <i>sized-random-access-range</i> R, class Comp = ranges::less, |
| 84 | + class Proj = identity> |
| 85 | + requires sortable<iterator_t<R>, Comp, Proj> |
| 86 | + borrowed_iterator_t<R> |
| 87 | + ranges::nth_element(Ep&& exec, R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {}); |
| 88 | +</pre> |
| 89 | +<blockquote> |
| 90 | +<p>-7- <i>Effects</i> Equivalent to: |
| 91 | +<tt>return ranges::nth_element(std::forward<Ep>(exec), ranges::begin(r), nth, |
| 92 | +<del>ranges::end(r)</del><ins>ranges::begin(r) + ranges::distance(r)</ins>, comp, proj);</tt> |
| 93 | +</p> |
| 94 | +</blockquote> |
| 95 | + |
| 96 | +</li> |
| 97 | + |
| 98 | +<li><p>Modify <sref ref="[alg.merge]"/> as indicated:</p> |
| 99 | + |
| 100 | +<pre> |
| 101 | +template<execution-policy Ep, sized-random-access-range R, class Comp = ranges::less, |
| 102 | + class Proj = identity> |
| 103 | + requires sortable<iterator_t<R>, Comp, Proj> |
| 104 | + borrowed_iterator_t<R> |
| 105 | + ranges::inplace_merge(Ep&& exec, R&& r, iterator_t<R> middle, Comp comp = {}, |
| 106 | + Proj proj = {}); |
| 107 | +</pre> |
| 108 | +<blockquote> |
| 109 | +<p>-14- <i>Effects</i> Equivalent to: |
| 110 | +<tt>return ranges::inplace_merge(std::forward<Ep>(exec), ranges::begin(r), middle, |
| 111 | +<del>ranges::end(r)</del><ins>ranges::begin(r) + ranges::distance(r)</ins>, comp, proj);</tt> |
| 112 | +</p> |
| 113 | +</blockquote> |
| 114 | + |
| 115 | +</li> |
| 116 | + |
| 117 | + |
| 118 | +</ol> |
| 119 | + |
| 120 | +</resolution> |
| 121 | + |
| 122 | +</issue> |
0 commit comments