|
79 | 79 | </tr> |
80 | 80 | </table> |
81 | 81 | <h1>C++ Standard Library Active Issues List (Revision D125)</h1> |
82 | | -<p>Revised 2025-06-06 at 14:20:41 UTC |
| 82 | +<p>Revised 2025-06-06 at 14:36:27 UTC |
83 | 83 | </p> |
84 | 84 | <p>Reference ISO/IEC IS 14882:2020(E)</p> |
85 | 85 | <p>Also see:</p> |
@@ -75535,7 +75535,7 @@ <h3 id="4270"><a href="#4270">4270</a><sup><a href="https://cplusplus.github.io/ |
75535 | 75535 | <h3 id="4271"><a href="#4271">4271</a><sup><a href="https://cplusplus.github.io/LWG/issue4271">(i)</a></sup>. Caching range views claim amortized amortized 𝒪(1) runtime |
75536 | 75536 | complexity for algorithms that are in fact 𝒪(n)</h3> |
75537 | 75537 | <p><b>Section:</b> 24.3.1 <a href="https://wg21.link/iterator.requirements.general">[iterator.requirements.general]</a>, 25.3.13 <a href="https://wg21.link/range.approximately.sized">[range.approximately.sized]</a>, 25.4.1 <a href="https://wg21.link/range.req.general">[range.req.general]</a>, 25.4.2 <a href="https://wg21.link/range.range">[range.range]</a>, 25.4.3 <a href="https://wg21.link/range.sized">[range.sized]</a>, 25.7.8.2 <a href="https://wg21.link/range.filter.view">[range.filter.view]</a>, 25.7.12.2 <a href="https://wg21.link/range.drop.view">[range.drop.view]</a>, 25.7.13.2 <a href="https://wg21.link/range.drop.while.view">[range.drop.while.view]</a>, 25.7.17.2 <a href="https://wg21.link/range.split.view">[range.split.view]</a>, 25.7.21.2 <a href="https://wg21.link/range.reverse.view">[range.reverse.view]</a>, 25.7.30.2 <a href="https://wg21.link/range.slide.view">[range.slide.view]</a>, 25.7.31.2 <a href="https://wg21.link/range.chunk.by.view">[range.chunk.by.view]</a> <b>Status:</b> <a href="lwg-active.html#New">New</a> |
75538 | | - <b>Submitter:</b> Andreas Weis <b>Opened:</b> 2025-06-02 <b>Last modified:</b> 2025-06-05</p> |
| 75538 | + <b>Submitter:</b> Andreas Weis <b>Opened:</b> 2025-06-02 <b>Last modified:</b> 2025-06-06</p> |
75539 | 75539 | <p><b>Priority: </b>Not Prioritized |
75540 | 75540 | </p> |
75541 | 75541 | <p><b>View all other</b> <a href="lwg-index.html#iterator.requirements.general">issues</a> in [iterator.requirements.general].</p> |
@@ -75602,7 +75602,7 @@ <h3 id="4271"><a href="#4271">4271</a><sup><a href="https://cplusplus.github.io/ |
75602 | 75602 | <p> |
75603 | 75603 | -2- The <code class='backtick'>range</code> concept requires that <code class='backtick'>ranges::begin</code> and <code class='backtick'>ranges::end</code> return an |
75604 | 75604 | iterator and a sentinel, respectively. The <code class='backtick'>sized_range</code> concept refines range |
75605 | | -with the requirement that <code class='backtick'>ranges::size</code> be amortized 𝒪(<del>1</del><ins>n</ins>). |
| 75605 | +with the requirement that <code class='backtick'>ranges::size</code> be <del>amortized</del> 𝒪(<del>1</del><ins>n</ins>). |
75606 | 75606 | The <code class='backtick'>view</code> concept specifies requirements on a <code class='backtick'>range</code> type to provide operations |
75607 | 75607 | with predictable complexity. |
75608 | 75608 | </p> |
@@ -75646,7 +75646,7 @@ <h3 id="4271"><a href="#4271">4271</a><sup><a href="https://cplusplus.github.io/ |
75646 | 75646 | </p> |
75647 | 75647 | </blockquote> |
75648 | 75648 | <ol style="list-style-type: none"> |
75649 | | -<li><p>(2.1) — <code class='backtick'>ranges::size(t)</code> is amortized 𝒪(<del>1</del><ins>n</ins>), |
| 75649 | +<li><p>(2.1) — <code class='backtick'>ranges::size(t)</code> is <del>amortized</del> 𝒪(<del>1</del><ins>n</ins>), |
75650 | 75650 | does not modify <code class='backtick'>t</code>, and is equal to <code class='backtick'>ranges::distance(ranges::begin(t), ranges::end(t))</code>, |
75651 | 75651 | and</p></li> |
75652 | 75652 | <li><p>(2.2) — […]</p></li> |
|
0 commit comments