profile_mode.xml: Update three ieeexplore.ieee.org references.
authorGerald Pfeifer <gerald@pfeifer.com>
Sat, 1 Sep 2018 21:27:14 +0000 (21:27 +0000)
committerGerald Pfeifer <gerald@gcc.gnu.org>
Sat, 1 Sep 2018 21:27:14 +0000 (21:27 +0000)
* doc/xml/manual/profile_mode.xml: Update three ieeexplore.ieee.org
references.

From-SVN: r264031

libstdc++-v3/ChangeLog
libstdc++-v3/doc/xml/manual/profile_mode.xml

index f5efaea66e9a3fdeac35a5d7b9fdddfc879940c5..d45e4342978424f2d6479c413a430c0b277261f3 100644 (file)
@@ -1,3 +1,8 @@
+2018-09-01  Gerald Pfeifer  <gerald@pfeifer.com>
+
+       * doc/xml/manual/profile_mode.xml: Update three ieeexplore.ieee.org
+       references.
+
 2018-08-31  Sandra Loosemore  <sandra@codesourcery.com>
 
        * testsuite/21_strings/basic_string/inserters_extractors/wchar_t/10.cc:
index 7e71a7e3312b42fb1b21501a23bbe726b4fbdb5a..fa1b7c993c3877a0367072e4769164073276da2f 100644 (file)
@@ -26,7 +26,7 @@
   various components at interesting entry/exit points to/from the standard
   library.  Process trace, recognize suboptimal patterns, give advice.
   For details, see the
-  <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://ieeexplore.ieee.org/document/4907670/">Perflint
+  <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://ieeexplore.ieee.org/document/4907670/">Perflint
   paper presented at CGO 2009</link>.
   </para>
   <para>
@@ -328,7 +328,7 @@ vector-size: improvement = 3: call stack = 0x804842c ...
 
   <para>
   For details, see
-   <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://ieeexplore.ieee.org/document/4907670/">paper presented at
+   <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://ieeexplore.ieee.org/document/4907670/">paper presented at
    CGO 2009</link>.
   </para>
 </section>
@@ -1403,7 +1403,7 @@ foo.cc:1: advice: Change "list" to "forward_list".
   See papers:
   <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://dl.acm.org/citation.cfm?doid=1065944.1065981">
   A framework for adaptive algorithm selection in STAPL</link> and
-  <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://ieeexplore.ieee.org/document/4228227/">
+  <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://ieeexplore.ieee.org/document/4228227/">
   Optimizing Sorting with Machine Learning Algorithms</link>.
   </para></listitem>
   <listitem><para><emphasis>Sample runtime reduction:</emphasis>60%.