[PATCH] libstdc++: Update dead links to PSTL upstream in docs

Sat, 18 Oct 2025 10:56:17 -0700 

The pstl code has been removed from the llvm repo so point to the Intel
upstream project where it really originates from.

libstdc++-v3/ChangeLog:

        * doc/xml/manual/status_cxx2017.xml: Replace broken link to PSTL
        upstream.
        * doc/xml/manual/status_cxx2020.xml: Likewise.
        * doc/html/manual/status.html: Regenerate.
---
 libstdc++-v3/doc/html/manual/status.html       | 4 ++--
 libstdc++-v3/doc/xml/manual/status_cxx2017.xml | 2 +-
 libstdc++-v3/doc/xml/manual/status_cxx2020.xml | 2 +-
 3 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/libstdc++-v3/doc/html/manual/status.html 
b/libstdc++-v3/doc/html/manual/status.html
index 465bc6ccafe9..64a484082689 100644
--- a/libstdc++-v3/doc/html/manual/status.html
+++ b/libstdc++-v3/doc/html/manual/status.html
@@ -970,7 +970,7 @@ since C++14 and the implementation is complete.
        <span class="emphasis"><em>28</em></span>
       </td><td colspan="3" align="left">
        <span class="emphasis"><em>Algorithms</em></span>
-      </td></tr><tr><td align="left">28.1</td><td align="left">General</td><td 
align="left"> </td><td align="left"> </td></tr><tr><td 
align="left">28.2</td><td align="left">Header <code 
class="code">&lt;algorithm&gt;</code> synopsis</td><td align="left"> </td><td 
align="left"> </td></tr><tr><td align="left">28.3</td><td 
align="left">Algorithms requirements</td><td align="left"> </td><td 
align="left"> </td></tr><tr><td align="left">28.4</td><td 
align="left">Parallel algorithms</td><td align="left"> </td><td 
align="left">Using <a class="link" 
href="https://github.com/llvm/llvm-project/tree/main/pstl"; 
target="_top">PSTL</a></td></tr><tr><td align="left">28.5</td><td 
align="left">Non-modifying sequence operations</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">28.6</td><td 
align="left">Mutating sequence operations</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">28.7</td><td align="left">Sorting 
and related operations</td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">28.8</td><td align="left">C library 
algorithms</td><td align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">
+      </td></tr><tr><td align="left">28.1</td><td align="left">General</td><td 
align="left"> </td><td align="left"> </td></tr><tr><td 
align="left">28.2</td><td align="left">Header <code 
class="code">&lt;algorithm&gt;</code> synopsis</td><td align="left"> </td><td 
align="left"> </td></tr><tr><td align="left">28.3</td><td 
align="left">Algorithms requirements</td><td align="left"> </td><td 
align="left"> </td></tr><tr><td align="left">28.4</td><td 
align="left">Parallel algorithms</td><td align="left"> </td><td 
align="left">Uses code from <a class="link" 
href="https://uxlfoundation.github.io/oneDPL/parallel_api_main.html"; 
target="_top">oneDPL</a></td></tr><tr><td align="left">28.5</td><td 
align="left">Non-modifying sequence operations</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">28.6</td><td 
align="left">Mutating sequence operations</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">28.7</td><td align="left">Sorting 
and related operations</td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">28.8</td><td align="left">C library 
algorithms</td><td align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">
       <span class="emphasis"><em>29</em></span>
       </td><td colspan="3" align="left">
        <span class="emphasis"><em>Numerics</em></span>
@@ -1815,7 +1815,7 @@ since C++17 and the implementation is complete.
        <span class="emphasis"><em>25</em></span>
       </td><td colspan="3" align="left">
        <span class="emphasis"><em>Algorithms library</em></span>
