From: Jonathan Wakely Date: Wed, 8 Oct 2025 11:41:16 +0000 (+0100) Subject: libstdc++: Update dead links to PSTL upstream in docs X-Git-Url: http://git.ipfire.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=3f70e625531ea9da1263b806f1d726630b8d600a;p=thirdparty%2Fgcc.git libstdc++: Update dead links to PSTL upstream in docs 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. Reviewed-by: Tomasz Kamiński --- diff --git a/libstdc++-v3/doc/html/manual/status.html b/libstdc++-v3/doc/html/manual/status.html index 465bc6ccafe..64a48408268 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. 28 Algorithms - 28.1General  28.2Header <algorithm> synopsis  28.3Algorithms requirements  28.4Parallel algorithms Using PSTL28.5Non-modifying sequence operationsY 28.6Mutating sequence operationsY 28.7Sorting and related operationsY 28.8C library algorithmsY  + 28.1General  28.2Header <algorithm> synopsis  28.3Algorithms requirements  28.4Parallel algorithms Uses code from oneDPL28.5Non-modifying sequence operationsY 28.6Mutating sequence operationsY 28.7Sorting and related operationsY 28.8C library algorithmsY  29 Numerics @@ -1815,7 +1815,7 @@ since C++17 and the implementation is complete. 25 Algorithms library - 25.1General  25.2Algorithms requirementsY 25.3Parallel algorithms Using PSTL25.4Header <algorithm> synopsisY 25.5Algorithm result typesY 25.6Non-modifying sequence operations  25.6.1All ofY 25.6.2Any ofY 25.6.3None ofY 25.6.4For eachY 25.6.5FindY 25.6.6Find endY 25.6.7Find firstY 25.6.8Adjacent findY 25.6.9CountY 25.6.10MismatchY 25.6.11EqualY 25.6.12Is permutationY 25.6.13SearchY 25.7Mutating sequence operations  25.7.1CopyY 25.7.2MoveY 25.7.3SwapY 25.7.4TransformY 25.7.5ReplaceY 25.7.6FillY 25.7.7GenerateY 25.7.8RemoveY 25.7.9UniqueY 25.7.10ReverseY 25.7.11RotateY 25.7.12SampleY 25.7.13ShuffleY 25.7.14ShiftY 25.8Sorting and related operations  25.8.1GeneralY 25.8.2SortingY 25.8.3Nth elementY 25.8.4Binary searchY 25.8.5PartitionsY 25.8.6MergeY 25.8.7Set operations on sorted structuresY 25.8.8Heap operationsY 25.8.9Minimum and maximumY 25.8.10Bounded valueY 25.8.11Lexicographical comparisonY 25.8.12Three-way comparison algorithmsY 25.8.13Permutation generatorsY 25.9Header <numeric> synopsisY 25.10Generalized numeric operations  25.10.1General  25.10.2Definitions  25.10.3AccumulateY 25.10.4ReduceY 25.10.5Inner productY 25.10.6Transform reduceY 25.10.7Partial sumY 25.10.8Exclusive scanY 25.10.9Inclusive scanY 25.10.10Transform exclusive scanY 25.10.11Transform inclusive scanY 25.10.12Adjacent differenceY 25.10.13IotaY 25.10.14Greatest common divisorY 25.10.15Least common multipleY 25.10.16MidpointY 25.11Specialized <memory> algorithms  25.11.1General  25.11.2Special memory conceptsY 25.11.3uninitialized_default_constructY 25.11.4uninitialized_value_constructY 25.11.5uninitialized_copyY 25.11.6uninitialized_moveY 25.11.7uninitialized_fillY 25.11.8construct_atY 25.11.9destroyY 25.12C library algorithmsY  + 25.1General  25.2Algorithms requirementsY 25.3Parallel algorithms Uses code from oneDPL25.4Header <algorithm> synopsisY 25.5Algorithm result typesY 25.6Non-modifying sequence operations  25.6.1All ofY 25.6.2Any ofY 25.6.3None ofY 25.6.4For eachY 25.6.5FindY 25.6.6Find endY 25.6.7Find firstY 25.6.8Adjacent findY 25.6.9CountY 25.6.10MismatchY 25.6.11EqualY 25.6.12Is permutationY 25.6.13SearchY 25.7Mutating sequence operations  25.7.1CopyY 25.7.2MoveY 25.7.3SwapY 25.7.4TransformY 25.7.5ReplaceY 25.7.6FillY 25.7.7GenerateY 25.7.8RemoveY 25.7.9UniqueY 25.7.10ReverseY 25.7.11RotateY 25.7.12SampleY 25.7.13ShuffleY 25.7.14ShiftY 25.8Sorting and related operations  25.8.1GeneralY 25.8.2SortingY 25.8.3Nth elementY 25.8.4Binary searchY 25.8.5PartitionsY 25.8.6MergeY 25.8.7Set operations on sorted structuresY 25.8.8Heap operationsY 25.8.9Minimum and maximumY 25.8.10Bounded valueY 25.8.11Lexicographical comparisonY 25.8.12Three-way comparison algorithmsY 25.8.13Permutation generatorsY 25.9Header <numeric> synopsisY 25.10Generalized numeric operations  25.10.1General  25.10.2Definitions  25.10.3AccumulateY 25.10.4ReduceY 25.10.5Inner productY 25.10.6Transform reduceY 25.10.7Partial sumY 25.10.8Exclusive scanY 25.10.9Inclusive scanY 25.10.10Transform exclusive scanY 25.10.11Transform inclusive scanY 25.10.12Adjacent differenceY 25.10.13IotaY 25.10.14Greatest common divisorY 25.10.15Least common multipleY 25.10.16MidpointY 25.11Specialized <memory> algorithms  25.11.1General  25.11.2Special memory conceptsY 25.11.3uninitialized_default_constructY 25.11.4uninitialized_value_constructY 25.11.5uninitialized_copyY 25.11.6uninitialized_moveY 25.11.7uninitialized_fillY 25.11.8construct_atY 25.11.9destroyY 25.12C library algorithmsY  26 Numerics library diff --git a/libstdc++-v3/doc/xml/manual/status_cxx2017.xml b/libstdc++-v3/doc/xml/manual/status_cxx2017.xml index 253aa4832aa..9c13caa084b 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. 28.4 Parallel algorithms - Using PSTL + Uses code from oneDPL 28.5 diff --git a/libstdc++-v3/doc/xml/manual/status_cxx2020.xml b/libstdc++-v3/doc/xml/manual/status_cxx2020.xml index ab44d726fb4..a1d3843abef 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. 25.3 Parallel algorithms - Using PSTL + Uses code from oneDPL