diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog index fd528b7f128b..a5e61f786644 100644 --- a/libstdc++-v3/ChangeLog +++ b/libstdc++-v3/ChangeLog @@ -1,4 +1,67 @@ -2010-07-19 Benjamin Kosnik +2010-07-22 Benjamin Kosnik + + DocBook 4.5 to 5.0 transition. + * doc/xml/authors.xml: Update markup to DocBook 5.0. + * doc/xml/faq.xml: Same. + * doc/xml/api.xml: Same. + * doc/xml/class.txml + * doc/xml/gnu/gpl-3.0.xml: Same. + * doc/xml/gnu/fdl-1.2.xml: Same. + * doc/xml/gnu/fdl-1.3.xml: Same. + * doc/xml/gnu/gpl-2.0.xml: Same. + * doc/xml/chapter.txml: Same. + * doc/xml/manual/mt_allocator.xml: Same. + * doc/xml/manual/allocator.xml: Same. + * doc/xml/manual/ctype.xml: Same. + * doc/xml/manual/numerics.xml: Same. + * doc/xml/manual/codecvt.xml: Same. + * doc/xml/manual/backwards_compatibility.xml: Same. + * doc/xml/manual/concurrency.xml: Same. + * doc/xml/manual/intro.xml: Same. + * doc/xml/manual/abi.xml: Same. + * doc/xml/manual/shared_ptr.xml: Same. + * doc/xml/manual/status_cxxtr1.xml: Same. + * doc/xml/manual/auto_ptr.xml: Same. + * doc/xml/manual/internals.xml: Same. + * doc/xml/manual/atomics.xml: Same. + * doc/xml/manual/parallel_mode.xml: Same. + * doc/xml/manual/status_cxx1998.xml: Same. + * doc/xml/manual/profile_mode.xml: Same. + * doc/xml/manual/containers.xml: Same. + * doc/xml/manual/io.xml: Same. + * doc/xml/manual/concurrency_extensions.xml: Same. + * doc/xml/manual/appendix_porting.xml: Same. + * doc/xml/manual/utilities.xml: Same. + * doc/xml/manual/support.xml: Same. + * doc/xml/manual/bitmap_allocator.xml: Same. + * doc/xml/manual/configure.xml: Same. + * doc/xml/manual/build_hacking.xml: Same. + * doc/xml/manual/evolution.xml: Same. + * doc/xml/manual/using.xml: Same. + * doc/xml/manual/using_exceptions.xml: Same. + * doc/xml/manual/debug.xml: Same. + * doc/xml/manual/localization.xml: Same. + * doc/xml/manual/strings.xml: Same. + * doc/xml/manual/debug_mode.xml: Same. + * doc/xml/manual/locale.xml: Same. + * doc/xml/manual/extensions.xml: Same. + * doc/xml/manual/appendix_contributing.xml: Same. + * doc/xml/manual/prerequisites.xml: Same. + * doc/xml/manual/messages.xml: Same. + * doc/xml/manual/diagnostics.xml: Same. + * doc/xml/manual/algorithms.xml: Same. + * doc/xml/manual/appendix_free.xml: Same. + * doc/xml/manual/iterators.xml: Same. + * doc/xml/manual/spine.xml: Same. + * doc/xml/manual/status_cxxtr24733.xml: Same. + * doc/xml/manual/status_cxx200x.xml: Same. + * doc/xml/manual/test.xml: Same. + * doc/xml/book.txml: Same. + * doc/xml/spine.xml: Same. + * doc/Makefile.am: Same. + * doc/Makefile.in: Regenerate. + +2010-07-20 Benjamin Kosnik * doc/xml/manual/appendix_contributing.xml: Update for new reality. * doc/Makefile.am (doc-xml): New default rule for XML output. diff --git a/libstdc++-v3/doc/Makefile.am b/libstdc++-v3/doc/Makefile.am index 79325caffa0f..06ce75a30952 100644 --- a/libstdc++-v3/doc/Makefile.am +++ b/libstdc++-v3/doc/Makefile.am @@ -220,7 +220,7 @@ xml_noinst = \ XSLTPROC = xsltproc XSLTPROC_FLAGS = --nonet --xinclude -XSL_STYLE_DIR = /usr/share/sgml/docbook/xsl-stylesheets +XSL_STYLE_DIR = /usr/share/sgml/docbook/xsl-ns-stylesheets XSL_FO_STYLE = $(XSL_STYLE_DIR)/fo/docbook.xsl XSL_HTML_STYLE = $(XSL_STYLE_DIR)/xhtml/chunk.xsl #XSL_HTML_SINGLE_STYLE = $(XSL_STYLE_DIR)/xhtml/onechunk.xsl @@ -245,9 +245,10 @@ ${docbook_outdir}/xml: XMLLINT = xmllint #LINT_FLAGS = --debug --nonet --xinclude --nsclean --postvalid --nowarning #LINT_FLAGS = --noblanks --noout --xinclude --postvalid --noent -LINT_FLAGS = --postvalid --debug --xinclude --noent --noblanks --nonet --noout -DTD_FLAGS = --dtdvalid http://www.oasis-open.org/docbook/xml/4.5/docbookx.dtd -XMLLINT_FLAGS = $(LINT_FLAGS) $(DTD_FLAGS) +LINT_FLAGS = --debug --xinclude --noent --noblanks --nonet --noout +#SCHEMA_FLAGS = --relaxng /usr/share/xml/docbook5/schema/rng/5.0/docbookxi.rng +SCHEMA_FLAGS = --dtdvalid /usr/share/xml/docbook5/schema/dtd/5.0/docbook.dtd +XMLLINT_FLAGS = $(LINT_FLAGS) $(SCHEMA_FLAGS) doc-xml-validate-docbook: $(xml_sources) @echo "Generating XML validation log..." $(XMLLINT) $(XMLLINT_FLAGS) ${top_srcdir}/doc/xml/spine.xml diff --git a/libstdc++-v3/doc/Makefile.in b/libstdc++-v3/doc/Makefile.in index 485aac4fba53..005e1b8927b0 100644 --- a/libstdc++-v3/doc/Makefile.in +++ b/libstdc++-v3/doc/Makefile.in @@ -359,7 +359,7 @@ xml_noinst = \ XSLTPROC = xsltproc XSLTPROC_FLAGS = --nonet --xinclude -XSL_STYLE_DIR = /usr/share/sgml/docbook/xsl-stylesheets +XSL_STYLE_DIR = /usr/share/sgml/docbook/xsl-ns-stylesheets XSL_FO_STYLE = $(XSL_STYLE_DIR)/fo/docbook.xsl XSL_HTML_STYLE = $(XSL_STYLE_DIR)/xhtml/chunk.xsl #XSL_HTML_SINGLE_STYLE = $(XSL_STYLE_DIR)/xhtml/onechunk.xsl @@ -369,9 +369,10 @@ XSL_HTML_SINGLE_STYLE = $(XSL_STYLE_DIR)/xhtml/docbook.xsl XMLLINT = xmllint #LINT_FLAGS = --debug --nonet --xinclude --nsclean --postvalid --nowarning #LINT_FLAGS = --noblanks --noout --xinclude --postvalid --noent -LINT_FLAGS = --postvalid --debug --xinclude --noent --noblanks --nonet --noout -DTD_FLAGS = --dtdvalid http://www.oasis-open.org/docbook/xml/4.5/docbookx.dtd -XMLLINT_FLAGS = $(LINT_FLAGS) $(DTD_FLAGS) +LINT_FLAGS = --debug --xinclude --noent --noblanks --nonet --noout +#SCHEMA_FLAGS = --relaxng /usr/share/xml/docbook5/schema/rng/5.0/docbookxi.rng +SCHEMA_FLAGS = --dtdvalid /usr/share/xml/docbook5/schema/dtd/5.0/docbook.dtd +XMLLINT_FLAGS = $(LINT_FLAGS) $(SCHEMA_FLAGS) # XML, all one page # Some info on canonicalization diff --git a/libstdc++-v3/doc/xml/api.xml b/libstdc++-v3/doc/xml/api.xml index 3073ed8ba6f5..4518f23d3dbb 100644 --- a/libstdc++-v3/doc/xml/api.xml +++ b/libstdc++-v3/doc/xml/api.xml @@ -1,15 +1,10 @@ - - + - - -
+
- - API Documentation +API Documentation + 2008 @@ -18,8 +13,8 @@ 2010 - FSF - + FSF + @@ -28,7 +23,7 @@ - + The GNU C++ library sources have been specially formatted so that @@ -47,38 +42,38 @@ - for the 3.4 release - + for the 3.4 release + - for the 4.1 release - + for the 4.1 release + - for the 4.2 release - + for the 4.2 release + - for the 4.3 release - + for the 4.3 release + - for the 4.4 release - + for the 4.4 release + - "the latest collection" - + "the latest collection" + (For the main development tree; see the date on the first page.) @@ -89,7 +84,7 @@ gcc.org site in a directory located at <URL:ftp://gcc.gnu.org/pub/gcc/libstdc++/doxygen/>. You will almost certainly need to use one of the - mirror sites to download + mirror sites to download the tarball. After unpacking, simply load libstdc++-html-*/index.html into a browser. diff --git a/libstdc++-v3/doc/xml/authors.xml b/libstdc++-v3/doc/xml/authors.xml index 5d7909f8b143..1f26f63fbc6d 100644 --- a/libstdc++-v3/doc/xml/authors.xml +++ b/libstdc++-v3/doc/xml/authors.xml @@ -1,4 +1,4 @@ - + - - - - - + - - + - - Paolo - Carlini - - + PaoloCarlini TR1, LWG Active, Closed, Defects lists. - - + - - Phil - Edwards - - + PhilEdwards Originating author, started HOWTO and FAQ, worked on sections Demangling, Macros, Strings, Iterators, Backwards Compatibility, SGI Extensions, Configure, Build, Install. - - + - - Doug - Gregor - - + DougGregor Debug Mode, TR1 function objects - - + - - Benjamin - Kosnik - - + BenjaminKosnik Allocators, ABI, API evolution and deprecation history, Backwards Compatibility, Thread, Debug Support, Locales, Facets, Parallel Mode, Headers, Namespaces, Construction and Structure, Using Exceptions, DocBook conversion and layout. - - + - - Dhruv - Matani - - + DhruvMatani bitmap_allocator - - + - - Jason - Merrill - - + JasonMerrill License, __verbose_terminate_handler - - + - - Mark - Mitchell - - + MarkMitchell Porting - - + - - Nathan - Myers - - + NathanMyers Referenced counted string, C++1998 implementation status. - - + - - Felix - Natter - - + FelixNatter Namespace composition, Backwards Compatibility. - - + - - Stefan - Olsson - - + StefanOlsson mt_allocator - - + - - Silvius - Rus - - + SilviusRus Profile mode - - + - - Johannes - Singler - - + JohannesSingler Parallel mode - - + - - Ami - Tavory - - + AmiTavory Policy Based Data Structures, Associative Containers, Unordered Containers. - - + - - Jonathan - Wakely - - + JonathanWakely shared_ptr, markup editing and styling - - + diff --git a/libstdc++-v3/doc/xml/book.txml b/libstdc++-v3/doc/xml/book.txml index a77690d0d32e..55b050271a5b 100644 --- a/libstdc++-v3/doc/xml/book.txml +++ b/libstdc++-v3/doc/xml/book.txml @@ -1,32 +1,29 @@ - - + + + - -Source Level Documentation - + 2007 - FSF - + FSF + - License - + License + - + - - - - - +</info> + + <chapter><info><title/></info> + + <para/> </chapter> </part> diff --git a/libstdc++-v3/doc/xml/chapter.txml b/libstdc++-v3/doc/xml/chapter.txml index 9cf5b74e8555..85323e73baaa 100644 --- a/libstdc++-v3/doc/xml/chapter.txml +++ b/libstdc++-v3/doc/xml/chapter.txml @@ -1,11 +1,8 @@ -<?xml version='1.0'?> -<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.5//EN" - "http://www.oasis-open.org/docbook/xml/4.5/docbookx.dtd" -[ ]> +<!-- Converted by db4-upgrade version 1.0 --> -<chapter id="manual.intro" xreflabel="Introduction"> +<chapter xmlns="http://docbook.org/ns/docbook" version="5.0" xml:id="manual.intro" xreflabel="Introduction"> -<chapterinfo> +<info><title>Introduction ISO C++ @@ -14,41 +11,41 @@ library - + -Introduction - - Status + +
Status + The GNU C++ ... - +
- - Setup +
Setup + The GNU C++ ... - - Next1 +
Next1 + The GNU C++ ... - - - Next2 +
+
Next2 + The GNU C++ ... - - +
+
- - Using +
Using + The GNU C++ ... - +
 diff --git a/libstdc++-v3/doc/xml/class.txml b/libstdc++-v3/doc/xml/class.txml index 83497db37200..26c9acf97f15 100644 --- a/libstdc++-v3/doc/xml/class.txml +++ b/libstdc++-v3/doc/xml/class.txml @@ -1,7 +1,9 @@ - + + +
