mirror of git://gcc.gnu.org/git/gcc.git
Regenerate libstdc++ HTML pages
* doc/html/*: Regenerate. From-SVN: r264760
This commit is contained in:
parent
b093d688da
commit
8e4d333b0e
|
|
@ -1,3 +1,7 @@
|
||||||
|
2018-10-01 Jonathan Wakely <jwakely@redhat.com>
|
||||||
|
|
||||||
|
* doc/html/*: Regenerate.
|
||||||
|
|
||||||
2018-09-30 Gerald Pfeifer <gerald@pfeifer.com>
|
2018-09-30 Gerald Pfeifer <gerald@pfeifer.com>
|
||||||
|
|
||||||
* doc/xml/manual/messages.xml: Switch link to www.oracle.com
|
* doc/xml/manual/messages.xml: Switch link to www.oracle.com
|
||||||
|
|
|
||||||
|
|
@ -3,7 +3,7 @@
|
||||||
Appendices
|
Appendices
|
||||||
</th><td width="20%" align="right"> <a accesskey="n" href="../bk02.html">Next</a></td></tr></table><hr /></div><div class="appendix"><div class="titlepage"><div><div><h1 class="title"><a id="appendix.gfdl-1.3"></a>GNU Free Documentation License</h1></div></div></div><p>Version 1.3, 3 November 2008</p><p>
|
</th><td width="20%" align="right"> <a accesskey="n" href="../bk02.html">Next</a></td></tr></table><hr /></div><div class="appendix"><div class="titlepage"><div><div><h1 class="title"><a id="appendix.gfdl-1.3"></a>GNU Free Documentation License</h1></div></div></div><p>Version 1.3, 3 November 2008</p><p>
|
||||||
Copyright © 2000, 2001, 2002, 2007, 2008
|
Copyright © 2000, 2001, 2002, 2007, 2008
|
||||||
<a class="link" href="http://www.fsf.org/" target="_top">Free Software Foundation, Inc.</a>
|
<a class="link" href="https://www.fsf.org" target="_top">Free Software Foundation, Inc.</a>
|
||||||
</p><p>
|
</p><p>
|
||||||
Everyone is permitted to copy and distribute verbatim copies of this
|
Everyone is permitted to copy and distribute verbatim copies of this
|
||||||
license document, but changing it is not allowed.
|
license document, but changing it is not allowed.
|
||||||
|
|
|
||||||
|
|
@ -9,7 +9,7 @@
|
||||||
Version 3, 29 June 2007
|
Version 3, 29 June 2007
|
||||||
</p><p>
|
</p><p>
|
||||||
Copyright © 2007 Free Software Foundation, Inc.
|
Copyright © 2007 Free Software Foundation, Inc.
|
||||||
<a class="link" href="http://www.fsf.org/" target="_top">http://www.fsf.org/</a>
|
<a class="link" href="https://www.fsf.org" target="_top">https://www.fsf.org</a>
|
||||||
</p><p>
|
</p><p>
|
||||||
Everyone is permitted to copy and distribute verbatim copies of this license
|
Everyone is permitted to copy and distribute verbatim copies of this license
|
||||||
document, but changing it is not allowed.
|
document, but changing it is not allowed.
|
||||||
|
|
|
||||||
|
|
@ -460,7 +460,7 @@ codecvt usage.
|
||||||
The Unicode HOWTO
|
The Unicode HOWTO
|
||||||
</a>
|
</a>
|
||||||
</em>. </span><span class="author"><span class="firstname">Bruno</span> <span class="surname">Haible</span>. </span></p></div><div class="biblioentry"><a id="id-1.3.4.6.3.3.8.11"></a><p><span class="title"><em>
|
</em>. </span><span class="author"><span class="firstname">Bruno</span> <span class="surname">Haible</span>. </span></p></div><div class="biblioentry"><a id="id-1.3.4.6.3.3.8.11"></a><p><span class="title"><em>
|
||||||
<a class="link" href="http://www.cl.cam.ac.uk/~mgk25/unicode.html" target="_top">
|
<a class="link" href="https://www.cl.cam.ac.uk/~mgk25/unicode.html" target="_top">
|
||||||
UTF-8 and Unicode FAQ for Unix/Linux
|
UTF-8 and Unicode FAQ for Unix/Linux
|
||||||
</a>
|
</a>
|
||||||
</em>. </span><span class="author"><span class="firstname">Markus</span> <span class="surname">Khun</span>. </span></p></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="std.localization.facet.messages"></a>messages</h3></div></div></div><p>
|
</em>. </span><span class="author"><span class="firstname">Markus</span> <span class="surname">Khun</span>. </span></p></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="std.localization.facet.messages"></a>messages</h3></div></div></div><p>
|
||||||
|
|
@ -732,7 +732,7 @@ void test01()
|
||||||
. </span><span class="author"><span class="firstname">Angelika</span> <span class="surname">Langer</span>. </span><span class="author"><span class="firstname">Klaus</span> <span class="surname">Kreft</span>. </span><span class="copyright">Copyright © 2000 Addison Wesley Longman, Inc.. </span><span class="publisher"><span class="publishername">
|
. </span><span class="author"><span class="firstname">Angelika</span> <span class="surname">Langer</span>. </span><span class="author"><span class="firstname">Klaus</span> <span class="surname">Kreft</span>. </span><span class="copyright">Copyright © 2000 Addison Wesley Longman, Inc.. </span><span class="publisher"><span class="publishername">
|
||||||
Addison Wesley Longman
|
Addison Wesley Longman
|
||||||
. </span></span></p></div><div class="biblioentry"><a id="id-1.3.4.6.3.4.8.9"></a><p><span class="title"><em>
|
. </span></span></p></div><div class="biblioentry"><a id="id-1.3.4.6.3.4.8.9"></a><p><span class="title"><em>
|
||||||
<a class="link" href="http://www.oracle.com/technetwork/java/api/index.html" target="_top">
|
<a class="link" href="https://www.oracle.com/technetwork/java/api/index.html" target="_top">
|
||||||
API Specifications, Java Platform
|
API Specifications, Java Platform
|
||||||
</a>
|
</a>
|
||||||
</em>. </span><span class="pagenums">java.util.Properties, java.text.MessageFormat,
|
</em>. </span><span class="pagenums">java.util.Properties, java.text.MessageFormat,
|
||||||
|
|
|
||||||
|
|
@ -1160,7 +1160,7 @@
|
||||||
</span>. </span><span class="publisher"><span class="publishername">
|
</span>. </span><span class="publisher"><span class="publishername">
|
||||||
Cambridge University Press
|
Cambridge University Press
|
||||||
. </span></span></p></div><div class="biblioentry"><a id="biblio.mscom"></a><p>[biblio.mscom] <span class="title"><em>
|
. </span></span></p></div><div class="biblioentry"><a id="biblio.mscom"></a><p>[biblio.mscom] <span class="title"><em>
|
||||||
<a class="link" href="https://www.microsoft.com/com/" target="_top">
|
<a class="link" href="https://docs.microsoft.com/en-us/windows/desktop/com/the-component-object-model" target="_top">
|
||||||
COM: Component Model Object Technologies
|
COM: Component Model Object Technologies
|
||||||
</a>
|
</a>
|
||||||
</em>. </span><span class="publisher"><span class="publishername">
|
</em>. </span><span class="publisher"><span class="publishername">
|
||||||
|
|
@ -1188,7 +1188,7 @@
|
||||||
</span>. </span><span class="publisher"><span class="publishername">
|
</span>. </span><span class="publisher"><span class="publishername">
|
||||||
Addison-Wesley Publishing Company
|
Addison-Wesley Publishing Company
|
||||||
. </span></span></p></div><div class="biblioentry"><a id="biblio.nelson96stlpq"></a><p>[biblio.nelson96stlpq] <span class="title"><em>
|
. </span></span></p></div><div class="biblioentry"><a id="biblio.nelson96stlpq"></a><p>[biblio.nelson96stlpq] <span class="title"><em>
|
||||||
<a class="link" href="http://marknelson.us/1996/01/01/priority-queues/" target="_top">Priority Queues and the STL
|
<a class="link" href="https://marknelson.us/posts/1996/01/01/priority-queues.html" target="_top">Priority Queues and the STL
|
||||||
</a>
|
</a>
|
||||||
</em>. </span><span class="date">
|
</em>. </span><span class="date">
|
||||||
January 1996
|
January 1996
|
||||||
|
|
|
||||||
|
|
@ -11,7 +11,7 @@
|
||||||
various components at interesting entry/exit points to/from the standard
|
various components at interesting entry/exit points to/from the standard
|
||||||
library. Process trace, recognize suboptimal patterns, give advice.
|
library. Process trace, recognize suboptimal patterns, give advice.
|
||||||
For details, see the
|
For details, see the
|
||||||
<a class="link" href="http://ieeexplore.ieee.org/document/4907670/" target="_top">Perflint
|
<a class="link" href="https://ieeexplore.ieee.org/document/4907670/" target="_top">Perflint
|
||||||
paper presented at CGO 2009</a>.
|
paper presented at CGO 2009</a>.
|
||||||
</p><p>
|
</p><p>
|
||||||
<span class="emphasis"><em>Strengths: </em></span>
|
<span class="emphasis"><em>Strengths: </em></span>
|
||||||
|
|
|
||||||
|
|
@ -60,7 +60,7 @@
|
||||||
call stack of its constructor location.
|
call stack of its constructor location.
|
||||||
</p><p>
|
</p><p>
|
||||||
For details, see
|
For details, see
|
||||||
<a class="link" href="http://ieeexplore.ieee.org/document/4907670/" target="_top">paper presented at
|
<a class="link" href="https://ieeexplore.ieee.org/document/4907670/" target="_top">paper presented at
|
||||||
CGO 2009</a>.
|
CGO 2009</a>.
|
||||||
</p></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.profile_mode.design.analysis"></a>Analysis and Diagnostics</h3></div></div></div><p>
|
</p></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.profile_mode.design.analysis"></a>Analysis and Diagnostics</h3></div></div></div><p>
|
||||||
Final analysis takes place offline, and it is based entirely on the
|
Final analysis takes place offline, and it is based entirely on the
|
||||||
|
|
|
||||||
|
|
@ -376,7 +376,7 @@ foo.cc:1: advice: Change "list" to "forward_list".
|
||||||
See papers:
|
See papers:
|
||||||
<a class="link" href="https://dl.acm.org/citation.cfm?doid=1065944.1065981" target="_top">
|
<a class="link" href="https://dl.acm.org/citation.cfm?doid=1065944.1065981" target="_top">
|
||||||
A framework for adaptive algorithm selection in STAPL</a> and
|
A framework for adaptive algorithm selection in STAPL</a> and
|
||||||
<a class="link" href="http://ieeexplore.ieee.org/document/4228227/" target="_top">
|
<a class="link" href="https://ieeexplore.ieee.org/document/4228227/" target="_top">
|
||||||
Optimizing Sorting with Machine Learning Algorithms</a>.
|
Optimizing Sorting with Machine Learning Algorithms</a>.
|
||||||
</p></li><li class="listitem"><p><span class="emphasis"><em>Sample runtime reduction:</em></span>60%.
|
</p></li><li class="listitem"><p><span class="emphasis"><em>Sample runtime reduction:</em></span>60%.
|
||||||
</p></li><li class="listitem"><p><span class="emphasis"><em>Recommendation:</em></span> Change sort algorithm
|
</p></li><li class="listitem"><p><span class="emphasis"><em>Recommendation:</em></span> Change sort algorithm
|
||||||
|
|
|
||||||
|
|
@ -275,13 +275,13 @@ is called.
|
||||||
The Open Group/The Institute of Electrical and Electronics
|
The Open Group/The Institute of Electrical and Electronics
|
||||||
Engineers, Inc.
|
Engineers, Inc.
|
||||||
. </span></p></div><div class="biblioentry"><a id="id-1.3.3.4.9.9.3"></a><p><span class="title"><em>
|
. </span></p></div><div class="biblioentry"><a id="id-1.3.3.4.9.9.3"></a><p><span class="title"><em>
|
||||||
<a class="link" href="http://www.boost.org/community/error_handling.html" target="_top">
|
<a class="link" href="https://www.boost.org/community/error_handling.html" target="_top">
|
||||||
Error and Exception Handling
|
Error and Exception Handling
|
||||||
</a>
|
</a>
|
||||||
</em>. </span><span class="author"><span class="firstname">David</span> <span class="surname">Abrahams </span>. </span><span class="publisher"><span class="publishername">
|
</em>. </span><span class="author"><span class="firstname">David</span> <span class="surname">Abrahams </span>. </span><span class="publisher"><span class="publishername">
|
||||||
Boost
|
Boost
|
||||||
. </span></span></p></div><div class="biblioentry"><a id="id-1.3.3.4.9.9.4"></a><p><span class="title"><em>
|
. </span></span></p></div><div class="biblioentry"><a id="id-1.3.3.4.9.9.4"></a><p><span class="title"><em>
|
||||||
<a class="link" href="http://www.boost.org/community/exception_safety.html" target="_top">
|
<a class="link" href="https://www.boost.org/community/exception_safety.html" target="_top">
|
||||||
Exception-Safety in Generic Components
|
Exception-Safety in Generic Components
|
||||||
</a>
|
</a>
|
||||||
</em>. </span><span class="author"><span class="firstname">David</span> <span class="surname">Abrahams</span>. </span><span class="publisher"><span class="publishername">
|
</em>. </span><span class="author"><span class="firstname">David</span> <span class="surname">Abrahams</span>. </span><span class="publisher"><span class="publishername">
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue