https://gcc.gnu.org/g:1e4d81aab2542f529d23329fcc5e642eedd617d9

commit r15-8873-g1e4d81aab2542f529d23329fcc5e642eedd617d9
Author: Jonathan Wakely <jwak...@redhat.com>
Date:   Mon Mar 24 21:28:47 2025 +0000

    libstdc++: Fix some broken links in the manual
    
    libstdc++-v3/ChangeLog:
    
            * doc/xml/manual/policy_data_structures_biblio.xml: Fix two
            broken links.
            * doc/html/manual/policy_data_structures.html: Regenerate.

Diff:
---
 libstdc++-v3/doc/html/manual/policy_data_structures.html      | 4 ++--
 libstdc++-v3/doc/xml/manual/policy_data_structures_biblio.xml | 4 ++--
 2 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/libstdc++-v3/doc/html/manual/policy_data_structures.html 
b/libstdc++-v3/doc/html/manual/policy_data_structures.html
index 45e07814184d..ba140809bbe0 100644
--- a/libstdc++-v3/doc/html/manual/policy_data_structures.html
+++ b/libstdc++-v3/doc/html/manual/policy_data_structures.html
@@ -1037,7 +1037,7 @@
          </span>. </span><span class="publisher"><span class="publishername">
          Addison-Wesley Publishing Company
        . </span></span></p></div><div class="biblioentry"><a 
id="biblio.kt99fat_heaps"></a><p>[biblio.kt99fat_heaps] <span class="title"><em>
-       <a class="link" 
href="https://www.cs.princeton.edu/research/techreps/TR-597-99"; target="_top">
+       <a class="link" 
href="https://www.cs.princeton.edu/research/techreps/293"; target="_top">
          New Heap Data Structures
        </a>
       </em>. </span><span class="date">
@@ -1185,7 +1185,7 @@
            </span>. </span><span class="publisher"><span class="publishername">
          Addison-Wesley Publishing Company
        . </span></span></p></div><div class="biblioentry"><a 
id="biblio.nelson96stlpq"></a><p>[biblio.nelson96stlpq] <span class="title"><em>
-       <a class="link" 
href="https://marknelson.us/posts/1996/01/01/priority-queues.html"; 
target="_top">Priority Queues and the STL
+       <a class="link" 
href="https://web.archive.org/web/20240806213010/https://marknelson.us/posts/1996/01/01/priority-queues.html";
 target="_top">Priority Queues and the STL
        </a>
       </em>. </span><span class="date">
        January 1996
diff --git a/libstdc++-v3/doc/xml/manual/policy_data_structures_biblio.xml 
b/libstdc++-v3/doc/xml/manual/policy_data_structures_biblio.xml
index 1450b8fc000e..928598d33c6b 100644
--- a/libstdc++-v3/doc/xml/manual/policy_data_structures_biblio.xml
+++ b/libstdc++-v3/doc/xml/manual/policy_data_structures_biblio.xml
@@ -737,7 +737,7 @@
     <biblioentry xml:id="biblio.kt99fat_heaps">
       <title>
        <link xmlns:xlink="http://www.w3.org/1999/xlink";
-             
xlink:href="https://www.cs.princeton.edu/research/techreps/TR-597-99";>
+             xlink:href="https://www.cs.princeton.edu/research/techreps/293";>
          New Heap Data Structures
        </link>
       </title>
@@ -1138,7 +1138,7 @@
     <biblioentry xml:id="biblio.nelson96stlpq">
       <title>
        <link xmlns:xlink="http://www.w3.org/1999/xlink";
-             
xlink:href="https://marknelson.us/posts/1996/01/01/priority-queues.html";>Priority
 Queues and the STL
+             
xlink:href="https://web.archive.org/web/20240806213010/https://marknelson.us/posts/1996/01/01/priority-queues.html";>Priority
 Queues and the STL
        </link>
       </title>
       <date>

Reply via email to