- +allocator ISO C++ @@ -10,15 +12,15 @@ allocator - + + -allocator - -Requirements +
Requirements + @@ -35,33 +37,33 @@ - +
+ +
Design Issues - -Design Issues - +
- -Implementation +
Implementation - - Interface Design + +
Interface Design + - +
- - Selecting Default Allocation Strategy +
Selecting Default Allocation Strategy + @@ -76,38 +78,38 @@ - +
- - Disabling Memory Caching +
Disabling Memory Caching + - - +
+
+ +
Using - -Using - +
+ +
Custom Allocators - -Custom Allocators - +
+ +Bibliography - -Bibliography - -General Information + - - + + + What is libstdc++? - + The GNU Standard C++ Library v3 is an ongoing project to implement the ISO 14882 Standard C++ library as described in @@ -41,18 +36,18 @@ exactly how far the project has come, or just want the latest bleeding-edge code, the up-to-date source is available over anonymous SVN, and can even be browsed over - the web. + the web. - - + + Why should I use libstdc++? - + The completion of the ISO C++ standardization gave the C++ community a powerful set of reuseable tools in the form of the C++ @@ -66,9 +61,9 @@ (gcc, g++, etc) is widely considered to be one of the leading compilers in the world. Its development is overseen by the - GCC team. All of + GCC team. All of the rapid development and near-legendary - portability + portability that are the hallmarks of an open-source project are being applied to libstdc++. @@ -83,13 +78,13 @@ - - + + Who's in charge of it? - + The libstdc++ project is contributed to by several developers all over the world, in the same way as GCC or Linux. @@ -101,19 +96,19 @@ Development and discussion is held on the libstdc++ mailing list. Subscribing to the list, or searching the list archives, is open to everyone. You can read instructions for - doing so on the homepage. + doing so on the homepage. If you have questions, ideas, code, or are just curious, sign up! - - + + When is libstdc++ going to be finished? - + Nathan Myers gave the best of all possible answers, responding to a Usenet article asking this question: Sooner, if you @@ -122,13 +117,13 @@ - - + + How do I contribute to the effort? - + Here is a page devoted to this topic. Subscribing to the mailing list (see above, or @@ -142,13 +137,13 @@ - - + + What happened to the older libg++? I need that! - + The most recent libg++ README states that libg++ is no longer being actively maintained. It should not be used for new @@ -160,13 +155,13 @@ - - + + What if I have more questions? - + If you have read the README file, and your question remains unanswered, then just ask the mailing list. At present, you do not @@ -187,16 +182,16 @@ - -License + - - + + + What are the license terms for libstdc++? - + See our license description for these and related questions. @@ -204,13 +199,13 @@ - - + + So any program which uses libstdc++ falls under the GPL? - + No. The special exception permits use of the library in proprietary applications. @@ -219,13 +214,13 @@ - - + + How is that different from the GNU {Lesser,Library} GPL? - + The LGPL requires that users be able to replace the LGPL code with a modified version; this is trivial if the library in question is a C @@ -238,13 +233,13 @@ - - + + I see. So, what restrictions are there on programs that use the library? - + None. We encourage such programs to be released as open source, but we won't punish you or sue you if you choose otherwise. @@ -255,15 +250,15 @@ - -Installation + - - + + + How do I install libstdc++? - + Often libstdc++ comes pre-installed as an integral part of many existing Linux and Unix systems, as well as many embedded @@ -281,17 +276,17 @@ - - + + How does one get current libstdc++ sources? - + Libstdc++ sources for all official releases can be obtained as part of the GCC sources, available from various sites and - mirrors. A full list of - download sites is provided on the main GCC site. + mirrors. A full list of + download sites is provided on the main GCC site. Current libstdc++ sources can always be checked out of the main @@ -303,8 +298,8 @@ Subversion, or SVN, is one of several revision control packages. It was selected for GNU projects because it's free (speech), free (beer), and very high - quality. The Subversion - home page has a better description. + quality. The Subversion + home page has a better description. The anonymous client checkout feature of SVN is @@ -313,24 +308,24 @@ For more information - see SVN - details. + see SVN + details. - - + + How do I know if it works? - + Libstdc++ comes with its own validation testsuite, which includes conformance testing, regression testing, ABI testing, and performance testing. Please consult the - testing - documentation for more details. + testing + documentation for more details. If you find bugs in the testsuite programs themselves, or if you @@ -340,12 +335,12 @@ - - + + How do I insure that the dynamically linked library will be found? - + Depending on your platform and library version, the error message might be similar to one of the following: @@ -388,20 +383,19 @@ is usually called something such as ld.so/rtld/dld.so. - Using LD_LIBRARY_PATH is not always the best solution, Finding Dynamic or Shared + Using LD_LIBRARY_PATH is not always the best solution, Finding Dynamic or Shared Libraries in the manual gives some alternatives. - - + + What's libsupc++? - + If the only functions from libstdc++.a which you need are language support functions (those listed in @@ -421,13 +415,13 @@ - - + + This library is HUGE! - + Usually the size of libraries on disk isn't noticeable. When a link editor (or simply linker) pulls things from a @@ -467,16 +461,16 @@ - -Platform-Specific Issues + - - + + + Can libstdc++ be used with non-GNU compilers? - + Perhaps. @@ -503,13 +497,13 @@ - - + + No 'long long' type on Solaris? - + By default we try to support the C99 long long type. This requires that certain functions from your C library be present. @@ -526,13 +520,13 @@ - - + + _XOPEN_SOURCE and _GNU_SOURCE are always defined? - + On Solaris, g++ (but not gcc) always defines the preprocessor macro _XOPEN_SOURCE. On GNU/Linux, the same happens with _GNU_SOURCE. (This is not an exhaustive list; @@ -558,11 +552,11 @@ To see which symbols are defined, look for CPLUSPLUS_CPP_SPEC in the gcc config headers for your target (and try changing them to see what happens when building complicated code). You can also run - g++ -E -dM - < /dev/null" to display + g++ -E -dM - < /dev/null" to display a list of predefined macros for any particular installation. This has been discussed on the mailing lists - quite a bit. + quite a bit. This method is something of a wart. We'd like to find a cleaner solution, but nobody yet has contributed the time. @@ -571,29 +565,29 @@ - - + + Mac OS X ctype.h is broken! How can I fix it? - + This is a long-standing bug in the OS X support. Fortunately, the patch is quite simple, and well-known. - Here's a - link to the solution. + Here's a + link to the solution. - - + + Threading is broken on i386? - + Support for atomic integer operations is/was broken on i386 @@ -609,13 +603,13 @@ - - + + MIPS atomic operations - + The atomic locking routines for MIPS targets requires MIPS II and later. A patch went in just after the 3.3 release to @@ -629,13 +623,13 @@ - - + + Recent GNU/Linux glibc required? - + When running on GNU/Linux, libstdc++ 3.2.1 (shared library version 5.0.1) and later uses localization and formatting code from the system C library (glibc) version 2.2.5 which contains necessary bugfixes. @@ -651,13 +645,13 @@ - - + + Can't use wchar_t/wstring on FreeBSD - + Older versions of FreeBSD's C library do not have sufficient support for wide character functions, and as a result the @@ -678,16 +672,16 @@ - -Known Bugs + - - + + + What works already? - + Short answer: Pretty much everything works except for some corner cases. Support for localization @@ -705,13 +699,13 @@ - - + + Bugs in the ISO C++ language or library specification - + Unfortunately, there are some. @@ -719,7 +713,7 @@ For those people who are not part of the ISO Library Group (i.e., nearly all of us needing to read this page in the first place), a public list of the library defects is occasionally - published here. + published here. Some of these issues have resulted in code changes in libstdc++. @@ -731,13 +725,13 @@ - - + + Bugs in the compiler (gcc/g++) and not libstdc++ - + On occasion, the compiler is wrong. Please be advised that this happens much less often than one would think, and avoid jumping to @@ -751,7 +745,7 @@ Before reporting a bug, please examine the - bugs database with the + bugs database with the category set to g++. @@ -760,21 +754,21 @@ - -Known Non-Bugs + - - + + + Reopening a stream fails - + One of the most-reported non-bug reports. Executing a sequence like: - + #include <fstream> ... std::fstream fs(a_file); @@ -803,13 +797,13 @@ - - + + -Weffc++ complains too much - + Many warnings are emitted when -Weffc++ is used. Making libstdc++ -Weffc++-clean is not a goal of the project, @@ -825,13 +819,13 @@ - - + + Ambiguous overloads after including an old-style header - + Another problem is the rel_ops namespace and the template comparison operator functions contained therein. If they become @@ -839,27 +833,27 @@ (e.g., using them and the <iterator> header), then you will suddenly be faced with huge numbers of ambiguity errors. This was discussed on the -v3 list; Nathan Myers - sums - things up here. The collisions with vector/string iterator + sums + things up here. The collisions with vector/string iterator types have been fixed for 3.1. - - + + The g++-3 headers are not ours - + If you have found an extremely broken header file which is causing problems for you, look carefully before submitting a - "high" priority bug report (which you probably + "high" priority bug report (which you probably shouldn't do anyhow; see the last paragraph of the page - describing the GCC - bug database). + describing the GCC + bug database). If the headers are in ${prefix}/include/g++-3, or @@ -881,14 +875,14 @@ - - + + Errors about *Concept and constraints in the STL - + If you see compilation errors containing messages about foo Concept and something to do with a @@ -908,21 +902,21 @@ - - + + Program crashes when using library code in a dynamically-loaded library - + If you are using the C++ library across dynamically-loaded objects, make certain that you are passing the correct options when compiling and linking: - + // compile your library components g++ -fPIC -c a.cc g++ -fPIC -c b.cc @@ -938,17 +932,17 @@ - - + + Memory leaks in containers - + A few people have reported that the standard containers appear to leak memory when tested with memory checkers such as - valgrind. + valgrind. The library's default allocators keep free memory in a pool for later reuse, rather than returning it to the OS. Although this memory is always reachable by the library and is never @@ -960,13 +954,13 @@ - - + + list::size() is O(n)! - + See the Containers @@ -975,18 +969,18 @@ - - + + Aw, that's easy to fix! - + If you have found a bug in the library and you think you have a working fix, then send it in! The main GCC site has a page - on submitting - patches that covers the procedure, but for libstdc++ you + on submitting + patches that covers the procedure, but for libstdc++ you should also send the patch to our mailing list in addition to the GCC patches mailing list. The libstdc++ contributors' page @@ -995,10 +989,10 @@ In addition to the description, the patch, and the ChangeLog entry, it is a Good Thing if you can additionally create a small - test program to test for the presence of the bug that your - patch fixes. Bugs have a way of being reintroduced; if an old - bug creeps back in, it will be caught immediately by the - testsuite -- but only if such a test exists. + test program to test for the presence of the bug that your patch + fixes. Bugs have a way of being reintroduced; if an old bug + creeps back in, it will be caught immediately by the testsuite - + but only if such a test exists. @@ -1007,16 +1001,16 @@ - -Miscellaneous + - - + + + string::iterator is not char*; vector<T>::iterator is not T* - + If you have code that depends on container<T> iterators being implemented as pointer-to-T, your code is broken. It's @@ -1040,13 +1034,13 @@ - - + + What's next after libstdc++? - + Hopefully, not much. The goal of libstdc++ is to produce a fully-compliant, fully-portable Standard Library. After that, @@ -1057,21 +1051,21 @@ There is an effort underway to add significant extensions to the standard library specification. The latest version of this effort is described in - - The C++ Library Technical Report 1. + + The C++ Library Technical Report 1. - - + + What about the STL from SGI? - + - The STL from SGI, + The STL from SGI, version 3.3, was the final merge of the STL codebase. The code in libstdc++ contains many fixes and changes, and the SGI code is no longer under active @@ -1079,7 +1073,7 @@ In particular, string is not from SGI and makes no - use of their "rope" class (which is included as an + use of their "rope" class (which is included as an optional extension), nor is valarray and some others. Classes like vector<> are, but have been extensively modified. @@ -1098,50 +1092,48 @@ - - + + Extensions and Backward Compatibility - + See the link on backwards compatibility and link on evolution. - - + + Does libstdc++ support TR1? - + Yes. The C++ Standard Library Technical Report adds many new features to the library. The latest version of this effort is described in - - Technical Report 1. + + Technical Report 1. - The implementation status of TR1 in libstdc++ can be tracked on the TR1 status + The implementation status of TR1 in libstdc++ can be tracked on the TR1 status page. - - + + How do I get a copy of the ISO C++ Standard? - + Copies of the full ISO 14882 standard are available on line via the ISO mirror site for committee members. Non-members, or those @@ -1150,14 +1142,14 @@ get a copy of the standard from their respective national standards organization. In the USA, this national standards organization is ANSI and their website is - right here. (And if + right here. (And if you've already registered with them, clicking this link will take you to directly to the place where you can - buy the standard on-line. + buy the standard on-line. Who is your country's member body? Visit the - ISO homepage and find out! + ISO homepage and find out! The 2003 version of the standard (the 1998 version plus TC1) is @@ -1166,13 +1158,13 @@ - - + + What's an ABI and why is it so messy? - + ABI stands for Application Binary Interface. Conventionally, it refers to a great @@ -1226,19 +1218,19 @@ - - + + How do I make std::vector<T>::capacity() == std::vector<T>::size? - + The standard idiom for deallocating a vector<T>'s unused memory is to create a temporary copy of the vector and swap their contents, e.g. for vector<T> v - + std::vector<T>(v).swap(v); diff --git a/libstdc++-v3/doc/xml/gnu/fdl-1.2.xml b/libstdc++-v3/doc/xml/gnu/fdl-1.2.xml index 8ad3a41c964d..ebf54f4a21bb 100644 --- a/libstdc++-v3/doc/xml/gnu/fdl-1.2.xml +++ b/libstdc++-v3/doc/xml/gnu/fdl-1.2.xml @@ -1,15 +1,16 @@ - + +GNU Free Documentation License - GNU Free Documentation License + Copyright (C) 2000, 2001, 2002 Free Software Foundation, Inc. 51 Franklin St, Fifth Floor, - Boston, MA 02110-1301 USA. Everyone is permitted to copy and + Boston, MA 02110-1301 USA. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. - + 0. PREAMBLE @@ -35,7 +36,7 @@ for any textual work, regardless of subject matter or whether it is published as a printed book. We recommend this License principally for works whose purpose is instruction or reference. - + 1. APPLICABILITY AND DEFINITIONS @@ -131,7 +132,7 @@ these Warranty Disclaimers may have is void and has no effect on the meaning of this License. - + 2. VERBATIM COPYING @@ -149,7 +150,7 @@ You may also lend copies, under the same conditions stated above, and you may publicly display copies. - + 3. COPYING IN QUANTITY @@ -190,7 +191,7 @@ them a chance to provide you with an updated version of the Document. - + 4. MODIFICATIONS @@ -340,7 +341,7 @@ permission to use their names for publicity for or to assert or imply endorsement of any Modified Version. - + 5. COMBINING DOCUMENTS @@ -368,7 +369,7 @@ sections Entitled "Dedications". You must delete all sections Entitled "Endorsements". - + 6. COLLECTIONS OF DOCUMENTS @@ -384,7 +385,7 @@ License into the extracted document, and follow this License in all other respects regarding verbatim copying of that document. - + 7. AGGREGATION WITH INDEPENDENT WORKS @@ -405,7 +406,7 @@ if the Document is in electronic form. Otherwise they must appear on printed covers that bracket the whole aggregate. - + 8. TRANSLATION @@ -426,7 +427,7 @@ "Dedications", or "History", the requirement (section 4) to Preserve its Title (section 1) will typically require changing the actual title. - + 9. TERMINATION @@ -438,15 +439,14 @@ have their licenses terminated so long as such parties remain in full compliance. - + 10. FUTURE REVISIONS OF THIS LICENSE The Free Software Foundation may publish new, revised versions of the GNU Free Documentation License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to - address new problems or concerns. See http://www.gnu.org/copyleft/. + address new problems or concerns. See http://www.gnu.org/copyleft/. Each version of the License is given a distinguishing version number. If @@ -458,7 +458,7 @@ License, you may choose any version ever published (not as a draft) by the Free Software Foundation. - + ADDENDUM: How to use this License for your documents diff --git a/libstdc++-v3/doc/xml/gnu/fdl-1.3.xml b/libstdc++-v3/doc/xml/gnu/fdl-1.3.xml index 4abbd1d779f9..9500e11fe2e9 100644 --- a/libstdc++-v3/doc/xml/gnu/fdl-1.3.xml +++ b/libstdc++-v3/doc/xml/gnu/fdl-1.3.xml @@ -1,21 +1,23 @@ - + +GNU Free Documentation License - GNU Free Documentation License + Version 1.3, 3 November 2008 - Copyright © 2000, 2001, 2002, 2007, 2008 - Free Software Foundation, Inc. + Copyright © 2000, 2001, 2002, 2007, 2008 + Free Software Foundation, Inc. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. - + 0. PREAMBLE The purpose of this License is to make a manual, textbook, or other - functional and useful document “free” in the sense of freedom: + functional and useful document “free” in the sense of freedom: to assure everyone the effective freedom to copy and redistribute it, with or without modifying it, either commercially or noncommercially. Secondarily, this License preserves for the author and @@ -23,7 +25,7 @@ responsible for modifications made by others. - This License is a kind of “copyleft”, which means that + This License is a kind of “copyleft”, which means that derivative works of the document must themselves be free in the same sense. It complements the GNU General Public License, which is a copyleft license designed for free software. @@ -37,7 +39,7 @@ published as a printed book. We recommend this License principally for works whose purpose is instruction or reference. - + 1. APPLICABILITY AND DEFINITIONS @@ -45,21 +47,21 @@ contains a notice placed by the copyright holder saying it can be distributed under the terms of this License. Such a notice grants a world-wide, royalty-free license, unlimited in duration, to use that work - under the conditions stated herein. The “Document”, below, + under the conditions stated herein. The “Document”, below, refers to any such manual or work. Any member of the public is a licensee, - and is addressed as “you”. You accept the license if you copy, + and is addressed as “you”. You accept the license if you copy, modify or distribute the work in a way requiring permission under copyright law. - A “Modified Version” of the Document means any work containing + A “Modified Version” of the Document means any work containing the Document or a portion of it, either copied verbatim, or with modifications and/or translated into another language. - A “Secondary Section” is a named appendix or a front-matter + A “Secondary Section” is a named appendix or a front-matter section of the Document that deals exclusively with the relationship of - the publishers or authors of the Document to the Document’s overall + the publishers or authors of the Document to the Document’s overall subject (or to related matters) and contains nothing that could fall directly within that overall subject. (Thus, if the Document is in part a textbook of mathematics, a Secondary Section may not explain any @@ -68,7 +70,7 @@ philosophical, ethical or political position regarding them. - The “Invariant Sections” are certain Secondary Sections whose + The “Invariant Sections” are certain Secondary Sections whose titles are designated, as being those of Invariant Sections, in the notice that says that the Document is released under this License. If a section does not fit the above definition of Secondary then it is not allowed to @@ -77,13 +79,13 @@ there are none. - The “Cover Texts” are certain short passages of text that are + The “Cover Texts” are certain short passages of text that are listed, as Front-Cover Texts or Back-Cover Texts, in the notice that says that the Document is released under this License. A Front-Cover Text may be at most 5 words, and a Back-Cover Text may be at most 25 words. - A “Transparent” copy of the Document means a machine-readable + A “Transparent” copy of the Document means a machine-readable copy, represented in a format whose specification is available to the general public, that is suitable for revising the document straightforwardly with generic text editors or (for images composed of @@ -94,7 +96,7 @@ markup, or absence of markup, has been arranged to thwart or discourage subsequent modification by readers is not Transparent. An image format is not Transparent if used for any substantial amount of text. A copy that is - not “Transparent” is called “Opaque”. + not “Transparent” is called “Opaque”. Examples of suitable formats for Transparent copies include plain ASCII @@ -108,26 +110,26 @@ some word processors for output purposes only. - The “Title Page” means, for a printed book, the title page + The “Title Page” means, for a printed book, the title page itself, plus such following pages as are needed to hold, legibly, the material this License requires to appear in the title page. For works in - formats which do not have any title page as such, “Title Page” - means the text near the most prominent appearance of the work’s + formats which do not have any title page as such, “Title Page” + means the text near the most prominent appearance of the work’s title, preceding the beginning of the body of the text. - The “publisher” means any person or entity that distributes + The “publisher” means any person or entity that distributes copies of the Document to the public. - A section “Entitled XYZ” means a named subunit of the Document + A section “Entitled XYZ” means a named subunit of the Document whose title either is precisely XYZ or contains XYZ in parentheses following text that translates XYZ in another language. (Here XYZ stands for a specific section name mentioned below, such as - “Acknowledgements”, “Dedications”, - “Endorsements”, or “History”.) To “Preserve - the Title” of such a section when you modify the Document means that - it remains a section “Entitled XYZ” according to this + “Acknowledgements”, “Dedications”, + “Endorsements”, or “History”.) To “Preserve + the Title” of such a section when you modify the Document means that + it remains a section “Entitled XYZ” according to this definition. @@ -138,7 +140,7 @@ these Warranty Disclaimers may have is void and has no effect on the meaning of this License. - + 2. VERBATIM COPYING @@ -156,13 +158,13 @@ You may also lend copies, under the same conditions stated above, and you may publicly display copies. - + 3. COPYING IN QUANTITY If you publish printed copies (or copies in media that commonly have printed covers) of the Document, numbering more than 100, and the - Document’s license notice requires Cover Texts, you must enclose + Document’s license notice requires Cover Texts, you must enclose the copies in covers that carry, clearly and legibly, all these Cover Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on the back cover. Both covers must also clearly and legibly identify you as the @@ -195,7 +197,7 @@ Document well before redistributing any large number of copies, to give them a chance to provide you with an updated version of the Document. - + 4. MODIFICATIONS @@ -252,7 +254,7 @@ Preserve in that license notice the full lists of Invariant Sections - and required Cover Texts given in the Document’s license + and required Cover Texts given in the Document’s license notice. @@ -263,10 +265,10 @@ - Preserve the section Entitled “History”, Preserve its + Preserve the section Entitled “History”, Preserve its Title, and add to it an item stating at least the title, year, new authors, and publisher of the Modified Version as given on the Title - Page. If there is no section Entitled “History” in the + Page. If there is no section Entitled “History” in the Document, create one stating the title, year, authors, and publisher of the Document as given on its Title Page, then add an item describing the Modified Version as stated in the previous sentence. @@ -277,7 +279,7 @@ Preserve the network location, if any, given in the Document for public access to a Transparent copy of the Document, and likewise the network locations given in the Document for previous versions it was - based on. These may be placed in the “History” + based on. These may be placed in the “History” section. You may omit a network location for a work that was published at least four years before the Document itself, or if the original publisher of the version it refers to gives permission. @@ -285,8 +287,8 @@ - For any section Entitled “Acknowledgements” or - “Dedications”, Preserve the Title of the section, and + For any section Entitled “Acknowledgements” or + “Dedications”, Preserve the Title of the section, and preserve in the section all the substance and tone of each of the contributor acknowledgements and/or dedications given therein. @@ -300,14 +302,14 @@ - Delete any section Entitled “Endorsements”. Such a section + Delete any section Entitled “Endorsements”. Such a section may not be included in the Modified Version. Do not retitle any existing section to be Entitled - “Endorsements” or to conflict in title with any Invariant + “Endorsements” or to conflict in title with any Invariant Section. @@ -322,13 +324,13 @@ that qualify as Secondary Sections and contain no material copied from the Document, you may at your option designate some or all of these sections as invariant. To do this, add their titles to the list of Invariant - Sections in the Modified Version’s license notice. These titles + Sections in the Modified Version’s license notice. These titles must be distinct from any other section titles. - You may add a section Entitled “Endorsements”, provided it + You may add a section Entitled “Endorsements”, provided it contains nothing but endorsements of your Modified Version by various - parties — for example, statements of peer review or that the text + parties — for example, statements of peer review or that the text has been approved by an organization as the authoritative definition of a standard. @@ -348,7 +350,7 @@ permission to use their names for publicity for or to assert or imply endorsement of any Modified Version. - + 5. COMBINING DOCUMENTS @@ -371,13 +373,13 @@ In the combination, you must combine any sections Entitled - “History” in the various original documents, forming one - section Entitled “History”; likewise combine any sections - Entitled “Acknowledgements”, and any sections Entitled - “Dedications”. You must delete all sections Entitled - “Endorsements”. + “History” in the various original documents, forming one + section Entitled “History”; likewise combine any sections + Entitled “Acknowledgements”, and any sections Entitled + “Dedications”. You must delete all sections Entitled + “Endorsements”. - + 6. COLLECTIONS OF DOCUMENTS @@ -393,15 +395,15 @@ License into the extracted document, and follow this License in all other respects regarding verbatim copying of that document. - + 7. AGGREGATION WITH INDEPENDENT WORKS A compilation of the Document or its derivatives with other separate and independent documents or works, in or on a volume of a storage or - distribution medium, is called an “aggregate” if the copyright + distribution medium, is called an “aggregate” if the copyright resulting from the compilation is not used to limit the legal rights of - the compilation’s users beyond what the individual works + the compilation’s users beyond what the individual works permit. When the Document is included in an aggregate, this License does not apply to the other works in the aggregate which are not themselves derivative works of the Document. @@ -409,12 +411,12 @@ If the Cover Text requirement of section 3 is applicable to these copies of the Document, then if the Document is less than one half of the entire - aggregate, the Document’s Cover Texts may be placed on covers that + aggregate, the Document’s Cover Texts may be placed on covers that bracket the Document within the aggregate, or the electronic equivalent of covers if the Document is in electronic form. Otherwise they must appear on printed covers that bracket the whole aggregate. - + 8. TRANSLATION @@ -431,12 +433,12 @@ License or a notice or disclaimer, the original version will prevail. - If a section in the Document is Entitled “Acknowledgements”, - “Dedications”, or “History”, the requirement + If a section in the Document is Entitled “Acknowledgements”, + “Dedications”, or “History”, the requirement (section 4) to Preserve its Title (section 1) will typically require changing the actual title. - + 9. TERMINATION @@ -467,7 +469,7 @@ reinstated, receipt of a copy of some or all of the same material does not give you any rights to use it. - + 10. FUTURE REVISIONS OF THIS LICENSE @@ -475,46 +477,46 @@ Free Documentation License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. See - Copyleft. + Copyleft. Each version of the License is given a distinguishing version number. If the Document specifies that a particular numbered version of this License - “or any later version” applies to it, you have the option of + “or any later version” applies to it, you have the option of following the terms and conditions either of that specified version or of any later version that has been published (not as a draft) by the Free Software Foundation. If the Document does not specify a version number of this License, you may choose any version ever published (not as a draft) by the Free Software Foundation. If the Document specifies that a proxy can decide which future versions of this License can be used, that - proxy’s public statement of acceptance of a version permanently + proxy’s public statement of acceptance of a version permanently authorizes you to choose that version for the Document. - + 11. RELICENSING - “Massive Multiauthor Collaboration Site” (or “MMC - Site”) means any World Wide Web server that publishes copyrightable + “Massive Multiauthor Collaboration Site” (or “MMC + Site”) means any World Wide Web server that publishes copyrightable works and also provides prominent facilities for anybody to edit those works. A public wiki that anybody can edit is an example of such a - server. A “Massive Multiauthor Collaboration” (or - “MMC”) contained in the site means any set of copyrightable + server. A “Massive Multiauthor Collaboration” (or + “MMC”) contained in the site means any set of copyrightable works thus published on the MMC site. - “CC-BY-SA” means the Creative Commons Attribution-Share Alike + “CC-BY-SA” means the Creative Commons Attribution-Share Alike 3.0 license published by Creative Commons Corporation, a not-for-profit corporation with a principal place of business in San Francisco, California, as well as future copyleft versions of that license published by that same organization. - “Incorporate” means to publish or republish a Document, in + “Incorporate” means to publish or republish a Document, in whole or in part, as part of another Document. - An MMC is “eligible for relicensing” if it is licensed under + An MMC is “eligible for relicensing” if it is licensed under this License, and if all works that were first published under this License somewhere other than this MMC, and subsequently incorporated in whole or in part into the MMC, (1) had no cover texts or invariant @@ -525,7 +527,7 @@ under CC-BY-SA on the same site at any time before August 1, 2009, provided the MMC is eligible for relicensing. - + ADDENDUM: How to use this License for your documents @@ -533,16 +535,16 @@ License in the document and put the following copyright and license notices just after the title page: - Copyright © YEAR YOUR NAME + Copyright © YEAR YOUR NAME Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in -the section entitled “GNU Free Documentation License”. +the section entitled “GNU Free Documentation License”. If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts, - replace the “with… Texts.” line with this: + replace the “with… Texts.” line with this: with the Invariant Sections being LIST THEIR TITLES, with the Front-Cover Texts being LIST, and with the Back-Cover Texts being LIST. diff --git a/libstdc++-v3/doc/xml/gnu/gpl-2.0.xml b/libstdc++-v3/doc/xml/gnu/gpl-2.0.xml index 151a9523f072..cf012ec960b2 100644 --- a/libstdc++-v3/doc/xml/gnu/gpl-2.0.xml +++ b/libstdc++-v3/doc/xml/gnu/gpl-2.0.xml @@ -1,15 +1,13 @@ - - - - - GNU General Public License + + GNU General Public License + Version 2, June 1991 1989, 1991 Free Software Foundation, Inc. - +
Free Software Foundation, Inc. 51 Franklin Street, Fifth Floor, @@ -20,16 +18,16 @@ Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Version 2, June 1991 - - GNU General Public License -
- Preamble + + +
Preamble + The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software - to make sure the software is free for all its users. This General Public License applies to most of the Free Software - Foundation's software and to any other program whose authors commit + Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Library General Public License instead.) You can apply it to your programs, too. @@ -52,7 +50,7 @@ must show them these terms so they know their rights. We protect your rights with two steps: - + copyright the software, and @@ -63,26 +61,26 @@ - Also, for each author's protection and ours, we want to make certain that + Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any - problems introduced by others will not reflect on the original authors' + problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be - licensed for everyone's free use or not licensed at all. + licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow.
-
- TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION -
- Section 0 +
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + +
Section 0 + This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The Program, below, refers to any such @@ -100,9 +98,9 @@ constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does.
-
- Section 1 - You may copy and distribute verbatim copies of the Program's source code as you +
Section 1 + + You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any @@ -112,14 +110,14 @@ You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee.
-
- Section 2 +
Section 2 + You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: - + You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. @@ -161,13 +159,13 @@ (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License.
-
- Section 3 +
Section 3 + You may copy and distribute the Program (or a work based on it, under Section 2 in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: - + Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium @@ -202,16 +200,16 @@ counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code.
-
- Section 4 +
Section 4 + You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance.
-
- Section 5 +
Section 5 + You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying @@ -219,16 +217,16 @@ of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it.
-
- Section 6 +
Section 6 + Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions - on the recipients' exercise of the rights granted herein. You are not responsible for enforcing + on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License.
-
- Section 7 +
Section 7 + If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you @@ -254,16 +252,16 @@ This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License.
-
- Section 8 +
Section 8 + If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License.
-
- Section 9 +
Section 9 + The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. @@ -274,16 +272,16 @@ Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation.
-
- Section 10 +
Section 10 + If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally.
-
- NO WARRANTY Section 11 +
NO WARRANTY Section 11 + BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM AS IS WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, @@ -291,8 +289,8 @@ PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
-
- Section 12 +
Section 12 + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE @@ -304,8 +302,8 @@ END OF TERMS AND CONDITIONS
-
- How to Apply These Terms to Your New Programs +
How to Apply These Terms to Your New Programs + If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. @@ -315,7 +313,7 @@ convey the exclusion of warranty; and each file should have at least the copyright line and a pointer to where the full notice is found. - <one line to give the program's name and a brief idea of what it does.> + <one line to give the program's name and a brief idea of what it does.> Copyright (C) <year> <name of author> This program is free software; you can redistribute it and/or modify diff --git a/libstdc++-v3/doc/xml/gnu/gpl-3.0.xml b/libstdc++-v3/doc/xml/gnu/gpl-3.0.xml index 90fa18be431d..d5a5eae203bc 100644 --- a/libstdc++-v3/doc/xml/gnu/gpl-3.0.xml +++ b/libstdc++-v3/doc/xml/gnu/gpl-3.0.xml @@ -1,23 +1,21 @@ - - - - - +<appendix xmlns="http://docbook.org/ns/docbook" version="5.0" + xml:id="appendix.gpl-3.0"><info><title> <acronym>GNU</acronym> General Public License version 3 - + + + Version 3, 29 June 2007 - Copyright © 2007 Free Software Foundation, Inc. - http://www.fsf.org/ + Copyright © 2007 Free Software Foundation, Inc. + http://www.fsf.org/ Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. - + Preamble @@ -28,7 +26,7 @@ The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your - freedom to share and change all versions of a program—to make sure it + freedom to share and change all versions of a program—to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its @@ -61,9 +59,9 @@ distribute and/or modify it. - For the developers’ and authors’ protection, the + For the developers’ and authors’ protection, the GPL clearly explains that there is no warranty for this - free software. For both users’ and authors’ sake, the + free software. For both users’ and authors’ sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions. @@ -71,7 +69,7 @@ Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. - This is fundamentally incompatible with the aim of protecting users’ + This is fundamentally incompatible with the aim of protecting users’ freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the @@ -95,36 +93,36 @@ TERMS AND CONDITIONS - + 0. Definitions. - “This License” refers to version 3 of the GNU + “This License” refers to version 3 of the GNU General Public License. - “Copyright” also means copyright-like laws that apply to other + “Copyright” also means copyright-like laws that apply to other kinds of works, such as semiconductor masks. - “The Program” refers to any copyrightable work licensed under - this License. Each licensee is addressed as “you”. - “Licensees” and “recipients” may be individuals or + “The Program” refers to any copyrightable work licensed under + this License. Each licensee is addressed as “you”. + “Licensees” and “recipients” may be individuals or organizations. - To “modify” a work means to copy from or adapt all or part of + To “modify” a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making - of an exact copy. The resulting work is called a “modified - version” of the earlier work or a work “based on” the + of an exact copy. The resulting work is called a “modified + version” of the earlier work or a work “based on” the earlier work. - A “covered work” means either the unmodified Program or a work + A “covered work” means either the unmodified Program or a work based on the Program. - To “propagate” a work means to do anything with it that, without + To “propagate” a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with @@ -132,13 +130,13 @@ countries other activities as well. - To “convey” a work means any kind of propagation that enables + To “convey” a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying. - An interactive user interface displays “Appropriate Legal - Notices” to the extent that it includes a convenient and prominently + An interactive user interface displays “Appropriate Legal + Notices” to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this @@ -146,37 +144,37 @@ a list of user commands or options, such as a menu, a prominent item in the list meets this criterion. - + 1. Source Code. - The “source code” for a work means the preferred form of the - work for making modifications to it. “Object code” means any + The “source code” for a work means the preferred form of the + work for making modifications to it. “Object code” means any non-source form of a work. - A “Standard Interface” means an interface that either is an + A “Standard Interface” means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language. - The “System Libraries” of an executable work include anything, + The “System Libraries” of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available - to the public in source code form. A “Major Component”, in this + to the public in source code form. A “Major Component”, in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it. - The “Corresponding Source” for a work in object code form means + The “Corresponding Source” for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to - control those activities. However, it does not include the work’s + control those activities. However, it does not include the work’s System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes @@ -193,7 +191,7 @@ The Corresponding Source for a work in source code form is that same work. - + 2. Basic Permissions. @@ -222,8 +220,8 @@ conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary. - - 3. Protecting Users’ Legal Rights From Anti-Circumvention Law. + + 3. Protecting Users’ Legal Rights From Anti-Circumvention Law. No covered work shall be deemed part of an effective technological measure @@ -236,15 +234,15 @@ circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of - the work as a means of enforcing, against the work’s users, your or - third parties’ legal rights to forbid circumvention of technological + the work as a means of enforcing, against the work’s users, your or + third parties’ legal rights to forbid circumvention of technological measures. - + 4. Conveying Verbatim Copies. - You may convey verbatim copies of the Program’s source code as you + You may convey verbatim copies of the Program’s source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice; keep intact all notices stating that this License and any non-permissive terms added in @@ -256,7 +254,7 @@ You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee. - + 5. Conveying Modified Source Versions. @@ -264,7 +262,7 @@ it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions: - + The work must carry prominent notices stating that you modified it, and @@ -275,8 +273,8 @@ The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement - modifies the requirement in section 4 to “keep intact all - notices”. + modifies the requirement in section 4 to “keep intact all + notices”. @@ -303,13 +301,13 @@ A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of - a storage or distribution medium, is called an “aggregate” if + a storage or distribution medium, is called an “aggregate” if the compilation and its resulting copyright are not used to limit the access - or legal rights of the compilation’s users beyond what the individual works + or legal rights of the compilation’s users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate. - + 6. Conveying Non-Source Forms. @@ -317,7 +315,7 @@ sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways: - + Convey the object code in, or embodied in, a physical product (including @@ -379,13 +377,13 @@ conveying the object code work. - A “User Product” is either (1) a “consumer product”, + A “User Product” is either (1) a “consumer product”, which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. - For a particular product received by a particular user, “normally - used” refers to a typical or common use of that class of product, + For a particular product received by a particular user, “normally + used” refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product @@ -393,7 +391,7 @@ uses represent the only significant mode of use of the product. - “Installation Information” for a User Product means any methods, + “Installation Information” for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice @@ -429,11 +427,11 @@ and must require no special password or key for unpacking, reading or copying. - + 7. Additional Terms. - “Additional permissions” are terms that supplement the terms of + “Additional permissions” are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that @@ -455,7 +453,7 @@ to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms: - + Disclaiming warranty or limiting liability differently from the terms @@ -499,8 +497,8 @@ - All other non-permissive additional terms are considered “further - restrictions” within the meaning of section 10. If the Program as + All other non-permissive additional terms are considered “further + restrictions” within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further @@ -520,7 +518,7 @@ of a separately written license, or stated as exceptions; the above requirements apply either way. - + 8. Termination. @@ -551,7 +549,7 @@ reinstated, you do not qualify to receive new licenses for the same material under section 10. - + 9. Acceptance Not Required for Having Copies. @@ -564,7 +562,7 @@ Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so. - + 10. Automatic Licensing of Downstream Recipients. @@ -574,12 +572,12 @@ compliance by third parties with this License. - An “entity transaction” is a transaction transferring control + An “entity transaction” is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the - party’s predecessor in interest had or could give under the previous + party’s predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts. @@ -593,36 +591,36 @@ by making, using, selling, offering for sale, or importing the Program or any portion of it. - + 11. Patents. - A “contributor” is a copyright holder who authorizes use under + A “contributor” is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The - work thus licensed is called the contributor’s “contributor - version”. + work thus licensed is called the contributor’s “contributor + version”. - A contributor’s “essential patent claims” are all patent + A contributor’s “essential patent claims” are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, - “control” includes the right to grant patent sublicenses in a + “control” includes the right to grant patent sublicenses in a manner consistent with the requirements of this License. Each contributor grants you a non-exclusive, worldwide, royalty-free patent - license under the contributor’s essential patent claims, to make, use, + license under the contributor’s essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version. - In the following three paragraphs, a “patent license” is any + In the following three paragraphs, a “patent license” is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not - to sue for patent infringement). To “grant” such a patent + to sue for patent infringement). To “grant” such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party. @@ -634,10 +632,10 @@ cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, - to extend the patent license to downstream recipients. “Knowingly - relying” means you have actual knowledge that, but for the patent + to extend the patent license to downstream recipients. “Knowingly + relying” means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your - recipient’s use of the covered work in a country, would infringe one + recipient’s use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid. @@ -650,7 +648,7 @@ all recipients of the covered work and works based on it. - A patent license is “discriminatory” if it does not include + A patent license is “discriminatory” if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work @@ -669,8 +667,8 @@ implied license or other defenses to infringement that may otherwise be available to you under applicable patent law. - - 12. No Surrender of Others’ Freedom. + + 12. No Surrender of Others’ Freedom. If conditions are imposed on you (whether by court order, agreement or @@ -683,7 +681,7 @@ Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program. - + 13. Use with the GNU Affero General Public License. @@ -696,7 +694,7 @@ section 13, concerning interaction through a network will apply to the combination as such. - + 14. Revised Versions of this License. @@ -708,7 +706,7 @@ Each version is given a distinguishing version number. If the Program specifies that a certain numbered version of the GNU - General Public License “or any later version” applies to it, you + General Public License “or any later version” applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the @@ -718,7 +716,7 @@ If the Program specifies that a proxy can decide which future versions of the GNU General Public License can be used, that - proxy’s public statement of acceptance of a version permanently + proxy’s public statement of acceptance of a version permanently authorizes you to choose that version for the Program. @@ -726,20 +724,20 @@ However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version. - + 15. Disclaimer of Warranty. THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR - OTHER PARTIES PROVIDE THE PROGRAM “AS IS” WITHOUT WARRANTY OF + OTHER PARTIES PROVIDE THE PROGRAM “AS IS” WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. - + 16. Limitation of Liability. @@ -753,7 +751,7 @@ EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. - + 17. Interpretation of Sections 15 and 16. @@ -767,7 +765,7 @@ END OF TERMS AND CONDITIONS - + How to Apply These Terms to Your New Programs @@ -779,11 +777,11 @@ To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively state the exclusion of warranty; and each file should have at least the - “copyright” line and a pointer to where the full notice is + “copyright” line and a pointer to where the full notice is found. -one line to give the program’s name and a brief idea of what it does. +one line to give the program’s name and a brief idea of what it does. Copyright (C) year name of author This program is free software: you can redistribute it and/or modify @@ -797,7 +795,7 @@ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License -along with this program. If not, see http://www.gnu.org/licenses/. +along with this program. If not, see http://www.gnu.org/licenses/. Also add information on how to contact you by electronic and paper mail. @@ -808,22 +806,22 @@ along with this program. If not, see program Copyright (C) year name of author -This program comes with ABSOLUTELY NO WARRANTY; for details type ‘show w’. +This program comes with ABSOLUTELY NO WARRANTY; for details type ‘show w’. This is free software, and you are welcome to redistribute it -under certain conditions; type ‘show c’ for details. +under certain conditions; type ‘show c’ for details. - The hypothetical commands ‘show w’ and - ‘show c’ should show the appropriate parts of - the General Public License. Of course, your program’s commands might be - different; for a GUI interface, you would use an “about box”. + The hypothetical commands ‘show w’ and + ‘show c’ should show the appropriate parts of + the General Public License. Of course, your program’s commands might be + different; for a GUI interface, you would use an “about box”. You should also get your employer (if you work as a programmer) or school, - if any, to sign a “copyright disclaimer” for the program, if + if any, to sign a “copyright disclaimer” for the program, if necessary. For more information on this, and how to apply and follow the GNU GPL, see - http://www.gnu.org/licenses/. + http://www.gnu.org/licenses/. The GNU General Public License does not permit @@ -831,7 +829,6 @@ under certain conditions; type ‘show c’ for detai subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this - License. But first, please read http://www.gnu.org/philosophy/why-not-lgpl.html. + License. But first, please read http://www.gnu.org/philosophy/why-not-lgpl.html. diff --git a/libstdc++-v3/doc/xml/manual/abi.xml b/libstdc++-v3/doc/xml/manual/abi.xml index 400d2a4b931f..268f0a69199d 100644 --- a/libstdc++-v3/doc/xml/manual/abi.xml +++ b/libstdc++-v3/doc/xml/manual/abi.xml @@ -1,7 +1,8 @@ - +
- +ABI Policy and Guidelines C++ @@ -22,15 +23,15 @@ compatibility - + + -ABI Policy and Guidelines - -The C++ Interface +
The C++ Interface + C++ applications often depend on specific language support @@ -53,9 +54,8 @@ 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 ABI - specification. + found in the ABI + specification. @@ -65,8 +65,8 @@ g++ command line options may change the ABI as a side-effect of use. Such flags include -fpack-struct and -fno-exceptions, but include others: see the complete - list in the GCC manual under the heading Options - for Code Generation Conventions. + list in the GCC manual under the heading Options + for Code Generation Conventions. @@ -105,18 +105,18 @@ given compiler ABI. In a nutshell: implements the C++ ABI in question. - +
+ +
Versioning - -Versioning The C++ interface has evolved throughout the history of the GNU C++ toolchain. With each release, various details have been changed so as to give distinct versions to the C++ interface. - - Goals +
Goals + Extending existing, stable ABIs. Versioning gives subsequent releases of library binaries the ability to add new symbols and add @@ -136,10 +136,10 @@ compatible. Allows multiple, incompatible ABIs to coexist at the same time. - +
- - History +
History + How can this complexity be managed? What does C++ versioning mean? @@ -298,8 +298,7 @@ compatible. Note 3: This release (but not previous or subsequent) has one - known incompatibility, see 33678 + known incompatibility, see 33678 in the GCC bug database. @@ -379,7 +378,7 @@ compatible. gcc-3.4.x, gcc-4.[0-5].x: 1000 + n (when n>1) gcc-3.4.x, gcc-4.[0-5].x: 999999 (when n=0) - + @@ -396,7 +395,7 @@ compatible. gcc-3.3.x: -fabi-version=1 gcc-3.4.x, gcc-4.[0-5].x: -fabi-version=2 (Incompatible with previous) - + @@ -460,7 +459,7 @@ compatible. gcc-4.4.1: 20090722 gcc-4.4.2: 20091015 - + @@ -501,7 +500,7 @@ compatible. gcc-3.4.x: "version-unused" gcc-4.[0-5].x: "version-unused" - + @@ -564,7 +563,7 @@ compatible. gcc-4.4.2: include/c++/4.4.2 gcc-4.5.0: include/c++/4.5.0 - + @@ -577,10 +576,10 @@ compatible. - +
- - Prerequisites +
Prerequisites + Minimum environment that supports a versioned ABI: A supported dynamic linker, a GNU linker of sufficient vintage to understand @@ -601,10 +600,10 @@ compatible. gcc-3.1.x tools and more recent vintages, will meet the requirements above, as does Solaris 2.5 and up. - +
- - Configuring +
Configuring + It turns out that most of the configure options that change @@ -631,10 +630,10 @@ compatible. versioning are in place. For more information, please consult acinclude.m4. - +
- - Checking Active +
Checking Active + When the GNU C++ library is being built with symbol versioning @@ -704,11 +703,11 @@ On Solaris 2, you can use pvs -r instead: ldd -v works too, but is very verbose. - - +
+
+ +
Allowed Changes - -Allowed Changes The following will cause the library minor version number to @@ -723,10 +722,10 @@ increase, say from "libstdc++.so.3.0.4" to "libstdc++.so.3.0.5". Other allowed changes are possible. - +
+ +
Prohibited Changes - -Prohibited Changes The following non-exhaustive list will cause the library major version @@ -755,18 +754,18 @@ number to increase, say from "libstdc++.so.3.0.4" to 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 this part +class in registers, the compiler will be forced to use memory. See this part of the C++ ABI documentation for further details. - +
- -Implementation +
Implementation + @@ -880,13 +879,13 @@ standard includes. - +
- -Testing +
Testing - - Single ABI Testing + +
Single ABI Testing + Testing for GNU C++ ABI changes is composed of two distinct @@ -982,9 +981,9 @@ Perhaps there are other C++ ABI checkers. If so, please notify us. We'd like to know about them! - - - Multiple ABI Testing +
+
Multiple ABI Testing + A "C" application, dynamically linked to two shared libraries, liba, libb. The dependent library liba is a C++ shared library compiled with @@ -1069,11 +1068,11 @@ gcc test.c -g -O2 -L. -lone -ltwo /usr/lib/libstdc++.so.5 /usr/lib/libstdc++.so. code from both liba, and the dependent libstdc++.so.6, and libb, with the dependent libstdc++.so.5. - - +
+
+ +
Outstanding Issues - -Outstanding Issues Some features in the C++ language make versioning especially @@ -1089,149 +1088,119 @@ gcc test.c -g -O2 -L. -lone -ltwo /usr/lib/libstdc++.so.5 /usr/lib/libstdc++.so. -24660: versioning weak symbols in libstdc++ +24660: versioning weak symbols in libstdc++ -19664: libstdc++ headers should have pop/push of the visibility around the declarations +19664: libstdc++ headers should have pop/push of the visibility around the declarations - +
+ +Bibliography - -Bibliography - - - - ABIcheck, a vague idea of checking ABI compatibility - - - + + + + ABIcheck, a vague idea of checking ABI compatibility + - - - - C++ ABI Reference - - + + + C++ ABI Reference + - - - - Intel Compilers for Linux Compatibility with the GNU Compilers - - - + + + + Intel Compilers for Linux Compatibility with the GNU Compilers + - - - - Linker and Libraries Guide (document 819-0690) - - - + + + + Linker and Libraries Guide (document 819-0690) + - - - - Sun Studio 11: C++ Migration Guide (document 819-3689) - - + + + Sun Studio 11: C++ Migration Guide (document 819-3689) + - - - - How to Write Shared Libraries - - + + + How to Write Shared Libraries + - Ulrich - Drepper + + UlrichDrepper + - - - - C++ ABI for the ARM Architecture - - + + + C++ ABI for the ARM Architecture + - - - - Dynamic Shared Objects: Survey and Issues - - + + + Dynamic Shared Objects: Survey and Issues + ISO C++ J16/06-0046 - - Benjamin - Kosnik - + BenjaminKosnik - - - - Versioning With Namespaces - - - + + + + Versioning With Namespaces + ISO C++ J16/06-0083 - - Benjamin - Kosnik - + BenjaminKosnik - - - - Binary Compatibility of Shared Libraries Implemented in C++ - on GNU/Linux Systems - - + + + Binary Compatibility of Shared Libraries Implemented in C++ + on GNU/Linux Systems + + SYRCoSE 2009 - - Pavel - Shved - - - Denis - Silakov - + PavelShved + DenisSilakov - +
diff --git a/libstdc++-v3/doc/xml/manual/algorithms.xml b/libstdc++-v3/doc/xml/manual/algorithms.xml index 008fd0286edf..831fe5fe6023 100644 --- a/libstdc++-v3/doc/xml/manual/algorithms.xml +++ b/libstdc++-v3/doc/xml/manual/algorithms.xml @@ -1,12 +1,11 @@ - - - - + - + + Algorithms + <indexterm><primary>Algorithms</primary></indexterm> + ISO C++ @@ -18,19 +17,16 @@ algorithm - + + - - Algorithms - <indexterm><primary>Algorithms</primary></indexterm> - The neatest accomplishment of the algorithms sect1 is that all the work is done via iterators, not containers directly. This means two important things: - + Anything that behaves like an iterator can be used in one of @@ -63,7 +59,7 @@ The single thing that trips people up the most is the definition of range used with iterators; the famous - "past-the-end" rule that everybody loves to hate. The + "past-the-end" rule that everybody loves to hate. The iterators sect1 of this document has a complete explanation of this simple rule that seems to cause so much confusion. Once you @@ -74,14 +70,14 @@ - - Mutating +
Mutating + - - <function>swap</function> +
<function>swap</function> + - - Specializations +
Specializations + If you call std::swap(x,y); where x and y are standard containers, then the call will automatically be replaced by a call to @@ -89,16 +85,16 @@ This allows member functions of each container class to take over, and containers' swap functions should have O(1) complexity according to - the standard. (And while "should" allows implementations to + the standard. (And while "should" allows implementations to behave otherwise and remain compliant, this implementation does in fact use constant-time swaps.) This should not be surprising, since for two containers of the same type to swap contents, only some internal pointers to storage need to be exchanged. - - - +
+
+
diff --git a/libstdc++-v3/doc/xml/manual/allocator.xml b/libstdc++-v3/doc/xml/manual/allocator.xml index ca1c8cb86099..b73554eb90e1 100644 --- a/libstdc++-v3/doc/xml/manual/allocator.xml +++ b/libstdc++-v3/doc/xml/manual/allocator.xml @@ -1,7 +1,8 @@ -
+
- +Allocators ISO C++ @@ -10,9 +11,9 @@ allocator - + + -Allocators Memory management for Standard Library entities is encapsulated in a @@ -24,8 +25,8 @@ management classes. -
-Requirements +
Requirements + The C++ standard only gives a few directives in this area: @@ -87,15 +88,14 @@
-
-Design Issues +
Design Issues + The easiest way of fulfilling the requirements is to call operator new each time a container needs memory, and to call operator delete each time - the container releases memory. This method may be slower + the container releases memory. This method may be slower than caching the allocations and re-using previously-allocated memory, but has the advantage of working correctly across a wide variety of hardware and operating systems, including large @@ -138,11 +138,11 @@
-
-Implementation +
Implementation -
- Interface Design + +
Interface Design + The only allocator interface that @@ -165,8 +165,8 @@
-
- Selecting Default Allocation Policy +
Selecting Default Allocation Policy + It's difficult to pick an allocation strategy that will provide @@ -189,8 +189,8 @@ Over multiple iterations, various STL container objects have elements inserted to some maximum amount. A variety of allocators are tested. - Test source for sequence - and associative + Test source for sequence + and associative containers. @@ -205,7 +205,7 @@ on a per-thread basis, as well as measuring thread contention for memory resources. Test source - here. + here. @@ -215,9 +215,9 @@ Test source for - sequence + sequence and - associative + associative containers. @@ -231,8 +231,8 @@
-
- Disabling Memory Caching +
Disabling Memory Caching + In use, allocator may allocate and @@ -285,8 +285,8 @@
-
-Using a Specific Allocator +
Using a Specific Allocator + You can specify different memory management schemes on a @@ -305,8 +305,8 @@
-
-Custom Allocators +
Custom Allocators + Writing a portable C++ allocator would dictate that the interface @@ -323,8 +323,8 @@
-
-Extension Allocators +
Extension Allocators + Several other allocators are provided as part of this @@ -472,8 +472,7 @@ A high-performance fixed-size allocator with exponentially-increasing allocations. It has its own - documentation, found here. + documentation, found here. @@ -484,21 +483,20 @@ A high-performance allocator that uses a bit-map to keep track of the used and unused memory locations. It has its own - documentation, found here. + documentation, found here.
- -Bibliography +Bibliography + - + <citetitle> ISO/IEC 14882:1998 Programming languages - C++ - + isoc++_1998 @@ -506,17 +504,13 @@ - - - - The Standard Librarian: What Are Allocators Good For? - - + - - Matt - Austern - + + The Standard Librarian: What Are Allocators Good For? + + + MattAustern C/C++ Users Journal @@ -525,39 +519,25 @@ - - - - The Hoard Memory Allocator - - + - - Emery - Berger - + + The Hoard Memory Allocator + + + EmeryBerger - - - - Reconsidering Custom Memory Allocation - - + - - Emery - Berger - - - Ben - Zorn - - - Kathryn - McKinley - + + Reconsidering Custom Memory Allocation + + + EmeryBerger + BenZorn + KathrynMcKinley 2002 OOPSLA @@ -566,21 +546,14 @@ - - - - Allocator Types - - + - - Klaus - Kreft - - - Angelika - Langer - + + Allocator Types + + + KlausKreft + AngelikaLanger C/C++ Users Journal @@ -589,14 +562,11 @@ - The C++ Programming Language - - Bjarne - Stroustrup - + The C++ Programming Language + BjarneStroustrup 2000 - + 19.4 Allocators @@ -607,11 +577,8 @@ - Yalloc: A Recycling C++ Allocator - - Felix - Yen - + Yalloc: A Recycling C++ Allocator + FelixYen diff --git a/libstdc++-v3/doc/xml/manual/appendix_contributing.xml b/libstdc++-v3/doc/xml/manual/appendix_contributing.xml index a9d32814df04..7dfe8e0ddf4e 100644 --- a/libstdc++-v3/doc/xml/manual/appendix_contributing.xml +++ b/libstdc++-v3/doc/xml/manual/appendix_contributing.xml @@ -1,12 +1,14 @@ - - - - + - + + Contributing + <indexterm> + <primary>Appendix</primary> + <secondary>Contributing</secondary> + </indexterm> + ISO C++ @@ -15,15 +17,9 @@ library - + + - - Contributing - <indexterm> - <primary>Appendix</primary> - <secondary>Contributing</secondary> - </indexterm> - The GNU C++ Library follows an open development model. Active @@ -32,11 +28,11 @@ should follow this procedure: - - Contributor Checklist +
Contributor Checklist + - - Reading +
Reading + @@ -50,9 +46,9 @@ the standard from their respective national standards organization. In the USA, this national standards organization is ANSI and their web-site is right - here. + here. (And if you've already registered with them, clicking this link will take you to directly to the place where you can - buy the standard on-line.) + buy the standard on-line.) @@ -60,7 +56,7 @@ The library working group bugs, and known defects, can be obtained here: - http://www.open-std.org/jtc1/sc22/wg21 + http://www.open-std.org/jtc1/sc22/wg21 @@ -69,16 +65,16 @@ The newsgroup dedicated to standardization issues is comp.std.c++: this FAQ for this group is quite useful and can be - found - here . + found + here . Peruse - the GNU - Coding Standards, and chuckle when you hit the part + the GNU + Coding Standards, and chuckle when you hit the part about Using Languages Other Than C. @@ -100,9 +96,9 @@ - - - Assignment +
+
Assignment + Small changes can be accepted without a copyright assignment form on file. New code and additions to the library need completed copyright @@ -129,8 +125,8 @@ For more information about getting a copyright assignment, please see - Legal - Matters. + Legal + Matters. @@ -141,18 +137,18 @@ mailto:assign@gnu.org, please cc the libstdc++ maintainer above so that progress can be monitored. - +
- - Getting Sources +
Getting Sources + - Getting write access - (look for "Write after approval") + Getting write access + (look for "Write after approval") - +
- - Submitting Patches +
Submitting Patches + Every patch must have several pieces of information before it can be @@ -195,8 +191,8 @@ else, use diff -cp OLD NEW ... If your version of diff does not support these options, then get the latest version of GNU - diff. The SVN - Tricks wiki page has information on customising the + diff. The SVN + Tricks wiki page has information on customising the output of svn diff. @@ -211,20 +207,20 @@ - +
- +
- +
Directory Layout and Source Conventions - Directory Layout and Source Conventions + The unpacked source directory of libstdc++ contains the files needed to create the GNU C++ Library. - + It has subdirectories: doc @@ -311,20 +307,20 @@ a bug or incompletely-implemented feature. Lines marked "XXX MT" indicate a place that may require attention for multi-thread safety. - +
- +
Coding Style - Coding Style + - - Bad Identifiers +
Bad Identifiers + Identifiers that conflict and should be avoided. - + This is the list of names reserved to the implementation that have been claimed by certain compilers and system headers of interest, and should not be used @@ -511,22 +507,22 @@ indicate a place that may require attention for multi-thread safety. // http://gcc.gnu.org/ml/libstdc++/1999-q4/msg00060.html __opr - +
- - By Example - +
By Example + + This library is written to appropriate C++ coding standards. As such, it is intended to precede the recommendations of the GNU Coding Standard, which can be referenced in full here: - http://www.gnu.org/prep/standards/standards.html#Formatting + http://www.gnu.org/prep/standards/standards.html#Formatting The rest of this is also interesting reading, but skip the "Design Advice" part. The GCC coding conventions are here, and are also useful: - http://gcc.gnu.org/codingconventions.html + http://gcc.gnu.org/codingconventions.html In addition, because it doesn't seem to be stated explicitly anywhere else, there is an 80 column source limit. @@ -941,21 +937,21 @@ indicate a place that may require attention for multi-thread safety. } // namespace std - - +
+
- +
Documentation Style - Documentation Style - - Doxygen - - Prerequisites + +
Doxygen + +
Prerequisites + Prerequisite tools are Bash 2.0 or later, - Doxygen, and - the GNU - coreutils. (GNU versions of find, xargs, and possibly + Doxygen, and + the GNU + coreutils. (GNU versions of find, xargs, and possibly sed and grep are used, just because the GNU versions make things very easy.) @@ -963,28 +959,20 @@ indicate a place that may require attention for multi-thread safety. To generate the pretty pictures and hierarchy graphs, the - Graphviz package + Graphviz package will need to be installed. For PDF - output, - pdflatex is required. + output, + pdflatex is required. - +
- - Generating the Doxygen Files +
Generating the Doxygen Files + The following Makefile rules run Doxygen to generate HTML docs, XML docs, XML docs as a single file, PDF docs, and the man pages. - - Generated files are output into separate sub directores of - doc/doxygen/ in the - build directory, based on the output format. For instance, the - HTML docs will be in doc/doxygen/html. - - make doc-html-doxygen @@ -1005,6 +993,13 @@ indicate a place that may require attention for multi-thread safety. make doc-man-doxygen + + Generated files are output into separate sub directores of + doc/doxygen/ in the + build directory, based on the output format. For instance, the + HTML docs will be in doc/doxygen/html. + + Careful observers will see that the Makefile rules simply call a script from the source tree, run_doxygen, which @@ -1020,10 +1015,10 @@ indicate a place that may require attention for multi-thread safety. library hackers are written in triple-# comments. - +
- - Markup +
Markup + In general, libstdc++ files should be formatted according to @@ -1037,7 +1032,7 @@ indicate a place that may require attention for multi-thread safety. Adding Doxygen markup to a file (informally called doxygenating) is very simple. The Doxygen manual can be found - here. + here. We try to use a very-recent version of Doxygen. @@ -1053,12 +1048,12 @@ indicate a place that may require attention for multi-thread safety. Some commentary to accompany - the first list in the Special - Documentation Blocks section of + the first list in the Special + Documentation Blocks section of the Doxygen manual: - + For longer comments, use the Javadoc style... @@ -1116,7 +1111,7 @@ indicate a place that may require attention for multi-thread safety. - + /** * @brief A model of a linear congruential random number generator. * @@ -1134,11 +1129,12 @@ indicate a place that may require attention for multi-thread safety. doubt, consult the following table. - +
HTML to Doxygen Markup Comparison - - - + + + + @@ -1154,12 +1150,12 @@ indicate a place that may require attention for multi-thread safety. - " + " \" - ' + ' \' @@ -1193,15 +1189,15 @@ indicate a place that may require attention for multi-thread safety.
- +
- +
- - Docbook +
Docbook + - - Prerequisites +
Prerequisites + Editing the DocBook sources requires an XML editor. Many exist: some notable options @@ -1222,16 +1218,16 @@ indicate a place that may require attention for multi-thread safety. - Access to the DocBook stylesheets and DTD is required. The + Access to the DocBook 5.0 stylesheets and schema is required. The stylesheets are usually packaged by vendor, in something - like docbook-style-xsl. To exactly match + like docbook5-style-xsl. To exactly match generated output, please use a version of the stylesheets equivalent - to docbook-style-xsl-1.74.0-5. The + to docbook5-style-xsl-1.75.2-3. The installation directory for this package corresponds to the XSL_STYLE_DIR in doc/Makefile.am and defaults - to /usr/share/sgml/docbook/xsl-stylesheets. + to /usr/share/sgml/docbook/xsl-ns-stylesheets. @@ -1243,18 +1239,16 @@ indicate a place that may require attention for multi-thread safety. For validating the XML document, you'll need something like xmllint and access to the - DocBook DTD. These are provided - by a vendor package like libxml2. + relevant DocBook schema. These are provided + by a vendor package like libxml2 and docbook5-schemas-5.0-4 For PDF output, something that transforms valid Docbook XML to PDF is - required. Possible solutions include dblatex, + required. Possible solutions include dblatex, xmlto, or prince. Of these, dblatex is the default. Other - options are listed on the DocBook web pages. Please + options are listed on the DocBook web pages. Please consult the libstdc++@gcc.gnu.org list when preparing printed manuals for current best practice and suggestions. @@ -1262,8 +1256,7 @@ indicate a place that may require attention for multi-thread safety. For Texinfo output, something that transforms valid Docbook - XML to Texinfo is required. The default choice is docbook2X. + XML to Texinfo is required. The default choice is docbook2X. @@ -1277,10 +1270,10 @@ indicate a place that may require attention for multi-thread safety. xmllint --noout --valid xml/index.xml - +
- - Generating the DocBook Files +
Generating the DocBook Files + The following Makefile rules generate (in order): an HTML @@ -1289,14 +1282,6 @@ xmllint --noout --valid xml/index.xml document. - - Generated files are output into separate sub directores of - doc/docbook/ in the - build directory, based on the output format. For instance, the - HTML docs will be in doc/docbook/html. - - make doc-html-docbook @@ -1313,12 +1298,18 @@ xmllint --noout --valid xml/index.xml make doc-xml-validate-docbook - + + Generated files are output into separate sub directores of + doc/docbook/ in the + build directory, based on the output format. For instance, the + HTML docs will be in doc/docbook/html. + +
- - File Organization and Basics +
File Organization and Basics + - + Which files are important All Docbook files are in the directory @@ -1379,24 +1370,25 @@ xmllint --noout --valid xml/index.xml </set> - +
- - Markup By Example +
Markup By Example + Complete details on Docbook markup can be found in the DocBook Element Reference, - online. + online. An incomplete reference for HTML to Docbook conversion is detailed in the table below. - +
HTML to Docbook XML Markup Comparison - - - + + + + @@ -1457,7 +1449,7 @@ xmllint --noout --valid xml/index.xml <emphasis> - " + " <quote> @@ -1469,11 +1461,12 @@ xmllint --noout --valid xml/index.xml equivalents are listed in the table below. -
+
Docbook XML Element Use - - - + + + + @@ -1540,14 +1533,14 @@ xmllint --noout --valid xml/index.xml
- - +
+
- - Combines +
Combines + - - Generating Combines and Assemblages +
Generating Combines and Assemblages + The following Makefile rules are defaults, and are usually @@ -1635,17 +1628,17 @@ xmllint --noout --valid xml/index.xml - - - +
+
+
- +
Design Notes - Design Notes + - + The Library ----------- @@ -2499,6 +2492,6 @@ xmllint --noout --valid xml/index.xml include them via "<backward/hash_map.h>" or "<ext/hash_map>" than to search the subdirectory itself via a "-I" directive. - +
 diff --git a/libstdc++-v3/doc/xml/manual/appendix_free.xml b/libstdc++-v3/doc/xml/manual/appendix_free.xml index 61df179eb3a0..86d503c9452e 100644 --- a/libstdc++-v3/doc/xml/manual/appendix_free.xml +++ b/libstdc++-v3/doc/xml/manual/appendix_free.xml @@ -1,12 +1,14 @@ - - - - + - + + Free Software Needs Free Documentation + <indexterm> + <primary>Appendix</primary> + <secondary>Free Documentation</secondary> + </indexterm> + ISO C++ @@ -15,15 +17,9 @@ library - + + - - Free Software Needs Free Documentation - <indexterm> - <primary>Appendix</primary> - <secondary>Free Documentation</secondary> - </indexterm> - The biggest deficiency in free operating systems is not in the @@ -68,7 +64,7 @@ can ill afford to lose manuals this way. Free documentation, like free software, is a matter of freedom, not price. The problem with these manuals was not that O'Reilly Associates charged a price for printed copies--that in itself is fine. -(The Free Software Foundation sells printed copies of +(The Free Software Foundation sells printed copies of free GNU manuals, too.) But GNU manuals are available in source code form, while these manuals are available only on paper. GNU manuals come with permission to copy and modify; the Perl manuals do not. @@ -167,8 +163,8 @@ check the distribution terms of a manual before you buy it, and prefer copylefted manuals to non-copylefted ones. -[Note: We now maintain a web page -that lists free books available from other publishers]. +[Note: We now maintain a web page +that lists free books available from other publishers]. Copyright © 2004, 2005, 2006, 2007 Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA diff --git a/libstdc++-v3/doc/xml/manual/appendix_porting.xml b/libstdc++-v3/doc/xml/manual/appendix_porting.xml index 80884533fabb..dc29a35353f8 100644 --- a/libstdc++-v3/doc/xml/manual/appendix_porting.xml +++ b/libstdc++-v3/doc/xml/manual/appendix_porting.xml @@ -1,12 +1,14 @@ - - - - + - + + Porting and Maintenance + <indexterm> + <primary>Appendix</primary> + <secondary>Porting and Maintenance</secondary> + </indexterm> + ISO C++ @@ -15,44 +17,32 @@ library - + + - - Porting and Maintenance - <indexterm> - <primary>Appendix</primary> - <secondary>Porting and Maintenance</secondary> - </indexterm> - - + - + - + - + - + - + diff --git a/libstdc++-v3/doc/xml/manual/atomics.xml b/libstdc++-v3/doc/xml/manual/atomics.xml index 345b2b7f6c10..ddeea0185d53 100644 --- a/libstdc++-v3/doc/xml/manual/atomics.xml +++ b/libstdc++-v3/doc/xml/manual/atomics.xml @@ -1,12 +1,11 @@ - - - - + - + + Atomics + <indexterm><primary>Atomics</primary></indexterm> + ISO C++ @@ -18,20 +17,17 @@ atomic - + + - - Atomics - <indexterm><primary>Atomics</primary></indexterm> - Facilities for atomic operations. - - API Reference +
API Reference + All items are declared in the standard header @@ -56,6 +52,6 @@ - +
 diff --git a/libstdc++-v3/doc/xml/manual/auto_ptr.xml b/libstdc++-v3/doc/xml/manual/auto_ptr.xml index 6c49a5567f31..f62d8f472b4f 100644 --- a/libstdc++-v3/doc/xml/manual/auto_ptr.xml +++ b/libstdc++-v3/doc/xml/manual/auto_ptr.xml @@ -1,7 +1,8 @@ -
+
- +auto_ptr ISO C++ @@ -10,12 +11,12 @@ auto_ptr - + -auto_ptr -
-Limitations + +
Limitations + Explaining all of the fun and delicious things that can happen with misuse of the auto_ptr class @@ -81,8 +82,8 @@
-
-Use in Containers +
Use in Containers + diff --git a/libstdc++-v3/doc/xml/manual/backwards_compatibility.xml b/libstdc++-v3/doc/xml/manual/backwards_compatibility.xml index c6135530c188..1f7348a0e905 100644 --- a/libstdc++-v3/doc/xml/manual/backwards_compatibility.xml +++ b/libstdc++-v3/doc/xml/manual/backwards_compatibility.xml @@ -1,7 +1,8 @@ - +
- +Backwards Compatibility ISO C++ @@ -10,12 +11,12 @@ backwards - + -Backwards Compatibility - -First + +
First + The first generation GNU C++ library was called libg++. It was a separate GNU project, although reliably paired with GCC. Rumors imply @@ -41,15 +42,15 @@ Committee couldn't include everything, and so a lot of those Portability notes and known implementation limitations are as follows. - - No <code>ios_base</code> +
No <code>ios_base</code> + At least some older implementations don't have std::ios_base, so you should use std::ios::badbit, std::ios::failbit and std::ios::eofbit and std::ios::goodbit. - +
+ +
No <code>cout</code> in <code>ostream.h</code>, no <code>cin</code> in <code>istream.h</code> - -No <code>cout</code> in <code>ostream.h</code>, no <code>cin</code> in <code>istream.h</code> In earlier versions of the standard, @@ -65,15 +66,15 @@ Committee couldn't include everything, and so a lot of those This project is no longer maintained or supported, and the sources archived. For the desperate, -the GCC extensions -page describes where to find the last libg++ source. The code is +the GCC extensions +page describes where to find the last libg++ source. The code is considered replaced and rewritten. - - +
+
+ +
Second - -Second The second generation GNU C++ library was called libstdc++, or @@ -95,8 +96,8 @@ considered replaced and rewritten. Portability notes and known implementation limitations are as follows. - - Namespace <code>std::</code> not supported +
Namespace <code>std::</code> not supported + Some care is required to support C++ compiler and or library @@ -179,10 +180,10 @@ AC_DEFUN([AC_CXX_NAMESPACE_STD], [ fi ]) - +
+ +
Illegal iterator usage - -Illegal iterator usage The following illustrate implementation-allowed illegal iterator use, and then correct use. @@ -209,15 +210,14 @@ AC_DEFUN([AC_CXX_NAMESPACE_STD], [ - +
- - <code>isspace</code> from <filename class="headerfile">cctype</filename> is a macro - +
<code>isspace</code> from <filename class="headerfile">cctype</filename> is a macro + + - Glibc 2.0.x and 2.1.x define ctype.h functionality as macros + Glibc 2.0.x and 2.1.x define ctype.h functionality as macros (isspace, isalpha etc.). @@ -259,17 +259,16 @@ std:: (__ctype_b[(int) ( ( 'X' ) )] & (unsigned short int) _ISspace ) ; Another problem arises if you put a using namespace - std; declaration at the top, and include ctype.h. This will result in + std; declaration at the top, and include ctype.h. This will result in ambiguities between the definitions in the global namespace (ctype.h) and the definitions in namespace std:: (<cctype>). - +
+ +
No <code>vector::at</code>, <code>deque::at</code>, <code>string::at</code> - -No <code>vector::at</code>, <code>deque::at</code>, <code>string::at</code> One solution is to add an autoconf-test for this: @@ -303,10 +302,10 @@ AC_DEFINE(HAVE_CONTAINER_AT)], to check for string::at separately. - +
+ +
No <code>std::char_traits<char>::eof</code> - -No <code>std::char_traits<char>::eof</code> Use some kind of autoconf test, plus this: @@ -320,10 +319,10 @@ AC_DEFINE(HAVE_CONTAINER_AT)], #endif - +
+ +
No <code>string::clear</code> - -No <code>string::clear</code> There are two functions for deleting the contents of a string: @@ -350,28 +349,27 @@ erase(size_type __pos = 0, size_type __n = npos) version, so you should use erase (which is probably faster than operator=(charT*)). - +
- - +<section><info><title> Removal of <code>ostream::form</code> and <code>istream::scan</code> extensions - + + These are no longer supported. Please use stringstreams instead. - +
+ +
No <code>basic_stringbuf</code>, <code>basic_stringstream</code> - -No <code>basic_stringbuf</code>, <code>basic_stringstream</code> Although the ISO standard i/ostringstream-classes are provided, (sstream), for compatibility with older implementations the pre-ISO - i/ostrstream (strstream) interface is also provided, + i/ostrstream (strstream) interface is also provided, with these caveats: @@ -484,34 +482,33 @@ any = temp; - Another example of using stringstreams is in this howto. + Another example of using stringstreams is in this howto. There is additional information in the libstdc++-v2 info files, in particular info iostream. - +
- - Little or no wide character support +
Little or no wide character support + Classes wstring and char_traits<wchar_t> are not supported. - +
- - No templatized iostreams +
No templatized iostreams + Classes wfilebuf and wstringstream are not supported. - +
+ +
Thread safety issues - -Thread safety issues Earlier GCC releases had a somewhat different approach to @@ -541,10 +538,9 @@ particular info iostream. written against per-CPU-architecture spinlocks and other parts against the gthr.h abstraction layer which is provided by gcc. A minor problem that pops up every so often is different - interpretations of what "thread-safe" means for a - library (not a general program). We currently use the same - definition that SGI uses for their STL subset. However, + interpretations of what "thread-safe" means for a + library (not a general program). We currently use the same + definition that SGI uses for their STL subset. However, the exception for read-only containers only applies to the STL components. This definition is widely-used and something similar will be used in the next version of the C++ standard library. @@ -554,23 +550,22 @@ particular info iostream. Here is a small link farm to threads (no pun) in the mail archives that discuss the threading problem. Each link is to the first relevant message in the thread; from there you can use - "Thread Next" to move down the thread. This farm is in + "Thread Next" to move down the thread. This farm is in latest-to-oldest order. - Our threading expert Loren gives a breakdown of the - six situations involving threads for the 3.0 + Our threading expert Loren gives a breakdown of the + six situations involving threads for the 3.0 release series. - - This message inspired a recent updating of issues with + + This message inspired a recent updating of issues with threading and the SGI STL library. It also contains some example POSIX-multithreaded STL code. @@ -584,12 +579,12 @@ particular info iostream. with work to restore them. Many of the points have been superseded anyhow.) - +
- +
+ +
Third - -Third The third generation GNU C++ library is called libstdc++, or libstdc++-v3. @@ -606,8 +601,8 @@ libstdc++-v3. Portability notes and known implementation limitations are as follows. - -Pre-ISO headers moved to backwards or removed +
Pre-ISO headers moved to backwards or removed + The pre-ISO C++ headers (iostream.h, defalloc.h etc.) are @@ -621,8 +616,8 @@ libstdc++-v3. For those of you new to ISO C++ (welcome, time travelers!), no, that isn't a typo. Yes, the headers really have new names. - Marshall Cline's C++ FAQ Lite has a good explanation in item - [27.4]. + Marshall Cline's C++ FAQ Lite has a good explanation in item + [27.4]. Some include adjustment may be required. What follows is an @@ -691,10 +686,10 @@ directive using namespace std; can be put at the global scope. This should be enough to get this code compiling, assuming the other usage is correct. - +
+ +
Extension headers hash_map, hash_set moved to ext or backwards - -Extension headers hash_map, hash_set moved to ext or backwards At this time most of the features of the SGI STL extension have been replaced by standardized libraries. @@ -781,11 +776,11 @@ AC_DEFUN([AC_HEADER_EXT_HASH_SET], [ fi ]) - +
+ +
No <code>ios::nocreate/ios::noreplace</code>. + - -No <code>ios::nocreate/ios::noreplace</code>. - The existence of ios::nocreate being used for input-streams has been confirmed, most probably because the author @@ -800,12 +795,12 @@ decide whether you want to create/replace or not. To my knowledge, even older implementations support app, ate and trunc (except for app ?). - +
- - +<section><info><title> No <code>stream::attach(int fd)</code> - + + Phil Edwards writes: It was considered and rejected for the ISO @@ -825,22 +820,22 @@ No stream::attach(int fd) An extension is available that implements this. ext/stdio_filebuf.h contains a derived class called - __gnu_cxx::stdio_filebuf. + __gnu_cxx::stdio_filebuf. This class can be constructed from a C FILE* or a file descriptor, and provides the fd() function. For another example of this, refer to - fdstream example + fdstream example by Nicolai Josuttis. - +
- - +<section><info><title> Support for C++98 dialect. - + + Check for complete library coverage of the C++1998/2003 standard. @@ -911,12 +906,12 @@ AC_DEFUN([AC_HEADER_STDCXX_98], [ fi ]) - +
- - +<section><info><title> Support for C++TR1 dialect. - + + Check for library coverage of the TR1 standard. @@ -1002,13 +997,13 @@ AC_DEFUN([AC_HEADER_TR1_UNORDERED_SET], [ fi ]) - +
- - +<section><info><title> Support for C++0x dialect. - + + Check for baseline language coverage in the compiler for the C++0xstandard. @@ -1234,63 +1229,54 @@ AC_DEFUN([AC_HEADER_UNORDERED_SET], [ fi ]) - +
- - +<section><info><title> Container::iterator_type is not necessarily Container::value_type* - + + This is a change in behavior from the previous version. Now, most iterator_type typedefs in container classes are POD objects, not value_type pointers. - +
- +
+ +Bibliography - -Bibliography - - - - Migrating to GCC 4.1 - - + - - Dan - Kegel - + + Migrating to GCC 4.1 + + + DanKegel - - - - Building the Whole Debian Archive with GCC 4.1: A Summary - - + - - Martin - Michlmayr - + + Building the Whole Debian Archive with GCC 4.1: A Summary + + + MartinMichlmayr - - - - Migration guide for GCC-3.2 - - + + + Migration guide for GCC-3.2 + + - +
diff --git a/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml b/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml index 7b90e3a1d55e..19b190661f02 100644 --- a/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml +++ b/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml @@ -1,7 +1,8 @@ - +
- +bitmap_allocator ISO C++ @@ -10,15 +11,15 @@ allocator - + + -bitmap_allocator - -Design +
Design + As this name suggests, this allocator uses a bit-map to keep track @@ -53,13 +54,13 @@ layer. - +
- -Implementation +
Implementation - - Free List Store + +
Free List Store + The Free List Store (referred to as FLS for the remaining part of this @@ -121,10 +122,10 @@ else return false. Currently, (3) is being used with a value of 36% Maximum wastage per Super Block. - +
- - Super Block +
Super Block + A super block is the block of memory acquired from the FLS from @@ -144,10 +145,10 @@ else return false. getting / returning Super Bocks to and from the OS using operator new as defined by the C++ standard. - +
- - Super Block Data Layout +
Super Block Data Layout + Each Super Block will be of some size that is a multiple of the number of Bits Per Block. Typically, this value is chosen as @@ -165,14 +166,15 @@ else return false. (assume a 32-bit system where, size_t is a 32-bit entity). - +
Bitmap Allocator Memory Map - - - - - - + + + + + + + @@ -219,10 +221,10 @@ else return false. x 2, which is 8-bytes, or 2 x sizeof(size_t). - + - - Maximum Wasted Percentage +
Maximum Wasted Percentage + This has nothing to do with the algorithm per-se, @@ -260,10 +262,10 @@ For map/multimap: k = 12, and c = 4 (int and double), we get: 37.524% create a function that returns the Max_Wastage_Percentage for us to use. - +
- - <function>allocate</function> +
<function>allocate</function> + The allocate function is specialized for single object allocation @@ -366,10 +368,10 @@ combination of the next-fit and first-fit algorithm optimized ONLY for single object allocations. - +
- - <function>deallocate</function> +
<function>deallocate</function> + The deallocate function again is specialized for single objects ONLY. For all n belonging to > 1, the operator delete is called without @@ -410,13 +412,13 @@ single object allocations. invariant is maintained by making sure that _S_last_request and _S_last_dealloc_index point to valid locations within the vector. - +
- - Questions +
Questions + - - 1 +
1 + Q1) The "Data Layout" section is cryptic. I have no idea of what you are trying to say. Layout of what? @@ -429,10 +431,10 @@ general formula for calculating the size of a super block is 32 x sizeof(value_type) x 2^n, where n ranges from 0 to 32 for 32-bit systems. - +
- - 2 +
2 + And since I just mentioned the term `each bitmap', what in the world is meant by it? What does each @@ -452,10 +454,10 @@ Block a bitmap as well? whose exact number for a super-block of a given size I have just mentioned. - +
- - 3 +
3 + How do the allocate and deallocate functions work in regard to bitmaps? @@ -492,11 +494,11 @@ Block a bitmap as well? The bit-map now looks like this: 1111111111111111111111111111111111111111111111111111111111111110 - - +
+
- - Locality +
Locality + Another issue would be whether to keep the all bitmaps in a separate area in memory, or to keep them near the actual blocks @@ -522,10 +524,10 @@ equivalent. single object allocations, though it preserves the locality of blocks very well when they are returned back to the allocator. - +
- - Overhead and Grow Policy +
Overhead and Grow Policy + Expected overhead per block would be 1 bit in memory. Also, once the address of the free list has been found, the cost for @@ -552,8 +554,8 @@ equivalent. which can fit exactly in a CPU register. Hence, the term given is exponential growth of the internal pool. - +
- + - + diff --git a/libstdc++-v3/doc/xml/manual/build_hacking.xml b/libstdc++-v3/doc/xml/manual/build_hacking.xml index fd134bdea454..0746392a2b52 100644 --- a/libstdc++-v3/doc/xml/manual/build_hacking.xml +++ b/libstdc++-v3/doc/xml/manual/build_hacking.xml @@ -1,7 +1,8 @@ - +
- +Configure and Build Hacking C++ @@ -19,15 +20,14 @@ shared - + -Configure and Build Hacking - - Prerequisites + +
Prerequisites + - As noted previously, + As noted previously, certain other tools are necessary for hacking on files that control configure (configure.ac, acinclude.m4) and make @@ -38,10 +38,10 @@ the auto-tools used, so please try to play nicely with the neighbors. - +
- - Overview: What Comes from Where +
Overview: What Comes from Where + @@ -61,14 +61,14 @@ "aclocal-1.11 && autoconf-2.64 && autoheader-2.64 && automake-1.11" The version numbers may be absent entirely or otherwise vary depending on - the - current requirements and your vendor's choice of + the + current requirements and your vendor's choice of installation names. - +
- - Storing Information in non-AC files (like configure.host) +
Storing Information in non-AC files (like configure.host) + Until that glorious day when we can use AC_TRY_LINK with a @@ -97,10 +97,10 @@ to properly find them all when generating configure. I would discourage that. - +
- - Coding and Commenting Conventions +
Coding and Commenting Conventions + Most comments should use {octothorpes, shibboleths, hash marks, @@ -122,10 +122,10 @@ $target_alias. The single exception is in configure.ac, for automake+dejagnu's sake. - +
- - The acinclude.m4 layout +
The acinclude.m4 layout + The nice thing about acinclude.m4/aclocal.m4 is that macros aren't actually performed/called/expanded/whatever here, just loaded. So @@ -213,10 +213,10 @@ present otherwise stuff magically goes wonky. - +
- - <constant>GLIBCXX_ENABLE</constant>, the <literal>--enable</literal> maker +
<constant>GLIBCXX_ENABLE</constant>, the <literal>--enable</literal> maker + All the GLIBCXX_ENABLE_FOO macros use a common helper, @@ -304,8 +304,7 @@ If you're wondering what that line noise in the last example was, that's how you embed autoconf special characters in output text. - They're called quadrigraphs + They're called quadrigraphs and you should use them whenever necessary. @@ -349,6 +348,6 @@ message. - +
- +
diff --git a/libstdc++-v3/doc/xml/manual/codecvt.xml b/libstdc++-v3/doc/xml/manual/codecvt.xml index a2a90cfdb5bd..0c642f9f904a 100644 --- a/libstdc++-v3/doc/xml/manual/codecvt.xml +++ b/libstdc++-v3/doc/xml/manual/codecvt.xml @@ -1,7 +1,8 @@ -
+
- +codecvt ISO C++ @@ -10,9 +11,9 @@ codecvt - + + -codecvt The standard class codecvt attempts to address conversions between @@ -30,8 +31,8 @@ specializations for wide and narrow characters and the implementation-provided extended functionality are given. -
-Requirements +
Requirements + Around page 425 of the C++ Standard, this charming heading comes into view: @@ -110,11 +111,11 @@ template parameter, imply an implementation strategy that is mostly mcsrtombs and wcsrtombs in particular.
-
-Design +
Design -
- <type>wchar_t</type> Size + +
<type>wchar_t</type> Size + The simple implementation detail of wchar_t's size seems to @@ -133,11 +134,11 @@ mcsrtombs and wcsrtombs in particular.
-
- Support for Unicode +
Support for Unicode + Probably the most frequently asked question about code conversion - is: "So dudes, what's the deal with Unicode strings?" + is: "So dudes, what's the deal with Unicode strings?" The dude part is optional, but apparently the usefulness of Unicode strings is pretty widely appreciated. Sadly, this specific encoding (And other useful encodings like UTF8, UCS4, ISO 8859-10, @@ -190,7 +191,7 @@ UTF-16, UTF8, UTF16). For iconv-based implementations, string literals for each of the -encodings (i.e. "UCS-2" and "UTF-8") are necessary, +encodings (i.e. "UCS-2" and "UTF-8") are necessary, although for other, non-iconv implementations a table of enumerated values or some other mechanism may be required. @@ -204,14 +205,14 @@ mechanism may be required. Some encodings require explicit endian-ness. As such, some kind of endian marker or other byte-order marker will be necessary. See - "Footnotes for C/C++ developers" in Haible for more information on + "Footnotes for C/C++ developers" in Haible for more information on UCS-2/Unicode endian issues. (Summary: big endian seems most likely, however implementations, most notably Microsoft, vary.) Types representing the conversion state, for conversions involving - the machinery in the "C" library, or the conversion descriptor, for + the machinery in the "C" library, or the conversion descriptor, for conversions using iconv (such as the type iconv_t.) Note that the conversion descriptor encodes more information than a simple encoding state type. @@ -238,13 +239,13 @@ mechanism may be required.
-
- Other Issues +
Other Issues + In addition, multi-threaded and multi-locale environments also impact the design and requirements for code conversions. In particular, they affect the required specialization codecvt<wchar_t, char, mbstate_t> -when implemented using standard "C" functions. +when implemented using standard "C" functions. @@ -267,7 +268,7 @@ incorrect. Yikes! The last, and fundamental problem, is the assumption of a global -locale for all the "C" functions referenced above. For something like +locale for all the "C" functions referenced above. For something like C++ iostreams (where codecvt is explicitly used) the notion of multiple locales is fundamental. In practice, most users may not run into this limitation. However, as a quality of implementation issue, @@ -288,8 +289,8 @@ LC_CTYPE category implements.
-
-Implementation +
Implementation + The two required specializations are implemented as follows: @@ -434,8 +435,8 @@ codecvt usage.
-
-Use +
Use + A conversions involving string literal. @@ -479,8 +480,8 @@ codecvt usage.
-
-Future +
Future + @@ -521,7 +522,7 @@ codecvt usage. - how to synchronize the "C" and "C++" + how to synchronize the "C" and "C++" conversion information? @@ -535,21 +536,15 @@ codecvt usage.
- -Bibliography +Bibliography + - + <citetitle> The GNU C Library - - - McGrath - Roland - - - Drepper - Ulrich - + + McGrathRoland + DrepperUlrich 2007 FSF @@ -560,23 +555,20 @@ codecvt usage. - + <citetitle> Correspondence - - - Drepper - Ulrich - + + DrepperUlrich 2002 - + - + <citetitle> ISO/IEC 14882:1998 Programming languages - C++ - + 1998 ISO @@ -584,9 +576,9 @@ codecvt usage. - + <citetitle> ISO/IEC 9899:1999 Programming languages - C - + 1999 ISO @@ -594,13 +586,11 @@ codecvt usage. - - - - System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008) - - + + + System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008) + 2008 @@ -611,13 +601,10 @@ codecvt usage. - + <citetitle> The C++ Programming Language, Special Edition - - - Stroustrup - Bjarne - + + StroustrupBjarne 2000 Addison Wesley, Inc. @@ -632,20 +619,14 @@ codecvt usage. - + <citetitle> Standard C++ IOStreams and Locales - + Advanced Programmer's Guide and Reference - - Langer - Angelika - - - Kreft - Klaus - + LangerAngelika + KreftKlaus 2000 Addison Wesley Longman, Inc. @@ -658,46 +639,34 @@ codecvt usage. - - - - A brief description of Normative Addendum 1 - - + - - Feather - Clive - + + A brief description of Normative Addendum 1 + + + FeatherClive Extended Character Sets - - + + The Unicode HOWTO - - - - Haible - Bruno - + + HaibleBruno - - - - UTF-8 and Unicode FAQ for Unix/Linux - - + - - Khun - Markus - + + UTF-8 and Unicode FAQ for Unix/Linux + + + KhunMarkus diff --git a/libstdc++-v3/doc/xml/manual/concurrency.xml b/libstdc++-v3/doc/xml/manual/concurrency.xml index f6a7366ff0d0..e3dd9b9468a1 100644 --- a/libstdc++-v3/doc/xml/manual/concurrency.xml +++ b/libstdc++-v3/doc/xml/manual/concurrency.xml @@ -1,12 +1,11 @@ - - - - + - + + Concurrency + <indexterm><primary>Concurrency</primary></indexterm> + ISO C++ @@ -27,12 +26,9 @@ condition_variable - + + - - Concurrency - <indexterm><primary>Concurrency</primary></indexterm> - Facilities for concurrent operation, and control thereof. @@ -40,8 +36,8 @@ - - API Reference +
API Reference + All items are declared in one of four standard header files. @@ -80,6 +76,6 @@ - +
 diff --git a/libstdc++-v3/doc/xml/manual/concurrency_extensions.xml b/libstdc++-v3/doc/xml/manual/concurrency_extensions.xml index 2b4a09ad8ea7..9092c8def612 100644 --- a/libstdc++-v3/doc/xml/manual/concurrency_extensions.xml +++ b/libstdc++-v3/doc/xml/manual/concurrency_extensions.xml @@ -1,12 +1,8 @@ - - - - + - +Concurrency ISO C++ @@ -15,15 +11,15 @@ library - + -Concurrency - - Design - - Interface to Locks and Mutexes +
Design + + +
Interface to Locks and Mutexes + The file <ext/concurrence.h> contains all the higher-level constructs for playing with threads. In contrast to the atomics layer, @@ -78,10 +74,10 @@ locks it during construction of __scoped_locke and unlocks it during destruction. This is an efficient way of locking critical sections, while retaining exception-safety. - +
- - Interface to Atomic Functions +
Interface to Atomic Functions + @@ -186,15 +182,15 @@ _GLIBCXX_WRITE_MEM_BARRIER Which expand to the appropriate write and read barrier required by the host hardware and operating system. - +
- +
- - Implementation - - Using Builtin Atomic Functions +
Implementation + +
Using Builtin Atomic Functions + The functions for atomic operations described above are either implemented via compiler intrinsics (if the underlying host is @@ -253,16 +249,16 @@ hardware, hand-crafted assembly is selected. This is the case for the following And for the rest, a simulated atomic lock via pthreads. - Detailed information about compiler intrinsics for atomic operations can be found in the GCC documentation. + Detailed information about compiler intrinsics for atomic operations can be found in the GCC documentation. More details on the library fallbacks from the porting section. - - - Thread Abstraction +
+
Thread Abstraction + A thin layer above IEEE 1003.1 (i.e. pthreads) is used to abstract the thread interface for GCC. This layer is called "gthread," and is @@ -276,7 +272,7 @@ the current host. In libstdc++ implementation files, Within libstdc++ sources, all calls to underlying thread functionality -use this layer. More detail as to the specific interface can be found in the source documentation. +use this layer. More detail as to the specific interface can be found in the source documentation. By design, the gthread layer is interoperable with the types, @@ -285,12 +281,12 @@ including pthread_t, pthread_once_t, pthread_cre etc. - - +
+
- +
Use - Use + Typical usage of the last two constructs is demonstrated as follows: @@ -332,6 +328,6 @@ and __concurrence_broadcast_error. - +
 diff --git a/libstdc++-v3/doc/xml/manual/configure.xml b/libstdc++-v3/doc/xml/manual/configure.xml index 6e81b06f2d4a..4c983a4fd2d8 100644 --- a/libstdc++-v3/doc/xml/manual/configure.xml +++ b/libstdc++-v3/doc/xml/manual/configure.xml @@ -1,7 +1,8 @@ - +
- +Configure ISO C++ @@ -13,9 +14,9 @@ options - + + -Configure When configuring libstdc++, you'll have to configure the entire @@ -29,8 +30,8 @@ Here are all of the configure options specific to libstdc++. Keep in mind that - they - all have opposite forms as well (enable/disable and + they + all have opposite forms as well (enable/disable and with/without). The defaults are for the current development sources, which may be different than those for released versions. @@ -43,8 +44,8 @@ --enable-multilib[default] This is part of the generic multilib support for building cross - compilers. As such, targets like "powerpc-elf" will have - libstdc++ built many different ways: "-msoft-float" + compilers. As such, targets like "powerpc-elf" will have + libstdc++ built many different ways: "-msoft-float" and not, etc. A different libstdc++ will be built for each of the different multilib versions. This option is on by default. @@ -68,15 +69,15 @@ libstdc++'s include files will be installed in ${libdir}/gcc-lib/${target_alias}/${gcc_version}/include/g++, unless you also specify - --with-gxx-include-dir=dirname during configuration. + --with-gxx-include-dir=dirname during configuration. --with-gxx-include-dir=<include-files dir> Adds support for named libstdc++ include directory. For instance, the following puts all the libstdc++ headers into a directory - called "4.4-20090404" instead of the usual - "c++/(version)". + called "4.4-20090404" instead of the usual + "c++/(version)". --with-gxx-include-dir=/foo/H-x86-gcc-3-c-gxx-inc/include/4.4-20090404 @@ -89,7 +90,7 @@ --enable-cstdio=OPTION Select a target-specific I/O package. At the moment, the only - choice is to use 'stdio', a generic "C" abstraction. + choice is to use 'stdio', a generic "C" abstraction. The default is 'stdio'. This option can change the library ABI. @@ -105,9 +106,9 @@ choices are 'ieee_1003.1-2001' to specify an X/Open, Standard Unix (IEEE Std. 1003.1-2001) model based on langinfo/iconv/catgets, 'gnu' to specify a model based on functionality from the GNU C - library (langinfo/iconv/gettext) (from glibc, the GNU C - library), or 'generic' to use a generic "C" - abstraction which consists of "C" locale info. + library (langinfo/iconv/gettext) (from glibc, the GNU C + library), or 'generic' to use a generic "C" + abstraction which consists of "C" locale info. If not explicitly specified, the configure proccess tries @@ -154,8 +155,8 @@ --enable-threads=OPTION Select a threading library. A full description is given in the - general compiler - configuration instructions. This option can change the + general compiler + configuration instructions. This option can change the library ABI. @@ -218,13 +219,13 @@ --enable-c99 - The "long long" type was introduced in C99, along + The "long long" type was introduced in C99, along with many other functions for wide characters, and math classification macros, etc. If enabled, all C99 functions not specified by the C++ standard will be put into namespace __gnu_cxx, and then all these names will be injected into namespace std, so that C99 functions can be - used "as if" they were in the C++ standard (as they + used "as if" they were in the C++ standard (as they will eventually be in some future revision of the standard, without a doubt). By default, C99 support is on, assuming the configure probes find all the necessary functions and bits @@ -233,7 +234,7 @@ --enable-wchar_t[default] - Template specializations for the "wchar_t" type are + Template specializations for the "wchar_t" type are required for wide character conversion support. Disabling wide character specializations may be expedient for initial porting efforts, but builds only a subset of what is required by @@ -243,14 +244,14 @@ --enable-long-long - The "long long" type was introduced in C99. It is + The "long long" type was introduced in C99. It is provided as a GNU extension to C++98 in g++. This flag builds - support for "long long" into the library (specialized + support for "long long" into the library (specialized templates and the like for iostreams). This option is on by default: - if enabled, users will have to either use the new-style "C" + if enabled, users will have to either use the new-style "C" headers by default (i.e., <cmath> not <math.h>) or add appropriate compile-time flags to all compile lines to - allow "C" visibility of this feature (on GNU/Linux, + allow "C" visibility of this feature (on GNU/Linux, the flag is -D_ISOC99_SOURCE, which is added automatically via CPLUSPLUS_CPP_SPEC's addition of _GNU_SOURCE). This option can change the library ABI. @@ -347,4 +348,4 @@ - +
diff --git a/libstdc++-v3/doc/xml/manual/containers.xml b/libstdc++-v3/doc/xml/manual/containers.xml index 3b4fb4baa07c..377b1a2ee6fa 100644 --- a/libstdc++-v3/doc/xml/manual/containers.xml +++ b/libstdc++-v3/doc/xml/manual/containers.xml @@ -1,12 +1,11 @@ - - - - + - + + Containers + <indexterm><primary>Containers</primary></indexterm> + ISO C++ @@ -15,28 +14,24 @@ library - + + - - Containers - <indexterm><primary>Containers</primary></indexterm> - - +
Sequences - Sequences + - +
list - list - - list::size() is O(n) + +
list::size() is O(n) + Yes it is, and that's okay. This is a decision that we preserved when we imported SGI's STL implementation. The following is - quoted from their FAQ: + quoted from their FAQ:
@@ -78,41 +73,38 @@ ...
- - +
+
- +
vector - vector + - - Space Overhead Management +
Space Overhead Management + - In this - message to the list, Daniel Kostecky announced work on an + In this + message to the list, Daniel Kostecky announced work on an alternate form of std::vector that would support hints on the number of elements to be over-allocated. The design was also described, along with possible implementation choices. - The first two alpha releases were announced here - and here. + The first two alpha releases were announced here + and here. - - +
+
- +
Associative - Associative + - - Insertion Hints +
Insertion Hints + Section [23.1.2], Table 69, of the C++ standard lists this function for all of the associative containers (map, set, etc): @@ -125,8 +117,7 @@ item to insert. The standard says that t is inserted as close as possible to the position just prior to p. (Library DR #233 addresses this topic, - referring to N1780. + referring to N1780. Since version 4.2 GCC implements the resolution to DR 233, so that insertions happen as close as possible to the hint. For earlier releases the hint was only used as described below. @@ -216,14 +207,14 @@ point to the correct place, then no further local searching is done; the search begins from scratch in logarithmic time. - +
- +
bitset - bitset - - Size Variable + +
Size Variable + No, you cannot write code of the form @@ -254,7 +245,7 @@ A very large N in - bitset<N>.   It has been + bitset<N>.   It has been pointed out a few times in newsgroups that N bits only takes up (N/8) bytes on most systems, and division by a factor of eight is pretty impressive when speaking of memory. Half a megabyte given @@ -276,7 +267,7 @@ space overhead, but it's all allocated inside the object.) - A container<bool>.   The + A container<bool>.   The Committee made provision for the space savings possible with that (N/8) usage previously mentioned, so that you don't have to do wasteful things like Container<char> or @@ -297,7 +288,7 @@ than that of vector). - Extremely weird solutions.   If + Extremely weird solutions.   If you have access to the compiler and linker at runtime, you can do something insane, like figuring out just how many bits you need, then writing a temporary source code file. That file contains an @@ -329,9 +320,9 @@ some extensions. - - - Type String +
+
Type String + @@ -357,18 +348,18 @@ std::bitset<5> b ( 10110 ); // invalid - - +
+
- +
- +
Interacting with C - Interacting with C + - - Containers vs. Arrays +
Containers vs. Arrays + You're writing some code and can't decide whether to use builtin arrays or some kind of container. There are compelling reasons @@ -464,8 +455,8 @@ template<typename T, unsigned int sz> looks just weird! Hint: unused parameters can be left nameless. - +
- +
 diff --git a/libstdc++-v3/doc/xml/manual/ctype.xml b/libstdc++-v3/doc/xml/manual/ctype.xml index 9cc4603667d9..afca9be54753 100644 --- a/libstdc++-v3/doc/xml/manual/ctype.xml +++ b/libstdc++-v3/doc/xml/manual/ctype.xml @@ -1,7 +1,8 @@ -
+
- +ctype ISO C++ @@ -10,15 +11,15 @@ ctype - + -ctype -
-Implementation -
- Specializations +
Implementation + + +
Specializations + For the required specialization codecvt<wchar_t, char, mbstate_t> , @@ -60,8 +61,8 @@ characters.
-
-Future +
Future + @@ -117,21 +118,15 @@ characters.
- -Bibliography +Bibliography + - + <citetitle> The GNU C Library - - - McGrath - Roland - - - Drepper - Ulrich - + + McGrathRoland + DrepperUlrich 2007 FSF @@ -140,23 +135,20 @@ characters. - + <citetitle> Correspondence - - - Drepper - Ulrich - + + DrepperUlrich 2002 - + - + <citetitle> ISO/IEC 14882:1998 Programming languages - C++ - + 1998 ISO @@ -164,9 +156,9 @@ characters. - + <citetitle> ISO/IEC 9899:1999 Programming languages - C - + 1999 ISO @@ -174,13 +166,12 @@ characters. - - - - The Open Group Base Specifications, Issue 6 (IEEE Std. 1003.1-2004) - - - + + + + The Open Group Base Specifications, Issue 6 (IEEE Std. 1003.1-2004) + + 1999 @@ -189,13 +180,10 @@ characters. - + <citetitle> The C++ Programming Language, Special Edition - - - Stroustrup - Bjarne - + + StroustrupBjarne 2000 Addison Wesley, Inc. @@ -209,20 +197,14 @@ characters. - + <citetitle> Standard C++ IOStreams and Locales - + Advanced Programmer's Guide and Reference - - Langer - Angelika - - - Kreft - Klaus - + LangerAngelika + KreftKlaus 2000 Addison Wesley Longman, Inc. diff --git a/libstdc++-v3/doc/xml/manual/debug.xml b/libstdc++-v3/doc/xml/manual/debug.xml index 5f97867de2ec..9772c3688859 100644 --- a/libstdc++-v3/doc/xml/manual/debug.xml +++ b/libstdc++-v3/doc/xml/manual/debug.xml @@ -1,7 +1,8 @@ - +
- +Debugging Support C++ @@ -10,9 +11,9 @@ debug - + + -Debugging Support There are numerous things that can be done to improve the ease with @@ -20,8 +21,8 @@ are some of them. - -Using <command>g++</command> +
Using <command>g++</command> + Compiler flags determine how debug information is transmitted between compilation and debug or analysis tools. @@ -52,15 +53,14 @@ - Many other options are available: please see "Options - for Debugging Your Program" in Using the GNU Compiler + Many other options are available: please see "Options + for Debugging Your Program" in Using the GNU Compiler Collection (GCC) for a complete list. - +
+ +
Debug Versions of Library Binary Files - -Debug Versions of Library Binary Files If you would like debug symbols in libstdc++, there are two ways to @@ -79,8 +79,7 @@ debug build will persist, without having to specify CXXFLAGS, and the debug library will be installed in a separate directory tree, in (prefix)/lib/debug. For - more information, look at the configuration section. + more information, look at the configuration section. @@ -94,10 +93,10 @@ This quick and dirty approach is often sufficient for quick debugging tasks, when you cannot or don't want to recompile your application to use the debug mode. - +
+ +
Memory Leak Hunting - -Memory Leak Hunting There are various third party memory tracing and debug utilities @@ -116,8 +115,7 @@ thing of great importance to keep in mind when debugging C++ code that uses new and delete: there are different kinds of allocation schemes that can be used by - std::allocator . For implementation details, see the mt allocator documentation and + std::allocator . For implementation details, see the mt allocator documentation and look specifically for GLIBCXX_FORCE_NEW. @@ -189,17 +187,16 @@ valgrind -v --num-callers=20 --leak-check=yes --leak-resolution=high --show-reachable=yes a.out - +
+ +
Using <command>gdb</command> - -Using <command>gdb</command> - Many options are available for gdb itself: please see - "GDB features for C++" in the gdb documentation. Also + Many options are available for gdb itself: please see + "GDB features for C++" in the gdb documentation. Also recommended: the other parts of this manual. @@ -258,47 +255,47 @@ For additional information on STL support and GDB please visit: - "GDB Support - for STL" in the GDB wiki. Additionally, in-depth + "GDB Support + for STL" in the GDB wiki. Additionally, in-depth documentation and discussion of the pretty printing feature can be found in "Pretty Printing" node in the GDB manual. You can find on-line versions of the GDB user manual in GDB's homepage, at - "GDB: The GNU Project - Debugger" . + "GDB: The GNU Project + Debugger" . - +
+ +
Tracking uncaught exceptions - -Tracking uncaught exceptions The verbose termination handler gives information about uncaught exceptions which are killing the program. It is described in the linked-to page. - +
+ +
Debug Mode - -Debug Mode The Debug Mode has compile and run-time checks for many containers. - +
+ +
Compile Time Checking - -Compile Time Checking The Compile-Time Checks Extension has compile-time checks for many algorithms. - +
+ +
Profile-based Performance Analysis - -Profile-based Performance Analysis The Profile-based Performance Analysis Extension has performance checks for many algorithms. - +
- +
diff --git a/libstdc++-v3/doc/xml/manual/debug_mode.xml b/libstdc++-v3/doc/xml/manual/debug_mode.xml index c3b3b57859d3..f0ab4992846f 100644 --- a/libstdc++-v3/doc/xml/manual/debug_mode.xml +++ b/libstdc++-v3/doc/xml/manual/debug_mode.xml @@ -1,12 +1,8 @@ - - - - + - +Debug Mode C++ @@ -18,12 +14,12 @@ debug - + -Debug Mode - - Intro + +
Intro + By default, libstdc++ is built with efficiency in mind, and therefore performs little or no error checking that is not @@ -65,10 +61,10 @@ different predicate. - +
- - Semantics +
Semantics + @@ -146,14 +142,14 @@ guaranteed to work. For full debug-mode support you can use the which always works correctly. - +
- - Using +
Using + - - Using the Debug Mode +
Using the Debug Mode + To use the libstdc++ debug mode, compile your application with the compiler flag -D_GLIBCXX_DEBUG. Note that this flag @@ -168,10 +164,10 @@ which always works correctly. GLIBCXX_DEBUG_MESSAGE_LENGTH can be used to request a different length. - +
- - Using a Specific Debug Container +
Using a Specific Debug Container + When it is not feasible to recompile your entire application, or only specific containers need checking, debugging containers are available as GNU extensions. These debugging containers are @@ -183,13 +179,14 @@ which always works correctly. containers: -
+
Debugging Containers - - - - - + + + + + + @@ -274,13 +271,14 @@ which always works correctly. containers have additional debug capability. -
+
Debugging Containers C++0x - - - - - + + + + + + @@ -318,15 +316,15 @@ containers have additional debug capability.
- - +
+
- - Design +
Design + - - Goals +
Goals + The libstdc++ debug mode replaces unsafe (but efficient) standard @@ -376,7 +374,7 @@ containers have additional debug capability. higher-numbered conformance levels are more usable (i.e., require less recompilation) but are more complicated to implement than the lower-numbered conformance levels. - + Full recompilation: The user must recompile his or her entire application and all C++ libraries it depends on, including the C++ standard library that ships with the @@ -438,18 +436,18 @@ containers have additional debug capability. - +
- - Methods +
Methods + This section provides an overall view of the design of the libstdc++ debug mode and details the relationship between design decisions and the stated design goals. - - The Wrapper Model +
The Wrapper Model + The libstdc++ debug mode uses a wrapper model where the debugging versions of library components (e.g., iterators and containers) form a layer on top of the release versions of the @@ -471,8 +469,8 @@ containers have additional debug capability. past-the-end iterators or inserting into a container using an iterator from a different container. - - Safe Iterators +
Safe Iterators + Iterator wrappers provide a debugging layer over any iterator that is attached to a particular container, and will manage the information detailing the iterator's state (singular, @@ -492,10 +490,10 @@ containers have additional debug capability. whose iterator or const_iterator typedef is the type of the safe iterator. - +
- - Safe Sequences (Containers) +
Safe Sequences (Containers) + Container wrappers provide a debugging layer over a particular container type. Because containers vary greatly in the member @@ -540,11 +538,11 @@ template<typename _Tp, typename _Allocator = allocator<_Tp> // duplicate std::list interface with debugging semantics }; - - +
+
- - Precondition Checking +
Precondition Checking + The debug mode operates primarily by checking the preconditions of all standard library operations that it supports. Preconditions that are always checked (regardless of whether or not we are in debug @@ -575,10 +573,10 @@ template<typename _Tp, typename _Allocator = allocator<_Tp> check macro that supports more advance formulation of error messages, _GLIBCXX_DEBUG_VERIFY. These macros are documented more thoroughly in the debug mode source code. - +
- - Release- and debug-mode coexistence +
Release- and debug-mode coexistence + The libstdc++ debug mode is the first debug mode we know of that is able to provide the "Per-use recompilation" (4) guarantee, that allows release-compiled and debug-compiled code to be linked and @@ -591,16 +589,16 @@ template<typename _Tp, typename _Allocator = allocator<_Tp> Achieving link- and run-time coexistence is not a trivial implementation task. To achieve this goal we required a small extension to the GNU C++ compiler (since incorporated into the C++0x language specification, described in the GCC Manual for the C++ language as - namespace - association), and a complex organization of debug- and + namespace + association), and a complex organization of debug- and release-modes. The end result is that we have achieved per-use recompilation but have had to give up some checking of the std::basic_string class template (namely, safe iterators). - - Compile-time coexistence of release- and debug-mode components +
Compile-time coexistence of release- and debug-mode components + Both the release-mode components and the debug-mode components need to exist within a single translation unit so that @@ -665,11 +663,11 @@ namespace std inline namespace __debug { } } - +
- - Link- and run-time coexistence of release- and - debug-mode components +
Link- and run-time coexistence of release- and + debug-mode components + Because each component has a distinct and separate release and debug implementation, there is no issue with link-time @@ -730,7 +728,7 @@ test02() debug/release containers, we must note two things about locale facets: - + They exist as shared state: one can create a facet in one translation unit and access the facet via the same type name in a different translation unit. This means that we cannot have two @@ -752,10 +750,10 @@ test02() simple alternatives (e.g., __gnu_debug::basic_string), and the usability benefit we gain from the ability to mix debug- and release-compiled translation units is enormous. - +
+ +
Alternatives for Coexistence - -Alternatives for Coexistence The coexistence scheme above was chosen over many alternatives, including language-only solutions and solutions that also required @@ -805,8 +803,8 @@ test02() Use implementation-specific properties of anonymous namespaces. - See this post - + See this post + This method fails the correctness criteria. Extension: allow reopening on namespaces: This would @@ -832,8 +830,8 @@ test02() functions taking no arguments in mixed-mode settings resulting in equivalent link names, vector::push_back() being one example. - See link - name + See link + name Other options may exist for implementing the debug mode, many of @@ -848,12 +846,12 @@ test02() added as we are able to identify other typical problem cases. These test cases will serve as a benchmark by which we can compare debug mode implementations. - - - +
+
+
- - Other Implementations +
Other Implementations + There are several existing implementations of debug modes for C++ @@ -861,15 +859,15 @@ test02() supports debugging for programs using libstdc++. The existing implementations include: - SafeSTL: + SafeSTL: SafeSTL was the original debugging version of the Standard Template Library (STL), implemented by Cay S. Horstmann on top of the Hewlett-Packard STL. Though it inspired much work in this area, it has not been kept up-to-date for use with modern compilers or C++ standard library implementations. - STLport: STLport is a free - implementation of the C++ standard library derived from the SGI implementation, and + STLport: STLport is a free + implementation of the C++ standard library derived from the SGI implementation, and ported to many other platforms. It includes a debug mode that uses a wrapper model (that in some ways inspired the libstdc++ debug mode design), although at the time of this writing the debug mode is @@ -885,7 +883,7 @@ test02() guarantee. - - +
+
diff --git a/libstdc++-v3/doc/xml/manual/diagnostics.xml b/libstdc++-v3/doc/xml/manual/diagnostics.xml index 271477e37120..b9a7048716fb 100644 --- a/libstdc++-v3/doc/xml/manual/diagnostics.xml +++ b/libstdc++-v3/doc/xml/manual/diagnostics.xml @@ -1,12 +1,11 @@ - - - - + - + + Diagnostics + <indexterm><primary>Diagnostics</primary></indexterm> + ISO C++ @@ -15,19 +14,16 @@ library - + - - Diagnostics - <indexterm><primary>Diagnostics</primary></indexterm> - - + +
Exceptions - Exceptions + - - API Reference +
API Reference + All exception objects are defined in one of the standard header files: exception, @@ -53,9 +49,9 @@ - - - Adding Data to <classname>exception</classname> +
+
Adding Data to <classname>exception</classname> + The standard exception classes carry with them a single string as data (usually describing what went wrong or where the 'throw' took @@ -76,11 +72,11 @@ }; - - +
+
- - Concept Checking +
Concept Checking + In 1999, SGI added concept checkers to their implementation of the STL: code which checked the template @@ -88,7 +84,7 @@ that the parameters being used met the requirements of the standard. For example, the Standard requires that types passed as template parameters to vector be - "Assignable" (which means what you think it means). The + "Assignable" (which means what you think it means). The checking was done during compilation, and none of the code was executed at runtime. @@ -101,8 +97,8 @@ The primary author of the checking code, Jeremy Siek, had already started work on a replacement implementation. The new code has been formally reviewed and accepted into - the - Boost libraries, and we are pleased to incorporate it into the + the + Boost libraries, and we are pleased to incorporate it into the GNU C++ library. @@ -126,6 +122,6 @@ checking described above. - +
 diff --git a/libstdc++-v3/doc/xml/manual/evolution.xml b/libstdc++-v3/doc/xml/manual/evolution.xml index eda00060a665..08876deb18a0 100644 --- a/libstdc++-v3/doc/xml/manual/evolution.xml +++ b/libstdc++-v3/doc/xml/manual/evolution.xml @@ -1,7 +1,8 @@ - +
- +API Evolution and Deprecation History ISO C++ api @@ -9,16 +10,16 @@ deprecation history - + + -API Evolution and Deprecation History A list of user-visible changes, in chronological order - -<constant>3.0</constant> +
<constant>3.0</constant> + Extensions moved to include/ext. @@ -39,10 +40,10 @@ deactivates the warning.) - +
+ +
<constant>3.1</constant> - -<constant>3.1</constant> @@ -65,10 +66,10 @@ Extensions to tree data structures added in ext/rb_ Removal of ext/tree, moved to backward/tree.h. - +
+ +
<constant>3.2</constant> - -<constant>3.2</constant> Symbol versioning introduced for shared library. @@ -89,16 +90,16 @@ Removal of ext/tree, moved to Error handling in iostreams cleaned up, made consistent. - +
+ +
<constant>3.3</constant> - -<constant>3.3</constant> - +
+ +
<constant>3.4</constant> - -<constant>3.4</constant> @@ -161,13 +162,14 @@ _Alloc_traits have been removed. underlying allocator was not user-configurable. - +
Extension Allocators - - - - - + + + + + + @@ -225,12 +227,13 @@ _Alloc_traits have been removed. the first released version of GCC that included the extension allocator. -
+
Extension Allocators Continued - - - - + + + + + @@ -277,10 +280,10 @@ Extension ext/demangle.h added. - + + +
<constant>4.0</constant> - -<constant>4.0</constant> @@ -300,10 +303,10 @@ Removal of ext/demangle.h. - +
+ +
<constant>4.1</constant> - -<constant>4.1</constant> @@ -324,10 +327,10 @@ types, namespace pb_assoc. Extension for policy-based basic_string first added: __gnu_cxx::__versa_string in ext/vstring.h. - +
+ +
<constant>4.2</constant> - -<constant>4.2</constant> @@ -360,10 +363,10 @@ __gnu_cxx::__debug. and ext/throw_allocator.h. - +
+ +
<constant>4.3</constant> - -<constant>4.3</constant> @@ -448,11 +451,11 @@ PCH binary files no longer installed. Instead, the source files are installed. Namespace pb_ds moved to __gnu_pb_ds. - +
- -<constant>4.4</constant> +
<constant>4.4</constant> + @@ -558,10 +561,10 @@ for non-standard pointer types has been added to vector and forward_list. - +
+ +
<constant>4.5</constant> - -<constant>4.5</constant> @@ -623,6 +626,6 @@ now defaults to zero. Extensions modified: ext/throw_allocator.h. - +
- + diff --git a/libstdc++-v3/doc/xml/manual/extensions.xml b/libstdc++-v3/doc/xml/manual/extensions.xml index 7fa9a5e36e43..b93c61f1be26 100644 --- a/libstdc++-v3/doc/xml/manual/extensions.xml +++ b/libstdc++-v3/doc/xml/manual/extensions.xml @@ -1,12 +1,11 @@ - - - - + - + + Extensions + <indexterm><primary>Extensions</primary></indexterm> + ISO C++ @@ -15,15 +14,12 @@ library - + - - Extensions - <indexterm><primary>Extensions</primary></indexterm> - - - + +</info> + <para> Here we will make an attempt at describing the non-Standard extensions to the library. Some of these are from SGI's STL, some of these are GNU's, @@ -32,7 +28,7 @@ <para><emphasis>Before</emphasis> you leap in and use any of these extensions, be aware of two things: </para> -<orderedlist> +<orderedlist inheritnum="ignore" continuation="restarts"> <listitem> <para> Non-Standard means exactly that. @@ -55,9 +51,9 @@ extensions, be aware of two things: </preface> <!-- Chapter 01 : Compile Time Checks --> -<chapter id="manual.ext.compile_checks" xreflabel="Compile Time Checks"> +<chapter xml:id="manual.ext.compile_checks" xreflabel="Compile Time Checks"><info><title>Compile Time Checks - Compile Time Checks + Also known as concept checking. @@ -77,8 +73,8 @@ extensions, be aware of two things: The primary author of the checking code, Jeremy Siek, had already started work on a replacement implementation. The new code has been formally reviewed and accepted into - the - Boost libraries, and we are pleased to incorporate it into the + the + Boost libraries, and we are pleased to incorporate it into the GNU C++ library. The new version imposes a much smaller space overhead on the generated @@ -104,54 +100,48 @@ extensions, be aware of two things: - + - + - + - +Allocators - Allocators + - + - + - +Containers - Containers + - - Policy Based Data Structures +
Policy Based Data Structures + - More details here. + More details here. - +
- - HP/SGI +
HP/SGI + @@ -173,7 +163,7 @@ extensions, be aware of two things: There are versions of single-bit test, set, reset, and flip member functions which do no range-checking. If we call them member functions of an instantiation - of "bitset<N>," then their names and signatures are: + of "bitset<N>," then their names and signatures are: bitset<N>& _Unchecked_set (size_t pos); @@ -196,19 +186,19 @@ extensions, be aware of two things: resolution calls for range-checking to be done. We'll just wait and see... Finally, two additional searching functions have been added. They return - the index of the first "on" bit, and the index of the first - "on" bit that is after prev, respectively: + the index of the first "on" bit, and the index of the first + "on" bit that is after prev, respectively: size_t _Find_first() const; size_t _Find_next (size_t prev) const; The same caveat given for the _Unchecked_* functions applies here also. - +
- - Deprecated HP/SGI +
Deprecated HP/SGI + The SGI hashing classes hash_set and @@ -230,8 +220,8 @@ extensions, be aware of two things: <hash_map> and <hash_set> are deprecated but available as backwards-compatible extensions, as discussed further below. <rope> is the - SGI specialization for large strings ("rope," - "large strings," get it? Love that geeky humor.) + SGI specialization for large strings ("rope," + "large strings," get it? Love that geeky humor.) <slist> is a singly-linked list, for when the doubly-linked list<> is too much space overhead, and <rb_tree> exposes the red-black @@ -240,12 +230,12 @@ extensions, be aware of two things: Each of the associative containers map, multimap, set, and multiset have a counterpart which uses a - hashing - function to do the arranging, instead of a strict weak ordering + hashing + function to do the arranging, instead of a strict weak ordering function. The classes take as one of their template parameters a function object that will return the hash value; by default, an instantiation of - hash. + hash. You should specialize this functor for your class, or define your own, before trying to use one of the hashing classes. @@ -269,13 +259,13 @@ extensions, be aware of two things: - +
- +Utilities - Utilities + The <functional> header contains many additional functors and helper functions, extending section 20.3. They are @@ -343,9 +333,9 @@ get_temporary_buffer(5, (int*)0); - +Algorithms - Algorithms + 25.1.6 (count, count_if) is extended with two more versions of count and count_if. The standard versions return their results. The additional signatures return void, but take a final parameter by @@ -381,34 +371,34 @@ get_temporary_buffer(5, (int*)0); - +Numerics - Numerics + 26.4, the generalized numeric operations such as accumulate, are extended with the following functions: power (x, n); power (x, n, moniod_operation); -Returns, in FORTRAN syntax, "x ** n" where n>=0. In the +Returns, in FORTRAN syntax, "x ** n" where n>=0. In the case of n == 0, returns the identity element for the monoid operation. The two-argument signature uses multiplication (for - a true "power" implementation), but addition is supported as well. + a true "power" implementation), but addition is supported as well. The operation functor must be associative. The iota function wins the award for Extension With the - Coolest Name. It "assigns sequentially increasing values to a range. + Coolest Name. It "assigns sequentially increasing values to a range. That is, it assigns value to *first, value + 1 to *(first + 1) and so - on." Quoted from SGI documentation. + on." Quoted from SGI documentation. void iota(_ForwardIter first, _ForwardIter last, _Tp value); - +Iterators - Iterators + 24.3.2 describes struct iterator, which didn't exist in the original HP STL implementation (the language wasn't rich enough at the time). For backwards compatibility, base classes are provided which @@ -430,17 +420,17 @@ get_temporary_buffer(5, (int*)0); - +Input and Output - Input and Output + Extensions allowing filebufs to be constructed from "C" types like FILE*s and file descriptors. - - Derived filebufs +
Derived filebufs + The v2 library included non-standard extensions to construct std::filebufs from C stdio types such as @@ -483,7 +473,7 @@ get_temporary_buffer(5, (int*)0); the fd() function were removed from the standard filebuf. Instead, <ext/stdio_filebuf.h> contains a derived class called - __gnu_cxx::stdio_filebuf. + __gnu_cxx::stdio_filebuf. This class can be constructed from a C FILE* or a file descriptor, and provides the fd() function. @@ -496,22 +486,21 @@ get_temporary_buffer(5, (int*)0); - +
- +Demangling - Demangling + Transforming C++ ABI identifiers (like RTTI symbols) into the original C++ source identifiers is called demangling. - If you have read the source - documentation for namespace abi then you are + If you have read the source + documentation for namespace abi then you are aware of the cross-vendor C++ ABI in use by GCC. One of the exposed functions is used for demangling, abi::__cxa_demangle. @@ -586,8 +575,7 @@ int main() - + diff --git a/libstdc++-v3/doc/xml/manual/internals.xml b/libstdc++-v3/doc/xml/manual/internals.xml index 63664cea3f1b..72af0b835c89 100644 --- a/libstdc++-v3/doc/xml/manual/internals.xml +++ b/libstdc++-v3/doc/xml/manual/internals.xml @@ -1,7 +1,8 @@ - +
- +Porting to New Hardware or Operating Systems ISO C++ @@ -10,9 +11,9 @@ internals - + + -Porting to New Hardware or Operating Systems @@ -45,8 +46,8 @@ a "host." The comment at the top of configure.ac explains why.) - -Operating System +
Operating System + If you are porting to a new operating system (as opposed to a new chip using an existing operating system), you will need to create a new @@ -151,11 +152,11 @@ this: We recommend copying an existing os_defines.h to use as a starting point. - +
- -CPU +
CPU + If you are porting to a new chip (as opposed to a new operating system running on an existing chip), you will need to create a new directory in the @@ -183,11 +184,11 @@ example, alpha, alphaev5, and alphaev6 al appropriate for your chip. - +
- -Character Types +
Character Types + The library requires that you provide three header files to implement character classification, analogous to that provided by the C libraries @@ -399,11 +400,11 @@ from __low up until __high into the vector given by } - +
- -Thread Safety +
Thread Safety + The C++ library string functionality requires a couple of atomic operations to provide thread-safety. If you don't take any special @@ -482,11 +483,11 @@ must be equivalent to those provided here, but using atomic operations: } - +
- -Numeric Limits +
Numeric Limits + The C++ library requires information about the fundamental data types, such as the minimum and maximum representable values of each type. @@ -504,11 +505,11 @@ To take that approach, create a new file called cpu_limits.h in your CPU configuration directory (see CPU). - +
- -Libtool +
Libtool + The C++ library is compiled, archived and linked with libtool. Explaining the full workings of libtool is beyond the scope of this @@ -543,6 +544,6 @@ operating system. - +
- +
diff --git a/libstdc++-v3/doc/xml/manual/intro.xml b/libstdc++-v3/doc/xml/manual/intro.xml index a6dff4daf152..705119b6d3e2 100644 --- a/libstdc++-v3/doc/xml/manual/intro.xml +++ b/libstdc++-v3/doc/xml/manual/intro.xml @@ -1,12 +1,10 @@ - - - - + - + + Introduction + <indexterm><primary>Introduction</primary></indexterm> + ISO C++ @@ -15,75 +13,65 @@ library - + + - - Introduction - <indexterm><primary>Introduction</primary></indexterm> - - +Status - Status + - - Implementation Status +
Implementation Status + - + - + - + - + - +
- +
License - License + There are two licenses affecting GNU libstdc++: one for the code, and one for the documentation. - There is a license section in the FAQ regarding common questions. If you have more - questions, ask the FSF or the gcc mailing list. + There is a license section in the FAQ regarding common questions. If you have more + questions, ask the FSF or the gcc mailing list. - - The Code: GPL +
The Code: GPL + - The source code is distributed under the GNU General Public License version 3, + The source code is distributed under the GNU General Public License version 3, with the addition under section 7 of an exception described in the GCC Runtime Library Exception, version 3.1 as follows (or see the file COPYING.RUNTIME): - + GCC RUNTIME LIBRARY EXCEPTION Version 3.1, 31 March 2009 -Copyright (C) 2009 Free Software Foundation, Inc. +Copyright (C) 2009 Free Software Foundation, Inc. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. @@ -157,10 +145,10 @@ requirements of the license of GCC. Hopefully that text is self-explanatory. If it isn't, you need to speak to your lawyer, or the Free Software Foundation. - +
- - The Documentation: GPL, FDL +
The Documentation: GPL, FDL + The documentation shipped with the library and made available over @@ -182,27 +170,26 @@ requirements of the license of GCC. If you plan on making copies of the documentation, please let us know. We can probably offer suggestions. - +
- +
- +
Bugs - Bugs + - - Implementation Bugs +
Implementation Bugs + Information on known bugs, details on efforts to fix them, and - fixed bugs are all available as part of the GCC bug tracking system, + fixed bugs are all available as part of the GCC bug tracking system, with the category set to libstdc++. - +
- - Standard Bugs +
Standard Bugs + Everybody's got issues. Even the C++ Standard Library. @@ -216,10 +203,10 @@ requirements of the license of GCC. Here are the issues which have resulted in code changes to the library. The links are to the specific defect reports from a partial copy of the Issues List. You can read the full version online - at the ISO C++ - Committee homepage, linked to on the - GCC "Readings" - page. If + at the ISO C++ + Committee homepage, linked to on the + GCC "Readings" + page. If you spend a lot of time reading the issues, we recommend downloading the ZIP file and reading them locally. @@ -237,116 +224,116 @@ requirements of the license of GCC. and src directories for appearances of _GLIBCXX_RESOLVE_LIB_DEFECTS for examples of style. Note that we usually do not make changes to the - code until an issue has reached DR status. + code until an issue has reached DR status. - 5: + 5: string::compare specification questionable This should be two overloaded functions rather than a single function. - 17: + 17: Bad bool parsing Apparently extracting Boolean values was messed up... - 19: - "Noconv" definition too vague + 19: + "Noconv" definition too vague If codecvt::do_in returns noconv there are no changes to the values in [to, to_limit). - 22: + 22: Member open vs flags Re-opening a file stream does not clear the state flags. - 23: + 23: Num_get overflow result Implement the proposed resolution. - 25: + 25: String operator<< uses width() value wrong Padding issues. - 48: + 48: Use of non-existent exception constructor An instance of ios_base::failure is constructed instead. - 49: + 49: Underspecification of ios_base::sync_with_stdio The return type is the previous state of synchronization. - 50: + 50: Copy constructor and assignment operator of ios_base These members functions are declared private and are thus inaccessible. Specifying the correct semantics of - "copying stream state" was deemed too complicated. + "copying stream state" was deemed too complicated. - 60: + 60: What is a formatted input function? This DR made many widespread changes to basic_istream and basic_ostream all of which have been implemented. - 63: + 63: Exception-handling policy for unformatted output Make the policy consistent with that of formatted input, unformatted input, and formatted output. - 68: + 68: Extractors for char* should store null at end And they do now. An editing glitch in the last item in the list of [27.6.1.2.3]/7. - 74: + 74: Garbled text for codecvt::do_max_length The text of the standard was gibberish. Typos gone rampant. - 75: + 75: Contradiction in codecvt::length's argument types Change the first parameter to stateT& and implement the new effects paragraph. - 83: + 83: string::npos vs. string::max_size() Safety checks on the size of the string should test against max_size() rather than npos. - 90: + 90: Incorrect description of operator>> for strings The effect contain isspace(c,getloc()) which must be replaced by isspace(c,is.getloc()). - 91: + 91: Description of operator>> and getline() for string<> might cause endless loop @@ -355,7 +342,7 @@ requirements of the license of GCC. not required to set gcount). - 103: + 103: set::iterator is required to be modifiable, but this allows modification of keys. @@ -364,14 +351,14 @@ requirements of the license of GCC. are constant iterators. - 109: + 109: Missing binders for non-const sequence elements The binder1st and binder2nd didn't have an operator() taking a non-const parameter. - 110: + 110: istreambuf_iterator::equal not const This was not a const member function. Note that the DR says to @@ -379,31 +366,31 @@ requirements of the license of GCC. overloaded version with identical contents. - 117: + 117: basic_ostream uses nonexistent num_put member functions num_put::put() was overloaded on the wrong types. - 118: + 118: basic_istream uses nonexistent num_get member functions Same as 117, but for num_get::get(). - 129: + 129: Need error indication from seekp() and seekg() These functions set failbit on error now. - 130: + 130: Return type of container::erase(iterator) differs for associative containers Make member erase return iterator for set, multiset, map, multimap. - 136: + 136: seekp, seekg setting wrong streams? seekp should only set the output stream, and @@ -417,46 +404,46 @@ requirements of the license of GCC. should probably not be calling underflow(). --> - 167: + 167: Improper use of traits_type::length() op<< with a const char* was calculating an incorrect number of characters to write. - 169: + 169: Bad efficiency of overflow() mandated Grow efficiently the internal array object. - 171: + 171: Strange seekpos() semantics due to joint position Quite complex to summarize... - 181: + 181: make_pair() unintended behavior This function used to take its arguments as reference-to-const, now it copies them (pass by value). - 195: + 195: Should basic_istream::sentry's constructor ever set eofbit? Yes, it can, specifically if EOF is reached while skipping whitespace. - 211: + 211: operator>>(istream&, string&) doesn't set failbit If nothing is extracted into the string, op>> now sets failbit (which can cause an exception, etc., etc.). - 214: + 214: set::find() missing const overload Both set and multiset were missing @@ -464,47 +451,47 @@ requirements of the license of GCC. for const instances. - 231: + 231: Precision in iostream? For conversion from a floating-point type, str.precision() is specified in the conversion specification. - 233: + 233: Insertion hints in associative containers Implement N1780, first check before then check after, insert as close to hint as possible. - 235: + 235: No specification of default ctor for reverse_iterator The declaration of reverse_iterator lists a default constructor. However, no specification is given what this constructor should do. - 241: + 241: Does unique_copy() require CopyConstructible and Assignable? Add a helper for forward_iterator/output_iterator, fix the existing one for input_iterator/output_iterator to not rely on Assignability. - 243: + 243: get and getline when sentry reports failure Store a null character only if the character array has a non-zero size. - 251: + 251: basic_stringbuf missing allocator_type This nested typedef was originally not specified. - 253: + 253: valarray helper functions are almost entirely useless Make the copy constructor and copy-assignment operator declarations @@ -512,60 +499,60 @@ requirements of the license of GCC. definitions. - 265: + 265: std::pair::pair() effects overly restrictive The default ctor would build its members from copies of temporaries; now it simply uses their respective default ctors. - 266: + 266: bad_exception::~bad_exception() missing Effects clause The bad_* classes no longer have destructors (they are trivial), since no description of them was ever given. - 271: + 271: basic_iostream missing typedefs The typedefs it inherits from its base classes can't be used, since (for example) basic_iostream<T>::traits_type is ambiguous. - 275: + 275: Wrong type in num_get::get() overloads Similar to 118. - 280: + 280: Comparison of reverse_iterator to const reverse_iterator Add global functions with two template parameters. (NB: not added for now a templated assignment operator) - 292: + 292: Effects of a.copyfmt (a) If (this == &rhs) do nothing. - 300: + 300: List::merge() specification incomplete If (this == &x) do nothing. - 303: + 303: Bitset input operator underspecified Basically, compare the input character to is.widen(0) and is.widen(1). - 305: + 305: Default behavior of codecvt<wchar_t, char, mbstate_t>::length() @@ -573,20 +560,20 @@ requirements of the license of GCC. mbstate_t>::do_length must return. - 328: + 328: Bad sprintf format modifier in money_put<>::do_put() - Change the format string to "%.0Lf". + Change the format string to "%.0Lf". - 365: + 365: Lack of const-qualification in clause 27 Add const overloads of is_open. - 387: + 387: std::complex over-encapsulated Add the real(T) and imag(T) @@ -595,26 +582,26 @@ requirements of the license of GCC. free functions. - 389: + 389: Const overload of valarray::operator[] returns by value Change it to return a const T&. - 396: + 396: what are characters zero and one Implement the proposed resolution. - 402: + 402: Wrong new expression in [some_]allocator::construct - Replace "new" with "::new". + Replace "new" with "::new". - 408: + 408: Is vector<reverse_iterator<char*> > forbidden? @@ -622,76 +609,76 @@ requirements of the license of GCC. Tweak the debug-mode checks in _Safe_iterator. - 409: + 409: Closing an fstream should clear the error state Have open clear the error flags. - 431: + 431: Swapping containers with unequal allocators Implement Option 3, as per N1599. - 432: + 432: stringbuf::overflow() makes only one write position available Implement the resolution, beyond DR 169. - 434: + 434: bitset::to_string() hard to use Add three overloads, taking fewer template arguments. - 438: + 438: Ambiguity in the "do the right thing" clause Implement the resolution, basically cast less. - 453: + 453: basic_stringbuf::seekoff need not always fail for an empty stream Don't fail if the next pointer is null and newoff is zero. - 455: + 455: cerr::tie() and wcerr::tie() are overspecified Initialize cerr tied to cout and wcerr tied to wcout. - 464: + 464: Suggestion for new member functions in standard containers Add data() to std::vector and at(const key_type&) to std::map. - 508: + 508: Bad parameters for ranlux64_base_01 Fix the parameters. - 512: + 512: Seeding subtract_with_carry_01 from a single unsigned long Construct a linear_congruential engine and seed with it. - 526: + 526: Is it undefined if a function in the standard changes in parameters? Use &value. - 538: + 538: 241 again: Does unique_copy() require CopyConstructible and Assignable? @@ -699,7 +686,7 @@ requirements of the license of GCC. input_iterator' value_type. - 539: + 539: partial_sum and adjacent_difference should mention requirements @@ -707,116 +694,116 @@ requirements of the license of GCC. in adjacent_difference. - 541: + 541: shared_ptr template assignment and void Add an auto_ptr<void> specialization. - 543: + 543: valarray slice default constructor Follow the straightforward proposed resolution. - 550: + 550: What should the return type of pow(float,int) be? In C++0x mode, remove the pow(float,int), etc., signatures. - 586: + 586: string inserter not a formatted function Change it to be a formatted output function (i.e. catch exceptions). - 596: + 596: 27.8.1.3 Table 112 omits "a+" and "a+b" modes Add the missing modes to fopen_mode. - 630: + 630: arrays of valarray Implement the simple resolution. - 660: + 660: Missing bitwise operations Add the missing operations. - 691: + 691: const_local_iterator cbegin, cend missing from TR1 In C++0x mode add cbegin(size_type) and cend(size_type) to the unordered containers. - 693: + 693: std::bitset::all() missing Add it, consistently with the discussion. - 695: + 695: ctype<char>::classic_table() not accessible Make the member functions table and classic_table public. - 696: + 696: istream::operator>>(int&) broken Implement the straightforward resolution. - 761: + 761: unordered_map needs an at() member function In C++0x mode, add at() and at() const. - 775: + 775: Tuple indexing should be unsigned? - Implement the int -> size_t replacements. + Implement the int -> size_t replacements. - 776: + 776: Undescribed assign function of std::array In C++0x mode, remove assign, add fill. - 781: + 781: std::complex should add missing C99 functions In C++0x mode, add std::proj. - 809: + 809: std::swap should be overloaded for array types Add the overload. - 844: + 844: complex pow return type is ambiguous In C++0x mode, remove the pow(complex<T>, int) signature. - 853: + 853: to_string needs updating with zero and one Update / add the signatures. - 865: + 865: More algorithms that throw away information The traditional HP / SGI return type and value is blessed @@ -824,15 +811,15 @@ requirements of the license of GCC. - - +
+
- +Setup - Setup + To transform libstdc++ sources into installed include files and properly built binaries useful for linking to other software is @@ -859,22 +846,20 @@ requirements of the license of GCC. - + - + - +
Make -Make + If you have never done this before, you should read the basic - GCC Installation - Instructions first. Read all of them. + GCC Installation + Instructions first. Read all of them. Twice. @@ -882,13 +867,12 @@ requirements of the license of GCC. started to build. - +
 - + diff --git a/libstdc++-v3/doc/xml/manual/io.xml b/libstdc++-v3/doc/xml/manual/io.xml index 13a1d7a47d28..6378313b5931 100644 --- a/libstdc++-v3/doc/xml/manual/io.xml +++ b/libstdc++-v3/doc/xml/manual/io.xml @@ -1,12 +1,11 @@ - - - - + - + + Input and Output + <indexterm><primary>Input and Output</primary></indexterm> + ISO C++ @@ -15,17 +14,14 @@ library - + + - - Input and Output - <indexterm><primary>Input and Output</primary></indexterm> - - +
Iostream Objects - Iostream Objects + To minimize the time you have to wait on the compiler, it's good to only include the headers you really need. Many people simply include @@ -35,10 +31,10 @@ <iosfwd> should be included whenever you simply need the name of an I/O-related class, such as - "ofstream" or "basic_streambuf". Like the name + "ofstream" or "basic_streambuf". Like the name implies, these are forward declarations. (A word to all you fellow old school programmers: trying to forward declare classes like - "class istream;" won't work. Look in the iosfwd header if + "class istream;" won't work. Look in the iosfwd header if you'd like to know why.) For example, @@ -93,9 +89,9 @@ the various concrete implementations. If you are only using the interfaces, then you only need to use the appropriate interface header. - <iomanip> provides "extractors and inserters + <iomanip> provides "extractors and inserters that alter information maintained by class ios_base and its derived - classes," such as std::setprecision and std::setw. If you need + classes," such as std::setprecision and std::setw. If you need to write expressions like os << setw(3); or is >> setbase(8);, you must include <iomanip>. @@ -157,24 +153,24 @@ compile times will go down when there's less parsing work to do. - +
- +
Stream Buffers - Stream Buffers + - - Derived streambuf Classes +
Derived streambuf Classes + Creating your own stream buffers for I/O can be remarkably easy. If you are interested in doing so, we highly recommend two very excellent books: - Standard C++ - IOStreams and Locales by Langer and Kreft, ISBN 0-201-18395-1, and - The C++ Standard Library + Standard C++ + IOStreams and Locales by Langer and Kreft, ISBN 0-201-18395-1, and + The C++ Standard Library by Nicolai Josuttis, ISBN 0-201-37926-0. Both are published by Addison-Wesley, who isn't paying us a cent for saying that, honest. @@ -223,14 +219,14 @@ Try it yourself! More examples can be found in 3.1.x code, in include/ext/*_filebuf.h, and in this article by James Kanze: - Filtering - Streambufs. + Filtering + Streambufs. - +
- - Buffering +
Buffering + First, are you sure that you understand buffering? Chaptericularly the fact that C++ may not, in fact, have anything to do with it? @@ -241,8 +237,8 @@ when the output stream is, in fact, a terminal and not a file or some other device -- and that may not even be true since C++ says nothing about files nor terminals. All of that is - system-dependent. (The "newline-buffer-flushing only occurring - on terminals" thing is mostly true on Unix systems, though.) + system-dependent. (The "newline-buffer-flushing only occurring + on terminals" thing is mostly true on Unix systems, though.) Some people also believe that sending endl down an output stream only writes a newline. This is incorrect; after a @@ -252,17 +248,17 @@ wasted when doing this to a file: - output << "a line of text" << endl; + output << "a line of text" << endl; output << some_data_variable << endl; - output << "another line of text" << endl; + output << "another line of text" << endl; The proper thing to do in this case to just write the data out and let the libraries and the system worry about the buffering. If you need a newline, just write a newline: - output << "a line of text\n" + output << "a line of text\n" << some_data_variable << '\n' - << "another line of text\n"; + << "another line of text\n"; I have also joined the output statements into a single statement. You could make the code prettier by moving the single newline to the start of the quoted text on the last line, for example. @@ -289,10 +285,10 @@ os.rdbuf()->pubsetbuf(0,0); is.rdbuf()->pubsetbuf(0,0); - os.open("/foo/bar/baz"); - is.open("/qux/quux/quuux"); + os.open("/foo/bar/baz"); + is.open("/qux/quux/quuux"); ... - os << "this data is written immediately\n"; + os << "this data is written immediately\n"; is >> i; // and this will probably cause a disk read Since all aspects of buffering are handled by a streambuf-derived member, it is necessary to get at that member with rdbuf(). @@ -303,8 +299,8 @@ A great deal of this is implementation-dependent. For example, streambuf does not specify any actions for its own setbuf()-ish functions; the classes derived from - streambuf each define behavior that "makes - sense" for that class: an argument of (0,0) turns off buffering + streambuf each define behavior that "makes + sense" for that class: an argument of (0,0) turns off buffering for filebuf but does nothing at all for its siblings stringbuf and strstreambuf, and specifying anything other than (0,0) has varying effects. @@ -320,15 +316,15 @@ changing those are system-dependent. - - +
+
- +
Memory Based Streams - Memory Based Streams - - Compatibility With strstream + +
Compatibility With strstream + Stringstreams (defined in the header <sstream>) @@ -360,23 +356,23 @@ If you are a user of the strstream classes, you need to update your code. You don't have to explicitly append ends to terminate the C-style character array, you don't have to mess with - "freezing" functions, and you don't have to manage the + "freezing" functions, and you don't have to manage the memory yourself. The strstreams have been officially deprecated, which means that 1) future revisions of the C++ Standard won't support them, and 2) if you use them, people will laugh at you. - - +
+
- +
File Based Streams - File Based Streams + - - Copying a File +
Copying a File + @@ -395,13 +391,13 @@ OUT << IN; For those of you who don't already know why this doesn't work (probably from having done it before), I invite you to quickly - create a simple text file called "input_file" containing + create a simple text file called "input_file" containing the sentence The quick brown fox jumped over the lazy dog. surrounded by blank lines. Code it up and try it. The contents - of "output_file" may surprise you. + of "output_file" may surprise you. Seriously, go do it. Get surprised, then come back. It's worth it. @@ -411,7 +407,7 @@ handled by the basic_streambuf family. Fortunately, the operator<< is overloaded to take an ostream and a pointer-to-streambuf, in order to help with just this kind of - "dump the data verbatim" situation. + "dump the data verbatim" situation. Why a pointer to streambuf and not just a streambuf? Well, the [io]streams hold pointers (or references, depending on the @@ -427,7 +423,7 @@ behavior, since that chaptericular << isn't defined by the Standard. I have seen instances where it is implemented, but the character extraction process removes all the whitespace, leaving you with no - blank lines and only "Thequickbrownfox...". With + blank lines and only "Thequickbrownfox...". With libraries that do not define that operator, IN (or one of IN's member pointers) sometimes gets converted to a void*, and the output file then contains a perfect text representation of a hexadecimal @@ -439,10 +435,10 @@ descendants. - +
- - Binary Input and Output +
Binary Input and Output + The first and most important thing to remember about binary I/O is @@ -454,7 +450,7 @@ Sorry. Them's the breaks. This isn't going to try and be a complete tutorial on reading and - writing binary files (because "binary" + writing binary files (because "binary" covers a lot of ground), but we will try and clear up a couple of misconceptions and common errors. @@ -481,7 +477,7 @@ Third, using the get() and put()/write() member functions still aren't guaranteed to help you. These are - "unformatted" I/O functions, but still character-based. + "unformatted" I/O functions, but still character-based. (This may or may not be what you want, see below.) Notice how all the problems here are due to the inappropriate use @@ -558,9 +554,9 @@ An instructive thread from comp.lang.c++.moderated delved off into this topic starting more or less at - this - post and continuing to the end of the thread. (The subject heading is "binary iostreams" on both comp.std.c++ - and comp.lang.c++.moderated.) Take special note of the replies by James Kanze and Dietmar Kühl. + this + post and continuing to the end of the thread. (The subject heading is "binary iostreams" on both comp.std.c++ + and comp.lang.c++.moderated.) Take special note of the replies by James Kanze and Dietmar Kühl. Briefly, the problems of byte ordering and type sizes mean that the unformatted functions like ostream::put() and @@ -569,28 +565,28 @@ invocation of a program to another invocation of the same program on a different platform, etc. - +
- +
- +
Interacting with C - Interacting with C + - - Using FILE* and file descriptors +
Using FILE* and file descriptors + See the extensions for using FILE and file descriptors with ofstream and ifstream. - +
- - Performance +
Performance + Pathetic Performance? Ditch C. @@ -604,9 +600,9 @@ #include <iostream> #include <cstdio> - std::cout << "Hel"; - std::printf ("lo, worl"); - std::cout << "d!\n"; + std::cout << "Hel"; + std::printf ("lo, worl"); + std::cout << "d!\n"; This must do what you think it does. @@ -647,7 +643,7 @@ - - +
+
 diff --git a/libstdc++-v3/doc/xml/manual/iterators.xml b/libstdc++-v3/doc/xml/manual/iterators.xml index 86b92a4f54bc..bcfa30cd5f9c 100644 --- a/libstdc++-v3/doc/xml/manual/iterators.xml +++ b/libstdc++-v3/doc/xml/manual/iterators.xml @@ -1,12 +1,11 @@ - - - - + - + + Iterators + <indexterm><primary>Iterators</primary></indexterm> + ISO C++ @@ -15,19 +14,16 @@ library - + + - - Iterators - <indexterm><primary>Iterators</primary></indexterm> - - - Predefined +
Predefined + - - Iterators vs. Pointers +
Iterators vs. Pointers + The following FAQ entry points out that @@ -63,7 +59,7 @@ classes. How much overhead is there when using an iterator class? Very little. Most of the layering classes contain nothing but typedefs, and typedefs are - "meta-information" that simply tell the compiler some + "meta-information" that simply tell the compiler some nicknames; they don't create code. That information gets passed down through inheritance, so while the compiler has to do work looking up all the names, your runtime code does not. (This has @@ -71,10 +67,10 @@ classes. - +
- - One Past the End +
One Past the End + This starts off sounding complicated, but is actually very easy, especially towards the end. Trust me. @@ -88,7 +84,7 @@ classes. C and C++ for builtin arrays. The following rules have always been true for both languages: - + You can point anywhere in the array, or to the first element past the end of the array. A pointer that points to one @@ -145,9 +141,9 @@ classes. Now think back to your junior-high school algebra course, when you were learning how to draw graphs. Remember that a graph terminating - with a solid dot meant, "Everything up through this point," - and a graph terminating with an open dot meant, "Everything up - to, but not including, this point," respectively called closed + with a solid dot meant, "Everything up through this point," + and a graph terminating with an open dot meant, "Everything up + to, but not including, this point," respectively called closed and open ranges? Remember how closed ranges were written with brackets, [a,b], and open ranges were written with parentheses, (a,b)? @@ -181,8 +177,8 @@ classes. Just don't dereference end(). - - +
+
diff --git a/libstdc++-v3/doc/xml/manual/locale.xml b/libstdc++-v3/doc/xml/manual/locale.xml index 234439ae355b..dcdd10322849 100644 --- a/libstdc++-v3/doc/xml/manual/locale.xml +++ b/libstdc++-v3/doc/xml/manual/locale.xml @@ -1,6 +1,7 @@ -
+
- +locale ISO C++ @@ -9,9 +10,9 @@ locale - + + -locale Describes the basic locale object, including nested @@ -19,8 +20,8 @@ classes id, facet, and the reference-counted implementation object, class _Impl. -
-Requirements +
Requirements + Class locale is non-templatized and has two distinct types nested @@ -89,8 +90,8 @@ Provides an index for looking up specific facets.
-
-Design +
Design + The major design challenge is fitting an object-orientated and @@ -105,11 +106,11 @@ portability is an issue.
-
-Implementation +
Implementation -
- Interacting with "C" locales + +
Interacting with "C" locales + @@ -470,8 +471,8 @@ global locale" (emphasis Paolo), that is:
-
-Future +
Future + @@ -510,21 +511,15 @@ global locale" (emphasis Paolo), that is:
- -Bibliography +Bibliography + - + <citetitle> The GNU C Library - - - McGrath - Roland - - - Drepper - Ulrich - + + McGrathRoland + DrepperUlrich 2007 FSF @@ -536,23 +531,20 @@ global locale" (emphasis Paolo), that is: - + <citetitle> Correspondence - - - Drepper - Ulrich - + + DrepperUlrich 2002 - + - + <citetitle> ISO/IEC 14882:1998 Programming languages - C++ - + 1998 ISO @@ -560,9 +552,9 @@ global locale" (emphasis Paolo), that is: - + <citetitle> ISO/IEC 9899:1999 Programming languages - C - + 1999 ISO @@ -570,13 +562,11 @@ global locale" (emphasis Paolo), that is: - - - - System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008) - - + + + System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008) + 2008 @@ -587,13 +577,10 @@ global locale" (emphasis Paolo), that is: - + <citetitle> The C++ Programming Language, Special Edition - - - Stroustrup - Bjarne - + + StroustrupBjarne 2000 Addison Wesley, Inc. @@ -607,20 +594,14 @@ global locale" (emphasis Paolo), that is: - + <citetitle> Standard C++ IOStreams and Locales - + Advanced Programmer's Guide and Reference - - Langer - Angelika - - - Kreft - Klaus - + LangerAngelika + KreftKlaus 2000 Addison Wesley Longman, Inc. diff --git a/libstdc++-v3/doc/xml/manual/localization.xml b/libstdc++-v3/doc/xml/manual/localization.xml index 70898546776f..b46e707fc4e0 100644 --- a/libstdc++-v3/doc/xml/manual/localization.xml +++ b/libstdc++-v3/doc/xml/manual/localization.xml @@ -1,12 +1,11 @@ - - - - + - + + Localization + <indexterm><primary>Localization</primary></indexterm> + ISO C++ @@ -15,42 +14,35 @@ library - + + - - Localization - <indexterm><primary>Localization</primary></indexterm> - -
+
Locales - Locales + - +
-
+
Facets - Facets + - + - + - +
diff --git a/libstdc++-v3/doc/xml/manual/messages.xml b/libstdc++-v3/doc/xml/manual/messages.xml index f0428d437816..d834e27d7a81 100644 --- a/libstdc++-v3/doc/xml/manual/messages.xml +++ b/libstdc++-v3/doc/xml/manual/messages.xml @@ -1,7 +1,8 @@ -
+
- +messages ISO C++ @@ -10,9 +11,9 @@ messages - + + -messages The std::messages facet implements message retrieval functionality @@ -20,8 +21,8 @@ equivalent to Java's java.text.MessageFormat .using either GNU gettext or IEEE 1003.1-200 functions. -
-Requirements +
Requirements + The std::messages facet is probably the most vaguely defined facet in @@ -108,8 +109,8 @@ be found, returns dfault.
-
-Design +
Design + A couple of notes on the standard. @@ -157,11 +158,11 @@ other, explicitly named locales.
-
-Implementation +
Implementation -
- Models + +
Models + This is a relatively simple class, on the face of it. The standard specifies very little in concrete terms, so generic @@ -228,8 +229,8 @@ model.
-
- The GNU Model +
The GNU Model + The messages facet, because it is retrieving and converting @@ -321,8 +322,8 @@ model.
-
-Use +
Use + A simple example using the GNU model of message conversion. @@ -351,8 +352,8 @@ void test01()
-
-Future +
Future + @@ -438,21 +439,15 @@ void test01()
- -Bibliography +Bibliography + - + <citetitle> The GNU C Library - - - McGrath - Roland - - - Drepper - Ulrich - + + McGrathRoland + DrepperUlrich 2007 FSF @@ -462,23 +457,20 @@ void test01() - + <citetitle> Correspondence - - - Drepper - Ulrich - + + DrepperUlrich 2002 - + - + <citetitle> ISO/IEC 14882:1998 Programming languages - C++ - + 1998 ISO @@ -486,9 +478,9 @@ void test01() - + <citetitle> ISO/IEC 9899:1999 Programming languages - C - + 1999 @@ -497,13 +489,11 @@ void test01() - - - - System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008) - - + + + System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008) + 2008 @@ -514,13 +504,10 @@ void test01() - + <citetitle> The C++ Programming Language, Special Edition - - - Stroustrup - Bjarne - + + StroustrupBjarne 2000 Addison Wesley, Inc. @@ -534,20 +521,14 @@ void test01() - + <citetitle> Standard C++ IOStreams and Locales - + Advanced Programmer's Guide and Reference - - Langer - Angelika - - - Kreft - Klaus - + LangerAngelika + KreftKlaus 2000 Addison Wesley Longman, Inc. @@ -560,27 +541,24 @@ void test01() - - - - API Specifications, Java Platform - - - + + + + API Specifications, Java Platform + + java.util.Properties, java.text.MessageFormat, java.util.Locale, java.util.ResourceBundle - - - - GNU gettext tools, version 0.10.38, Native Language Support -Library and Tools. - - + + + GNU gettext tools, version 0.10.38, Native Language Support + Library and Tools. + diff --git a/libstdc++-v3/doc/xml/manual/mt_allocator.xml b/libstdc++-v3/doc/xml/manual/mt_allocator.xml index ba93b10fa68f..b31b593bc29a 100644 --- a/libstdc++-v3/doc/xml/manual/mt_allocator.xml +++ b/libstdc++-v3/doc/xml/manual/mt_allocator.xml @@ -1,7 +1,8 @@ - +
- +mt_allocator ISO C++ @@ -10,15 +11,15 @@ allocator - + + -mt_allocator - -Intro +
Intro + The mt allocator [hereinafter referred to simply as "the allocator"] @@ -40,14 +41,14 @@ view - the "inner workings" of the allocator. - +
- -Design Issues +
Design Issues + + +
Overview - -Overview There are three general components to the allocator: a datum @@ -104,15 +105,15 @@ classes, namely member functions allocate and deallocate, plus others. - - +
+
- -Implementation +
Implementation - -Tunable Parameters + +
Tunable Parameters + Certain allocation parameters can be modified, or tuned. There exists a nested struct __pool_base::_Tune that contains all @@ -166,10 +167,10 @@ int main() } - +
+ +
Initialization - -Initialization The static variables (pointers to freelists, tuning parameters etc) @@ -276,10 +277,10 @@ The _S_initialize() function: a thread decides to return some blocks to the global freelist. - +
+ +
Deallocation Notes - -Deallocation Notes Notes about deallocation. This allocator does not explicitly release memory. Because of this, memory debugging programs like @@ -308,16 +309,16 @@ containers, this works, as an instance of the allocator is constructed as part of a container's constructor. However, this assumption is implementation-specific, and subject to change. For an example of a pool that frees memory, see the following - - example. + + example. - +
- +
+ +
Single Thread Example - -Single Thread Example Let's start by describing how the data on a freelist is laid out in memory. @@ -408,10 +409,10 @@ after a set of performance measurements that showed that this is roughly 10% faster than maintaining a set of "last pointers" as well. - +
+ +
Multiple Thread Example - -Multiple Thread Example In the ST example we never used the thread_id variable present in each block. @@ -549,6 +550,6 @@ be improved to further reduce the risk of blocks being "bounced back and forth" between freelists. - +
- +
diff --git a/libstdc++-v3/doc/xml/manual/numerics.xml b/libstdc++-v3/doc/xml/manual/numerics.xml index 379e83cf56db..a9e866e78c8d 100644 --- a/libstdc++-v3/doc/xml/manual/numerics.xml +++ b/libstdc++-v3/doc/xml/manual/numerics.xml @@ -1,12 +1,11 @@ - - - - + - + + Numerics + <indexterm><primary>Numerics</primary></indexterm> + ISO C++ @@ -15,21 +14,18 @@ library - + + - - Numerics - <indexterm><primary>Numerics</primary></indexterm> - - +
Complex - Complex + - - complex Processing +
complex Processing + Using complex<> becomes even more comple- er, sorry, @@ -38,7 +34,7 @@ compiled a list of C++98 and C99 conflict points; his description of C's new type versus those of C++ and how to get them playing together nicely is -here. +here. complex<> is intended to be instantiated with a floating-point type. As long as you meet that and some other basic @@ -49,13 +45,13 @@ (u), and (u,v). - - +
+
- +
Generalized Operations - Generalized Operations + @@ -93,15 +89,15 @@ The other three functions have similar dual-signature forms. - +
- +
Interacting with C - Interacting with C + - - Numerics vs. Arrays +
Numerics vs. Arrays + One of the major reasons why FORTRAN can chew through numbers so well is that it is defined to be free of pointer aliasing, an assumption @@ -112,7 +108,7 @@ as an extension). That library solution is a set of two classes, five template classes, - and "a whole bunch" of functions. The classes are required + and "a whole bunch" of functions. The classes are required to be free of pointer aliasing, so compilers can optimize the daylights out of them the same way that they have been for FORTRAN. They are collectively called valarray, although strictly @@ -121,10 +117,10 @@ libraries before. - +
- - C99 +
C99 + In addition to the other topics on this page, we'll note here some of the C99 features that appear in libstdc++. @@ -143,7 +139,7 @@ wcstoll. - - +
+
 diff --git a/libstdc++-v3/doc/xml/manual/parallel_mode.xml b/libstdc++-v3/doc/xml/manual/parallel_mode.xml index fbc2ed1dbec9..ec0faf9c71d4 100644 --- a/libstdc++-v3/doc/xml/manual/parallel_mode.xml +++ b/libstdc++-v3/doc/xml/manual/parallel_mode.xml @@ -1,12 +1,8 @@ - - - - + - +Parallel Mode C++ @@ -18,9 +14,9 @@ parallel - + + -Parallel Mode The libstdc++ parallel mode is an experimental parallel implementation of many algorithms the C++ Standard Library. @@ -35,8 +31,8 @@ specific compiler flag. - - Intro +
Intro + The following library components in the include numeric are included in the parallel mode: @@ -83,10 +79,10 @@ specific compiler flag. std::unique_copy - +
- - Semantics +
Semantics + The parallel mode STL algorithms are currently not exception-safe, i.e. user-defined functors must not throw exceptions. @@ -100,13 +96,13 @@ it is not possible to call parallel STL algorithm in concurrent threads, either. It might work with other compilers, though. - +
- - Using +
Using + - - Prerequisite Compiler Flags +
Prerequisite Compiler Flags + Any use of parallel functionality requires additional compiler @@ -114,7 +110,7 @@ It might work with other compilers, though. not difficult: just compile your application with the compiler flag -fopenmp. This will link in libgomp, the GNU - OpenMP implementation, + OpenMP implementation, whose presence is mandatory. @@ -129,10 +125,10 @@ In addition, hardware that supports atomic operations and a compiler the GCC manual for more information. - +
- - Using Parallel Mode +
Using Parallel Mode + To use the libstdc++ parallel mode, compile your application with @@ -154,10 +150,10 @@ In addition, hardware that supports atomic operations and a compiler translation units. Parallel mode functionality has distinct linkage, and cannot be confused with normal mode symbols. - +
- - Using Specific Parallel Components +
Using Specific Parallel Components + When it is not feasible to recompile your entire application, or only specific algorithms need to be parallel-aware, individual @@ -199,13 +195,14 @@ flags for atomic operations.) parallel algorithms that can be used in a similar manner: -
+
Parallel Algorithms - - - - - + + + + + + @@ -461,16 +458,16 @@ flags for atomic operations.)
- +
- +
- - Design +
Design + - - Interface Basics +
Interface Basics + All parallel algorithms are intended to have signatures that are @@ -536,14 +533,14 @@ overload is therefore missing. - +
- - Configuration and Tuning +
Configuration and Tuning + - - Setting up the OpenMP Environment +
Setting up the OpenMP Environment + Several aspects of the overall runtime environment can be manipulated @@ -585,10 +582,10 @@ nested parallelism (omp_set_nested), schedule kind documentation for more information. - +
- - Compile Time Switches +
Compile Time Switches + To force an algorithm to execute sequentially, even though parallelism @@ -662,10 +659,10 @@ Multiway mergesort comes with the two splitting strategies for multi-way merging. The quicksort options cannot be used for stable_sort. - +
- - Run Time Settings and Defaults +
Run Time Settings and Defaults + The default parallelization strategy, the choice of specific algorithm @@ -729,8 +726,8 @@ i. e. it is a singleton. It can be read and written by calling __gnu_parallel::_Settings::set, respectively. Please note that the first call return a const object, so direct manipulation is forbidden. -See - settings.h +See + settings.h for complete details. @@ -754,12 +751,12 @@ int main() } - +
- +
- - Implementation Namespaces +
Implementation Namespaces + One namespace contain versions of code that are always explicitly sequential: @@ -787,12 +784,12 @@ related to the parallel mode on a per-namespace basis, can be found in the generated source documentation. - +
- +
- - Testing +
Testing + Both the normal conformance and regression tests and the @@ -830,28 +827,22 @@ the generated source documentation. file, and can be generated by using the make doc-performance rule in the testsuite's Makefile. - +
+ +Bibliography - -Bibliography - + <citetitle> Parallelization of Bulk Operations for STL Dictionaries - + - - Johannes - Singler - - - Leonor - Frias - + JohannesSingler + LeonorFrias 2007 - + @@ -862,26 +853,17 @@ the generated source documentation. - + <citetitle> The Multi-Core Standard Template Library - + - - Johannes - Singler - - - Peter - Sanders - - - Felix - Putze - + JohannesSingler + PeterSanders + FelixPutze 2007 - + diff --git a/libstdc++-v3/doc/xml/manual/prerequisites.xml b/libstdc++-v3/doc/xml/manual/prerequisites.xml index e85020f2563d..5a51b9986e5f 100644 --- a/libstdc++-v3/doc/xml/manual/prerequisites.xml +++ b/libstdc++-v3/doc/xml/manual/prerequisites.xml @@ -1,7 +1,8 @@ - +
- +Prerequisites ISO C++ @@ -10,17 +11,17 @@ Prerequisites - + + -Prerequisites Because libstdc++ is part of GCC, the primary source for installation instructions is - the GCC install page. + the GCC install page. In particular, list of prerequisite software needed to build the library - - starts with those requirements. The same pages also list + + starts with those requirements. The same pages also list the tools you will need if you wish to modify the source. @@ -31,8 +32,8 @@ As of GCC 4.0.1 the minimum version of binutils required to build libstdc++ is 2.15.90.0.1.1. You can get snapshots (as well as releases) of binutils from - - ftp://sources.redhat.com/pub/binutils. + + ftp://sources.redhat.com/pub/binutils. Older releases of libstdc++ do not require such a recent version, but to take full advantage of useful space-saving features and bug-fixes you should use a recent binutils whenever possible. @@ -156,4 +157,4 @@ zh_TW BIG5 - +
diff --git a/libstdc++-v3/doc/xml/manual/profile_mode.xml b/libstdc++-v3/doc/xml/manual/profile_mode.xml index 5665d4e64775..cb4db6732a57 100644 --- a/libstdc++-v3/doc/xml/manual/profile_mode.xml +++ b/libstdc++-v3/doc/xml/manual/profile_mode.xml @@ -1,12 +1,8 @@ - - - - + - +Profile Mode C++ @@ -18,13 +14,13 @@ profile - - -Profile Mode + - - Intro + + +
Intro + Goal: Give performance improvement advice based on recognition of suboptimal usage patterns of the standard library. @@ -36,8 +32,8 @@ various components at interesting entry/exit points to/from the standard library. Process trace, recognize suboptimal patterns, give advice. For details, see - paper presented at - CGO 2009. + paper presented at + CGO 2009. Strengths: @@ -71,8 +67,8 @@ - - Using the Profile Mode +
Using the Profile Mode + This is the anticipated common workflow for program foo.cc: @@ -155,10 +151,10 @@ vector-size: improvement = 3: call stack = 0x804842c ... at a higher abstraction level. - +
- - Tuning the Profile Mode +
Tuning the Profile Mode + Compile time switches and environment variables (see also file profiler.h). Unless specified otherwise, they can be set at compile time @@ -214,21 +210,22 @@ vector-size: improvement = 3: call stack = 0x804842c ... - +
- +
- - Design +
Design + - +
Profile Code Location - - - + + + + @@ -258,9 +255,8 @@ vector-size: improvement = 3: call stack = 0x804842c ... - -Wrapper Model +
Wrapper Model + In order to get our instrumented library version included instead of the release one, @@ -285,12 +281,11 @@ vector-size: improvement = 3: call stack = 0x804842c ... not allowed. Mixing them at compile time will result in preprocessor errors. Mixing them at link time is undefined. - +
- -Instrumentation +
Instrumentation + Instead of instrumenting every public entry and exit point, we chose to add instrumentation on demand, as needed @@ -313,12 +308,11 @@ vector-size: improvement = 3: call stack = 0x804842c ... All the instrumentation on/off compile time switches live in include/profile/profiler.h. - +
- -Run Time Behavior +
Run Time Behavior + For practical reasons, the instrumentation library processes the trace partially @@ -339,15 +333,14 @@ vector-size: improvement = 3: call stack = 0x804842c ... For details, see - paper presented at - CGO 2009. + paper presented at + CGO 2009. - +
- -Analysis and Diagnostics +
Analysis and Diagnostics + Final analysis takes place offline, and it is based entirely on the generated trace and debugging info in the application binary. @@ -357,12 +350,11 @@ vector-size: improvement = 3: call stack = 0x804842c ... The input to the analysis is a table indexed by profile type and call stack. The data type for each entry depends on the profile type. - +
- -Cost Model +
Cost Model + While it is likely that cost models become complex as we get into more sophisticated analysis, we will try to follow a simple set of rules @@ -399,12 +391,11 @@ vector-size: improvement = 3: call stack = 0x804842c ... care require a sorted container. - +
- -Reports +
Reports + There are two types of reports. First, if we recognize a pattern for which we have a substitute that is likely to give better performance, we print @@ -419,12 +410,11 @@ which have the worst data locality in actual traversals. Although this does not offer a solution, it helps the user focus on the key problems and ignore the uninteresting ones. - +
- -Testing +
Testing + First, we want to make sure we preserve the behavior of the release mode. You can just type "make check-profile", which @@ -436,13 +426,12 @@ it helps the user focus on the key problems and ignore the uninteresting ones. Each diagnostic must come with at least two tests, one for false positives and one for false negatives. - +
- + + +
Extensions for Custom Containers - -Extensions for Custom Containers Many large projects use their own data structures instead of the ones in the @@ -453,12 +442,11 @@ it helps the user focus on the key problems and ignore the uninteresting ones. profiler.h (look for "Instrumentation hooks"). - +
- -Empirical Cost Model +
Empirical Cost Model + Currently, the cost model uses formulas with predefined relative weights @@ -479,17 +467,15 @@ it helps the user focus on the key problems and ignore the uninteresting ones. generic parameters. - +
- -Implementation Issues +
Implementation Issues - -Stack Traces + +
Stack Traces + Accurate stack traces are needed during profiling since we group events by call context and dynamic instance. Without accurate traces, diagnostics @@ -503,12 +489,11 @@ it helps the user focus on the key problems and ignore the uninteresting ones. to 0 if you are willing to give up call context information, or to a small positive value to reduce run time overhead. - +
- -Symbolization of Instruction Addresses +
Symbolization of Instruction Addresses + The profiling and analysis phases use only instruction addresses. An external utility such as addr2line is needed to postprocess the result. @@ -516,12 +501,11 @@ it helps the user focus on the key problems and ignore the uninteresting ones. This would require access to symbol tables, debug information tables, external programs or libraries and other system dependent information. - +
- -Concurrency +
Concurrency + Our current model is simplistic, but precise. We cannot afford to approximate because some of our diagnostics require @@ -529,24 +513,22 @@ it helps the user focus on the key problems and ignore the uninteresting ones. During profiling, we keep a single information table per diagnostic. There is a single lock per information table. - +
- -Using the Standard Library in the Instrumentation Implementation +
Using the Standard Library in the Instrumentation Implementation + As much as we would like to avoid uses of libstdc++ within our instrumentation library, containers such as unordered_map are very appealing. We plan to use them as long as they are named properly to avoid ambiguity. - +
- -Malloc Hooks +
Malloc Hooks + User applications/libraries can provide malloc hooks. When the implementation of the malloc hooks uses stdlibc++, there can @@ -563,12 +545,11 @@ it helps the user focus on the key problems and ignore the uninteresting ones. XXX: A definitive solution to this problem would be for the profile extension to use a custom allocator internally, and perhaps not to use libstdc++. - +
- -Construction and Destruction of Global Objects +
Construction and Destruction of Global Objects + The profiling library state is initialized at the first call to a profiling method. This allows us to record the construction of all global objects. @@ -576,18 +557,16 @@ it helps the user focus on the key problems and ignore the uninteresting ones. by a function registered by atexit, thus invoked by exit. - +
- +
- -Developer Information +
Developer Information + + +
Big Picture - -Big Picture The profile mode headers are included with -D_GLIBCXX_PROFILE through preprocessor directives in @@ -609,11 +588,10 @@ it helps the user focus on the key problems and ignore the uninteresting ones. -D_GLIBCXX_PROFILE_... compiler option. - +
+ +
How To Add A Diagnostic - -How To Add A Diagnostic Let's say the diagnostic name is "magic". @@ -684,11 +662,11 @@ it helps the user focus on the key problems and ignore the uninteresting ones. Add documentation in file doc/xml/manual/profile_mode.xml. - - +
+
+ +
Diagnostics - -Diagnostics The table below presents all the diagnostics we intend to implement. @@ -712,16 +690,17 @@ it helps the user focus on the key problems and ignore the uninteresting ones. specific needs or time budgets. -
+
Profile Diagnostics - - - - - - - - + + + + + + + + + @@ -735,145 +714,145 @@ it helps the user focus on the key problems and ignore the uninteresting ones. - - CONTAINERS - - HASHTABLE_TOO_SMALL + + CONTAINERS + + HASHTABLE_TOO_SMALL 10 1 - + 10 yes - - - HASHTABLE_TOO_LARGE + + + HASHTABLE_TOO_LARGE 5 1 - + 10 yes - - - INEFFICIENT_HASH + + + INEFFICIENT_HASH 7 3 - + 10 yes - - - VECTOR_TOO_SMALL + + + VECTOR_TOO_SMALL 8 1 - + 10 yes - - - VECTOR_TOO_LARGE + + + VECTOR_TOO_LARGE 5 1 - + 10 yes - - - VECTOR_TO_HASHTABLE + + + VECTOR_TO_HASHTABLE 7 7 - + 10 no - - - HASHTABLE_TO_VECTOR + + + HASHTABLE_TO_VECTOR 7 7 - + 10 no - - - VECTOR_TO_LIST + + + VECTOR_TO_LIST 8 5 - + 10 yes - - - LIST_TO_VECTOR + + + LIST_TO_VECTOR 10 5 - + 10 no - - - ORDERED_TO_UNORDERED + + + ORDERED_TO_UNORDERED 10 5 - + 10 only map/unordered_map - - ALGORITHMS - - SORT + + ALGORITHMS + + SORT 7 8 - + 7 no - - LOCALITY - - SOFTWARE_PREFETCH + + LOCALITY + + SOFTWARE_PREFETCH 8 8 - + 5 no - - - RBTREE_LOCALITY + + + RBTREE_LOCALITY 4 8 - + 5 no - - - FALSE_SHARING + + + FALSE_SHARING 8 10 - + 10 no @@ -881,9 +860,8 @@ it helps the user focus on the key problems and ignore the uninteresting ones.
- -Diagnostic Template +
Diagnostic Template + Switch: _GLIBCXX_PROFILE_<diagnostic>. @@ -912,21 +890,19 @@ advice sample - +
- -Containers +
Containers + Switch: _GLIBCXX_PROFILE_CONTAINERS. - -Hashtable Too Small +
Hashtable Too Small + Switch: _GLIBCXX_PROFILE_HASHTABLE_TOO_SMALL. @@ -964,12 +940,11 @@ foo.cc:1: advice: Changing initial unordered_set size from 10 to 1000000 saves 1 - +
- -Hashtable Too Large +
Hashtable Too Large + Switch: _GLIBCXX_PROFILE_HASHTABLE_TOO_LARGE. @@ -1010,11 +985,10 @@ bytes of memory and M iteration steps. - +
+ +
Inefficient Hash - -Inefficient Hash Switch: _GLIBCXX_PROFILE_INEFFICIENT_HASH. @@ -1057,11 +1031,10 @@ class dumb_hash { - +
+ +
Vector Too Small - -Vector Too Small Switch: _GLIBCXX_PROFILE_VECTOR_TOO_SMALL. @@ -1098,11 +1071,10 @@ copying 4000000 bytes and 20 memory allocations and deallocations. - +
+ +
Vector Too Large - -Vector Too Large Switch: _GLIBCXX_PROFILE_VECTOR_TOO_LARGE @@ -1140,11 +1112,10 @@ bytes of memory and may reduce the number of cache and TLB misses. - +
+ +
Vector to Hashtable - -Vector to Hashtable Switch: _GLIBCXX_PROFILE_VECTOR_TO_HASHTABLE. @@ -1187,11 +1158,10 @@ comparisons. - +
+ +
Hashtable to Vector - -Hashtable to Vector Switch: _GLIBCXX_PROFILE_HASHTABLE_TO_VECTOR. @@ -1232,11 +1202,10 @@ indirections and may achieve better data locality. - +
+ +
Vector to List - -Vector to List Switch: _GLIBCXX_PROFILE_VECTOR_TO_LIST. @@ -1278,11 +1247,10 @@ operations. - +
+ +
List to Vector - -List to Vector Switch: _GLIBCXX_PROFILE_LIST_TO_VECTOR. @@ -1321,11 +1289,10 @@ memory references. - +
+ +
List to Forward List (Slist) - -List to Forward List (Slist) Switch: _GLIBCXX_PROFILE_LIST_TO_SLIST. @@ -1367,11 +1334,10 @@ foo.cc:1: advice: Change "list" to "forward_list". - +
+ +
Ordered to Unordered Associative Container - -Ordered to Unordered Associative Container Switch: _GLIBCXX_PROFILE_ORDERED_TO_UNORDERED. @@ -1410,23 +1376,21 @@ foo.cc:1: advice: Change "list" to "forward_list". - +
- +
- -Algorithms +
Algorithms + Switch: _GLIBCXX_PROFILE_ALGORITHMS. - -Sort Algorithm Performance +
Sort Algorithm Performance + Switch: _GLIBCXX_PROFILE_SORT. @@ -1437,10 +1401,10 @@ foo.cc:1: advice: Change "list" to "forward_list". Fundamentals: See papers: - - A framework for adaptive algorithm selection in STAPL and - - Optimizing Sorting with Machine Learning Algorithms. + + A framework for adaptive algorithm selection in STAPL and + + Optimizing Sorting with Machine Learning Algorithms. Sample runtime reduction:60%. @@ -1459,22 +1423,20 @@ foo.cc:1: advice: Change "list" to "forward_list". - +
- +
- -Data Locality +
Data Locality + Switch: _GLIBCXX_PROFILE_LOCALITY. - -Need Software Prefetch +
Need Software Prefetch + Switch: _GLIBCXX_PROFILE_SOFTWARE_PREFETCH. @@ -1532,11 +1494,10 @@ foo.cc:7: advice: Insert prefetch instruction. - +
+ +
Linked Structure Locality - -Linked Structure Locality Switch: _GLIBCXX_PROFILE_RBTREE_LOCALITY. @@ -1548,8 +1509,8 @@ foo.cc:7: advice: Insert prefetch instruction. Fundamentals:Allocation can be tuned to a specific traversal pattern, to result in better data locality. See paper: - - Custom Memory Allocation for Free. + + Custom Memory Allocation for Free. Sample runtime reduction:30%. @@ -1593,14 +1554,13 @@ the allocation sequence or switching to a structure conscious allocator. - +
- +
- -Multithreaded Data Access +
Multithreaded Data Access + The diagnostics in this group are not meant to be implemented short term. @@ -1612,9 +1572,8 @@ the allocation sequence or switching to a structure conscious allocator. _GLIBCXX_PROFILE_MULTITHREADED. - -Data Dependence Violations at Container Level +
Data Dependence Violations at Container Level + Switch: _GLIBCXX_PROFILE_DDTEST. @@ -1638,9 +1597,9 @@ the allocation sequence or switching to a structure conscious allocator. Keep a shadow for each container. Record iterator dereferences and container member accesses. Issue advice for elements referenced by multiple threads. - See paper: + See paper: The LRPD test: speculative run-time parallelization of loops with - privatization and reduction parallelization. + privatization and reduction parallelization. Cost model: Number of accesses to elements referenced from multiple threads @@ -1650,11 +1609,10 @@ the allocation sequence or switching to a structure conscious allocator. - +
+ +
False Sharing - -False Sharing Switch: _GLIBCXX_PROFILE_FALSE_SHARING. @@ -1699,14 +1657,13 @@ sharing in multithreaded access at foo.cc:4. Detected N shared cache lines. - +
- +
- -Statistics +
Statistics + Switch: @@ -1726,32 +1683,26 @@ sharing in multithreaded access at foo.cc:4. Detected N shared cache lines. of each operation actually performed on the container. - +
- +
- -Bibliography +Bibliography + - + <citetitle> Perflint: A Context Sensitive Performance Advisor for C++ Programs - + - - Lixia - Liu - - - Silvius - Rus - + LixiaLiu + SilviusRus 2009 - + diff --git a/libstdc++-v3/doc/xml/manual/shared_ptr.xml b/libstdc++-v3/doc/xml/manual/shared_ptr.xml index 0ea5b79c51d5..4ef5f72b6a63 100644 --- a/libstdc++-v3/doc/xml/manual/shared_ptr.xml +++ b/libstdc++-v3/doc/xml/manual/shared_ptr.xml @@ -1,7 +1,8 @@ -
+
- +shared_ptr ISO C++ @@ -10,17 +11,17 @@ shared_ptr - + + -shared_ptr The shared_ptr class template stores a pointer, usually obtained via new, and implements shared ownership semantics. -
-Requirements +
Requirements + @@ -43,8 +44,8 @@ and implements shared ownership semantics.
-
-Design Issues +
Design Issues + @@ -67,11 +68,11 @@ technique known as type erasure.
-
-Implementation +
Implementation -
- Class Hierarchy + +
Class Hierarchy + A shared_ptr<T> contains a pointer of @@ -158,8 +159,8 @@ that simplifies the implementation slightly.
-
- Thread Safety +
Thread Safety + C++0x-only features are: rvalue-ref/move support, allocator support, @@ -170,8 +171,8 @@ deprecated in C++0x mode. The -Thread -Safety section of the Boost shared_ptr documentation says "shared_ptr +Thread +Safety section of the Boost shared_ptr documentation says "shared_ptr objects offer the same level of thread safety as built-in types." The implementation must ensure that concurrent updates to separate shared_ptr instances are correct even when those instances share a reference count e.g. @@ -224,8 +225,8 @@ Policy below for details.
-
- Selecting Lock Policy +
Selecting Lock Policy + @@ -254,8 +255,8 @@ available policies are: Selected when GCC supports a builtin atomic compare-and-swap operation -on the target processor (see Atomic -Builtins.) The reference counts are maintained using a lock-free +on the target processor (see Atomic +Builtins.) The reference counts are maintained using a lock-free algorithm and GCC's atomic builtins, which provide the required memory synchronisation. @@ -292,8 +293,8 @@ used when libstdc++ is built without --enable-threads.
-
- Dual C++0x and TR1 Implementation +
Dual C++0x and TR1 Implementation + The interface of tr1::shared_ptr was extended for C++0x @@ -319,8 +320,8 @@ the C++0x version.
-
-Related functions and classes +
Related functions and classes + @@ -412,11 +413,11 @@ the following types, depending on how the shared_ptr is constructed. --> -
-Use +
Use -
- Examples + +
Examples + Examples of use can be found in the testsuite, under testsuite/tr1/2_general_utilities/shared_ptr, @@ -426,8 +427,8 @@ the following types, depending on how the shared_ptr is constructed.
-
- Unresolved Issues +
Unresolved Issues + The shared_ptr atomic access clause in the C++0x working draft is not implemented in GCC. @@ -478,8 +479,8 @@ the following types, depending on how the shared_ptr is constructed.
-
-Acknowledgments +
Acknowledgments + The original authors of the Boost shared_ptr, which is really nice @@ -490,56 +491,48 @@ the following types, depending on how the shared_ptr is constructed.
- -Bibliography +Bibliography + - - - - Improving shared_ptr for C++0x, Revision 2 - - + + + Improving shared_ptr for C++0x, Revision 2 + N2351 - - - - C++ Standard Library Active Issues List - - + + + C++ Standard Library Active Issues List + N2456 - - - - Working Draft, Standard for Programming Language C++ - - + + + Working Draft, Standard for Programming Language C++ + N2461 - - shared_ptr - - Boost C++ Libraries documentation, shared_ptr - - + shared_ptr + + Boost C++ Libraries documentation, shared_ptr + N2461 diff --git a/libstdc++-v3/doc/xml/manual/spine.xml b/libstdc++-v3/doc/xml/manual/spine.xml index edb650c879c8..2ff83bd8e57e 100644 --- a/libstdc++-v3/doc/xml/manual/spine.xml +++ b/libstdc++-v3/doc/xml/manual/spine.xml @@ -1,19 +1,14 @@ - - - - + -The GNU C++ Library - + + 2009 2010 - FSF + FSF @@ -21,117 +16,98 @@ License - + - + - - +<part xml:id="manual.std" xreflabel="Standard Contents"><info><title> Standard Contents - + + - + - + - + - + - + - + - + - + - + - + - + - + - + - - +<part xml:id="appendix" xreflabel="Appendices"><info><title> Appendices - + + - + - + - + - + - + diff --git a/libstdc++-v3/doc/xml/manual/status_cxx1998.xml b/libstdc++-v3/doc/xml/manual/status_cxx1998.xml index c5e63fa977ed..67f6f891df03 100644 --- a/libstdc++-v3/doc/xml/manual/status_cxx1998.xml +++ b/libstdc++-v3/doc/xml/manual/status_cxx1998.xml @@ -1,7 +1,8 @@ - +
- +C++ 1998/2003 ISO C++ @@ -10,12 +11,11 @@ 1998 - + -C++ 1998/2003 - - Implementation Status +
+Implementation Status This status table is based on the table of contents of ISO/IEC 14882:2003. @@ -35,13 +35,14 @@ particular release. Broken/Partial --> - -C++ 1998/2003 Implementation Status - - - - - +
+ C++ 1998/2003 Implementation Status + + + + + + Section @@ -65,25 +66,25 @@ particular release. 18.1 Types Y - + 18.2 Implementation properties Y - + 18.2.1 Numeric Limits - - + + 18.2.1.1 Class template numeric_limits Y - + 18.2.1.2 @@ -104,85 +105,85 @@ particular release. 18.2.1.5 numeric_limits specializations Y - + 18.2.2 C Library Y - + 18.3 Start and termination Y - + 18.4 Dynamic memory management Y - + 18.5 Type identification - - + + 18.5.1 Class type_info Y - + 18.5.2 Class bad_cast Y - + 18.5.3 Class bad_typeid Y - + 18.6 Exception handling - - + + 18.6.1 Class exception Y - + 18.6.2 Violation exception-specifications Y - + 18.6.3 Abnormal termination Y - + 18.6.4 uncaught_exception Y - + 18.7 Other runtime support Y - + @@ -196,19 +197,19 @@ particular release. 19.1 Exception classes Y - + 19.2 Assertions Y - + 19.3 Error numbers Y - + @@ -222,139 +223,139 @@ particular release. 20.1 Requirements Y - + 20.2 Utility components - - + + 20.2.1 Operators Y - + 20.2.2 pair Y - + 20.3 Function objects - - + + 20.3.1 Base Y - + 20.3.2 Arithmetic operation Y - + 20.3.3 Comparisons Y - + 20.3.4 Logical operations Y - + 20.3.5 Negators Y - + 20.3.6 Binders Y - + 20.3.7 Adaptors for pointers to functions Y - + 20.3.8 Adaptors for pointers to members Y - + 20.4 Memory - - + + 20.4.1 The default allocator Y - + 20.4.2 Raw storage iterator Y - + 20.4.3 Temporary buffers Y - + 20.4.4 Specialized algorithms Y - + 20.4.4.1 uninitialized_copy Y - + 20.4.4.2 uninitialized_fill Y - + 20.4.4.3 uninitialized_fill_n Y - + 20.4.5 Class template auto_ptr Y - + 20.4.6 C library Y - + @@ -367,50 +368,50 @@ particular release. 21.1 Character traits - - + + 21.1.1 Character traits requirements Y - + 21.1.2 traits typedef Y - + 21.1.3 char_traits specializations - - + + 21.1.3.1 struct char_traits<char> Y - + 21.1.3.2 struct char_traits<wchar_t> Y - + 21.2 String classes Y - + 21.3 Class template basic_string Y - + 21.4 @@ -429,158 +430,158 @@ particular release. 22.1 Locales - - + + 22.1.1 Class locale Y - + 22.1.2 locale globals Y - + 22.1.3 Convenience interfaces - - + + 22.1.3.1 Character classification Y - + 22.1.3.2 Character conversions Y - + 22.2 Standard locale categories - - + + 22.2.1 ctype Y - + 22.2.2 Numeric - - + + 22.2.2.1 num_get Y - + 22.2.2.2 num_put Y - + 22.2.3 num_punct Y - + 22.2.4 collate Y - + 22.2.5 Time - - + + 22.2.5.1 time_get Y - + 22.2.5.2 time_get_byname Y - + 22.2.5.3 time_put Y - + 22.2.5.3 time_put_byname Y - + 22.2.6 Monetary - - + + 22.2.6.1 money_get Y - + 22.2.6.2 money_put Y - + 22.2.6.3 money_punct Y - + 22.2.6.4 money_punct_byname Y - + 22.2.7 messages Y - + 22.2.8 Program-defined facets Y - + 22.3 C Library Locales Y - + @@ -594,91 +595,91 @@ particular release. 23.1 Container requirements Y - + 23.2 Sequence containers - - + + 23.2.1 Class template deque Y - + 23.2.2 Class template list Y - + 23.2.3 Adaptors - - + + 23.2.3.1 Class template queue Y - + 23.2.3.2 Class template priority_queue Y - + 23.2.3.3 Class template stack Y - + 23.2.4 Class template vector Y - + 23.2.5 Class vector<bool> Y - + 23.3 Associative containers - - + + 23.3.1 Class template map Y - + 23.3.2 Class template multimap Y - + 23.3.3 Class template set Y - + 23.3.4 Class template multiset Y - + @@ -692,67 +693,67 @@ particular release. 24.1 Requirements Y - + 24.2 Header <iterator> synopsis Y - + 24.3 Iterator primitives Y - + 24.4 Predefined iterators and Iterator adaptors - - + + 24.4.1 Reverse iterators Y - + 24.4.2 Insert iterators Y - + 24.5 Stream iterators - - + + 24.5.1 Class template istream_iterator Y - + 24.5.2 Class template ostream_iterator Y - + 24.5.3 Class template istreambuf_iterator Y - + 24.5.4 Class template ostreambuf_iterator Y - + @@ -766,25 +767,25 @@ particular release. 25.1 Non-modifying sequence operations Y - + 25.2 Mutating sequence operations Y - + 25.3 Sorting and related operations Y - + 25.4 C library algorithms Y - + @@ -798,115 +799,115 @@ particular release. 26.1 Numeric type requirements Y - + 26.2 Complex numbers Y - + 26.3 Numeric arrays - - + + 26.3.1 Header <valarray> synopsis Y - + 26.3.2 Class template valarray Y - + 26.3.3 valarray non-member operations Y - + 26.3.4 Class slice Y - + 26.3.5 Class template slice_array Y - + 26.3.6 Class gslice Y - + 26.3.7 Class template gslice_array Y - + 26.3.8 Class template mask_array Y - + 26.3.9 Class template indirect_array Y - + 26.4 Generalized numeric operations - - + + 26.4.1 accumulate Y - + 26.4.2 inner_product Y - + 26.4.3 partial_sum Y - + 26.4.4 adjacent_difference Y - + 26.4.5 iota Y - + 26.5 C Library Y - + @@ -920,61 +921,61 @@ particular release. 27.1 Requirements Y - + 27.2 Forward declarations Y - + 27.3 Standard iostream objects Y - + 27.3.1 Narrow stream objects Y - + 27.3.2 Wide stream objects Y - + 27.4 Iostreams base classes Y - + 27.5 Stream buffers Y - + 27.6 Formatting and manipulators Y - + 27.7 String-based streams Y - + 27.8 File-based streams Y - + @@ -987,53 +988,53 @@ particular release. D.1 Increment operator with bool operand - - + + D.2 static keyword - - + + D.3 Access declarations - - + + D.4 Implicit conversion from const strings - - + + D.5 C standard library headers - - + + D.6 Old iostreams members - - + + D.7 char* streams - - + +
- +
- - Implementation Specific Behavior +
Implementation Specific Behavior + The ISO standard defines the following phrase: @@ -1056,8 +1057,8 @@ particular release. We do so here, for the C++ library only. Behavior of the - compiler, linker, runtime loader, and other elements of "the - implementation" are documented elsewhere. Everything listed + compiler, linker, runtime loader, and other elements of "the + implementation" are documented elsewhere. Everything listed in Annex B, Implementation Qualities, are also part of the compiler, not the library. @@ -1104,13 +1105,13 @@ particular release. std::type_info::name() is the mangled type name (see the previous entry for more). - [20.1.5]/5 "Implementors are encouraged to + [20.1.5]/5 "Implementors are encouraged to supply libraries that can accept allocators that encapsulate more general memory models and that support non-equal instances. In such implementations, any requirements imposed on allocators by containers beyond those requirements that appear in Table 32, and the semantics of containers and algorithms when allocator instances compare - non-equal, are implementation-defined." As yet we don't + non-equal, are implementation-defined." As yet we don't have any allocators which compare non-equal, so we can't describe how they behave. @@ -1158,6 +1159,6 @@ particular release. a get area exists will... whatever fflush() does, I think. - +
- +
diff --git a/libstdc++-v3/doc/xml/manual/status_cxx200x.xml b/libstdc++-v3/doc/xml/manual/status_cxx200x.xml index 45eb09f9007b..4a74ea7aa469 100644 --- a/libstdc++-v3/doc/xml/manual/status_cxx200x.xml +++ b/libstdc++-v3/doc/xml/manual/status_cxx200x.xml @@ -1,7 +1,8 @@ - +
- +C++ 200x ISO C++ @@ -10,9 +11,7 @@ 200x - - -C++ 200x + This table is based on the table of contents of ISO/IEC @@ -44,13 +43,14 @@ particular release. Broken/Partial --> - +
C++ 200x Implementation Status - - - - - + + + + + + Section @@ -75,7 +75,7 @@ particular release. 18.1 General Y - + @@ -87,21 +87,21 @@ particular release. 18.3 Implementation properties - - + + 18.3.1 Numeric Limits - - + + 18.3.1.1 Class template numeric_limits Y - + @@ -115,40 +115,40 @@ particular release. 18.3.1.3 float_round_style N - + 18.3.1.4 float_denorm_style N - + 18.3.1.5 numeric_limits specializations Y - + 18.3.2 C Library Y - + 18.4 Integer types - - + + 18.4.1 Header <cstdint> synopsis Y - + @@ -161,104 +161,104 @@ particular release. 18.6 Dynamic memory management Y - + 18.7 Type identification - - + + 18.7.1 Class type_info Y - + 18.7.2 Class bad_cast Y - + 18.7.3 Class bad_typeid Y - + 18.8 Exception handling - - + + 18.8.1 Class exception Y - + 18.8.2 Violating exception-specifications Y - + 18.8.3 Abnormal termination Y - + 18.8.4 uncaught_exception Y - + 18.8.5 Exception Propagation Y - + 18.8.6 nested_exception Y - + 18.9 Initializer lists - - + + 18.9.1 Initializer list constructors Y - + 18.9.2 Initializer list access Y - + 18.9.3 Initializer list range access N - + 18.10 Other runtime support Y - + @@ -272,61 +272,61 @@ particular release. 19.1 General Y - + 19.2 Exception classes Y - + 19.3 Assertions Y - + 19.4 Error numbers Y - + 19.5 System error support - - + + 19.5.1 Class error_category Y - + 19.5.2 Class error_code Y - + 19.5.3 Class error_condition Y - + 19.5.4 Comparison operators Y - + 19.5.5 Class system_error Y - + @@ -339,56 +339,56 @@ particular release. 20.1 General - - + + 20.2 Requirements - - + + 20.3 Utility components - - + + 20.3.1 Operators Y - + 20.3.2 Swap Y - + 20.3.3 forward and move helpers Y - + 20.3.4 Function template declval Y - + 20.3.5 Pairs - - + + 20.3.5.1 In general - - + + @@ -401,33 +401,33 @@ particular release. 20.3.5.3 Tuple-like access to pair Y - + 20.3.5.4 pair range access N - + 20.3.5.5 Piecewise construction N - + 20.4 Tuples - - + + 20.4.1 In general - - + + @@ -445,74 +445,74 @@ particular release. 20.6 Compile-time rational arithmetic - - + + 20.6.1 Class template ratio Y - + 20.6.2 Arithmetic on ratio types Y - + 20.6.3 Comparison of ratio types Y - + 20.6.4 SI types for ratio Y - + 20.7 Metaprogramming and type traits - - + + 20.7.1 Requirements Y - + 20.7.2 Header <type_traits> synopsis - - + + 20.7.3 Helper classes Y - + 20.7.4 Unary Type Traits Y - + 20.7.4.1 Primary type categories Y - + 20.7.4.2 Composite type traits Y - + @@ -525,7 +525,7 @@ particular release. 20.7.5 Relationships between types Y - + @@ -538,274 +538,274 @@ particular release. 20.7.6.1 Const-volatile modifications Y - + 20.7.6.2 Reference modifications Y - + 20.7.6.3 Sign modifications Y - + 20.7.6.4 Array modifications Y - + 20.7.6.5 Pointer modifications Y - + 20.7.6.6 Other transformations Y - + 20.8 Function objects - - + + 20.8.1 Definitions Y - + 20.8.2 Requirements Y - + 20.8.3 Base Y - + 20.8.4 Class template reference_wrapper Y - + 20.8.5 Arithmetic operation Y - + 20.8.6 Comparisons Y - + 20.8.7 Logical operations Y - + 20.8.8 Bitwise operations Y - + 20.8.9 Negators Y - + 20.8.10 Function template bind Y - + 20.8.11 Adaptors for pointers to functions Y - + 20.8.12 Adaptors for pointers to members Y - + 20.8.13 Function template mem_fn Y - + 20.8.14 Polymorphic function wrappers - - + + 20.8.14.1 Class bad_function_call Y - + 20.8.14.2 Class template function Y - + 20.8.15 Class template hash Y - + 20.9 Memory - - + + 20.9.1 Allocator argument tag N - + 20.9.2 uses_allocator N - + 20.9.3 Pointer traits N - + 20.9.4 Allocator traits N - + 20.9.5 The default allocator Y - + 20.9.6 Scoped allocator adaptor - - + + 20.9.6.1 Scoped allocator adaptor member types N - + 20.9.6.2 Scoped allocator adaptor constructors N - + 20.9.6.3 Scoped allocator adaptor members N - + 20.9.7 Raw storage iterator Y - + 20.9.8 Temporary buffers Y - + 20.9.9 Specialized algorithms - - + + 20.9.9.1 addressof N - + 20.9.9.2 uninitialized_copy Y - + 20.9.9.3 uninitialized_fill Y - + 20.9.9.4 uninitialized_fill_n Y - + 20.9.10 Class template unique_ptr Y - + 20.9.11 Smart pointers - - + + 20.9.11.1 Class bad_weak_ptr Y - + 20.9.11.2 @@ -814,7 +814,7 @@ particular release. Uses code from - boost::shared_ptr. + boost::shared_ptr. @@ -822,70 +822,70 @@ particular release. 20.9.11.3 Class template weak_ptr Y - + 20.9.11.4 Class template emable_shared_from_this Y - + 20.9.11.5 shared_ptr atomic access Partial - + 20.9.11.6 Hash support Y - + 20.9.12 Pointer safety Partial - + 20.9.13 Align N - + 20.9.16 C library Y - + 20.10 Time utilities - - + + 20.10.1 Clock requirements Y - + 20.10.2 Time-related traits - - + + 20.10.2.1 treat_as_floating_point Y - + 20.10.2.2 @@ -897,7 +897,7 @@ particular release. 20.10.2.3 Specializations of common_type Y - + 20.10.3 @@ -914,39 +914,39 @@ particular release. 20.10.5 Clocks - - + + 20.10.5.1 Class system_clock Y - + 20.10.5.2 Class monotonic_clock Y - + 20.10.5.3 Class high_resolution_clock Y - + 20.11 Date and time functions Y - + 20.12 Class type_index N - + @@ -960,31 +960,31 @@ particular release. 21.1 General Y - + 21.2 Character traits - - + + 21.2.1 Character traits requirements Y - + 21.2.2 traits typedefs Y - + 21.2.3 char_traits specializations - - + + 21.2.3.1 @@ -1014,25 +1014,25 @@ particular release. 21.3 String classes Y - + 21.4 Class template basic_string Y - + 21.5 Numeric Conversions Y - + 21.6 Hash support Y - + 21.7 @@ -1052,196 +1052,196 @@ particular release. 22.1 General Y - + 22.2 Header <locale> synopsis Y - + 22.3 Locales - - + + 22.3.1 Class locale Y - + 22.3.2 locale globals Y - + 22.3.3 Convenience interfaces - - + + 22.3.3.1 Character classification Y - + 22.3.3.2 Conversions - - + + 22.3.3.2.1 Character conversions Y - + 22.3.3.2.2 string conversions N - + 22.3.3.2.3 Buffer conversions N - + 22.4 Standard locale categories - - + + 22.4.1 The ctype category Y - + 22.4.2 The numeric category - - + + 22.4.2.1 num_get Y - + 22.4.2.2 num_put Y - + 22.4.3 The numeric punctuation facet Y - + 22.4.4 The collate category Y - + 22.4.5 The time category - - + + 22.4.5.1 Class template time_get Y - + 22.4.5.2 Class template time_get_byname Y - + 22.4.5.3 Class template time_put Y - + 22.4.5.3 Class template time_put_byname Y - + 22.4.6 The monetary category - - + + 22.4.6.1 Class template money_get Y - + 22.4.6.2 Class template money_put Y - + 22.4.6.3 Class template money_punct Y - + 22.4.6.4 Class template money_punct_byname Y - + 22.4.7 The message retrieval category Y - + 22.4.8 Program-defined facets Y - + 22.5 Standard code conversion facets N - + 22.6 C Library Locales Y - + @@ -1254,50 +1254,50 @@ particular release. 23.1 General - - + + 23.2 Container requirements - - + + 23.2.1 General container requirements Y - + 23.2.2 Data races Y - + 23.2.3 Sequence containers Y - + 23.2.4 Associative containers Y - + 23.2.5 Unordered associative containers Y - + 23.3 Sequence containers - - + + 23.3.1 @@ -1309,115 +1309,115 @@ particular release. 23.3.2 Class template deque Y - + 23.3.3 Class template forward_list Y - + 23.3.4 Class template list Y - + 23.3.5 Container adaptors - - + + 23.3.5.1 Class template queue Y - + 23.3.5.2 Class template priority_queue Y - + 23.3.5.3 Class template stack Y - + 23.3.6 Class template vector Y - + 23.3.7 Class vector<bool> Y - + 23.4 Associative containers - - + + 23.4.1 Class template map Y - + 23.4.2 Class template multimap Y - + 23.4.3 Class template set Y - + 23.4.4 Class template multiset Y - + 23.5 Unordered associative containers - - + + 23.5.1 Class template unordered_map Y - + 23.5.2 Class template unordered_multimap Y - + 23.5.3 Class template unordered_set Y - + 23.5.4 Class template unordered_multiset Y - + @@ -1431,86 +1431,86 @@ particular release. 24.1 General Y - + 24.2 Iterator requirements Y - + 24.3 Header <iterator> synopsis Y - + 24.4 Iterator primitives Y - + 24.5 Iterator adaptors - - + + 24.5.1 Reverse iterators Y - + 24.5.2 Insert iterators Y - + 24.5.3 Move iterators Y - + 24.6 Stream iterators - - + + 24.6.1 Class template istream_iterator Y - + 24.6.2 Class template ostream_iterator Y - + 24.6.3 Class template istreambuf_iterator Y - + 24.6.4 Class template ostreambuf_iterator Y - + 24.6.5 range access N - + @@ -1523,32 +1523,32 @@ particular release. 25.1 General - - + + 25.2 Non-modifying sequence operations Y - + 25.3 Mutating sequence operations Y - + 25.4 Sorting and related operations Y - + 25.5 C library algorithms Y - + @@ -1562,19 +1562,19 @@ particular release. 26.1 General Y - + 26.2 Numeric type requirements Y - + 26.3 The floating-point environment Y - + 26.4 @@ -1585,26 +1585,26 @@ particular release. 26.5 Random number generation - - + + 26.5.1 Requirements - - + + 26.5.2 Header <random> synopsis - - + + 26.5.3 Random number engine class templates - - + + 26.5.3.1 @@ -1627,8 +1627,8 @@ particular release. 26.5.4 Random number engine adaptor class templates - - + + 26.5.4.1 @@ -1652,7 +1652,7 @@ particular release. 26.5.5 Engines and engine adaptors with predefined parameters Y - + 26.5.6 @@ -1663,285 +1663,285 @@ particular release. 26.5.7 Utilities - - + + 26.5.7.1 Class seed_seq Y - + 26.5.7.2 Function template generate_canonical Y - + 26.5.8 Random number distribution class templates - - + + 26.5.8.1 Uniform distributions - - + + 26.5.8.1.1 Class template uniform_int_distribution Y - + 26.5.8.1.2 Class template uniform_real_distribution Y - + 26.5.8.2 Bernoulli distributions - - + + 26.5.8.2.1 Class bernoulli_distribution Y - + 26.5.8.2.2 Class template binomial_distribution Y - + 26.5.8.2.3 Class template geometric_distribution Y - + 26.5.8.2.4 Class template negative_binomial_distribution Y - + 26.5.8.3 Poisson distributions - - + + 26.5.8.3.1 Class template poisson_distribution Y - + 26.5.8.3.2 Class template exponential_distribution Y - + 26.5.8.3.3 Class template gamma_distribution Y - + 26.5.8.3.4 Class template weibull_distribution Y - + 26.5.8.3.5 Class template extreme_value_distribution Y - + 26.5.8.4 Normal distributions - - + + 26.5.8.4.1 Class template normal_distribution Y - + 26.5.8.4.2 Class template lognormal_distribution Y - + 26.5.8.4.3 Class template chi_squared_distribution Y - + 26.5.8.4.4 Class template cauchy_distribution Y - + 26.5.8.4.5 Class template fisher_f_distribution Y - + 26.5.8.4.6 Class template student_t_distribution Y - + 26.5.8.5 Sampling distributions - - + + 26.5.8.5.1 Class template discrete_distribution Y - + 26.5.8.5.2 Class template piecewise_constant_distribution Y - + 26.5.8.5.3 Class template piecewise_linear_distribution Y - + 26.6 Numeric arrays - - + + 26.6.1 Header <valarray> synopsis Y - + 26.6.2 Class template valarray Y - + 26.6.3 valarray non-member operations Y - + 26.6.4 Class slice Y - + 26.6.5 Class template slice_array Y - + 26.6.6 The gslice class Y - + 26.6.7 Class template gslice_array Y - + 26.6.8 Class template mask_array Y - + 26.6.9 Class template indirect_array Y - + 26.6.10 valarray range access N - + 26.7 Generalized numeric operations - - + + 26.7.1 accumulate Y - + 26.7.2 inner_product Y - + 26.7.3 partial_sum Y - + 26.7.4 adjacent_difference Y - + 26.7.5 iota Y - + 26.8 C Library Y - + @@ -1955,56 +1955,56 @@ particular release. 27.1 General Y - + 27.2 Iostreams requirements Y - + 27.2.1 Imbue Limitations Y - + 27.2.2 Positioning Type Limitations Y - + 27.2.3 Thread safety Partial - + 27.3 Forward declarations Y - + 27.4 Standard iostream objects Y - + 27.4.1 Narrow stream objects Y - + 27.4.2 Wide stream objects Y - + @@ -2017,7 +2017,7 @@ particular release. 27.6 Stream buffers Y - + @@ -2053,89 +2053,89 @@ particular release. 28.1 General N - + 28.2 Definitions N - + 28.3 Requirements N - + 28.4 Header <regex> synopsis N - + 28.5 Namespace std::regex_constants Y - + 28.6 Class regex_error Y - + 28.7 Class template regex_traits Partial - + 28.8 Class template basic_regex Partial - + 28.9 Class template sub_match Partial - + 28.10 Class template match_results Partial - + 28.11 Regular expression algorithms N - + 28.12 Regular expression Iterators N - + 28.13 Modified ECMAScript regular expression grammar N - + @@ -2149,20 +2149,20 @@ particular release. 29.1 General Y - + 29.2 Header <atomic> synopsis Y - + 29.3 Order and consistency N - + 29.4 @@ -2173,8 +2173,8 @@ particular release. 29.5 Atomic types - - + + 29.5.1 @@ -2198,20 +2198,20 @@ particular release. 29.6 Operations on atomic types Y - + 29.7 Flag Type and operations Y - + 29.8 Fences N - + @@ -2225,19 +2225,19 @@ particular release. 30.1 General Y - + 30.2 Requirements Y - + 30.3 Threads - - + + @@ -2250,19 +2250,19 @@ particular release. 30.3.2 Namespace this_thread Y - + 30.4 Mutual exclusion - - + + 30.4.1 Mutex requirements - - + + 30.4.1.1 @@ -2274,55 +2274,55 @@ particular release. 30.4.1.2 Class recursive_mutex Y - + 30.4.2 Timed mutex requirements - - + + 30.4.2.1 Class timed_mutex Y - + 30.4.2.2 Class recursive_timed_mutex Y - + 30.4.3 Locks - - + + 30.4.3.1 Class template lock_guard Y - + 30.4.3.2 Class template unique_lock Y - + 30.4.4 Generic locking algorithms Y - + 30.4.5 Call once - - + + 30.4.5.1 @@ -2334,7 +2334,7 @@ particular release. 30.4.5.2 call_once Y - + @@ -2347,25 +2347,25 @@ particular release. 30.5.1 Class condition_variable Y - + 30.5.2 Class condition_variable_any Y - + 30.6 Futures - - + + 30.6.1 Overview - - + + 30.6.2 @@ -2377,13 +2377,13 @@ particular release. 30.6.3 Class future_error Y - + 30.6.4 Associated asynchronous state Y - + @@ -2411,13 +2411,13 @@ particular release. 30.6.8 Class template atomic_future N - + 30.6.9 Function template async Y - + @@ -2437,62 +2437,62 @@ particular release. D.1 Increment operator with bool operand - - + + D.2 static keyword - - + + D.3 Access declarations - - + + D.4 register keyword - - + + D.5 Dynamic exception specifications - - + + D.6 C standard library headers - - + + D.7 Old iostreams members - - + + D.8 char* streams - - + + D.9 Binders - - + + D.10 auto_ptr - - + + @@ -2500,4 +2500,4 @@ particular release.
- +
diff --git a/libstdc++-v3/doc/xml/manual/status_cxxtr1.xml b/libstdc++-v3/doc/xml/manual/status_cxxtr1.xml index 4d3650167e64..321c4ba269c4 100644 --- a/libstdc++-v3/doc/xml/manual/status_cxxtr1.xml +++ b/libstdc++-v3/doc/xml/manual/status_cxxtr1.xml @@ -1,7 +1,8 @@ - +
- +C++ TR1 ISO C++ @@ -10,9 +11,7 @@ tr1 - - -C++ TR1 + This table is based on the table of contents of ISO/IEC DTR 19768 @@ -40,13 +39,14 @@ release. Broken/Partial --> - +
C++ TR1 Implementation Status - - - - - + + + + + + @@ -64,77 +64,77 @@ release. 2.1 Reference wrappers - - + + 2.1.1 Additions to header <functional> synopsis Y - + 2.1.2 Class template reference_wrapper - - + + 2.1.2.1 reference_wrapper construct/copy/destroy Y - + 2.1.2.2 reference_wrapper assignment Y - + 2.1.2.3 reference_wrapper access Y - + 2.1.2.4 reference_wrapper invocation Y - + 2.1.2.5 reference_wrapper helper functions Y - + 2.2 Smart pointers - - + + 2.2.1 Additions to header <memory> synopsis Y - + 2.2.2 Class bad_weak_ptr Y - + 2.2.3 Class template shared_ptr - + Uses code from - boost::shared_ptr. + boost::shared_ptr. @@ -142,115 +142,115 @@ release. 2.2.3.1 shared_ptr constructors Y - + 2.2.3.2 shared_ptr destructor Y - + 2.2.3.3 shared_ptr assignment Y - + 2.2.3.4 shared_ptr modifiers Y - + 2.2.3.5 shared_ptr observers Y - + 2.2.3.6 shared_ptr comparison Y - + 2.2.3.7 shared_ptr I/O Y - + 2.2.3.8 shared_ptr specialized algorithms Y - + 2.2.3.9 shared_ptr casts Y - + 2.2.3.10 get_deleter Y - + 2.2.4 Class template weak_ptr - - + + 2.2.4.1 weak_ptr constructors Y - + 2.2.4.2 weak_ptr destructor Y - + 2.2.4.3 weak_ptr assignment Y - + 2.2.4.4 weak_ptr modifiers Y - + 2.2.4.5 weak_ptr observers Y - + 2.2.4.6 weak_ptr comparison Y - + 2.2.4.7 weak_ptr specialized algorithms Y - + 2.2.5 Class template enable_shared_from_this Y - + 3 @@ -260,133 +260,133 @@ release. 3.1 Definitions Y - + 3.2 Additions to <functional> synopsis Y - + 3.3 Requirements Y - + 3.4 Function return types Y - + 3.5 Function template mem_fn Y - + 3.6 Function object binders - - + + 3.6.1 Class template is_bind_expression Y - + 3.6.2 Class template is_placeholder Y - + 3.6.3 Function template bind Y - + 3.6.4 Placeholders Y - + 3.7 Polymorphic function wrappers - - + + 3.7.1 - Class bad_function_call + Class bad_function_call Y - + 3.7.1.1 bad_function_call constructor Y - + 3.7.2 Class template function - - + + 3.7.2.1 function construct/copy/destroy Y - + 3.7.2.2 function modifiers Y - + 3.7.2.3 function capacity Y - + 3.7.2.4 function invocation Y - + 3.7.2.5 function target access Y - + 3.7.2.6 undefined operators Y - + 3.7.2.7 null pointer comparison operators Y - + 3.7.2.8 specialized algorithms Y - + 4 @@ -396,97 +396,97 @@ release. 4.1 Requirements Y - + 4.2 Header <type_traits> synopsis Y - + 4.3 Helper classes Y - + 4.4 General Requirements Y - + 4.5 Unary Type Traits - - + + 4.5.1 Primary Type Categories Y - + 4.5.2 Composite type traits Y - + 4.5.3 Type properties Y - + 4.6 Relationships between types Y - + 4.7 Transformations between types - - + + 4.7.1 Const-volatile modifications Y - + 4.7.2 Reference modifications Y - + 4.7.3 Array modifications Y - + 4.7.4 Pointer modifications Y - + 4.8 Other transformations Y - + 4.9 Implementation requirements Y - + 5 @@ -495,62 +495,62 @@ release. 5.1 Random number generation - - + + 5.1.1 Requirements Y - + 5.1.2 Header <random> synopsis Y - + 5.1.3 Class template variate_generator Y - + 5.1.4 Random number engine class templates Y - + 5.1.4.1 Class template linear_congruential Y - + 5.1.4.2 Class template mersenne_twister Y - + 5.1.4.3 Class template subtract_with_carry Y - + 5.1.4.4 Class template subtract_with_carry_01 Y - + 5.1.4.5 Class template discard_block Y - + 5.1.4.6 @@ -562,229 +562,229 @@ release. 5.1.5 Engines with predefined parameters Y - + 5.1.6 Class random_device Y - + 5.1.7 Random distribution class templates Y - + 5.1.7.1 Class template uniform_int Y - + 5.1.7.2 Class bernoulli_distribution Y - + 5.1.7.3 Class template geometric_distribution Y - + 5.1.7.4 Class template poisson_distribution Y - + 5.1.7.5 Class template binomial_distribution Y - + 5.1.7.6 Class template uniform_real Y - + 5.1.7.7 Class template exponential_distribution Y - + 5.1.7.8 Class template normal_distribution Y - + 5.1.7.9 Class template gamma_distribution Y - + 5.2 Mathematical special functions Y - + 5.2.1 Additions to header <cmath> synopsis Y - + 5.2.1.1 associated Laguerre polynomials Y - + 5.2.1.2 associated Legendre functions Y - + 5.2.1.3 beta function Y - + 5.2.1.4 (complete) elliptic integral of the first kind Y - + 5.2.1.5 (complete) elliptic integral of the second kind Y - + 5.2.1.6 (complete) elliptic integral of the third kind Y - + 5.2.1.7 confluent hypergeometric functions Y - + 5.2.1.8 regular modified cylindrical Bessel functions Y - + 5.2.1.9 cylindrical Bessel functions (of the first kind) Y - + 5.2.1.10 irregular modified cylindrical Bessel functions Y - + 5.2.1.11 cylindrical Neumann functions Y - + 5.2.1.12 (incomplete) elliptic integral of the first kind Y - + 5.2.1.13 (incomplete) elliptic integral of the second kind Y - + 5.2.1.14 (incomplete) elliptic integral of the third kind Y - + 5.2.1.15 exponential integral Y - + 5.2.1.16 Hermite polynomials Y - + 5.2.1.17 hypergeometric functions Y - + 5.2.1.18 Laguerre polynomials Y - + 5.2.1.19 Legendre polynomials Y - + 5.2.1.20 Riemann zeta function Y - + 5.2.1.21 spherical Bessel functions (of the first kind) Y - + 5.2.1.22 spherical associated Legendre functions Y - + 5.2.1.23 spherical Neumann functions Y - + 5.2.2 Additions to header <math.h> synopsis Y - + 6 @@ -794,236 +794,236 @@ release. 6.1 Tuple types Y - + 6.1.1 Header <tuple> synopsis Y - + 6.1.2 Additions to header <utility> synopsis Y - + 6.1.3 Class template tuple Y - + 6.1.3.1 Construction Y - + 6.1.3.2 Tuple creation functions Y - + 6.1.3.3 Tuple helper classes Y - + 6.1.3.4 Element access Y - + 6.1.3.5 Relational operators Y - + 6.1.4 Pairs Y - + 6.2 Fixed size array Y - + 6.2.1 Header <array> synopsis Y - + 6.2.2 Class template array Y - + 6.2.2.1 array constructors, copy, and assignment Y - + 6.2.2.2 array specialized algorithms Y - + 6.2.2.3 array size Y - + 6.2.2.4 Zero sized arrays Y - + 6.2.2.5 Tuple interface to class template array Y - + 6.3 Unordered associative containers Y - + 6.3.1 Unordered associative container requirements Y - + 6.3.1.1 Exception safety guarantees Y - + 6.3.2 Additions to header <functional> synopsis Y - + 6.3.3 Class template hash Y - + 6.3.4 Unordered associative container classes Y - + 6.3.4.1 Header <unordered_set> synopsis Y - + 6.3.4.2 Header <unordered_map> synopsis Y - + 6.3.4.3 Class template unordered_set Y - + 6.3.4.3.1 unordered_set constructors Y - + 6.3.4.3.2 unordered_set swap Y - + 6.3.4.4 Class template unordered_map Y - + 6.3.4.4.1 unordered_map constructors Y - + 6.3.4.4.2 unordered_map element access Y - + 6.3.4.4.3 unordered_map swap Y - + 6.3.4.5 - Class template unordered_multiset + Class template unordered_multiset Y - + 6.3.4.5.1 unordered_multiset constructors Y - + 6.3.4.5.2 unordered_multiset swap Y - + 6.3.4.6 Class template unordered_multimap Y - + 6.3.4.6.1 unordered_multimap constructors Y - + 6.3.4.6.2 unordered_multimap swap Y - + 7 @@ -1034,322 +1034,322 @@ release. 7.1 Definitions N - + 7.2 Requirements N - + 7.3 Regular expressions summary N - + 7.4 Header <regex> synopsis N - + 7.5 Namespace tr1::regex_constants N - + 7.5.1 Bitmask Type syntax_option_type N - + 7.5.2 Bitmask Type regex_constants::match_flag_type N - + 7.5.3 Implementation defined error_type N - + 7.6 Class regex_error N - + 7.7 Class template regex_traits N - + 7.8 Class template basic_regex N - + 7.8.1 basic_regex constants N - + 7.8.2 basic_regex constructors N - + 7.8.3 basic_regex assign N - + 7.8.4 basic_regex constant operations N - + 7.8.5 basic_regex locale N - + 7.8.6 basic_regex swap N - + 7.8.7 basic_regex non-member functions N - + 7.8.7.1 basic_regex non-member swap N - + 7.9 Class template sub_match N - + 7.9.1 sub_match members N - + 7.9.2 sub_match non-member operators N - + 7.10 Class template match_results N - + 7.10.1 match_results constructors N - + 7.10.2 match_results size N - + 7.10.3 match_results element access N - + 7.10.4 match_results formatting N - + 7.10.5 match_results allocator N - + 7.10.6 match_results swap N - + 7.11 Regular expression algorithms N - + 7.11.1 exceptions N - + 7.11.2 regex_match N - + 7.11.3 regex_search N - + 7.11.4 regex_replace N - + 7.12 Regular expression Iterators N - + 7.12.1 Class template regex_iterator N - + 7.12.1.1 regex_iterator constructors N - + 7.12.1.2 regex_iterator comparisons N - + 7.12.1.3 regex_iterator dereference N - + 7.12.1.4 regex_iterator increment N - + 7.12.2 Class template regex_token_iterator N - + 7.12.2.1 regex_token_iterator constructors N - + 7.12.2.2 regex_token_iterator comparisons N - + 7.12.2.3 regex_token_iterator dereference N - + 7.12.2.4 regex_token_iterator increment N - + 7.13 Modified ECMAScript regular expression grammar N - + 8 @@ -1359,61 +1359,61 @@ release. 8.1 Additions to header <complex> Y - + 8.1.1 Synopsis Y - + 8.1.2 Function acos Y - + 8.1.3 Function asin Y - + 8.1.4 Function atan Y - + 8.1.5 Function acosh Y - + 8.1.6 Function asinh Y - + 8.1.7 Function atanh Y - + 8.1.8 Function fabs Y - + 8.1.9 Additional Overloads Y - + @@ -1433,88 +1433,88 @@ release. 8.4 Additions to header <cctype> Y - + 8.4.1 Synopsis Y - + 8.4.2 Function isblank Y - + 8.5 Additions to header <ctype.h> Y - + 8.6 Header <cfenv> Y - + 8.6.1 Synopsis Y - + 8.6.2 Definitions Y - + 8.7 Header <fenv.h> Y - + 8.8 Additions to header <cfloat> Y - + 8.9 Additions to header <float.h> Y - + 8.10 Additions to header <ios> N - + 8.10.1 Synopsis N - + 8.10.2 Function hexfloat N - + 8.11 Header <cinttypes> Y - + 8.11.1 @@ -1526,56 +1526,56 @@ release. 8.11.2 Definitions Y - + 8.12 Header <inttypes.h> Y - + 8.13 Additions to header <climits> Y - + 8.14 Additions to header <limits.h> Y - + 8.15 Additions to header <locale> N - + 8.16 Additions to header <cmath> Y - + 8.16.1 Synopsis Y - + 8.16.2 Definitions Y - + 8.16.3 Function template definitions Y - + 8.16.4 @@ -1587,73 +1587,73 @@ release. 8.17 Additions to header <math.h> Y - + 8.18 Additions to header <cstdarg> Y - + 8.19 Additions to header <stdarg.h> Y - + 8.20 The header <cstdbool> Y - + 8.21 The header <stdbool.h> Y - + 8.22 The header <cstdint> Y - + 8.22.1 Synopsis Y - + 8.22.2 Definitions Y - + 8.23 The header <stdint.h> Y - + 8.24 Additions to header <cstdio> Y - + 8.24.1 Synopsis Y - + 8.24.2 Definitions Y - + 8.24.3 @@ -1665,43 +1665,43 @@ release. 8.24.4 Additions to header <stdio.h> Y - + 8.25 Additions to header <cstdlib> Y - + 8.25.1 Synopsis Y - + 8.25.2 Definitions Y - + 8.25.3 Function abs Y - + 8.25.4 Function div Y - + 8.26 Additions to header <stdlib.h> Y - + 8.27 @@ -1725,19 +1725,19 @@ release. 8.30 Additions to header <cwchar> Y - + 8.30.1 Synopsis Y - + 8.30.2 Definitions Y - + 8.30.3 @@ -1749,34 +1749,34 @@ release. 8.31 Additions to header <wchar.h> Y - + 8.32 Additions to header <cwctype> Y - + 8.32.1 Synopsis Y - + 8.32.2 Function iswblank Y - + 8.33 Additions to header <wctype.h> Y - +
- +
diff --git a/libstdc++-v3/doc/xml/manual/status_cxxtr24733.xml b/libstdc++-v3/doc/xml/manual/status_cxxtr24733.xml index f3b29b9bf363..997e76be18f7 100644 --- a/libstdc++-v3/doc/xml/manual/status_cxxtr24733.xml +++ b/libstdc++-v3/doc/xml/manual/status_cxxtr24733.xml @@ -1,15 +1,14 @@ - +
- +C++ TR 24733 TR 24733 - - -C++ TR 24733 + This table is based on the table of contents of @@ -32,13 +31,14 @@ particular release. Broken/Partial --> - +
C++ TR 24733 Implementation Status - - - - - + + + + + + Section @@ -88,14 +88,14 @@ particular release. 3.1 Characteristics of decimal floating-point types - - + + 3.2 Decimal Types - - + + @@ -129,157 +129,157 @@ particular release. 3.2.5 Initialization from coefficient and exponent Y - + 3.2.6 Conversion to generic floating-point type Y - + 3.2.7 Unary arithmetic operators Y - + 3.2.8 Binary arithmetic operators Y - + 3.2.9 Comparison operators Y - + 3.2.10 Formatted input N - + 3.2.11 Formatted output N - + 3.3 Additions to header limits N - + 3.4 Headers cfloat and float.h - - + + 3.4.2 Additions to header cfloat synopsis Y - + 3.4.3 Additions to header float.h synopsis N - + 3.4.4 Maximum finite value Y - + 3.4.5 Epsilon Y - + 3.4.6 Minimum positive normal value Y - + 3.4.7 Minimum positive subnormal value Y - + 3.4.8 Evaluation format Y - + 3.5 Additions to cfenv and fenv.h Outside the scope of GCC - + 3.6 Additions to cmath and math.h Outside the scope of GCC - + 3.7 Additions to cstdio and stdio.h Outside the scope of GCC - + 3.8 Additions to cstdlib and stdlib.h Outside the scope of GCC - + 3.9 Additions to cwchar and wchar.h Outside the scope of GCC - + 3.10 Facets N - + 3.11 Type traits N - + 3.12 Hash functions N - + @@ -296,4 +296,4 @@ particular release.
- +
diff --git a/libstdc++-v3/doc/xml/manual/strings.xml b/libstdc++-v3/doc/xml/manual/strings.xml index 8eb9b49a1be3..4d9fc64f7669 100644 --- a/libstdc++-v3/doc/xml/manual/strings.xml +++ b/libstdc++-v3/doc/xml/manual/strings.xml @@ -1,12 +1,11 @@ - - - - + - + + Strings + <indexterm><primary>Strings</primary></indexterm> + ISO C++ @@ -15,25 +14,20 @@ library - - - - Strings - <indexterm><primary>Strings</primary></indexterm> - + - - String Classes +
String Classes + - - Simple Transformations +
Simple Transformations + Here are Standard, simple, and portable ways to perform common transformations on a string instance, such as - "convert to all upper case." The word transformations + "convert to all upper case." The word transformations is especially apt, because the standard template function transform<> is used. @@ -90,8 +84,8 @@ are overloaded names (declared in <cctype> and <locale>) so the template-arguments for transform<> cannot be deduced, as explained in - this - message. + this + message. At minimum, you can write short wrappers like @@ -122,14 +116,14 @@ optimize named temporaries out of existence. - - - Case Sensitivity +
+
Case Sensitivity + The well-known-and-if-it-isn't-well-known-it-ought-to-be - Guru of the Week + Guru of the Week discussions held on Usenet covered this topic in January of 1998. Briefly, the challenge was, write a 'ci_string' class which is identical to the standard 'string' class, but is @@ -149,34 +143,33 @@ The solution is surprisingly easy. The original answer was posted on Usenet, and a revised version appears in Herb Sutter's - book Exceptional C++ and on his website as GotW 29. + book Exceptional C++ and on his website as GotW 29. See? Told you it was easy! Added June 2000: The May 2000 issue of C++ - Report contains a fascinating article by + Report contains a fascinating article by Matt Austern (yes, the Matt Austern) on why case-insensitive comparisons are not as easy as they seem, and why creating a class is the wrong way to go about it in production code. (The GotW answer mentions one of the principle difficulties; his article mentions more.) - Basically, this is "easy" only if you ignore some things, + Basically, this is "easy" only if you ignore some things, things which may be too important to your program to ignore. (I chose to ignore them when originally writing this entry, and am surprised that nobody ever called me on it...) The GotW question and answer remain useful instructional tools, however. Added September 2000: James Kanze provided a link to a - Unicode - Technical Report discussing case handling, which provides some + Unicode + Technical Report discussing case handling, which provides some very good information. - - - Arbitrary Character Types +
+
Arbitrary Character Types + @@ -231,24 +224,24 @@ built-in types. If you want to use your own special character class, then you have - a lot - of work to do, especially if you with to use i18n features + a lot + of work to do, especially if you with to use i18n features (facets require traits information but don't have a traits argument). - Another example of how to specialize char_traits was given on the - mailing list and at a later date was put into the file + Another example of how to specialize char_traits was given on the + mailing list and at a later date was put into the file include/ext/pod_char_traits.h. We agree that the way it's used with basic_string (scroll down to main()) - doesn't look nice, but that's because the - nice-looking first attempt turned out to not - be conforming C++, due to the rule that CharT must be a POD. + doesn't look nice, but that's because the + nice-looking first attempt turned out to not + be conforming C++, due to the rule that CharT must be a POD. (See how tricky this is?) - +
- - Tokenizing +
Tokenizing + The Standard C (and C++) function strtok() leaves a lot to @@ -256,7 +249,7 @@ destroys the character string on which it operates, and it requires you to handle all the memory problems. But it does let the client code decide what to use to break the string into pieces; it allows - you to choose the "whitespace," so to speak. + you to choose the "whitespace," so to speak. A C++ implementation lets us keep the good things and fix those annoyances. The implementation here is more intuitive (you only @@ -345,9 +338,9 @@ stringtok(Container &container, string const &in, - - - Shrink to Fit +
+
Shrink to Fit + From GCC 3.4 calling s.reserve(res) on a @@ -372,10 +365,10 @@ stringtok(Container &container, string const &in, - +
- - CString (MFC) +
CString (MFC) + @@ -387,8 +380,8 @@ stringtok(Container &container, string const &in, are relying on special functions offered by the CString class. Things are not as bad as they seem. In - this - message, Joe Buck points out a few very important things: + this + message, Joe Buck points out a few very important things: The Standard string supports all the operations @@ -485,8 +478,8 @@ stringtok(Container &container, string const &in, - - +
+
diff --git a/libstdc++-v3/doc/xml/manual/support.xml b/libstdc++-v3/doc/xml/manual/support.xml index 8035efc38f6b..2cb7205bd445 100644 --- a/libstdc++-v3/doc/xml/manual/support.xml +++ b/libstdc++-v3/doc/xml/manual/support.xml @@ -1,12 +1,11 @@ - - - - + - + + Support + <indexterm><primary>Support</primary></indexterm> + ISO C++ @@ -15,12 +14,7 @@ library - - - - Support - <indexterm><primary>Support</primary></indexterm> - + This part deals with the functions called and objects created @@ -34,11 +28,11 @@ kind of support a C++ program gets from the Standard Library. - +
Types - Types - - Fundamental Types + +
Fundamental Types + C++ has the following builtin types: @@ -98,9 +92,9 @@ instead, use a POD. - - - Numeric Properties +
+
Numeric Properties + @@ -108,8 +102,7 @@ traits classes to give access to various implementation defined-aspects of the fundamental types. The traits classes -- fourteen in total -- are all specializations of the template class - numeric_limits, documented here + numeric_limits, documented here and defined as follows: @@ -153,10 +146,10 @@ static const float_round_style round_style; }; - +
- - NULL +
NULL + The only change that might affect people is the type of NULL: while it is required to be a macro, @@ -180,25 +173,24 @@ NULL is always a pointer.) - In his book Effective - C++, Scott Meyers points out that the best way + In his book Effective + C++, Scott Meyers points out that the best way to solve this problem is to not overload on pointer-vs-integer types to begin with. He also offers a way to make your own magic NULL that will match pointers before it matches integers. See - the - Effective C++ CD example + the + Effective C++ CD example - +
- +
- +
Dynamic Memory - Dynamic Memory + There are six flavors each of new and delete, so make certain that you're using the right @@ -211,7 +203,7 @@ people are used to using - Single object "nothrow" form, returning NULL on errors + Single object "nothrow" form, returning NULL on errors Array new, throwing @@ -276,16 +268,15 @@ bad_alloc is derived from the base exception class defined in Sect1 19. - +
- +
Termination - Termination - - Termination Handlers + +
Termination Handlers + - Not many changes here to cstdlib. You should note that the + Not many changes here to cstdlib. You should note that the abort() function does not call the destructors of automatic nor static objects, so if you're depending on those to do cleanup, it isn't going to happen. @@ -298,7 +289,7 @@ funky, too, until you look closer. Basically, three points to remember are: - + Static objects are destroyed in reverse order of their creation. @@ -342,11 +333,11 @@ those slots. If you think you may run out, we recommend using the xatexit/xexit combination from libiberty, which has no such limit. - +
- +
Verbose Terminate Handler - Verbose Terminate Handler + If you are having difficulty with uncaught exceptions and want a little bit of help debugging the causes of the core dumps, you can @@ -446,7 +437,7 @@ int main(int argc) an unspecified manner. - - +
+
 diff --git a/libstdc++-v3/doc/xml/manual/test.xml b/libstdc++-v3/doc/xml/manual/test.xml index 6c0f266d3491..006ff332086d 100644 --- a/libstdc++-v3/doc/xml/manual/test.xml +++ b/libstdc++-v3/doc/xml/manual/test.xml @@ -1,7 +1,8 @@ - +
- +Test ISO C++ @@ -25,20 +26,18 @@ exception safety - - -Test + The libstdc++ testsuite includes testing for standard conformance, regressions, ABI, and performance. - -Organization +
Organization + + +
Directory Layout - -Directory Layout The directory libsrcdir/testsuite contains the @@ -131,11 +130,11 @@ util Files for libtestc++, utilities and testing routines. All new tests should be written with the policy of one test case, one file in mind. - +
- -Naming Conventions +
Naming Conventions + In addition, there are some special names and suffixes that are @@ -225,15 +224,15 @@ cat 27_io/objects/char/3_xin.in | a.out - - +
+
- -Running the Testsuite +
Running the Testsuite - - Basic + +
Basic + You can check the status of the build without installing it @@ -259,18 +258,16 @@ cat 27_io/objects/char/3_xin.in | a.out Archives of test results for various versions and platforms are - available on the GCC website in the build - status section of each individual release, and are also - archived on a daily basis on the gcc-testresults + available on the GCC website in the build + status section of each individual release, and are also + archived on a daily basis on the gcc-testresults mailing list. Please check either of these places for a similar combination of source version, operating system, and host CPU. - +
- - Variations +
Variations + There are several options for running tests, including testing the regression tests, testing a subset of the regression tests, @@ -470,13 +467,12 @@ runtest --tool libstdc++ --srcdir=/path/to/gcc/libstdc++-v3/testsuite please email the main libstdc++ mailing list if you see something odd or have questions. - +
- - Permutations +
Permutations + - To run the libstdc++ test suite under the debug mode, edit + To run the libstdc++ test suite under the debug mode, edit libstdc++-v3/scripts/testsuite_flags to add the compile-time flag -D_GLIBCXX_DEBUG to the result printed by the --build-cxx @@ -500,11 +496,11 @@ runtest --tool libstdc++ --srcdir=/path/to/gcc/libstdc++-v3/testsuite set to -D_GLIBCXX_DEBUG or -D_GLIBCXX_PARALLEL. - - +
+
+ +
Writing a new test case - -Writing a new test case The first step in making a new test case is to choose the correct @@ -632,14 +628,14 @@ up in the normal.exp file. More examples can be found in the libstdc++-v3/testsuite/*/*.cc files. - +
- -Test Harness and Utilities +
Test Harness and Utilities + + +
Dejagnu Harness Details - -Dejagnu Harness Details Underlying details of testing for conformance and regressions are abstracted via the GNU Dejagnu package. This is similar to the @@ -682,10 +678,10 @@ board" information unique to this library. This is currently unused and sets only default variables. - +
+ +
Utilities - -Utilities @@ -800,24 +796,24 @@ only default variables. - +
- +
- -Special Topics +
Special Topics - - + +<section xml:id="test.exception.safety"><info><title> Qualifying Exception Safety Guarantees <indexterm> <primary>Test</primary> <secondary>Exception Safety</secondary> </indexterm> - + + + +
Overview - -Overview Testing is composed of running a particular test sequence, @@ -856,13 +852,13 @@ only default variables. potential error paths have been exercised in a sequential manner. - +
- - +<section xml:id="test.exception.safety.status"><info><title> Existing tests - + + @@ -924,13 +920,13 @@ as the allocator type. - +
- - +<section xml:id="test.exception.safety.containers"><info><title> C++0x Requirements Test Sequence Descriptions - + + @@ -1030,10 +1026,10 @@ C++0x Requirements Test Sequence Descriptions - +
- +
- +
- +
diff --git a/libstdc++-v3/doc/xml/manual/using.xml b/libstdc++-v3/doc/xml/manual/using.xml index bb6077c4e197..e3400a678c14 100644 --- a/libstdc++-v3/doc/xml/manual/using.xml +++ b/libstdc++-v3/doc/xml/manual/using.xml @@ -1,21 +1,15 @@ - - - - + + Using -Using - - - - Command Options +
Command Options + The set of features available in the GNU C++ library is shaped by - several GCC - Command Options. Options that impact libstdc++ are + several GCC + Command Options. Options that impact libstdc++ are enumerated and detailed in the table below. @@ -23,11 +17,12 @@ By default, g++ is equivalent to g++ -std=gnu++98. The standard library also defaults to this dialect. - +
C++ Command Options - - - + + + + @@ -82,19 +77,19 @@
- +
- +
Headers - Headers + - - Header Files +
Header Files + The C++ standard specifies the entire set of header files that must be available to all hosted implementations. Actually, the - word "files" is a misnomer, since the contents of the + word "files" is a misnomer, since the contents of the headers don't necessarily have to be in any kind of external file. The only rule is that when one #include's a header, the contents of that header become available, no matter @@ -121,14 +116,15 @@ C++98/03 include files. These are available in the default compilation mode, i.e. -std=c++98 or -std=gnu++98. - +
C++ 1998 Library Headers - - - - - - + + + + + + + algorithm @@ -180,15 +176,16 @@
- - + +
C++ 1998 Library Headers for C Library Facilities - - - - - - + + + + + + + cassert @@ -225,15 +222,16 @@ C++0x include files. These are only available in C++0x compilation mode, i.e. -std=c++0x or -std=gnu++0x. - -
+ +
C++ 200x Library Headers - - - - - - + + + + + + + @@ -309,16 +307,17 @@ mode, i.e. -std=c++0x or -std=gnu++0x.
- + - +
C++ 200x Library Headers for C Library Facilities - - - - - - + + + + + + + cassert @@ -368,14 +367,15 @@ mode, i.e. -std=c++0x or -std=gnu++0x. In addition, TR1 includes as: -
+
C++ TR 1 Library Headers - - - - - - + + + + + + + @@ -400,17 +400,18 @@ mode, i.e. -std=c++0x or -std=gnu++0x.
- + - +
C++ TR 1 Library Headers for C Library Facilities - - - - - - + + + + + + + @@ -445,10 +446,11 @@ compiler supports scalar decimal floating-point types defined via __attribute__((mode(SD|DD|LD))). -
+
C++ TR 24733 Decimal Floating-Point Header - - + + + decimal/decimal @@ -461,11 +463,12 @@ compiler supports scalar decimal floating-point types defined via Also included are files for the C++ ABI interface: -
+
C++ ABI Headers - - - + + + + cxxabi.hcxxabi_forced.h @@ -476,14 +479,15 @@ compiler supports scalar decimal floating-point types defined via And a large variety of extensions. -
+
Extension Headers - - - - - - + + + + + + + @@ -536,16 +540,17 @@ compiler supports scalar decimal floating-point types defined via
- + - +
Extension Debug Headers - - - - - - + + + + + + + @@ -567,15 +572,16 @@ compiler supports scalar decimal floating-point types defined via
- + - +
Extension Profile Headers - - - - - + + + + + + @@ -596,13 +602,14 @@ compiler supports scalar decimal floating-point types defined via
- + - +
Extension Parallel Headers - - - + + + + parallel/algorithm @@ -612,10 +619,10 @@ compiler supports scalar decimal floating-point types defined via
- +
- - Mixing Headers +
Mixing Headers + A few simple rules. @@ -655,10 +662,10 @@ same translation unit: Several parts of C++0x diverge quite substantially from TR1 predecessors. - +
- - The C Headers and <code>namespace std</code> +
The C Headers and <code>namespace std</code> + The standard specifies that if one includes the C-style header @@ -682,10 +689,10 @@ used uniformly, instead of a combination of std::sinf, std::sin, and std::sinl. - +
- - Precompiled Headers +
Precompiled Headers + There are three base header files that are provided. They can be @@ -754,18 +761,18 @@ g++ -Winvalid-pch -I. -include stdc++.h -H -g -O2 hello.cc -o test.exe The exclamation point to the left of the stdc++.h.gch listing means that the generated PCH file was used, and thus the - + - Detailed information about creating precompiled header files can be found in the GCC documentation. + Detailed information about creating precompiled header files can be found in the GCC documentation. - - +
+
- +
Macros - Macros + All library macros begin with _GLIBCXX_. @@ -863,8 +870,7 @@ g++ -Winvalid-pch -I. -include stdc++.h -H -g -O2 hello.cc -o test.exe --enable-concept-checks. When defined, performs compile-time checking on certain template instantiations to detect violations of the requirements of the standard. This - is described in more detail here. + is described in more detail here. @@ -901,14 +907,14 @@ g++ -Winvalid-pch -I. -include stdc++.h -H -g -O2 hello.cc -o test.exe - +
- +
Namespaces - Namespaces + - - Available Namespaces +
Available Namespaces + @@ -937,14 +943,14 @@ and __gnu_pbds. - A complete list of implementation namespaces (including namespace contents) is available in the generated source documentation. + A complete list of implementation namespaces (including namespace contents) is available in the generated source documentation. - +
- - namespace std +
namespace std + @@ -967,10 +973,10 @@ cases where the qualified verbiage becomes unwieldy.) - +
- - Using Namespace Composition +
Using Namespace Composition + Best practice in programming suggests sequestering new data or @@ -1005,22 +1011,22 @@ namespace gtk std::string does not get imported into the global namespace. Additionally, a more elaborate arrangement can be made for backwards compatibility and portability, whereby the using-declarations can wrapped in macros that - are set based on autoconf-tests to either "" or i.e. using + are set based on autoconf-tests to either "" or i.e. using std::string; (depending on whether the system has libstdc++ in std:: or not). (ideas from Llewelly and Karl Nelson) - - +
+
- +
Linking - Linking + - - Almost Nothing +
Almost Nothing + Or as close as it gets: freestanding. This is a minimal configuration, with only partial support for the standard @@ -1121,10 +1127,10 @@ namespace gtk identified above is actually used at compile time. Violations are diagnosed as undefined symbols at link time. - +
- - Finding Dynamic or Shared Libraries +
Finding Dynamic or Shared Libraries + If the only library built is the static library @@ -1139,10 +1145,10 @@ namespace gtk A quick read of the relevant part of the GCC - manual, Compiling - C++ Programs, specifies linking against a C++ + manual, Compiling + C++ Programs, specifies linking against a C++ library. More details from the - GCC FAQ, + GCC FAQ, which states GCC does not, by default, specify a location so that the dynamic linker can find dynamic libraries at runtime. @@ -1177,19 +1183,19 @@ A quick read of the relevant part of the GCC GNU ld (default on Linux): - -Wl,-rpath,destdir/lib + -Wl,-rpath,destdir/lib IRIX ld: - -Wl,-rpath,destdir/lib + -Wl,-rpath,destdir/lib Solaris ld: - -Wl,-Rdestdir/lib + -Wl,-Rdestdir/lib @@ -1225,13 +1231,13 @@ A quick read of the relevant part of the GCC create your executables, these details are taken care of for you. - - +
+
- +
Concurrency - Concurrency + This section discusses issues surrounding the proper compilation of multithreaded applications which use the Standard C++ @@ -1239,8 +1245,8 @@ A quick read of the relevant part of the GCC standard does not address matters of multithreaded applications. - - Prerequisites +
Prerequisites + All normal disclaimers aside, multithreaded C++ application are only supported when libstdc++ and all user code was built with @@ -1274,14 +1280,14 @@ A quick read of the relevant part of the GCC in ``gcc -dumpspecs'' (look at lib and cpp entries). - +
- - Thread Safety +
Thread Safety + -We currently use the SGI STL definition of thread safety. +We currently use the SGI STL definition of thread safety. @@ -1315,9 +1321,8 @@ gcc version 4.1.2 20070925 (Red Hat 4.1.2-33) Requisite command-line flags are used for atomic operations and threading. Examples of this include -pthread and -march=native, although specifics vary - depending on the host environment. See Machine - Dependent Options. + depending on the host environment. See Machine + Dependent Options. @@ -1366,20 +1371,20 @@ gcc version 4.1.2 20070925 (Red Hat 4.1.2-33) - - - Atomics +
+
Atomics + - +
- - IO +
IO + This gets a bit tricky. Please read carefully, and bear with me. - - Structure +
Structure + A wrapper type called __basic_file provides our abstraction layer for the std::filebuf classes. Nearly all decisions dealing @@ -1390,18 +1395,18 @@ gcc version 4.1.2 20070925 (Red Hat 4.1.2-33) level is akin to providing locking within containers, and is not done for the same reasons (see the links above). - +
- - Defaults +
Defaults + The __basic_file type is simply a collection of small wrappers around the C stdio layer (again, see the link under Structure). We do no locking ourselves, but simply pass through to calls to fopen, fwrite, and so forth. - So, for 3.0, the question of "is multithreading safe for I/O" - must be answered with, "is your platform's C library threadsafe - for I/O?" Some are by default, some are not; many offer multiple + So, for 3.0, the question of "is multithreading safe for I/O" + must be answered with, "is your platform's C library threadsafe + for I/O?" Some are by default, some are not; many offer multiple implementations of the C library with varying tradeoffs of threadsafety and efficiency. You, the programmer, are always required to take care with multiple threads. @@ -1420,10 +1425,10 @@ gcc version 4.1.2 20070925 (Red Hat 4.1.2-33) inside an std::ofstream), you need to guard such accesses like any other critical shared resource. - +
- - Future +
Future + A second choice may be available for I/O implementations: libio. This is disabled by default, and in fact will not currently work due to other @@ -1434,11 +1439,11 @@ gcc version 4.1.2 20070925 (Red Hat 4.1.2-33) type is basically derived from FILE. (The real situation is more complex than that... it's derived from an internal type used to implement FILE. See libio/libioP.h to see scary things done with - vtbls.) The result is that there is no "layer" of C stdio + vtbls.) The result is that there is no "layer" of C stdio to go through; the filebuf makes calls directly into the same functions used to implement fread, fwrite, and so forth, using internal data structures. (And when I say - "makes calls directly," I mean the function is literally + "makes calls directly," I mean the function is literally replaced by a jump into an internal function. Fast but frightening. *grin*) @@ -1453,20 +1458,20 @@ gcc version 4.1.2 20070925 (Red Hat 4.1.2-33) installed. For other platforms, a copy of the libio subsection will be built and included in libstdc++. - +
- - Alternatives +
Alternatives + Don't forget that other cstdio implementations are possible. You could easily write one to perform your own forms of locking, to solve your - "interesting" problems. + "interesting" problems. - +
- +
- - Containers +
Containers + This section discusses issues surrounding the design of multithreaded applications which use Standard C++ containers. @@ -1481,10 +1486,10 @@ gcc version 4.1.2 20070925 (Red Hat 4.1.2-33) Two excellent pages to read when working with the Standard C++ containers and threads are - SGI's - http://www.sgi.com/tech/stl/thread_safety.html and - SGI's - http://www.sgi.com/tech/stl/Allocators.html. + SGI's + http://www.sgi.com/tech/stl/thread_safety.html and + SGI's + http://www.sgi.com/tech/stl/Allocators.html. However, please ignore all discussions about the user-level configuration of the lock implementation inside the STL @@ -1528,17 +1533,15 @@ gcc version 4.1.2 20070925 (Red Hat 4.1.2-33) options and capabilities. - - +
+
- + - + diff --git a/libstdc++-v3/doc/xml/manual/using_exceptions.xml b/libstdc++-v3/doc/xml/manual/using_exceptions.xml index d6f52a572a16..afc38734ae86 100644 --- a/libstdc++-v3/doc/xml/manual/using_exceptions.xml +++ b/libstdc++-v3/doc/xml/manual/using_exceptions.xml @@ -1,7 +1,8 @@ - +
- +Exceptions C++ @@ -25,9 +26,7 @@ -fno-exceptions - - -Exceptions + The C++ language provides language support for stack unwinding @@ -48,8 +47,8 @@ exception neutrality and exception safety. - -Exception Safety +
Exception Safety + What is exception-safe code? @@ -121,11 +120,11 @@ exception neutrality and exception safety. - +
- -Exception Neutrality +
Exception Neutrality + Simply put, once thrown an exception object should continue in flight unless handled explicitly. In practice, this means @@ -201,10 +200,10 @@ exception neutrality and exception safety. - +
+ +
Doing without - -Doing without C++ is a language that strives to be as efficient as is possible in delivering features. As such, considerable care is used by both @@ -217,7 +216,7 @@ exception neutrality and exception safety. support try and catch blocks and thrown objects. (Language support for -fno-exceptions is documented in the GNU - GCC manual.) + GCC manual.) Before detailing the library support @@ -353,13 +352,13 @@ exception neutrality and exception safety. - +
- -Compatibility +
Compatibility + + +
With <literal>C</literal> - -With <literal>C</literal> C language code that is expecting to interoperate with C++ should be compiled with -fexceptions. This will make @@ -381,10 +380,10 @@ is called. with -fexceptions. - +
+ +
With <literal>POSIX</literal> thread cancellation - -With <literal>POSIX</literal> thread cancellation GNU systems re-use some of the exception handling mechanisms to @@ -424,28 +423,27 @@ is called. catch(const __cxxabiv1::__forced_unwind&) { - this->_M_setstate(ios_base::badbit); + this->_M_setstate(ios_base::badbit); throw; } catch(...) - { this->_M_setstate(ios_base::badbit); } + { this->_M_setstate(ios_base::badbit); } - - +
+
+ +Bibliography - -Bibliography - - - - System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008) - - - + + + + System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008) + + 2.9.5 Thread Cancellation @@ -459,17 +457,13 @@ is called. - - - - Error and Exception Handling - - - - - David - Abrahams - + + + + Error and Exception Handling + + + DavidAbrahams Boost @@ -479,17 +473,13 @@ is called. - - - - Exception-Safety in Generic Components - - - - - David - Abrahams - + + + + Exception-Safety in Generic Components + + + DavidAbrahams Boost @@ -498,17 +488,12 @@ is called. - - - - Standard Library Exception Policy - - - - - Matt - Austern - + + + + Standard Library Exception Policy + + MattAustern WG21 N1077 @@ -517,17 +502,13 @@ is called. - - - - ia64 c++ abi exception handling - - - - - Richard - Henderson - + + + + ia64 c++ abi exception handling + + + RichardHenderson GNU @@ -536,42 +517,32 @@ is called. - - - - Appendix E: Standard-Library Exception Safety - - - - - Bjarne - Stroustrup - + + + + Appendix E: Standard-Library Exception Safety + + BjarneStroustrup - + <citetitle> Exceptional C++ - + Exception-Safety Issues and Techniques - - Herb - Sutter - + HerbSutter - - - - GCC Bug 25191: exception_defines.h #defines try/catch - - + + + GCC Bug 25191: exception_defines.h #defines try/catch + - +
diff --git a/libstdc++-v3/doc/xml/manual/utilities.xml b/libstdc++-v3/doc/xml/manual/utilities.xml index ef118f5ccc49..5c3a8fd4864d 100644 --- a/libstdc++-v3/doc/xml/manual/utilities.xml +++ b/libstdc++-v3/doc/xml/manual/utilities.xml @@ -1,12 +1,11 @@ - - - - + - + + Utilities + <indexterm><primary>Utilities</primary></indexterm> + ISO C++ @@ -15,30 +14,27 @@ library - + + - - Utilities - <indexterm><primary>Utilities</primary></indexterm> - -
+
Functors - Functors + If you don't know what functors are, you're not alone. Many people get slightly the wrong idea. In the interest of not reinventing the wheel, we will refer you to the introduction to the functor concept written by SGI as chapter of their STL, in - their - http://www.sgi.com/tech/stl/functors.html. + their + http://www.sgi.com/tech/stl/functors.html.
-
+
Pairs - Pairs + The pair<T1,T2> is a simple and handy way to carry around a pair of objects. One is of type T1, and another of type T2; they may be the same type, but you don't get anything @@ -92,9 +88,9 @@
-
+
Memory - Memory + Memory contains three general areas. First, function and operator calls via new and delete @@ -104,26 +100,23 @@ - + - + - +
-
+
Traits - Traits +
diff --git a/libstdc++-v3/doc/xml/spine.xml b/libstdc++-v3/doc/xml/spine.xml index 27d0d8ab3c47..726966bc78c4 100644 --- a/libstdc++-v3/doc/xml/spine.xml +++ b/libstdc++-v3/doc/xml/spine.xml @@ -1,15 +1,9 @@ - - -]> - - + -The GNU C++ Library Documentation - + 2000 2001 @@ -23,26 +17,144 @@ 2009 2010 - FSF + FSF - &authors; - + + + + + + + + + + + PaoloCarlini + + TR1, LWG Active, Closed, Defects lists. + + + + PhilEdwards + + Originating author, started HOWTO and FAQ, worked on sections + Demangling, Macros, Strings, Iterators, Backwards + Compatibility, SGI Extensions, Configure, Build, Install. + + + + DougGregor + + Debug Mode, TR1 function objects + + + + BenjaminKosnik + + Allocators, ABI, API evolution and deprecation history, + Backwards Compatibility, Thread, Debug Support, Locales, + Facets, Parallel Mode, Headers, Namespaces, Construction and + Structure, Using Exceptions, DocBook conversion and layout. + + + + + DhruvMatani + + bitmap_allocator + + + + JasonMerrill + + License, __verbose_terminate_handler + + + + MarkMitchell + + Porting + + + + NathanMyers + + Referenced counted string, C++1998 implementation status. + + + + FelixNatter + + Namespace composition, Backwards Compatibility. + + + + + StefanOlsson + + mt_allocator + + + + SilviusRus + + Profile mode + + + + JohannesSingler + + Parallel mode + + + + AmiTavory + + Policy Based Data Structures, Associative Containers, Unordered + Containers. + + + + JonathanWakely + + shared_ptr, markup editing and styling + + + + + + - + - + - +