diff options
Diffstat (limited to 'libstdc++-v3/doc/xml/manual')
| -rw-r--r-- | libstdc++-v3/doc/xml/manual/abi.xml | 14 | ||||
| -rw-r--r-- | libstdc++-v3/doc/xml/manual/build_hacking.xml | 176 | ||||
| -rw-r--r-- | libstdc++-v3/doc/xml/manual/documentation_hacking.xml | 167 | ||||
| -rw-r--r-- | libstdc++-v3/doc/xml/manual/policy_data_structures.xml | 1463 | ||||
| -rw-r--r-- | libstdc++-v3/doc/xml/manual/policy_data_structures_biblio.xml | 1452 | ||||
| -rw-r--r-- | libstdc++-v3/doc/xml/manual/spine.xml | 1 | ||||
| -rw-r--r-- | libstdc++-v3/doc/xml/manual/status_cxx2011.xml | 21 | ||||
| -rw-r--r-- | libstdc++-v3/doc/xml/manual/test_policy_data_structures.xml | 109 |
8 files changed, 1827 insertions, 1576 deletions
diff --git a/libstdc++-v3/doc/xml/manual/abi.xml b/libstdc++-v3/doc/xml/manual/abi.xml index 6dc74136389..3fb5fa8de35 100644 --- a/libstdc++-v3/doc/xml/manual/abi.xml +++ b/libstdc++-v3/doc/xml/manual/abi.xml @@ -54,7 +54,7 @@ virtual functions, etc. These details are defined as the compiler Application Binary Interface, or ABI. The GNU C++ compiler uses an industry-standard C++ ABI starting with version 3. Details can be - found in the <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://www.codesourcery.com/public/cxx-abi/abi.html">ABI + found in the <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://mentorembedded.github.com/cxx-abi/abi.html">ABI specification</link>. </para> @@ -271,6 +271,7 @@ compatible. <listitem><para>GCC 4.5.0: libstdc++.so.6.0.14</para></listitem> <listitem><para>GCC 4.6.0: libstdc++.so.6.0.15</para></listitem> <listitem><para>GCC 4.6.1: libstdc++.so.6.0.16</para></listitem> + <listitem><para>GCC 4.7.0: libstdc++.so.6.0.17</para></listitem> </itemizedlist> <para> Note 1: Error should be libstdc++.so.3.0.3. @@ -332,6 +333,7 @@ compatible. <listitem><para>GCC 4.5.0: GLIBCXX_3.4.14, CXXABI_1.3.4</para></listitem> <listitem><para>GCC 4.6.0: GLIBCXX_3.4.15, CXXABI_1.3.5</para></listitem> <listitem><para>GCC 4.6.1: GLIBCXX_3.4.16, CXXABI_1.3.5</para></listitem> + <listitem><para>GCC 4.7.0: GLIBCXX_3.4.17, CXXABI_1.3.6</para></listitem> </itemizedlist> </listitem> @@ -449,13 +451,19 @@ compatible. <listitem><para>GCC 4.4.4: 20100429</para></listitem> <listitem><para>GCC 4.4.5: 20101001</para></listitem> <listitem><para>GCC 4.4.6: 20110416</para></listitem> + <listitem><para>GCC 4.4.7: 20120313</para></listitem> <listitem><para>GCC 4.5.0: 20100414</para></listitem> <listitem><para>GCC 4.5.1: 20100731</para></listitem> <listitem><para>GCC 4.5.2: 20101216</para></listitem> <listitem><para>GCC 4.5.3: 20110428</para></listitem> + <listitem><para>GCC 4.5.4: 20120702</para></listitem> <listitem><para>GCC 4.6.0: 20110325</para></listitem> <listitem><para>GCC 4.6.1: 20110627</para></listitem> <listitem><para>GCC 4.6.2: 20111026</para></listitem> + <listitem><para>GCC 4.6.3: 20120301</para></listitem> + <listitem><para>GCC 4.7.0: 20120322</para></listitem> + <listitem><para>GCC 4.7.1: 20120614</para></listitem> + <listitem><para>GCC 4.7.2: 20120920</para></listitem> </itemizedlist> <para/> </listitem> @@ -729,7 +737,7 @@ class that would otherwise have implicit versions. This will change the way the compiler deals with this class in by-value return statements or parameters: instead of passing instances of this class in registers, the compiler will be forced to use memory. See the -section on <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://www.codesourcery.com/public/cxx-abi/abi.html#calls">Function +section on <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://mentorembedded.github.com/cxx-abi/abi.html#calls">Function Calling Conventions and APIs</link> of the C++ ABI documentation for further details. </para></listitem> @@ -1087,7 +1095,7 @@ gcc test.c -g -O2 -L. -lone -ltwo /usr/lib/libstdc++.so.5 /usr/lib/libstdc++.so. <biblioentry xml:id="biblio.cxxabi"> <title> <link xmlns:xlink="http://www.w3.org/1999/xlink" - xlink:href="http://www.codesourcery.com/public/cxx-abi"> + xlink:href="http://www.codesourcery.com/cxx-abi/"> C++ ABI Summary </link> </title> diff --git a/libstdc++-v3/doc/xml/manual/build_hacking.xml b/libstdc++-v3/doc/xml/manual/build_hacking.xml index daac8c0e2f0..dde72729f25 100644 --- a/libstdc++-v3/doc/xml/manual/build_hacking.xml +++ b/libstdc++-v3/doc/xml/manual/build_hacking.xml @@ -8,7 +8,13 @@ C++ </keyword> <keyword> - BUILD_HACKING + build + </keyword> + <keyword> + configure + </keyword> + <keyword> + hacking </keyword> <keyword> version @@ -38,7 +44,50 @@ </para> </section> -<section xml:id="build_hacking.map"><info><title>Overview: What Comes from Where</title></info> +<section xml:id="build_hacking.overview"> +<info><title>Overview</title></info> + +<section xml:id="build_hacking.overview.basic"> +<info><title>General Process</title></info> + +<para> + The configure process begins the act of building libstdc++, and is + started via: +</para> + +<screen> +<computeroutput> +configure +</computeroutput> +</screen> + +<para> +The <filename>configure</filename> file is a script generated (via +<command>autoconf</command>) from the file +<filename>configure.ac</filename>. +</para> + + +<para> + After the configure process is complete, +</para> + +<screen> +<computeroutput> +make all +</computeroutput> +</screen> + +<para> +in the build directory starts the build process. The <literal>all</literal> target comes from the <filename>Makefile</filename> file, which is generated via <command>configure</command> from the <filename>Makefile.in</filename> file, which is in turn generated (via +<command>automake</command>) from the file +<filename>Makefile.am</filename>. +</para> + +</section> + + +<section xml:id="build_hacking.overview.map"><info><title>What Comes from Where</title></info> <figure> @@ -57,19 +106,19 @@ </figure> <para> - Regenerate all generated files by using the command sequence - <code>"autoreconf"</code> at the top level of the libstdc++ source - directory. The following will also work, but is much more complex: - <code>"aclocal-1.11 && autoconf-2.64 && - autoheader-2.64 && automake-1.11"</code> The version - numbers may be absent entirely or otherwise vary depending on - <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/install/prerequisites.html">the - current requirements</link> and your vendor's choice of - installation names. + Regenerate all generated files by using the command + <code>autoreconf</code> at the top level of the libstdc++ source + directory. </para> </section> -<section xml:id="build_hacking.scripts"><info><title>Storing Information in non-AC files (like configure.host)</title></info> +</section> <!-- overview --> + + +<section xml:id="build_hacking.configure"> +<info><title>Configure</title></info> + +<section xml:id="build_hacking.configure.scripts"><info><title>Storing Information in non-AC files (like configure.host)</title></info> <para> @@ -101,7 +150,7 @@ </para> </section> -<section xml:id="build_hacking.conventions"><info><title>Coding and Commenting Conventions</title></info> +<section xml:id="build_hacking.configure.conventions"><info><title>Coding and Commenting Conventions</title></info> <para> @@ -126,7 +175,7 @@ </para> </section> -<section xml:id="build_hacking.acinclude"><info><title>The acinclude.m4 layout</title></info> +<section xml:id="build_hacking.configure.acinclude"><info><title>The acinclude.m4 layout</title></info> <para> The nice thing about acinclude.m4/aclocal.m4 is that macros aren't @@ -217,19 +266,19 @@ </section> -<section xml:id="build_hacking.enable"><info><title><constant>GLIBCXX_ENABLE</constant>, the <literal>--enable</literal> maker</title></info> +<section xml:id="build_hacking.configure.enable"><info><title><constant>GLIBCXX_ENABLE</constant>, the <literal>--enable</literal> maker</title></info> <para> - All the GLIBCXX_ENABLE_FOO macros use a common helper, - GLIBCXX_ENABLE. (You don't have to use it, but it's easy.) The - helper does two things for us: + All the <literal>GLIBCXX_ENABLE_FOO</literal> macros use a common + helper, <literal>GLIBCXX_ENABLE</literal>. (You don't have to use + it, but it's easy.) The helper does two things for us: </para> <orderedlist> <listitem> <para> - Builds the call to the AC_ARG_ENABLE macro, with --help text + Builds the call to the <literal>AC_ARG_ENABLE</literal> macro, with --help text properly quoted and aligned. (Death to changequote!) </para> </listitem> @@ -237,7 +286,7 @@ <para> Checks the result against a list of allowed possibilities, and signals a fatal error if there's no match. This means that the - rest of the GLIBCXX_ENABLE_FOO macro doesn't need to test for + rest of the <literal>GLIBCXX_ENABLE_FOO</literal> macro doesn't need to test for strange arguments, nor do we need to protect against empty/whitespace strings with the <code>"x$foo" = "xbar"</code> idiom. @@ -284,13 +333,13 @@ not pass --enable/--disable. It should be one of the permitted values passed later. Examples: <code>[yes]</code>, or <code>[bar]</code>, or <code>[$1]</code> (which passes the - argument given to the GLIBCXX_ENABLE_FOO macro as the - default). + argument given to the <literal>GLIBCXX_ENABLE_FOO</literal> macro + as the default). </para> <para> For cases where we need to probe for particular models of things, it is useful to have an undocumented "auto" value here (see - GLIBCXX_ENABLE_CLOCALE for an example). + <literal>GLIBCXX_ENABLE_CLOCALE</literal> for an example). </para> </listitem> <listitem> @@ -351,5 +400,86 @@ </para> </section> +</section> <!-- configure --> + +<section xml:id="build_hacking.make"><info><title>Make</title></info> + + <para> + The build process has to make all of object files needed for + static or shared libraries, but first it has to generate some + include files. The general order is as follows: + </para> + +<orderedlist> + <listitem> + <para> + make include files, make pre-compiled headers + </para> + </listitem> + <listitem> + <para> + make libsupc++ + </para> + <para> + Generates a libtool convenience library, + <filename>libsupc++convenience</filename> with language-support + routines. Also generates a freestanding static library, + <filename>libsupc++.a</filename>. + </para> + </listitem> + <listitem> + <para> + make src + </para> + <para> + Generates two convenience libraries, one for C++98 and one for + C++11, various compability files for shared and static + libraries, and then collects all the generated bits and creates + the final libstdc++ libraries. + </para> +<orderedlist> + <listitem> + <para> + make src/c++98 + </para> + <para> + Generates a libtool convenience library, + <filename>libc++98convenience</filename> with language-support + routines. Uses the <literal>-std=gnu++98</literal> dialect. + </para> + </listitem> + <listitem> + <para> + make src/c++11 + </para> + <para> + Generates a libtool convenience library, + <filename>libc++11convenience</filename> with language-support + routines. Uses the <literal>-std=gnu++11</literal> dialect. + </para> + </listitem> + <listitem> + <para> + make src + </para> + <para> + Generates needed compatibility objects for shared and static + libraries. Shared-only code is seggregated at compile-time via + the macro <literal>_GLIBCXX_SHARED</literal>. + </para> + + <para> + Then, collects all the generated convenience libraries, adds in + any required compatibility objects, and creates the final shared + and static libraries: <filename>libstdc++.so</filename> and + <filename>libstdc++.a</filename>. + </para> + + </listitem> +</orderedlist> + </listitem> +</orderedlist> + +</section> <!-- make --> </section> diff --git a/libstdc++-v3/doc/xml/manual/documentation_hacking.xml b/libstdc++-v3/doc/xml/manual/documentation_hacking.xml index e74f2b7f01e..05c05a636ec 100644 --- a/libstdc++-v3/doc/xml/manual/documentation_hacking.xml +++ b/libstdc++-v3/doc/xml/manual/documentation_hacking.xml @@ -102,14 +102,10 @@ in the following directories: </para> <para> - <filename class="directory"> - doc/libstdc++/libstdc++-api.html - </filename> + <filename>doc/libstdc++/libstdc++-api.html</filename> </para> <para> - <filename class="directory"> - doc/libstdc++/libstdc++-manual.html - </filename> + <filename>doc/libstdc++/libstdc++-manual.html</filename> </para> </listitem> </varlistentry> @@ -346,6 +342,76 @@ </section> + <section xml:id="doxygen.debug"> + <info><title>Debugging Generation</title></info> + + <para> + Sometimes, mis-configuration of the pre-requisite tools can + lead to errors when attempting to build the + documentation. Here are some of the obvious errors, and ways + to fix some common issues that may appear quite cryptic. + </para> + + <para> + First, if using a rule like <code>make pdf</code>, try to + narrow down the scope of the error to either docbook + (<code>make doc-pdf-docbook</code>) or doxygen (<code>make + doc-pdf-doxygen</code>). + </para> + <para> + Working on the doxygen path only, closely examine the + contents of the following build directory: + <filename>build/target/libstdc++-v3/doc/doxygen/latex</filename>. + Pay attention to three files enclosed within, annotated as follows. + </para> +<itemizedlist> + +<listitem> + <para> + <emphasis>refman.tex</emphasis> + </para> + + <para> + The actual latex file, or partial latex file. This is generated + via <command>doxygen</command>, and is the LaTeX version of the + Doxygen XML file <filename>libstdc++-api.xml</filename>. Go to a specific + line, and look at the genrated LaTeX, and try to deduce what + markup in <filename>libstdc++-api.xml</filename> is causing it. + </para> +</listitem> + +<listitem> + <para> + <emphasis>refman.out</emphasis> + </para> + + <para> + A log of the compilation of the converted LaTeX form to pdf. This + is a linear list, from the beginning of the + <filename>refman.tex</filename> file: the last entry of this file + should be the end of the LaTeX file. If it is truncated, then you + know that the last entry is the last part of the generated LaTeX + source file that is valid. Often this file contains an error with + a specific line number of <filename>refman.tex</filename> that is + incorrect, or will have clues at the end of the file with the dump + of the memory usage of LaTeX. + </para> +</listitem> +</itemizedlist> + + <para> + If the error at hand is not obvious after examination, a + fall-back strategy is to start commenting out the doxygen + input sources, which can be found in + <filename>doc/doxygen/user.cfg.in</filename>, look for the + <literal>INPUT</literal> tag. Start by commenting out whole + directories of header files, until the offending header is + identified. Then, read the latex log files to try and find + surround text, and look for that in the offending header. + </para> + + </section> + <section xml:id="doxygen.markup"><info><title>Markup</title></info> @@ -742,6 +808,95 @@ make <literal>XSL_STYLE_DIR="/usr/share/xml/docbook/stylesheet/nwalsh"</literal> </section> + <section xml:id="docbook.debug"> + <info><title>Debugging Generation</title></info> + + <para> + Sometimes, mis-configuration of the pre-requisite tools can + lead to errors when attempting to build the + documentation. Here are some of the obvious errors, and ways + to fix some common issues that may appear quite cryptic. + </para> + + <para> + First, if using a rule like <code>make pdf</code>, try to + narrow down the scope of the error to either docbook + (<code>make doc-pdf-docbook</code>) or doxygen (<code>make + doc-pdf-doxygen</code>). + </para> + + <para> + Working on the docbook path only, closely examine the + contents of the following build directory: + <filename>build/target/libstdc++-v3/doc/docbook/latex</filename>. + Pay attention to three files enclosed within, annotated as follows. + </para> + +<itemizedlist> + +<listitem> + <para> + <emphasis>spine.tex</emphasis> + </para> + + <para> + The actual latex file, or partial latex file. This is generated + via <command>dblatex</command>, and is the LaTeX version of the + DocBook XML file <filename>spine.xml</filename>. Go to a specific + line, and look at the genrated LaTeX, and try to deduce what + markup in <filename>spine.xml</filename> is causing it. + </para> +</listitem> + +<listitem> + <para> + <emphasis>spine.out</emphasis> + </para> + + <para> + A log of the conversion from the XML form to the LaTeX form. This + is a linear list, from the beginning of the + <filename>spine.xml</filename> file: the last entry of this file + should be the end of the DocBook file. If it is truncated, then + you know that the last entry is the last part of the XML source + file that is valid. The error is after this point. + </para> +</listitem> + + +<listitem> + <para> + <emphasis>spine.log</emphasis> + </para> + + <para> + A log of the compilation of the converted LaTeX form to pdf. This + is a linear list, from the beginning of the + <filename>spine.tex</filename> file: the last entry of this file + should be the end of the LaTeX file. If it is truncated, then you + know that the last entry is the last part of the generated LaTeX + source file that is valid. Often this file contains an error with + a specific line number of <filename>spine.tex</filename> that is + incorrect. + </para> +</listitem> + +</itemizedlist> + + <para> + If the error at hand is not obvious after examination, or if one + encounters the inscruitable <quote>Incomplete + \ifmmode</quote> error, a fall-back strategy is to start + commenting out parts of the XML document (regardless of what + this does to over-all document validity). Start by + commenting out each of the largest parts of the + <filename>spine.xml</filename> file, section by section, + until the offending section is identified. + </para> + + + </section> + <section xml:id="docbook.validation"><info><title>Editing and Validation</title></info> <para> diff --git a/libstdc++-v3/doc/xml/manual/policy_data_structures.xml b/libstdc++-v3/doc/xml/manual/policy_data_structures.xml index 11fad5e018d..fe7e9477d3d 100644 --- a/libstdc++-v3/doc/xml/manual/policy_data_structures.xml +++ b/libstdc++-v3/doc/xml/manual/policy_data_structures.xml @@ -4996,7 +4996,7 @@ <mediaobject> <imageobject> <imagedata align="center" format="PNG" scale="100" - fileref="../images/pbds_priority_queue_tag_hierarchy.png"/> + fileref="../images/pbds_priority_queue_tag_hierarchy.png"/> </imageobject> <textobject> <phrase>Priority-Queue Data-Structure Tags.</phrase> @@ -5073,7 +5073,7 @@ <!-- S05: Reference/Acknowledgments --> <section xml:id="pbds.ack"> <info><title>Acknowledgments</title></info> - <?dbhtml filename="policy_data_structures_biblio.html"?> + <?dbhtml filename="policy_data_structures_ack.html"?> <para> Written by Ami Tavory and Vladimir Dreizin (IBM Haifa Research @@ -5123,1461 +5123,8 @@ include tries.</para> </section> - <!-- S06: Biblio --> - <bibliography xml:id="pbds.biblio"> - <info> - <title> - Bibliography - </title> - </info> - <?dbhtml filename="policy_data_structures_biblio.html"?> - - <!-- 01 --> - <biblioentry xml:id="biblio.abrahams97exception"> - <title> - <link xmlns:xlink="http://www.w3.org/1999/xlink" - xlink:href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/1997/N1075.pdf"> - STL Exception Handling Contract - </link> - </title> - <date>1997</date> - - <author> - <personname> - <firstname> - Dave - </firstname> - <surname> - Abrahams - </surname> - </personname> - </author> - - <publisher> - <publishername> - ISO SC22/WG21 - </publishername> - </publisher> - </biblioentry> - - - <!-- 02 --> - <biblioentry xml:id="biblio.alexandrescu01modern"> - <title> - Modern C++ Design: Generic Programming and Design Patterns Applied - </title> - <date> - 2001 - </date> - - <author> - <personname> - <firstname> - Andrei - </firstname> - <surname> - Alexandrescu - </surname> - </personname> - </author> - - <publisher> - <publishername> - Addison-Wesley Publishing Company - </publishername> - </publisher> - </biblioentry> - - - <!-- 03 --> - <biblioentry xml:id="biblio.andrew04mtf"> - <title> - MTF, Bit, and COMB: A Guide to Deterministic and Randomized - Algorithms for the List Update Problem - </title> - - <authorgroup> - <author> - <personname> - <firstname> - K. - </firstname> - <surname> - Andrew - </surname> - </personname> - </author> - - <author> - <personname> - <firstname> - D. - </firstname> - <surname> - Gleich - </surname> - </personname> - </author> - </authorgroup> - </biblioentry> - - <!-- 04 --> - <biblioentry xml:id="biblio.austern00noset"> - <title> - Why You Shouldn't Use set - and What You Should Use Instead - </title> - <date> - April, 2000 - </date> - - <author> - <personname> - <firstname> - Matthew - </firstname> - <surname> - Austern - </surname> - </personname> - </author> - - <publisher> - <publishername> - C++ Report - </publishername> - </publisher> - </biblioentry> - - <!-- 05 --> - <biblioentry xml:id="biblio.austern01htprop"> - <title> - <link xmlns:xlink="http://www.w3.org/1999/xlink" - xlink:href="http://www.open-std.org/JTC1/sc22/wg21/docs/papers/2001/n1326.html"> - A Proposal to Add Hashtables to the Standard Library - </link> - </title> - <date> - 2001 - </date> - - <author> - <personname> - <firstname> - Matthew - </firstname> - <surname> - Austern - </surname> - </personname> - </author> - - <publisher> - <publishername> - ISO SC22/WG21 - </publishername> - </publisher> - </biblioentry> - - <!-- 06 --> - <biblioentry xml:id="biblio.austern98segmentedit"> - <title> - Segmented iterators and hierarchical algorithms - </title> - <date> - April, 1998 - </date> - - <author> - <personname> - <firstname> - Matthew - </firstname> - <surname> - Austern - </surname> - </personname> - </author> - - <publisher> - <publishername> - Generic Programming - </publishername> - </publisher> - </biblioentry> - - <!-- 07 --> - <biblioentry xml:id="biblio.dawestimer"> - <title> - <link xmlns:xlink="http://www.w3.org/1999/xlink" - xlink:href="www.boost.org/doc/libs/release/libs/timer/"> - Boost Timer Library - </link> - </title> - - <author> - <personname> - <firstname> - Beeman - </firstname> - <surname> - Dawes - </surname> - </personname> - </author> - - <publisher> - <publishername> - Boost - </publishername> - </publisher> - </biblioentry> - - <!-- 08 --> - <biblioentry xml:id="biblio.clearypool"> - <title> - <link xmlns:xlink="http://www.w3.org/1999/xlink" - xlink:href="www.boost.org/doc/libs/release/libs/pool/"> - Boost Pool Library - </link> - </title> - - <author> - <personname> - <firstname> - Stephen - </firstname> - <surname> - Cleary - </surname> - </personname> - </author> - - <publisher> - <publishername> - Boost - </publishername> - </publisher> - </biblioentry> - - - <!-- 09 --> - <biblioentry xml:id="biblio.maddocktraits"> - <title> - <link xmlns:xlink="http://www.w3.org/1999/xlink" - xlink:href="www.boost.org/doc/libs/release/libs/type_traits/"> - Boost Type Traits Library - </link> - </title> - <authorgroup> - <author> - <personname> - <firstname> - Maddock - </firstname> - <surname> - John - </surname> - </personname> - </author> - <author> - <personname> - <firstname> - Stephen - </firstname> - <surname> - Cleary - </surname> - </personname> - </author> - </authorgroup> - <publisher> - <publishername> - Boost - </publishername> - </publisher> - </biblioentry> - - <!-- 10 --> - <biblioentry xml:id="biblio.brodal96priority"> - <title> - <link xmlns:xlink="http://www.w3.org/1999/xlink" - xlink:href="http://portal.acm.org/citation.cfm?id=313883"> - Worst-case efficient priority queues - </link> - </title> - - <author> - <personname> - <firstname> - Gerth - </firstname> - <surname> - Stolting Brodal - </surname> - </personname> - </author> - - </biblioentry> - - <!-- 11 --> - <biblioentry xml:id="biblio.bulkamayheweff"> - <title> - Efficient C++ Programming Techniques - </title> - <date> - 1997 - </date> - - <authorgroup> - <author> - <personname> - <firstname> - D. - </firstname> - <surname> - Bulka - </surname> - </personname> - </author> - <author> - <personname> - <firstname> - D. - </firstname> - <surname> - Mayhew - </surname> - </personname> - </author> - </authorgroup> - - <publisher> - <publishername> - Addison-Wesley Publishing Company - </publishername> - </publisher> - </biblioentry> - - <!-- 12 --> - <biblioentry xml:id="biblio.clrs2001"> - <title> - Introduction to Algorithms, 2nd edition - </title> - <date> - 2001 - </date> - <authorgroup> - <author> - <personname> - <firstname> - T. H. - </firstname> - <surname> - Cormen - </surname> - </personname> - </author> - - <author> - <personname> - <firstname> - C. E. - </firstname> - <surname> - Leiserson - </surname> - </personname> - </author> - - <author> - <personname> - <firstname> - R. L. - </firstname> - <surname> - Rivest - </surname> - </personname> - </author> - - <author> - <personname> - <firstname> - C. - </firstname> - <surname> - Stein - </surname> - </personname> - </author> - </authorgroup> - <publisher> - <publishername> - MIT Press - </publishername> - </publisher> - </biblioentry> - - <!-- 13 --> - <biblioentry xml:id="biblio.dubhashi98neg"> - <title> - Balls and bins: A study in negative dependence - </title> - <date> - 1998 - </date> - <authorgroup> - <author> - <personname> - <firstname> - D. - </firstname> - <surname> - Dubashi - </surname> - </personname> - </author> - <author> - <personname> - <firstname> - D. - </firstname> - <surname> - Ranjan - </surname> - </personname> - </author> - </authorgroup> - - <publisher> - <publishername> - Random Structures and Algorithms 13 - </publishername> - </publisher> - </biblioentry> - - - <!-- 14 --> - <biblioentry xml:id="biblio.fagin79extendible"> - <title> - Extendible hashing - a fast access method for dynamic files - </title> - <date> - 1979 - </date> - - <authorgroup> - <author> - <personname> - <firstname> - R. - </firstname> - <surname> - Fagin - </surname> - </personname> - </author> - <author> - <personname> - <firstname> - J. - </firstname> - <surname> - Nievergelt - </surname> - </personname> - </author> - <author> - <personname> - <firstname> - N. - </firstname> - <surname> - Pippenger - </surname> - </personname> - </author> - <author> - <personname> - <firstname> - H. R. - </firstname> - <surname> - Strong - </surname> - </personname> - </author> - </authorgroup> - - <publisher> - <publishername> - ACM Trans. Database Syst. 4 - </publishername> - </publisher> - </biblioentry> - - - - <!-- 15 --> - <biblioentry xml:id="biblio.filliatre2000ptset"> - <title> - <link xmlns:xlink="http://www.w3.org/1999/xlink" - xlink:href="http://cristal.inria.fr/~frisch/icfp06_contest/advtr/applyOmatic/ptset.ml"> - Ptset: Sets of integers implemented as Patricia trees - </link> - </title> - - <date> - 2000 - </date> - - <author> - <personname> - <firstname> - Jean-Christophe - </firstname> - <surname> - Filliatre - </surname> - </personname> - </author> - </biblioentry> - - - - <!-- 16 --> - <biblioentry xml:id="biblio.fredman86pairing"> - <title> - <link xmlns:xlink="http://www.w3.org/1999/xlink" - xlink:href="http://www.cs.cmu.edu/~sleator/papers/pairing-heaps.pdf"> - The pairing heap: a new form of self-adjusting heap - </link> - </title> - <date> - 1986 - </date> - <authorgroup> - <author> - <personname> - <firstname> - M. L. - </firstname> - <surname> - Fredman - </surname> - </personname> - </author> - <author> - <personname> - <firstname> - R. - </firstname> - <surname> - Sedgewick - </surname> - </personname> - </author> - <author> - <personname> - <firstname> - D. D. - </firstname> - <surname> - Sleator - </surname> - </personname> - </author> - <author> - <personname> - <firstname> - R. E. - </firstname> - <surname> - Tarjan - </surname> - </personname> - </author> - </authorgroup> - </biblioentry> - - - <!-- 17 --> - <biblioentry xml:id="biblio.gof"> - <title> - Design Patterns - Elements of Reusable Object-Oriented Software - </title> - <date> - 1995 - </date> - <authorgroup> - <author> - <personname> - <firstname> - E. - </firstname> - <surname> - Gamma - </surname> - </personname> - </author> - <author> - <personname> - <firstname> - R. - </firstname> - <surname> - Helm - </surname> - </personname> - </author> - <author> - <personname> - <firstname> - R. - </firstname> - <surname> - Johnson - </surname> - </personname> - </author> - <author> - <personname> - <firstname> - J. - </firstname> - <surname> - Vlissides - </surname> - </personname> - </author> - </authorgroup> - <publisher> - <publishername> - Addison-Wesley Publishing Company - </publishername> - </publisher> - </biblioentry> - - - <!-- 18 --> - <biblioentry xml:id="biblio.garg86order"> - <title> - Order-preserving key transformations - </title> - <date> - 1986 - </date> - <authorgroup> - <author> - <personname> - <firstname> - A. K. - </firstname> - <surname> - Garg - </surname> - </personname> - </author> - <author> - <personname> - <firstname> - C. C. - </firstname> - <surname> - Gotlieb - </surname> - </personname> - </author> - </authorgroup> - - <publisher> - <publishername> - Trans. Database Syst. 11 - </publishername> - </publisher> - </biblioentry> - - <!-- 19 --> - <biblioentry xml:id="biblio.hyslop02making"> - <title> - Making a real hash of things - </title> - <date> - May 2002 - </date> - <authorgroup> - <author> - <personname> - <firstname> - J. - </firstname> - <surname> - Hyslop - </surname> - </personname> - </author> - <author> - <personname> - <firstname> - Herb - </firstname> - <surname> - Sutter - </surname> - </personname> - </author> - </authorgroup> - - <publisher> - <publishername> - C++ Report - </publishername> - </publisher> - </biblioentry> - - - <!-- 20 --> - <biblioentry xml:id="biblio.jossutis01stl"> - <title> - The C++ Standard Library - A Tutorial and Reference - </title> - <date> - 2001 - </date> - - <author> - <personname> - <firstname> - N. M. - </firstname> - <surname> - Jossutis - </surname> - </personname> - </author> - <publisher> - <publishername> - Addison-Wesley Publishing Company - </publishername> - </publisher> - </biblioentry> - - <!-- 21 --> - <biblioentry xml:id="biblio.kt99fat_heaps"> - <title> - <link xmlns:xlink="http://www.w3.org/1999/xlink" - xlink:href="http://www.cs.princeton.edu/research/techreps/TR-597-99"> - New Heap Data Structures - </link> - </title> - <date> - 1999 - </date> - - <authorgroup> - <author> - <personname> - <firstname> - Haim - </firstname> - <surname> - Kaplan - </surname> - </personname> - </author> - <author> - <personname> - <firstname> - Robert E. - </firstname> - <surname> - Tarjan - </surname> - </personname> - </author> - </authorgroup> - </biblioentry> - - - <!-- 22 --> - <biblioentry xml:id="biblio.kleft00sets"> - <title> - Are Set Iterators Mutable or Immutable? - </title> - <date> - October 2000 - </date> - <authorgroup> - <author> - <personname> - <firstname> - Angelika - </firstname> - <surname> - Langer - </surname> - </personname> - </author> - - <author> - <personname> - <firstname> - Klaus - </firstname> - <surname> - Kleft - </surname> - </personname> - </author> - </authorgroup> - - <publisher> - <publishername> - C/C++ Users Jornal - </publishername> - </publisher> - </biblioentry> - - <!-- 23 --> - <biblioentry xml:id="biblio.knuth98sorting"> - <title> - The Art of Computer Programming - Sorting and Searching - </title> - <date> - 1998 - </date> - - <author> - <personname> - <firstname> - D. E. - </firstname> - <surname> - Knuth - </surname> - </personname> - </author> - - <publisher> - <publishername> - Addison-Wesley Publishing Company - </publishername> - </publisher> - </biblioentry> - - <!-- 24 --> - <biblioentry xml:id="biblio.liskov98data"> - <title> - Data abstraction and hierarchy - </title> - <date> - May 1998 - </date> - - <author> - <personname> - <firstname> - B. - </firstname> - <surname> - Liskov - </surname> - </personname> - </author> - - <publisher> - <publishername> - SIGPLAN Notices 23 - </publishername> - </publisher> - </biblioentry> - - <!-- 25 --> - <biblioentry xml:id="biblio.litwin80lh"> - <title> - Linear hashing: A new tool for file and table addressing - </title> - <date> - June 1980 - </date> - - <author> - <personname> - <firstname> - W. - </firstname> - <surname> - Litwin - </surname> - </personname> - </author> - - <publisher> - <publishername> - Proceedings of International Conference on Very Large Data Bases - </publishername> - </publisher> - </biblioentry> - - <!-- 26 --> - <biblioentry xml:id="biblio.maverik_lowerbounds"> - <title> - <link xmlns:xlink="http://www.w3.org/1999/xlink" - xlink:href="http://magic.aladdin.cs.cmu.edu/2005/08/01/deamortization-part-2-binomial-heaps"> - Deamortization - Part 2: Binomial Heaps - </link> - </title> - <date> - 2005 - </date> - - <author> - <personname> - <firstname> - Maverik - </firstname> - <surname> - Woo - </surname> - </personname> - </author> - </biblioentry> - - <!-- 27 --> - <biblioentry xml:id="biblio.meyers96more"> - <title> - More Effective C++: 35 New Ways to Improve Your Programs and Designs - </title> - <date> - 1996 - </date> - - <author> - <personname> - <firstname> - Scott - </firstname> - <surname> - Meyers - </surname> - </personname> - </author> - - <publisher> - <publishername> - Addison-Wesley Publishing Company - </publishername> - </publisher> - </biblioentry> - - <!-- 28 --> - <biblioentry xml:id="biblio.meyers00nonmember"> - <title> - How Non-Member Functions Improve Encapsulation - </title> - <date> - 2000 - </date> - - <author> - <personname> - <firstname> - Scott - </firstname> - <surname> - Meyers - </surname> - </personname> - </author> - - <publisher> - <publishername> - C/C++ Users Journal - </publishername> - </publisher> - </biblioentry> - - <!-- 29 --> - <biblioentry xml:id="biblio.meyers01stl"> - <title> - Effective STL: 50 Specific Ways to Improve Your Use of the Standard Template Library - </title> - <date> - 2001 - </date> - - <author> - <personname> - <firstname> - Scott - </firstname> - <surname> - Meyers - </surname> - </personname> - </author> - - <publisher> - <publishername> - Addison-Wesley Publishing Company - </publishername> - </publisher> - </biblioentry> - - <!-- 30 --> - <biblioentry xml:id="biblio.meyers02both"> - <title> - Class Template, Member Template - or Both? - </title> - <date> - 2003 - </date> - - <author> - <personname> - <firstname> - Scott - </firstname> - <surname> - Meyers - </surname> - </personname> - </author> - - <publisher> - <publishername> - C/C++ Users Journal - </publishername> - </publisher> - </biblioentry> - - <!-- 31 --> - <biblioentry xml:id="biblio.motwani95random"> - <title> - Randomized Algorithms - </title> - <date> - 2003 - </date> - <authorgroup> - <author> - <personname> - <firstname> - R. - </firstname> - <surname> - Motwani - </surname> - </personname> - </author> - <author> - <personname> - <firstname> - P. - </firstname> - <surname> - Raghavan - </surname> - </personname> - </author> - </authorgroup> - <publisher> - <publishername> - Cambridge University Press - </publishername> - </publisher> - </biblioentry> - - - <!-- 32 --> - <biblioentry xml:id="biblio.mscom"> - <title> - <link xmlns:xlink="http://www.w3.org/1999/xlink" - xlink:href="http://www.microsoft.com/com"> - COM: Component Model Object Technologies - </link> - </title> - <publisher> - <publishername> - Microsoft - </publishername> - </publisher> - </biblioentry> - - <!-- 33 --> - <biblioentry xml:id="biblio.musser95rationale"> - <title> - Rationale for Adding Hash Tables to the C++ Standard Template Library - </title> - <date> - 1995 - </date> - - <author> - <personname> - <firstname> - David R. - </firstname> - <surname> - Musser - </surname> - </personname> - </author> - - </biblioentry> - - <!-- 35 --> - <biblioentry xml:id="biblio.musser96stltutorial"> - <title> - STL Tutorial and Reference Guide - </title> - <date> - 1996 - </date> - - <authorgroup> - <author> - <personname> - <firstname> - David R. - </firstname> - <surname> - Musser - </surname> - </personname> - </author> - <author> - <personname> - <firstname> - A. - </firstname> - <surname> - Saini - </surname> - </personname> - </author> - </authorgroup> - <publisher> - <publishername> - Addison-Wesley Publishing Company - </publishername> - </publisher> - - </biblioentry> - - - <!-- 36 --> - <biblioentry xml:id="biblio.nelson96stlpq"> - <title> - <link xmlns:xlink="http://www.w3.org/1999/xlink" - xlink:href="http://www.dogma.net/markn/articles/pq_stl/priority.htm">Priority Queues and the STL - </link> - </title> - <date> - January 1996 - </date> - - <author> - <personname> - <firstname> - Mark - </firstname> - <surname> - Nelson - </surname> - </personname> - </author> - - <publisher> - <publishername> - Dr. Dobbs Journal - </publishername> - </publisher> - </biblioentry> - - - <!-- 37 --> - <biblioentry xml:id="biblio.okasaki98mereable"> - <title> - Fast mergeable integer maps - </title> - <date> - September 1998 - </date> - <authorgroup> - <author> - <personname> - <firstname> - C. - </firstname> - <surname> - Okasaki - </surname> - </personname> - </author> - <author> - <personname> - <firstname> - A. - </firstname> - <surname> - Gill - </surname> - </personname> - </author> - </authorgroup> - <publisher> - <publishername> - In Workshop on ML - </publishername> - </publisher> - </biblioentry> - - <!-- 38 --> - <biblioentry xml:id="biblio.sgi_stl"> - <title> - <link xmlns:xlink="http://www.w3.org/1999/xlink" - xlink:href="http://www.sgi.com/tech/stl"> - Standard Template Library Programmer's Guide - </link> - </title> - <author> - <personname> - <firstname> - Matt - </firstname> - <surname> - Austern - </surname> - </personname> - </author> - - <publisher> - <publishername> - SGI - </publishername> - </publisher> - </biblioentry> - - <!-- 39 --> - <biblioentry xml:id="biblio.select_man"> - <title> - <link xmlns:xlink="http://www.w3.org/1999/xlink" - xlink:href="http://www.scit.wlv.ac.uk/cgi-bin/mansec?3C+select"> - select - </link> - </title> - </biblioentry> - - - <!-- 40 --> - <biblioentry xml:id="biblio.sleator84amortized"> - <title> - Amortized Efficiency of List Update Problems - </title> - <date> - 1984 - </date> - <authorgroup> - <author> - <personname> - <firstname> - D. D. - </firstname> - <surname> - Sleator - </surname> - </personname> - </author> - - <author> - <personname> - <firstname> - R. E. - </firstname> - <surname> - Tarjan - </surname> - </personname> - </author> - </authorgroup> - - <publisher> - <publishername> - ACM Symposium on Theory of Computing - </publishername> - </publisher> - </biblioentry> - - <!-- 41 --> - <biblioentry xml:id="biblio.sleator85self"> - <title> - Self-Adjusting Binary Search Trees - </title> - <date> - 1985 - </date> - - <authorgroup> - <author> - <personname> - <firstname> - D. D. - </firstname> - <surname> - Sleator - </surname> - </personname> - </author> - - <author> - <personname> - <firstname> - R. E. - </firstname> - <surname> - Tarjan - </surname> - </personname> - </author> - </authorgroup> - - <publisher> - <publishername> - ACM Symposium on Theory of Computing - </publishername> - </publisher> - </biblioentry> - - <!-- 42 --> - <biblioentry xml:id="biblio.stepanov94standard"> - <title> - The Standard Template Library - </title> - <date> - 1984 - </date> - <authorgroup> - <author> - <personname> - <firstname> - A. A. - </firstname> - <surname> - Stepanov - </surname> - </personname> - </author> - <author> - <personname> - <firstname> - M. - </firstname> - <surname> - Lee - </surname> - </personname> - </author> - </authorgroup> - </biblioentry> - - <!-- 43 --> - <biblioentry xml:id="biblio.stroustrup97cpp"> - <title> - The C++ Programming Langugage - </title> - <date> - 1997 - </date> - - <author> - <personname> - <firstname> - Bjarne - </firstname> - <surname> - Stroustrup - </surname> - </personname> - </author> - - <publisher> - <publishername> - Addison-Wesley Publishing Company - </publishername> - </publisher> - </biblioentry> - - <!-- 44 --> - <biblioentry xml:id="biblio.vandevoorde2002cpptemplates"> - <title> - C++ Templates: The Complete Guide - </title> - <date> - 2002 - </date> - <authorgroup> - <author> - <personname> - <firstname> - D. - </firstname> - <surname> - Vandevoorde - </surname> - </personname> - </author> - - <author> - <personname> - <firstname> - N. M. - </firstname> - <surname> - Josuttis - </surname> - </personname> - </author> - </authorgroup> - <publisher> - <publishername> - Addison-Wesley Publishing Company - </publishername> - </publisher> - </biblioentry> - - - <!-- 45 --> - <biblioentry xml:id="biblio.wickland96thirty"> - <title> - <link xmlns:xlink="http://www.w3.org/1999/xlink" - xlink:href="http://myweb.wvnet.edu/~gsa00121/books/amongdead30.zip"> - Thirty Years Among the Dead - </link> - </title> - <date> - 1996 - </date> - - <author> - <personname> - <firstname> - C. A. - </firstname> - <surname> - Wickland - </surname> - </personname> - </author> - - <publisher> - <publishername> - National Psychological Institute - </publishername> - </publisher> - </biblioentry> - - - </bibliography> +<xi:include xmlns:xi="http://www.w3.org/2001/XInclude" parse="xml" + href="policy_data_structures_biblio.xml"> +</xi:include> </chapter> diff --git a/libstdc++-v3/doc/xml/manual/policy_data_structures_biblio.xml b/libstdc++-v3/doc/xml/manual/policy_data_structures_biblio.xml new file mode 100644 index 00000000000..11f798fd232 --- /dev/null +++ b/libstdc++-v3/doc/xml/manual/policy_data_structures_biblio.xml @@ -0,0 +1,1452 @@ + +<!-- Policy Based Data Structures: Biblio --> +<bibliography xmlns="http://docbook.org/ns/docbook" version="5.0" + xml:id="pbds.biblio" xreflabel="Bibliography"> + <info><title>Bibliography</title></info> + + <!-- 01 --> + <biblioentry xml:id="biblio.abrahams97exception"> + <title> + <link xmlns:xlink="http://www.w3.org/1999/xlink" + xlink:href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/1997/N1075.pdf"> + STL Exception Handling Contract + </link> + </title> + <date>1997</date> + + <author> + <personname> + <firstname> + Dave + </firstname> + <surname> + Abrahams + </surname> + </personname> + </author> + + <publisher> + <publishername> + ISO SC22/WG21 + </publishername> + </publisher> + </biblioentry> + + + <!-- 02 --> + <biblioentry xml:id="biblio.alexandrescu01modern"> + <title> + Modern C++ Design: Generic Programming and Design Patterns Applied + </title> + <date> + 2001 + </date> + + <author> + <personname> + <firstname> + Andrei + </firstname> + <surname> + Alexandrescu + </surname> + </personname> + </author> + + <publisher> + <publishername> + Addison-Wesley Publishing Company + </publishername> + </publisher> + </biblioentry> + + + <!-- 03 --> + <biblioentry xml:id="biblio.andrew04mtf"> + <title> + MTF, Bit, and COMB: A Guide to Deterministic and Randomized + Algorithms for the List Update Problem + </title> + + <authorgroup> + <author> + <personname> + <firstname> + K. + </firstname> + <surname> + Andrew + </surname> + </personname> + </author> + + <author> + <personname> + <firstname> + D. + </firstname> + <surname> + Gleich + </surname> + </personname> + </author> + </authorgroup> + </biblioentry> + + <!-- 04 --> + <biblioentry xml:id="biblio.austern00noset"> + <title> + Why You Shouldn't Use set - and What You Should Use Instead + </title> + <date> + April, 2000 + </date> + + <author> + <personname> + <firstname> + Matthew + </firstname> + <surname> + Austern + </surname> + </personname> + </author> + + <publisher> + <publishername> + C++ Report + </publishername> + </publisher> + </biblioentry> + + <!-- 05 --> + <biblioentry xml:id="biblio.austern01htprop"> + <title> + <link xmlns:xlink="http://www.w3.org/1999/xlink" + xlink:href="http://www.open-std.org/JTC1/sc22/wg21/docs/papers/2001/n1326.html"> + A Proposal to Add Hashtables to the Standard Library + </link> + </title> + <date> + 2001 + </date> + + <author> + <personname> + <firstname> + Matthew + </firstname> + <surname> + Austern + </surname> + </personname> + </author> + + <publisher> + <publishername> + ISO SC22/WG21 + </publishername> + </publisher> + </biblioentry> + + <!-- 06 --> + <biblioentry xml:id="biblio.austern98segmentedit"> + <title> + Segmented iterators and hierarchical algorithms + </title> + <date> + April, 1998 + </date> + + <author> + <personname> + <firstname> + Matthew + </firstname> + <surname> + Austern + </surname> + </personname> + </author> + + <publisher> + <publishername> + Generic Programming + </publishername> + </publisher> + </biblioentry> + + <!-- 07 --> + <biblioentry xml:id="biblio.dawestimer"> + <title> + <link xmlns:xlink="http://www.w3.org/1999/xlink" + xlink:href="www.boost.org/doc/libs/release/libs/timer/"> + Boost Timer Library + </link> + </title> + + <author> + <personname> + <firstname> + Beeman + </firstname> + <surname> + Dawes + </surname> + </personname> + </author> + + <publisher> + <publishername> + Boost + </publishername> + </publisher> + </biblioentry> + + <!-- 08 --> + <biblioentry xml:id="biblio.clearypool"> + <title> + <link xmlns:xlink="http://www.w3.org/1999/xlink" + xlink:href="www.boost.org/doc/libs/release/libs/pool/"> + Boost Pool Library + </link> + </title> + + <author> + <personname> + <firstname> + Stephen + </firstname> + <surname> + Cleary + </surname> + </personname> + </author> + + <publisher> + <publishername> + Boost + </publishername> + </publisher> + </biblioentry> + + + <!-- 09 --> + <biblioentry xml:id="biblio.maddocktraits"> + <title> + <link xmlns:xlink="http://www.w3.org/1999/xlink" + xlink:href="www.boost.org/doc/libs/release/libs/type_traits/"> + Boost Type Traits Library + </link> + </title> + <authorgroup> + <author> + <personname> + <firstname> + Maddock + </firstname> + <surname> + John + </surname> + </personname> + </author> + <author> + <personname> + <firstname> + Stephen + </firstname> + <surname> + Cleary + </surname> + </personname> + </author> + </authorgroup> + <publisher> + <publishername> + Boost + </publishername> + </publisher> + </biblioentry> + + <!-- 10 --> + <biblioentry xml:id="biblio.brodal96priority"> + <title> + <link xmlns:xlink="http://www.w3.org/1999/xlink" + xlink:href="https://dl.acm.org/citation.cfm?id=313883"> + Worst-case efficient priority queues + </link> + </title> + + <author> + <personname> + <firstname> + Gerth + </firstname> + <surname> + Stolting Brodal + </surname> + </personname> + </author> + + </biblioentry> + + <!-- 11 --> + <biblioentry xml:id="biblio.bulkamayheweff"> + <title> + Efficient C++ Programming Techniques + </title> + <date> + 1997 + </date> + + <authorgroup> + <author> + <personname> + <firstname> + D. + </firstname> + <surname> + Bulka + </surname> + </personname> + </author> + <author> + <personname> + <firstname> + D. + </firstname> + <surname> + Mayhew + </surname> + </personname> + </author> + </authorgroup> + + <publisher> + <publishername> + Addison-Wesley Publishing Company + </publishername> + </publisher> + </biblioentry> + + <!-- 12 --> + <biblioentry xml:id="biblio.clrs2001"> + <title> + Introduction to Algorithms, 2nd edition + </title> + <date> + 2001 + </date> + <authorgroup> + <author> + <personname> + <firstname> + T. H. + </firstname> + <surname> + Cormen + </surname> + </personname> + </author> + + <author> + <personname> + <firstname> + C. E. + </firstname> + <surname> + Leiserson + </surname> + </personname> + </author> + + <author> + <personname> + <firstname> + R. L. + </firstname> + <surname> + Rivest + </surname> + </personname> + </author> + + <author> + <personname> + <firstname> + C. + </firstname> + <surname> + Stein + </surname> + </personname> + </author> + </authorgroup> + <publisher> + <publishername> + MIT Press + </publishername> + </publisher> + </biblioentry> + + <!-- 13 --> + <biblioentry xml:id="biblio.dubhashi98neg"> + <title> + Balls and bins: A study in negative dependence + </title> + <date> + 1998 + </date> + <authorgroup> + <author> + <personname> + <firstname> + D. + </firstname> + <surname> + Dubashi + </surname> + </personname> + </author> + <author> + <personname> + <firstname> + D. + </firstname> + <surname> + Ranjan + </surname> + </personname> + </author> + </authorgroup> + + <publisher> + <publishername> + Random Structures and Algorithms 13 + </publishername> + </publisher> + </biblioentry> + + + <!-- 14 --> + <biblioentry xml:id="biblio.fagin79extendible"> + <title> + Extendible hashing - a fast access method for dynamic files + </title> + <date> + 1979 + </date> + + <authorgroup> + <author> + <personname> + <firstname> + R. + </firstname> + <surname> + Fagin + </surname> + </personname> + </author> + <author> + <personname> + <firstname> + J. + </firstname> + <surname> + Nievergelt + </surname> + </personname> + </author> + <author> + <personname> + <firstname> + N. + </firstname> + <surname> + Pippenger + </surname> + </personname> + </author> + <author> + <personname> + <firstname> + H. R. + </firstname> + <surname> + Strong + </surname> + </personname> + </author> + </authorgroup> + + <publisher> + <publishername> + ACM Trans. Database Syst. 4 + </publishername> + </publisher> + </biblioentry> + + + + <!-- 15 --> + <biblioentry xml:id="biblio.filliatre2000ptset"> + <title> + <link xmlns:xlink="http://www.w3.org/1999/xlink" + xlink:href="http://cristal.inria.fr/~frisch/icfp06_contest/advtr/applyOmatic/ptset.ml"> + Ptset: Sets of integers implemented as Patricia trees + </link> + </title> + + <date> + 2000 + </date> + + <author> + <personname> + <firstname> + Jean-Christophe + </firstname> + <surname> + Filliatre + </surname> + </personname> + </author> + </biblioentry> + + + + <!-- 16 --> + <biblioentry xml:id="biblio.fredman86pairing"> + <title> + <link xmlns:xlink="http://www.w3.org/1999/xlink" + xlink:href="http://www.cs.cmu.edu/~sleator/papers/pairing-heaps.pdf"> + The pairing heap: a new form of self-adjusting heap + </link> + </title> + <date> + 1986 + </date> + <authorgroup> + <author> + <personname> + <firstname> + M. L. + </firstname> + <surname> + Fredman + </surname> + </personname> + </author> + <author> + <personname> + <firstname> + R. + </firstname> + <surname> + Sedgewick + </surname> + </personname> + </author> + <author> + <personname> + <firstname> + D. D. + </firstname> + <surname> + Sleator + </surname> + </personname> + </author> + <author> + <personname> + <firstname> + R. E. + </firstname> + <surname> + Tarjan + </surname> + </personname> + </author> + </authorgroup> + </biblioentry> + + + <!-- 17 --> + <biblioentry xml:id="biblio.gof"> + <title> + Design Patterns - Elements of Reusable Object-Oriented Software + </title> + <date> + 1995 + </date> + <authorgroup> + <author> + <personname> + <firstname> + E. + </firstname> + <surname> + Gamma + </surname> + </personname> + </author> + <author> + <personname> + <firstname> + R. + </firstname> + <surname> + Helm + </surname> + </personname> + </author> + <author> + <personname> + <firstname> + R. + </firstname> + <surname> + Johnson + </surname> + </personname> + </author> + <author> + <personname> + <firstname> + J. + </firstname> + <surname> + Vlissides + </surname> + </personname> + </author> + </authorgroup> + <publisher> + <publishername> + Addison-Wesley Publishing Company + </publishername> + </publisher> + </biblioentry> + + + <!-- 18 --> + <biblioentry xml:id="biblio.garg86order"> + <title> + Order-preserving key transformations + </title> + <date> + 1986 + </date> + <authorgroup> + <author> + <personname> + <firstname> + A. K. + </firstname> + <surname> + Garg + </surname> + </personname> + </author> + <author> + <personname> + <firstname> + C. C. + </firstname> + <surname> + Gotlieb + </surname> + </personname> + </author> + </authorgroup> + + <publisher> + <publishername> + Trans. Database Syst. 11 + </publishername> + </publisher> + </biblioentry> + + <!-- 19 --> + <biblioentry xml:id="biblio.hyslop02making"> + <title> + Making a real hash of things + </title> + <date> + May 2002 + </date> + <authorgroup> + <author> + <personname> + <firstname> + J. + </firstname> + <surname> + Hyslop + </surname> + </personname> + </author> + <author> + <personname> + <firstname> + Herb + </firstname> + <surname> + Sutter + </surname> + </personname> + </author> + </authorgroup> + + <publisher> + <publishername> + C++ Report + </publishername> + </publisher> + </biblioentry> + + + <!-- 20 --> + <biblioentry xml:id="biblio.jossutis01stl"> + <title> + The C++ Standard Library - A Tutorial and Reference + </title> + <date> + 2001 + </date> + + <author> + <personname> + <firstname> + N. M. + </firstname> + <surname> + Jossutis + </surname> + </personname> + </author> + <publisher> + <publishername> + Addison-Wesley Publishing Company + </publishername> + </publisher> + </biblioentry> + + <!-- 21 --> + <biblioentry xml:id="biblio.kt99fat_heaps"> + <title> + <link xmlns:xlink="http://www.w3.org/1999/xlink" + xlink:href="http://www.cs.princeton.edu/research/techreps/TR-597-99"> + New Heap Data Structures + </link> + </title> + <date> + 1999 + </date> + + <authorgroup> + <author> + <personname> + <firstname> + Haim + </firstname> + <surname> + Kaplan + </surname> + </personname> + </author> + <author> + <personname> + <firstname> + Robert E. + </firstname> + <surname> + Tarjan + </surname> + </personname> + </author> + </authorgroup> + </biblioentry> + + + <!-- 22 --> + <biblioentry xml:id="biblio.kleft00sets"> + <title> + Are Set Iterators Mutable or Immutable? + </title> + <date> + October 2000 + </date> + <authorgroup> + <author> + <personname> + <firstname> + Angelika + </firstname> + <surname> + Langer + </surname> + </personname> + </author> + + <author> + <personname> + <firstname> + Klaus + </firstname> + <surname> + Kleft + </surname> + </personname> + </author> + </authorgroup> + + <publisher> + <publishername> + C/C++ Users Jornal + </publishername> + </publisher> + </biblioentry> + + <!-- 23 --> + <biblioentry xml:id="biblio.knuth98sorting"> + <title> + The Art of Computer Programming - Sorting and Searching + </title> + <date> + 1998 + </date> + + <author> + <personname> + <firstname> + D. E. + </firstname> + <surname> + Knuth + </surname> + </personname> + </author> + + <publisher> + <publishername> + Addison-Wesley Publishing Company + </publishername> + </publisher> + </biblioentry> + + <!-- 24 --> + <biblioentry xml:id="biblio.liskov98data"> + <title> + Data abstraction and hierarchy + </title> + <date> + May 1998 + </date> + + <author> + <personname> + <firstname> + B. + </firstname> + <surname> + Liskov + </surname> + </personname> + </author> + + <publisher> + <publishername> + SIGPLAN Notices 23 + </publishername> + </publisher> + </biblioentry> + + <!-- 25 --> + <biblioentry xml:id="biblio.litwin80lh"> + <title> + Linear hashing: A new tool for file and table addressing + </title> + <date> + June 1980 + </date> + + <author> + <personname> + <firstname> + W. + </firstname> + <surname> + Litwin + </surname> + </personname> + </author> + + <publisher> + <publishername> + Proceedings of International Conference on Very Large Data Bases + </publishername> + </publisher> + </biblioentry> + + <!-- 26 --> + <biblioentry xml:id="biblio.maverik_lowerbounds"> + <title> + <link xmlns:xlink="http://www.w3.org/1999/xlink" + xlink:href="http://magic.aladdin.cs.cmu.edu/2005/08/01/deamortization-part-2-binomial-heaps"> + Deamortization - Part 2: Binomial Heaps + </link> + </title> + <date> + 2005 + </date> + + <author> + <personname> + <firstname> + Maverik + </firstname> + <surname> + Woo + </surname> + </personname> + </author> + </biblioentry> + + <!-- 27 --> + <biblioentry xml:id="biblio.meyers96more"> + <title> + More Effective C++: 35 New Ways to Improve Your Programs and Designs + </title> + <date> + 1996 + </date> + + <author> + <personname> + <firstname> + Scott + </firstname> + <surname> + Meyers + </surname> + </personname> + </author> + + <publisher> + <publishername> + Addison-Wesley Publishing Company + </publishername> + </publisher> + </biblioentry> + + <!-- 28 --> + <biblioentry xml:id="biblio.meyers00nonmember"> + <title> + How Non-Member Functions Improve Encapsulation + </title> + <date> + 2000 + </date> + + <author> + <personname> + <firstname> + Scott + </firstname> + <surname> + Meyers + </surname> + </personname> + </author> + + <publisher> + <publishername> + C/C++ Users Journal + </publishername> + </publisher> + </biblioentry> + + <!-- 29 --> + <biblioentry xml:id="biblio.meyers01stl"> + <title> + Effective STL: 50 Specific Ways to Improve Your Use of the Standard Template Library + </title> + <date> + 2001 + </date> + + <author> + <personname> + <firstname> + Scott + </firstname> + <surname> + Meyers + </surname> + </personname> + </author> + + <publisher> + <publishername> + Addison-Wesley Publishing Company + </publishername> + </publisher> + </biblioentry> + + <!-- 30 --> + <biblioentry xml:id="biblio.meyers02both"> + <title> + Class Template, Member Template - or Both? + </title> + <date> + 2003 + </date> + + <author> + <personname> + <firstname> + Scott + </firstname> + <surname> + Meyers + </surname> + </personname> + </author> + + <publisher> + <publishername> + C/C++ Users Journal + </publishername> + </publisher> + </biblioentry> + + <!-- 31 --> + <biblioentry xml:id="biblio.motwani95random"> + <title> + Randomized Algorithms + </title> + <date> + 2003 + </date> + <authorgroup> + <author> + <personname> + <firstname> + R. + </firstname> + <surname> + Motwani + </surname> + </personname> + </author> + <author> + <personname> + <firstname> + P. + </firstname> + <surname> + Raghavan + </surname> + </personname> + </author> + </authorgroup> + <publisher> + <publishername> + Cambridge University Press + </publishername> + </publisher> + </biblioentry> + + + <!-- 32 --> + <biblioentry xml:id="biblio.mscom"> + <title> + <link xmlns:xlink="http://www.w3.org/1999/xlink" + xlink:href="https://www.microsoft.com/com/"> + COM: Component Model Object Technologies + </link> + </title> + <publisher> + <publishername> + Microsoft + </publishername> + </publisher> + </biblioentry> + + <!-- 33 --> + <biblioentry xml:id="biblio.musser95rationale"> + <title> + Rationale for Adding Hash Tables to the C++ Standard Template Library + </title> + <date> + 1995 + </date> + + <author> + <personname> + <firstname> + David R. + </firstname> + <surname> + Musser + </surname> + </personname> + </author> + + </biblioentry> + + <!-- 35 --> + <biblioentry xml:id="biblio.musser96stltutorial"> + <title> + STL Tutorial and Reference Guide + </title> + <date> + 1996 + </date> + + <authorgroup> + <author> + <personname> + <firstname> + David R. + </firstname> + <surname> + Musser + </surname> + </personname> + </author> + <author> + <personname> + <firstname> + A. + </firstname> + <surname> + Saini + </surname> + </personname> + </author> + </authorgroup> + <publisher> + <publishername> + Addison-Wesley Publishing Company + </publishername> + </publisher> + + </biblioentry> + + + <!-- 36 --> + <biblioentry xml:id="biblio.nelson96stlpq"> + <title> + <link xmlns:xlink="http://www.w3.org/1999/xlink" + xlink:href="http://www.dogma.net/markn/articles/pq_stl/priority.htm">Priority Queues and the STL + </link> + </title> + <date> + January 1996 + </date> + + <author> + <personname> + <firstname> + Mark + </firstname> + <surname> + Nelson + </surname> + </personname> + </author> + + <publisher> + <publishername> + Dr. Dobbs Journal + </publishername> + </publisher> + </biblioentry> + + + <!-- 37 --> + <biblioentry xml:id="biblio.okasaki98mereable"> + <title> + Fast mergeable integer maps + </title> + <date> + September 1998 + </date> + <authorgroup> + <author> + <personname> + <firstname> + C. + </firstname> + <surname> + Okasaki + </surname> + </personname> + </author> + <author> + <personname> + <firstname> + A. + </firstname> + <surname> + Gill + </surname> + </personname> + </author> + </authorgroup> + <publisher> + <publishername> + In Workshop on ML + </publishername> + </publisher> + </biblioentry> + + <!-- 38 --> + <biblioentry xml:id="biblio.sgi_stl"> + <title> + <link xmlns:xlink="http://www.w3.org/1999/xlink" + xlink:href="http://www.sgi.com/tech/stl/"> + Standard Template Library Programmer's Guide + </link> + </title> + <author> + <personname> + <firstname> + Matt + </firstname> + <surname> + Austern + </surname> + </personname> + </author> + + <publisher> + <publishername> + SGI + </publishername> + </publisher> + </biblioentry> + + <!-- 39 --> + <biblioentry xml:id="biblio.select_man"> + <title> + <link xmlns:xlink="http://www.w3.org/1999/xlink" + xlink:href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/select.html"> + select + </link> + </title> + </biblioentry> + + + <!-- 40 --> + <biblioentry xml:id="biblio.sleator84amortized"> + <title> + Amortized Efficiency of List Update Problems + </title> + <date> + 1984 + </date> + <authorgroup> + <author> + <personname> + <firstname> + D. D. + </firstname> + <surname> + Sleator + </surname> + </personname> + </author> + + <author> + <personname> + <firstname> + R. E. + </firstname> + <surname> + Tarjan + </surname> + </personname> + </author> + </authorgroup> + + <publisher> + <publishername> + ACM Symposium on Theory of Computing + </publishername> + </publisher> + </biblioentry> + + <!-- 41 --> + <biblioentry xml:id="biblio.sleator85self"> + <title> + Self-Adjusting Binary Search Trees + </title> + <date> + 1985 + </date> + + <authorgroup> + <author> + <personname> + <firstname> + D. D. + </firstname> + <surname> + Sleator + </surname> + </personname> + </author> + + <author> + <personname> + <firstname> + R. E. + </firstname> + <surname> + Tarjan + </surname> + </personname> + </author> + </authorgroup> + + <publisher> + <publishername> + ACM Symposium on Theory of Computing + </publishername> + </publisher> + </biblioentry> + + <!-- 42 --> + <biblioentry xml:id="biblio.stepanov94standard"> + <title> + The Standard Template Library + </title> + <date> + 1984 + </date> + <authorgroup> + <author> + <personname> + <firstname> + A. A. + </firstname> + <surname> + Stepanov + </surname> + </personname> + </author> + <author> + <personname> + <firstname> + M. + </firstname> + <surname> + Lee + </surname> + </personname> + </author> + </authorgroup> + </biblioentry> + + <!-- 43 --> + <biblioentry xml:id="biblio.stroustrup97cpp"> + <title> + The C++ Programming Langugage + </title> + <date> + 1997 + </date> + + <author> + <personname> + <firstname> + Bjarne + </firstname> + <surname> + Stroustrup + </surname> + </personname> + </author> + + <publisher> + <publishername> + Addison-Wesley Publishing Company + </publishername> + </publisher> + </biblioentry> + + <!-- 44 --> + <biblioentry xml:id="biblio.vandevoorde2002cpptemplates"> + <title> + C++ Templates: The Complete Guide + </title> + <date> + 2002 + </date> + <authorgroup> + <author> + <personname> + <firstname> + D. + </firstname> + <surname> + Vandevoorde + </surname> + </personname> + </author> + + <author> + <personname> + <firstname> + N. M. + </firstname> + <surname> + Josuttis + </surname> + </personname> + </author> + </authorgroup> + <publisher> + <publishername> + Addison-Wesley Publishing Company + </publishername> + </publisher> + </biblioentry> + + + <!-- 45 --> + <biblioentry xml:id="biblio.wickland96thirty"> + <title> + <link xmlns:xlink="http://www.w3.org/1999/xlink" + xlink:href="http://myweb.wvnet.edu/~gsa00121/books/amongdead30.zip"> + Thirty Years Among the Dead + </link> + </title> + <date> + 1996 + </date> + + <author> + <personname> + <firstname> + C. A. + </firstname> + <surname> + Wickland + </surname> + </personname> + </author> + + <publisher> + <publishername> + National Psychological Institute + </publishername> + </publisher> + </biblioentry> + +</bibliography> diff --git a/libstdc++-v3/doc/xml/manual/spine.xml b/libstdc++-v3/doc/xml/manual/spine.xml index 806f4ec118d..2d4bc6f1d03 100644 --- a/libstdc++-v3/doc/xml/manual/spine.xml +++ b/libstdc++-v3/doc/xml/manual/spine.xml @@ -19,6 +19,7 @@ <year>2009</year> <year>2010</year> <year>2011</year> + <year>2012</year> <holder> <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://www.fsf.org">FSF</link> </holder> diff --git a/libstdc++-v3/doc/xml/manual/status_cxx2011.xml b/libstdc++-v3/doc/xml/manual/status_cxx2011.xml index 0ed63eab7be..e26db6ff910 100644 --- a/libstdc++-v3/doc/xml/manual/status_cxx2011.xml +++ b/libstdc++-v3/doc/xml/manual/status_cxx2011.xml @@ -158,10 +158,13 @@ particular release. <entry>C library dependency for quick_exit, at_quick_exit</entry> </row> <row> + <?dbhtml bgcolor="#B0B0B0" ?> <entry>18.6</entry> <entry>Dynamic memory management</entry> - <entry>Y</entry> - <entry/> + <entry>Partial</entry> + <entry>Missing <code>get_new_handler</code>. + <code>set_new_handler</code> is not thread-safe. + </entry> </row> <row> <entry>18.7</entry> @@ -206,10 +209,13 @@ particular release. <entry/> </row> <row> + <?dbhtml bgcolor="#B0B0B0" ?> <entry>18.8.3</entry> <entry>Abnormal termination</entry> - <entry>Y</entry> - <entry/> + <entry>Partial</entry> + <entry>Missing <code>get_terminate</code>. + <code>set_terminate</code> is not thread-safe. + </entry> </row> <row> <entry>18.8.4</entry> @@ -2606,10 +2612,13 @@ particular release. <entry/> </row> <row> + <?dbhtml bgcolor="#B0B0B0" ?> <entry>D.11</entry> <entry>Violating exception-specifications</entry> - <entry/> - <entry/> + <entry>Partial</entry> + <entry>Missing <code>get_unexpected</code>. + <code>set_unexpected</code> is not thread-safe. + </entry> </row> </tbody> diff --git a/libstdc++-v3/doc/xml/manual/test_policy_data_structures.xml b/libstdc++-v3/doc/xml/manual/test_policy_data_structures.xml index 2cad15ceea9..241ec9f0e33 100644 --- a/libstdc++-v3/doc/xml/manual/test_policy_data_structures.xml +++ b/libstdc++-v3/doc/xml/manual/test_policy_data_structures.xml @@ -35,7 +35,8 @@ several sources, each checking only some containers.</para> <para>For more details, consult the files in - <filename>testsuite/ext/pb_ds/regression</filename>.</para> + <filename class="directory">testsuite/ext/pb_ds/regression</filename>. + </para> </section> <!-- S02 performance --> @@ -68,16 +69,12 @@ the number of values inserted.</para> <para> It uses the test file: - <filename> - performance/ext/pb_ds/text_find_timing_test.cc - </filename> + <filename>performance/ext/pb_ds/text_find_timing_test.cc</filename> </para> <para> And uses the data file: - <filename> - filethirty_years_among_the_dead_preproc.txt - </filename> + <filename>filethirty_years_among_the_dead_preproc.txt</filename> </para> <para>The test checks the effect of different range-hashing @@ -398,9 +395,7 @@ <para> It uses the test file: - <filename> - performance/ext/pb_ds/random_int_find_timing.cc - </filename> + <filename>performance/ext/pb_ds/random_int_find_timing.cc</filename> </para> <para>The test checks the effect of different underlying @@ -917,9 +912,7 @@ <para> It uses the test file: - <filename> - performance/ext/pb_ds/random_int_subscript_find_timing.cc - </filename> + <filename>performance/ext/pb_ds/random_int_subscript_find_timing.cc</filename> </para> <para>The test checks the effect of different underlying @@ -1416,9 +1409,7 @@ <para> It uses the test file: - <filename> - performance/ext/pb_ds/random_int_subscript_insert_timing.cc - </filename> + <filename>performance/ext/pb_ds/random_int_subscript_insert_timing.cc</filename> </para> <para>The test checks the effect of different underlying @@ -1955,9 +1946,7 @@ <para> It uses the test file: - <filename> - performance/ext/pb_ds/hash_zlob_random_int_find_timing.cc - </filename> + <filename>performance/ext/pb_ds/hash_zlob_random_int_find_timing.cc</filename> </para> <para>The test checks the effect of different range-hashing @@ -2254,9 +2243,7 @@ <para> It uses the test file: - <filename> - performance/ext/pb_ds/hash_random_int_erase_mem_usage.cc - </filename> + <filename>performance/ext/pb_ds/hash_random_int_erase_mem_usage.cc</filename> </para> @@ -2536,9 +2523,7 @@ <para> It uses the test file: - <filename> - performance/ext/pb_ds/tree_text_insert_timing.cc - </filename> + <filename>performance/ext/pb_ds/tree_text_insert_timing.cc</filename> </para> @@ -2912,9 +2897,7 @@ <para> It uses the test file: - <filename> - performance/ext/pb_ds/text_find_timing.cc - </filename> + <filename>performance/ext/pb_ds/text_find_timing.cc</filename> </para> @@ -3185,9 +3168,7 @@ <para> It uses the test file: - <filename> - performance/ext/pb_ds/tree_text_lor_find_timing.cc - </filename> + <filename>performance/ext/pb_ds/tree_text_lor_find_timing.cc</filename> </para> <para>The test checks the effect of different underlying @@ -3424,9 +3405,7 @@ <para> It uses the test file: - <filename> - performance/ext/pb_ds/tree_split_join_timing.cc - </filename> + <filename>performance/ext/pb_ds/tree_split_join_timing.cc</filename> </para> @@ -3688,9 +3667,7 @@ <para> It uses the test file: - <filename> - performance/ext/pb_ds/tree_order_statistics_timing.cc - </filename> + <filename>performance/ext/pb_ds/tree_order_statistics_timing.cc</filename> </para> <para>The test checks the performance difference of policies based @@ -3885,9 +3862,7 @@ <para> It uses the test file: - <filename> - performance/ext/pb_ds/multimap_text_find_timing_small.cc - </filename> + <filename>performance/ext/pb_ds/multimap_text_find_timing_small.cc</filename> </para> <para>The test checks the find-time scalability of different @@ -4350,9 +4325,7 @@ <para> It uses the test file: - <filename> - performance/ext/pb_ds/multimap_text_find_timing_large.cc - </filename> + <filename>performance/ext/pb_ds/multimap_text_find_timing_large.cc</filename> </para> <para>The test checks the find-time scalability of different @@ -4819,9 +4792,7 @@ <para> It uses the test file: - <filename> - performance/ext/pb_ds/multimap_text_insert_timing_small.cc - </filename> + <filename>performance/ext/pb_ds/multimap_text_insert_timing_small.cc</filename> </para> <para>The test checks the insert-time scalability of different @@ -5288,9 +5259,7 @@ <para> It uses the test file: - <filename> - performance/ext/pb_ds/multimap_text_insert_timing_large.cc - </filename> + <filename>performance/ext/pb_ds/multimap_text_insert_timing_large.cc</filename> </para> <para>The test checks the insert-time scalability of different @@ -5751,9 +5720,7 @@ <para> It uses the test file: - <filename> - performance/ext/pb_ds/multimap_text_insert_mem_usage_small.cc - </filename> + <filename>performance/ext/pb_ds/multimap_text_insert_mem_usage_small.cc</filename> </para> <para>The test checks the memory scalability of different @@ -6213,9 +6180,7 @@ <para> It uses the test file: - <filename> - performance/ext/pb_ds/multimap_text_insert_mem_usage_large.cc - </filename> + <filename>performance/ext/pb_ds/multimap_text_insert_mem_usage_large.cc</filename> </para> <para>The test checks the memory scalability of different @@ -6675,9 +6640,7 @@ <para> It uses the test file: - <filename> - performance/ext/pb_ds/priority_queue_text_push_timing.cc - </filename> + <filename>performance/ext/pb_ds/priority_queue_text_push_timing.cc</filename> </para> <para>The test checks the effect of different underlying data @@ -7062,9 +7025,7 @@ <para> It uses the test file: - <filename> - performance/ext/pb_ds/priority_queue_text_push_pop_timing.cc - </filename> + <filename>performance/ext/pb_ds/priority_queue_text_push_pop_timing.cc</filename> </para> <para>The test checks the effect of different underlying data @@ -7429,9 +7390,7 @@ <para> It uses the test file: - <filename> - performance/ext/pb_ds/priority_queue_random_int_push_timing.cc - </filename> + <filename>performance/ext/pb_ds/priority_queue_random_int_push_timing.cc</filename> </para> <para>The test checks the effect of different underlying data @@ -7785,9 +7744,7 @@ <para> It uses the test file: - <filename> - performance/ext/pb_ds/priority_queue_random_int_push_pop_timing.cc - </filename> + <filename>performance/ext/pb_ds/priority_queue_random_int_push_pop_timing.cc</filename> </para> <para>The test checks the effect of different underlying data @@ -8050,9 +8007,7 @@ number of values pushed to the container.</para> <para> It uses the test file: - <filename> - performance/ext/pb_ds/priority_queue_text_pop_mem_usage.cc - </filename> + <filename>performance/ext/pb_ds/priority_queue_text_pop_mem_usage.cc</filename> </para> <para>The test checks the effect of different underlying data @@ -8302,9 +8257,7 @@ the average time as a function of the number of values.</para> <para> It uses the test file: - <filename> - performance/ext/pb_ds/priority_queue_text_join_timing.cc - </filename> + <filename>performance/ext/pb_ds/priority_queue_text_join_timing.cc</filename> </para> <para>The test checks the effect of different underlying data @@ -8554,9 +8507,7 @@ <para> It uses the test file: - <filename> - performance/ext/pb_ds/priority_queue_text_modify_up_timing.cc - </filename> + <filename>performance/ext/pb_ds/priority_queue_text_modify_up_timing.cc</filename> </para> <para>The test checks the effect of different underlying data @@ -8920,9 +8871,7 @@ <para> It uses the test file: - <filename> - performance/ext/pb_ds/priority_queue_text_modify_down_timing.cc - </filename> + <filename>performance/ext/pb_ds/priority_queue_text_modify_down_timing.cc</filename> </para> <para>The main purpose of this test is to contrast Priority Queue @@ -9771,4 +9720,4 @@ </section> <!-- performance --> -</section>
\ No newline at end of file +</section> |