-      </td></tr><tr><td align="left">25.1</td><td align="left">General</td><td 
align="left"> </td><td align="left"> </td></tr><tr><td 
align="left">25.2</td><td align="left">Algorithms requirements</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.3</td><td align="left">Parallel algorithms</td><td 
align="left"> </td><td align="left">Using <a class="link" 
href="https://github.com/llvm/llvm-project/tree/main/pstl"; 
target="_top">PSTL</a></td></tr><tr><td align="left">25.4</td><td 
align="left">Header <code class="code">&lt;algorithm&gt;</code> 
synopsis</td><td align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.5</td><td align="left">Algorithm result types</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.6</td><td align="left">Non-modifying sequence 
operations</td><td align="left"> </td><td align="left"> </td></tr><tr><td 
align="left">25.6.1</td><td align="left">All of</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.6.2</td><td align="left">Any 
of</td><td align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.6.3</td><td align="left">None of</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.6.4</td><td align="left">For 
each</td><td align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.6.5</td><td align="left">Find</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.6.6</td><td align="left">Find 
end</td><td align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.6.7</td><td align="left">Find first</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.6.8</td><td align="left">Adjacent find</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.6.9</td><td align="left">Count</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.6.10</td><td 
align="left">Mismatch</td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">25.6.11</td><td align="left">Equal</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.6.12</td><td align="left">Is permutation</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.6.13</td><td align="left">Search</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.7</td><td 
align="left">Mutating sequence operations</td><td align="left"> </td><td 
align="left"> </td></tr><tr><td align="left">25.7.1</td><td 
align="left">Copy</td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">25.7.2</td><td align="left">Move</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.7.3</td><td align="left">Swap</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.7.4</td><td 
align="left">Transform</td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">25.7.5</td><td align="left">Replace</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.7.6</td><td align="left">Fill</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.7.7</td><td 
align="left">Generate</td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">25.7.8</td><td align="left">Remove</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.7.9</td><td align="left">Unique</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.7.10</td><td 
align="left">Reverse</td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">25.7.11</td><td align="left">Rotate</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.7.12</td><td align="left">Sample</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.7.13</td><td 
align="left">Shuffle</td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">25.7.14</td><td align="left">Shift</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.8</td><td align="left">Sorting and related operations</td><td 
align="left"> </td><td align="left"> </td></tr><tr><td 
align="left">25.8.1</td><td align="left">General</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.8.2</td><td 
align="left">Sorting</td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">25.8.3</td><td align="left">Nth element</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.8.4</td><td align="left">Binary search</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.8.5</td><td align="left">Partitions</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.8.6</td><td align="left">Merge</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.8.7</td><td align="left">Set 
operations on sorted structures</td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">25.8.8</td><td align="left">Heap 
operations</td><td align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.8.9</td><td align="left">Minimum and maximum</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.8.10</td><td align="left">Bounded value</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.8.11</td><td align="left">Lexicographical comparison</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.8.12</td><td align="left">Three-way comparison 
algorithms</td><td align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.8.13</td><td align="left">Permutation generators</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.9</td><td align="left">Header <code 
class="code">&lt;numeric&gt;</code> synopsis</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.10</td><td 
align="left">Generalized numeric operations</td><td align="left"> </td><td 
align="left"> </td></tr><tr><td align="left">25.10.1</td><td 
align="left">General</td><td align="left"> </td><td align="left"> 
</td></tr><tr><td align="left">25.10.2</td><td align="left">Definitions</td><td 
align="left"> </td><td align="left"> </td></tr><tr><td 
align="left">25.10.3</td><td align="left">Accumulate</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.10.4</td><td align="left">Reduce</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.10.5</td><td 
align="left">Inner product</td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">25.10.6</td><td align="left">Transform 
reduce</td><td align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.10.7</td><td align="left">Partial sum</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.10.8</td><td align="left">Exclusive scan</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.10.9</td><td align="left">Inclusive scan</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.10.10</td><td align="left">Transform exclusive scan</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.10.11</td><td align="left">Transform inclusive scan</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.10.12</td><td align="left">Adjacent difference</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.10.13</td><td align="left">Iota</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.10.14</td><td 
align="left">Greatest common divisor</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.10.15</td><td 
align="left">Least common multiple</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.10.16</td><td 
align="left">Midpoint</td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">25.11</td><td align="left">Specialized <code 
class="code">&lt;memory&gt;</code> algorithms</td><td align="left"> </td><td 
align="left"> </td></tr><tr><td align="left">25.11.1</td><td 
align="left">General</td><td align="left"> </td><td align="left"> 
</td></tr><tr><td align="left">25.11.2</td><td align="left">Special memory 
concepts</td><td align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.11.3</td><td align="left"><code 
class="code">uninitialized_default_construct</code></td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.11.4</td><td align="left"><code 
class="code">uninitialized_value_construct</code></td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.11.5</td><td align="left"><code 
class="code">uninitialized_copy</code></td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.11.6</td><td 
align="left"><code class="code">uninitialized_move</code></td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.11.7</td><td align="left"><code 
class="code">uninitialized_fill</code></td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.11.8</td><td 
align="left"><code class="code">construct_at</code></td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.11.9</td><td align="left"><code 
class="code">destroy</code></td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">25.12</td><td align="left">C library 
algorithms</td><td align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">
+      </td></tr><tr><td align="left">25.1</td><td align="left">General</td><td 
align="left"> </td><td align="left"> </td></tr><tr><td 
align="left">25.2</td><td align="left">Algorithms requirements</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.3</td><td align="left">Parallel algorithms</td><td 
align="left"> </td><td align="left">Uses code from <a class="link" 
href="https://uxlfoundation.github.io/oneDPL/parallel_api_main.html"; 
target="_top">oneDPL</a></td></tr><tr><td align="left">25.4</td><td 
align="left">Header <code class="code">&lt;algorithm&gt;</code> 
synopsis</td><td align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.5</td><td align="left">Algorithm result types</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.6</td><td align="left">Non-modifying sequence 
operations</td><td align="left"> </td><td align="left"> </td></tr><tr><td 
align="left">25.6.1</td><td align="left">All of</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.6.2</td><td align="left">Any 
of</td><td align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.6.3</td><td align="left">None of</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.6.4</td><td align="left">For 
each</td><td align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.6.5</td><td align="left">Find</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.6.6</td><td align="left">Find 
end</td><td align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.6.7</td><td align="left">Find first</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.6.8</td><td align="left">Adjacent find</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.6.9</td><td align="left">Count</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.6.10</td><td 
align="left">Mismatch</td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">25.6.11</td><td align="left">Equal</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.6.12</td><td align="left">Is permutation</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.6.13</td><td align="left">Search</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.7</td><td 
align="left">Mutating sequence operations</td><td align="left"> </td><td 
align="left"> </td></tr><tr><td align="left">25.7.1</td><td 
align="left">Copy</td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">25.7.2</td><td align="left">Move</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.7.3</td><td align="left">Swap</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.7.4</td><td 
align="left">Transform</td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">25.7.5</td><td align="left">Replace</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.7.6</td><td align="left">Fill</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.7.7</td><td 
align="left">Generate</td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">25.7.8</td><td align="left">Remove</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.7.9</td><td align="left">Unique</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.7.10</td><td 
align="left">Reverse</td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">25.7.11</td><td align="left">Rotate</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.7.12</td><td align="left">Sample</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.7.13</td><td 
align="left">Shuffle</td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">25.7.14</td><td align="left">Shift</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.8</td><td align="left">Sorting and related operations</td><td 
align="left"> </td><td align="left"> </td></tr><tr><td 
align="left">25.8.1</td><td align="left">General</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.8.2</td><td 
align="left">Sorting</td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">25.8.3</td><td align="left">Nth element</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.8.4</td><td align="left">Binary search</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.8.5</td><td align="left">Partitions</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.8.6</td><td align="left">Merge</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.8.7</td><td align="left">Set 
operations on sorted structures</td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">25.8.8</td><td align="left">Heap 
operations</td><td align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.8.9</td><td align="left">Minimum and maximum</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.8.10</td><td align="left">Bounded value</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.8.11</td><td align="left">Lexicographical comparison</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.8.12</td><td align="left">Three-way comparison 
algorithms</td><td align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.8.13</td><td align="left">Permutation generators</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.9</td><td align="left">Header <code 
class="code">&lt;numeric&gt;</code> synopsis</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.10</td><td 
align="left">Generalized numeric operations</td><td align="left"> </td><td 
align="left"> </td></tr><tr><td align="left">25.10.1</td><td 
align="left">General</td><td align="left"> </td><td align="left"> 
</td></tr><tr><td align="left">25.10.2</td><td align="left">Definitions</td><td 
align="left"> </td><td align="left"> </td></tr><tr><td 
align="left">25.10.3</td><td align="left">Accumulate</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.10.4</td><td align="left">Reduce</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.10.5</td><td 
align="left">Inner product</td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">25.10.6</td><td align="left">Transform 
reduce</td><td align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.10.7</td><td align="left">Partial sum</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.10.8</td><td align="left">Exclusive scan</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.10.9</td><td align="left">Inclusive scan</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.10.10</td><td align="left">Transform exclusive scan</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.10.11</td><td align="left">Transform inclusive scan</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.10.12</td><td align="left">Adjacent difference</td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.10.13</td><td align="left">Iota</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.10.14</td><td 
align="left">Greatest common divisor</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.10.15</td><td 
align="left">Least common multiple</td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.10.16</td><td 
align="left">Midpoint</td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">25.11</td><td align="left">Specialized <code 
class="code">&lt;memory&gt;</code> algorithms</td><td align="left"> </td><td 
align="left"> </td></tr><tr><td align="left">25.11.1</td><td 
align="left">General</td><td align="left"> </td><td align="left"> 
</td></tr><tr><td align="left">25.11.2</td><td align="left">Special memory 
concepts</td><td align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.11.3</td><td align="left"><code 
class="code">uninitialized_default_construct</code></td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.11.4</td><td align="left"><code 
class="code">uninitialized_value_construct</code></td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.11.5</td><td align="left"><code 
class="code">uninitialized_copy</code></td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.11.6</td><td 
align="left"><code class="code">uninitialized_move</code></td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.11.7</td><td align="left"><code 
class="code">uninitialized_fill</code></td><td align="left">Y</td><td 
align="left"> </td></tr><tr><td align="left">25.11.8</td><td 
align="left"><code class="code">construct_at</code></td><td 
align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">25.11.9</td><td align="left"><code 
class="code">destroy</code></td><td align="left">Y</td><td align="left"> 
</td></tr><tr><td align="left">25.12</td><td align="left">C library 
algorithms</td><td align="left">Y</td><td align="left"> </td></tr><tr><td 
align="left">
        <span class="emphasis"><em>26</em></span>
       </td><td colspan="3" align="left">
        <span class="emphasis"><em>Numerics library</em></span>
diff --git a/libstdc++-v3/doc/xml/manual/status_cxx2017.xml 
b/libstdc++-v3/doc/xml/manual/status_cxx2017.xml
index 253aa4832aa9..9c13caa084b1 100644
--- a/libstdc++-v3/doc/xml/manual/status_cxx2017.xml
+++ b/libstdc++-v3/doc/xml/manual/status_cxx2017.xml
@@ -1896,7 +1896,7 @@ since C++14 and the implementation is complete.
       <entry>28.4</entry>
       <entry>Parallel algorithms</entry>
       <entry/>
-      <entry>Using <link xmlns:xlink="http://www.w3.org/1999/xlink"; 
xlink:href="https://github.com/llvm/llvm-project/tree/main/pstl";>PSTL</link></entry>
+      <entry>Uses code from <link xmlns:xlink="http://www.w3.org/1999/xlink"; 
xlink:href="https://uxlfoundation.github.io/oneDPL/parallel_api_main.html";>oneDPL</link></entry>
     </row>
     <row>
       <entry>28.5</entry>
diff --git a/libstdc++-v3/doc/xml/manual/status_cxx2020.xml 
b/libstdc++-v3/doc/xml/manual/status_cxx2020.xml
index ab44d726fb48..a1d3843abeff 100644
--- a/libstdc++-v3/doc/xml/manual/status_cxx2020.xml
+++ b/libstdc++-v3/doc/xml/manual/status_cxx2020.xml
@@ -3425,7 +3425,7 @@ since C++17 and the implementation is complete.
       <entry>25.3</entry>
       <entry>Parallel algorithms</entry>
       <entry/>
-      <entry>Using <link xmlns:xlink="http://www.w3.org/1999/xlink"; 
xlink:href="https://github.com/llvm/llvm-project/tree/main/pstl";>PSTL</link></entry>
+      <entry>Uses code from <link xmlns:xlink="http://www.w3.org/1999/xlink"; 
xlink:href="https://uxlfoundation.github.io/oneDPL/parallel_api_main.html";>oneDPL</link></entry>
     </row>
 
     <row>
-- 
2.51.0

Reply via email to