AppendixÂ E.Â GNU Free Documentation License

diff --git a/libstdc++-v3/doc/html/faq.html b/libstdc++-v3/doc/html/faq.html index 12d91a8e678b..a4833c47532f 100644 --- a/libstdc++-v3/doc/html/faq.html +++ b/libstdc++-v3/doc/html/faq.html @@ -4,7 +4,7 @@ 2008 FSF -

1. General Information

1.1. +

1. General Information

1.1. What is libstdc++?
1.2. Why should I use libstdc++? @@ -475,6 +475,8 @@ 5.0.1) and later uses localization and formatting code from the system C library (glibc) version 2.2.5 which contains necessary bugfixes. Most GNU/Linux distros make more recent versions available now. + libstdc++ 4.6.0 and later require glibc 2.3 or later for this + localization and formatting code.
The guideline is simple: the more recent the C++ library, the more recent the C library. (This is also documented in the main GCC installation instructions.) diff --git a/libstdc++-v3/doc/html/manual/abi.html b/libstdc++-v3/doc/html/manual/abi.html index f8e14c56ab7b..4d612509a105 100644 --- a/libstdc++-v3/doc/html/manual/abi.html +++ b/libstdc++-v3/doc/html/manual/abi.html @@ -87,10 +87,13 @@ compatible.
Release versioning on the libgcc_s.so binary.
This is implemented via file names and the ELF DT_SONAME mechanism (at least on ELF systems). It is versioned as follows: -
gcc-3.0.0: libgcc_s.so.1
gcc-3.0.1: libgcc_s.so.1
gcc-3.0.2: libgcc_s.so.1
gcc-3.0.3: libgcc_s.so.1
gcc-3.0.4: libgcc_s.so.1
gcc-3.1.0: libgcc_s.so.1
gcc-3.1.1: libgcc_s.so.1
gcc-3.2.0: libgcc_s.so.1
gcc-3.2.1: libgcc_s.so.1
gcc-3.2.2: libgcc_s.so.1
gcc-3.2.3: libgcc_s.so.1
gcc-3.3.0: libgcc_s.so.1
gcc-3.3.1: libgcc_s.so.1
gcc-3.3.2: libgcc_s.so.1
gcc-3.3.3: libgcc_s.so.1
gcc-3.4.x, gcc-4.[0-5].x: on m68k-linux and - hppa-linux this is either libgcc_s.so.1 (when configuring - --with-sjlj-exceptions) or libgcc_s.so.2. For all - others, this is libgcc_s.so.1.
Symbol versioning on the libgcc_s.so binary.
It is versioned with the following labels and version +
gcc-3.0.0: libgcc_s.so.1
gcc-3.0.1: libgcc_s.so.1
gcc-3.0.2: libgcc_s.so.1
gcc-3.0.3: libgcc_s.so.1
gcc-3.0.4: libgcc_s.so.1
gcc-3.1.0: libgcc_s.so.1
gcc-3.1.1: libgcc_s.so.1
gcc-3.2.0: libgcc_s.so.1
gcc-3.2.1: libgcc_s.so.1
gcc-3.2.2: libgcc_s.so.1
gcc-3.2.3: libgcc_s.so.1
gcc-3.3.0: libgcc_s.so.1
gcc-3.3.1: libgcc_s.so.1
gcc-3.3.2: libgcc_s.so.1
gcc-3.3.3: libgcc_s.so.1
gcc-3.4.x, gcc-4.[0-5].x: libgcc_s.so.1
For m68k-linux the versions differ as follows:
gcc-3.4.x, gcc-4.[0-5].x: libgcc_s.so.1 + when configuring --with-sjlj-exceptions, or + libgcc_s.so.2
For hppa-linux the versions differ as follows:
gcc-3.4.x, gcc-4.[0-1].x: either libgcc_s.so.1 + when configuring --with-sjlj-exceptions, or + libgcc_s.so.2
gcc-4.[2-5].x: either libgcc_s.so.3 when configuring + --with-sjlj-exceptions) or libgcc_s.so.4 +
Symbol versioning on the libgcc_s.so binary.
It is versioned with the following labels and version definitions, where the version definition is the maximum for a particular release. Labels are cumulative. If a particular release is not listed, it has the same version labels as the preceding @@ -464,49 +467,49 @@ gcc test.c -g -O2 -L. -lone -ltwo /usr/lib/libstdc++.so.5 /usr/lib/libstdc++.so. 24660: versioning weak symbols in libstdc++
19664: libstdc++ headers should have pop/push of the visibility around the declarations -
Bibliography
+
Bibliography
ABIcheck, a vague idea of checking ABI compatibility - .
+ .
C++ ABI Reference - .
+ .
Intel Compilers for Linux Compatibility with the GNU Compilers - .
+ .
Sun Solaris 2.9 : Linker and Libraries Guide (document 816-1386) - .
+ .
Sun Solaris 2.9 : C++ Migration Guide (document 816-2459) - .
+ .
How to Write Shared Libraries - . Ulrich Drepper.
+ . Ulrich Drepper.
C++ ABI for the ARM Architecture - .
+ .
Dynamic Shared Objects: Survey and Issues @@ -514,7 +517,7 @@ gcc test.c -g -O2 -L. -lone -ltwo /usr/lib/libstdc++.so.5 /usr/lib/libstdc++.so. . ISO C++ J16/06-0046 - . Benjamin Kosnik.
+ . Benjamin Kosnik.
Versioning With Namespaces @@ -522,7 +525,7 @@ gcc test.c -g -O2 -L. -lone -ltwo /usr/lib/libstdc++.so.5 /usr/lib/libstdc++.so. . ISO C++ J16/06-0083 - . Benjamin Kosnik.
+ . Benjamin Kosnik.
Binary Compatibility of Shared Libraries Implemented in C++ diff --git a/libstdc++-v3/doc/html/manual/algorithms.html b/libstdc++-v3/doc/html/manual/algorithms.html index c7910e8224d7..71829fbd1263 100644 --- a/libstdc++-v3/doc/html/manual/algorithms.html +++ b/libstdc++-v3/doc/html/manual/algorithms.html @@ -7,7 +7,7 @@ Standard Contents Â Next
ChapterÂ 11.Â Algorithms - +
Table of Contents
Mutating
swap
The neatest accomplishment of the algorithms sect1 is that all the work is done via iterators, not containers directly. This means two diff --git a/libstdc++-v3/doc/html/manual/api.html b/libstdc++-v3/doc/html/manual/api.html index 6a3b094b5b5b..8bb60d28273f 100644 --- a/libstdc++-v3/doc/html/manual/api.html +++ b/libstdc++-v3/doc/html/manual/api.html @@ -75,11 +75,11 @@ _Alloc_traits have been removed. __alloc to select an underlying allocator that satisfied memory allocation requests. The selection of this underlying allocator was not user-configurable. -
TableÂ B.1.Â Extension Allocators
Allocator (3.4) Header (3.4) Allocator (3.[0-3]) Header (3.[0-3])
__gnu_cxx::new_allocator<T> ext/new_allocator.h std::__new_alloc memory
__gnu_cxx::malloc_allocator<T> ext/malloc_allocator.h std::__malloc_alloc_template<int> memory
__gnu_cxx::debug_allocator<T> ext/debug_allocator.h std::debug_alloc<T> memory
__gnu_cxx::__pool_alloc<T> ext/pool_allocator.h std::__default_alloc_template<bool,int> memory
__gnu_cxx::__mt_alloc<T> ext/mt_allocator.h
__gnu_cxx::bitmap_allocator<T> ext/bitmap_allocator.h

Releases after gcc-3.4 have continued to add to the collection +
TableÂ B.1.Â Extension Allocators
Allocator (3.4) Header (3.4) Allocator (3.[0-3]) Header (3.[0-3])
__gnu_cxx::new_allocator<T> ext/new_allocator.h std::__new_alloc memory
__gnu_cxx::malloc_allocator<T> ext/malloc_allocator.h std::__malloc_alloc_template<int> memory
__gnu_cxx::debug_allocator<T> ext/debug_allocator.h std::debug_alloc<T> memory
__gnu_cxx::__pool_alloc<T> ext/pool_allocator.h std::__default_alloc_template<bool,int> memory
__gnu_cxx::__mt_alloc<T> ext/mt_allocator.h
__gnu_cxx::bitmap_allocator<T> ext/bitmap_allocator.h

Releases after gcc-3.4 have continued to add to the collection of available allocators. All of these new allocators are standard-style. The following table includes details, along with the first released version of GCC that included the extension allocator. -
TableÂ B.2.Â Extension Allocators Continued
Allocator Include Version
__gnu_cxx::array_allocator<T> ext/array_allocator.h 4.0.0
__gnu_cxx::throw_allocator<T> ext/throw_allocator.h 4.2.0

+
TableÂ B.2.Â Extension Allocators Continued
Allocator Include Version
__gnu_cxx::array_allocator<T> ext/array_allocator.h 4.0.0
__gnu_cxx::throw_allocator<T> ext/throw_allocator.h 4.2.0

Debug mode first appears.
Precompiled header support PCH support. diff --git a/libstdc++-v3/doc/html/manual/appendix_contributing.html b/libstdc++-v3/doc/html/manual/appendix_contributing.html index fc792adc087e..f7e1c5c37954 100644 --- a/libstdc++-v3/doc/html/manual/appendix_contributing.html +++ b/libstdc++-v3/doc/html/manual/appendix_contributing.html @@ -7,7 +7,7 @@ Appendices Â Next
AppendixÂ A.Â Contributing - +
Table of Contents
Contributor Checklist
Reading
Assignment
Getting Sources
Submitting Patches
Directory Layout and Source Conventions
Coding Style
Bad Identifiers
By Example
Documentation Style
Doxygen
Docbook
Combines
Design Notes
The GNU C++ Library follows an open development model. Active contributors are assigned maintainer-ship responsibility, and given diff --git a/libstdc++-v3/doc/html/manual/appendix_free.html b/libstdc++-v3/doc/html/manual/appendix_free.html index 827ff6288cca..e633d028872b 100644 --- a/libstdc++-v3/doc/html/manual/appendix_free.html +++ b/libstdc++-v3/doc/html/manual/appendix_free.html @@ -7,7 +7,7 @@ Appendices Â Next
AppendixÂ C.Â Free Software Needs Free Documentation - +
The biggest deficiency in free operating systems is not in the software--it is the lack of good free manuals that we can include in diff --git a/libstdc++-v3/doc/html/manual/appendix_gfdl.html b/libstdc++-v3/doc/html/manual/appendix_gfdl.html index edb2f0c3f4db..ab34a73c02a3 100644 --- a/libstdc++-v3/doc/html/manual/appendix_gfdl.html +++ b/libstdc++-v3/doc/html/manual/appendix_gfdl.html @@ -2,149 +2,153 @@ AppendixÂ E.Â GNU Free Documentation License
AppendixÂ E.Â GNU Free Documentation License
PrevÂ PartÂ IV.Â Appendices - Â Next
AppendixÂ E.Â 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 - distribute verbatim copies of this license document, but changing it is - not allowed. -
+Â Next
AppendixÂ E.Â GNU Free Documentation License
Version 1.3, 3 November 2008
+ 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: 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 publisher a way to - get credit for their work, while not being considered responsible for - modifications made by others. -
- 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. + 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 + publisher a way to get credit for their work, while not being considered + responsible for modifications made by others. +
+ 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.
We have designed this License in order to use it for manuals for free software, because free software needs free documentation: a free program should come with manuals providing the same freedoms that the software - does. But this License is not limited to software manuals; it can be used + does. But this License is not limited to software manuals; it can be used 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.
+ published as a printed book. We recommend this License principally for + works whose purpose is instruction or reference. +
1. APPLICABILITY AND DEFINITIONS -
+
This License applies to any manual or other work, in any medium, that contains a notice placed by the copyright holder saying it can be - distributed under the terms of this License. Such a notice grants a + 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, 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, modify or - distribute the work in a way requiring permission under copyright - law. -
- 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 section of the - Document that deals exclusively with the relationship of 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 mathematics.) The relationship - could be a matter of historical connection with the subject or with - related matters, or of legal, commercial, philosophical, ethical or - political position regarding them. -
- 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 be - designated as Invariant. The Document may contain zero Invariant - Sections. If the Document does not identify any Invariant Sections then + 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, + modify or distribute the work in a way requiring permission under + copyright law. +
+ 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 + section of the Document that deals exclusively with the relationship of + 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 + mathematics.) The relationship could be a matter of historical connection + with the subject or with related matters, or of legal, commercial, + philosophical, ethical or political position regarding them. +
+ 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 + be designated as Invariant. The Document may contain zero Invariant + Sections. If the Document does not identify any Invariant Sections then there are none.
- 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 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 pixels) generic paint - programs or (for drawings) some widely available drawing editor, and that - is suitable for input to text formatters or for automatic translation to a - variety of formats suitable for input to text formatters. A copy made in - an otherwise Transparent file format whose 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". + 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 + 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 + pixels) generic paint programs or (for drawings) some widely available + drawing editor, and that is suitable for input to text formatters or for + automatic translation to a variety of formats suitable for input to text + formatters. A copy made in an otherwise Transparent file format whose + 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â.
Examples of suitable formats for Transparent copies include plain ASCII without markup, Texinfo input format, LaTeX input format, SGML or XML using a publicly available DTD, and standard-conforming simple HTML, - PostScript or PDF designed for human modification. Examples of - transparent image formats include PNG, XCF and JPG. Opaque formats - include proprietary formats that can be read and edited only by - proprietary word processors, SGML or XML for which the DTD and/or - processing tools are not generally available, and the machine-generated - HTML, PostScript or PDF produced by some word processors for output - purposes only. -
- 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 title, preceding the beginning of - the body of the text. -
- 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 definition. + PostScript or PDF designed for human modification. Examples of transparent + image formats include PNG, XCF and JPG. Opaque formats include proprietary + formats that can be read and edited only by proprietary word processors, + SGML or XML for which the DTD and/or processing tools are not generally + available, and the machine-generated HTML, PostScript or PDF produced by + some word processors for output purposes only. +
+ 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 + title, preceding the beginning of the body of the text. +
+ 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 + 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 + definition.
The Document may include Warranty Disclaimers next to the notice which - states that this License applies to the Document. These Warranty + states that this License applies to the Document. These Warranty Disclaimers are considered to be included by reference in this License, but only as regards disclaiming warranties: any other implication that these Warranty Disclaimers may have is void and has no effect on the meaning of this License. -
+
2. VERBATIM COPYING -
+
You may copy and distribute the Document in any medium, either commercially or noncommercially, provided that this License, the copyright notices, and the license notice saying this License applies to the Document are reproduced in all copies, and that you add no other - conditions whatsoever to those of this License. You may not use technical + conditions whatsoever to those of this License. You may not use technical measures to obstruct or control the reading or further copying of the - copies you make or distribute. However, you may accept compensation in - exchange for copies. If you distribute a large enough number of copies - you must also follow the conditions in section 3. + copies you make or distribute. However, you may accept compensation in + exchange for copies. If you distribute a large enough number of copies you + must also follow the conditions in section 3.
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 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 - publisher of these copies. The front cover must present the full title - with all words of the title equally prominent and visible. You may add - other material on the covers in addition. Copying with changes limited to + 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 + publisher of these copies. The front cover must present the full title + with all words of the title equally prominent and visible. You may add + other material on the covers in addition. Copying with changes limited to the covers, as long as they preserve the title of the Document and satisfy - these conditions, can be treated as verbatim copying in other - respects. + these conditions, can be treated as verbatim copying in other respects.
If the required texts for either cover are too voluminous to fit legibly, you should put the first ones listed (as many as fit reasonably) on the @@ -155,7 +159,7 @@ along with each Opaque copy, or state in or with each Opaque copy a computer-network location from which the general network-using public has access to download using public-standard network protocols a complete - Transparent copy of the Document, free of added material. If you use the + Transparent copy of the Document, free of added material. If you use the latter option, you must take reasonably prudent steps, when you begin distribution of Opaque copies in quantity, to ensure that this Transparent copy will remain thus accessible at the stated location until at least one @@ -164,24 +168,23 @@
It is requested, but not required, that you contact the authors of the Document well before redistributing any large number of copies, to give - them a chance to provide you with an updated version of the - Document. -
+ them a chance to provide you with an updated version of the Document. +
4. MODIFICATIONS -
+
You may copy and distribute a Modified Version of the Document under the conditions of sections 2 and 3 above, provided that you release the Modified Version under precisely this License, with the Modified Version filling the role of the Document, thus licensing distribution and - modification of the Modified Version to whoever possesses a copy of it. - In addition, you must do these things in the Modified Version: + modification of the Modified Version to whoever possesses a copy of it. In + addition, you must do these things in the Modified Version:
Use in the Title Page (and on the covers, if any) a title distinct from that of the Document, and from those of previous versions (which should, if there were any, be listed in the History section of the - Document). You may use the same title as a previous version if the + Document). You may use the same title as a previous version if the original publisher of that version gives permission. -
+
List on the Title Page, as authors, one or more persons or entities responsible for authorship of the modifications in the Modified Version, together with at least five of the principal authors of the @@ -201,60 +204,63 @@ terms of this License, in the form shown in the Addendum below.
Preserve in that license notice the full lists of Invariant Sections - and required Cover Texts given in the Document's license notice. + and required Cover Texts given in the Documentâs license + notice.
Include an unaltered copy of this License.
- 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 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. + 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 + 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.
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" 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. + 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.
- 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. + 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.
Preserve all the Invariant Sections of the Document, unaltered in - their text and in their titles. Section numbers or the equivalent are + their text and in their titles. Section numbers or the equivalent are not considered part of the section titles.
- Delete any section Entitled "Endorsements". Such a section may not be - included in the Modified Version. + 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 Section. + Do not retitle any existing section to be Entitled + âEndorsementsâ or to conflict in title with any Invariant + Section.
Preserve any Warranty Disclaimers.
If the Modified Version includes new front-matter sections or appendices 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 must be - distinct from any other section titles. + as invariant. To do this, add their titles to the list of Invariant + 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 contains - nothing but endorsements of your Modified Version by various parties--for - example, statements of peer review or that the text has been approved by - an organization as the authoritative definition of a standard. + 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 + has been approved by an organization as the authoritative definition of a + standard.
You may add a passage of up to five words as a Front-Cover Text, and a passage of up to 25 words as a Back-Cover Text, to the end of the list of - Cover Texts in the Modified Version. Only one passage of Front-Cover Text + Cover Texts in the Modified Version. Only one passage of Front-Cover Text and one of Back-Cover Text may be added by (or through arrangements made - by) any one entity. If the Document already includes a cover text for the + by) any one entity. If the Document already includes a cover text for the same cover, previously added by you or by arrangement made by the same entity you are acting on behalf of, you may not add another; but you may replace the old one, on explicit permission from the previous publisher @@ -263,9 +269,9 @@ The author(s) and publisher(s) of the Document do not by this License give permission to use their names for publicity for or to assert or imply endorsement of any Modified Version. -
+
5. COMBINING DOCUMENTS -
+
You may combine the Document with other documents released under this License, under the terms defined in section 4 above for modified versions, provided that you include in the combination all of the Invariant Sections @@ -274,22 +280,23 @@ you preserve all their Warranty Disclaimers.
The combined work need only contain one copy of this License, and multiple - identical Invariant Sections may be replaced with a single copy. If there + identical Invariant Sections may be replaced with a single copy. If there are multiple Invariant Sections with the same name but different contents, make the title of each such section unique by adding at the end of it, in parentheses, the name of the original author or publisher of that section - if known, or else a unique number. Make the same adjustment to the - section titles in the list of Invariant Sections in the license notice of - the combined work. -
- 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". -
+ if known, or else a unique number. Make the same adjustment to the section + titles in the list of Invariant Sections in the license notice of the + combined work. +
+ 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â. +
6. COLLECTIONS OF DOCUMENTS -
+
You may make a collection consisting of the Document and other documents released under this License, and replace the individual copies of this License in the various documents with a single copy that is included in @@ -300,90 +307,135 @@ it individually under this License, provided you insert a copy of this 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 resulting - from the compilation is not used to limit the legal rights of 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. + 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 + 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.
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 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. -
+ 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 -
+
Translation is considered a kind of modification, so you may distribute - translations of the Document under the terms of section 4. Replacing + translations of the Document under the terms of section 4. Replacing Invariant Sections with translations requires special permission from their copyright holders, but you may include translations of some or all Invariant Sections in addition to the original versions of these Invariant - Sections. You may include a translation of this License, and all the + Sections. You may include a translation of this License, and all the license notices in the Document, and any Warranty Disclaimers, provided that you also include the original English version of this License and the - original versions of those notices and disclaimers. In case of a + original versions of those notices and disclaimers. In case of a disagreement between the translation and the original version of this 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 (section 4) to Preserve its - Title (section 1) will typically require changing the actual title. -
+ 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 -
+
You may not copy, modify, sublicense, or distribute the Document except as - expressly provided for under this License. Any other attempt to copy, - modify, sublicense or distribute the Document 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. -
+ expressly provided under this License. Any attempt otherwise to copy, + modify, sublicense, or distribute it is void, and will automatically + terminate your rights under this License. +
+ However, if you cease all violation of this License, then your license + from a particular copyright holder is reinstated (a) provisionally, unless + and until the copyright holder explicitly and finally terminates your + license, and (b) permanently, if the copyright holder fails to notify you + of the violation by some reasonable means prior to 60 days after the + cessation. +
+ Moreover, your license from a particular copyright holder is reinstated + permanently if the copyright holder notifies you of the violation by some + reasonable means, this is the first time you have received notice of + violation of this License (for any work) from that copyright holder, and + you cure the violation prior to 30 days after your receipt of the notice. +
+ Termination of your rights under this section does not terminate the + licenses of parties who have received copies or rights from you under this + License. If your rights have been terminated and not permanently + 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 -
+
The Free Software Foundation may publish new, revised versions of the GNU - Free Documentation License from time to time. Such new versions will be + 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 + Copyleft.
- Each version of the License is given a distinguishing version number. If + 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 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. -
+ â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 + 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 + 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 + works thus published on the MMC site. +
+ â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 + whole or in part, as part of another Document. +
+ 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 + sections, and (2) were thus incorporated prior to November 1, 2008. +
+ The operator of an MMC Site may republish an MMC contained in the site + 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 -
+
To use this License in a document you have written, include a copy of the License in the document and put the following copyright and license notices just after the title page: -
- Copyright (C) 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.2 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". -
+
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â.
If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts, - 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. -
+ 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.
If you have Invariant Sections without Cover Texts, or some other combination of the three, merge those two alternatives to suit the situation. diff --git a/libstdc++-v3/doc/html/manual/appendix_gpl.html b/libstdc++-v3/doc/html/manual/appendix_gpl.html index 012c9086be41..23edc550a457 100644 --- a/libstdc++-v3/doc/html/manual/appendix_gpl.html +++ b/libstdc++-v3/doc/html/manual/appendix_gpl.html @@ -78,7 +78,7 @@
The precise terms and conditions for copying, distribution and modification follow. -
+
TERMS AND CONDITIONS
0. Definitions. @@ -619,7 +619,7 @@ waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. -
+
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs diff --git a/libstdc++-v3/doc/html/manual/appendix_porting.html b/libstdc++-v3/doc/html/manual/appendix_porting.html index 46ee854f2c1b..104689183e15 100644 --- a/libstdc++-v3/doc/html/manual/appendix_porting.html +++ b/libstdc++-v3/doc/html/manual/appendix_porting.html @@ -7,7 +7,7 @@ Appendices Â Next
AppendixÂ B.Â Porting and Maintenance - +
Table of Contents
Configure and Build Hacking
Prerequisites
Overview: What Comes from Where
Storing Information in non-AC files (like configure.host)
Coding and Commenting Conventions
The acinclude.m4 layout
GLIBCXX_ENABLE, the --enable maker
Porting to New Hardware or Operating Systems
Operating System
CPU
Character Types
Thread Safety
Numeric Limits
Libtool
Test
Organization
Running the Testsuite
Writing a new test case
Test Harness and Utilities
Special Topics
ABI Policy and Guidelines
The C++ Interface
Versioning
Allowed Changes
Prohibited Changes
Implementation
Testing
Outstanding Issues
API Evolution and Deprecation History
3.0
3.1
3.2
3.3
3.4
4.0
4.1
4.2
4.3
4.4
4.5
Backwards Compatibility
First
Second
Third
Configure and Build Hacking
Prerequisites
As noted previously, certain other tools are necessary for hacking on files that diff --git a/libstdc++-v3/doc/html/manual/atomics.html b/libstdc++-v3/doc/html/manual/atomics.html index a01126003fa0..1b14532a9aa7 100644 --- a/libstdc++-v3/doc/html/manual/atomics.html +++ b/libstdc++-v3/doc/html/manual/atomics.html @@ -7,7 +7,7 @@ Standard Contents Â Next
ChapterÂ 14.Â Atomics - +
Table of Contents
API Reference
Facilities for atomic operations.
API Reference
diff --git a/libstdc++-v3/doc/html/manual/backwards.html b/libstdc++-v3/doc/html/manual/backwards.html index dc8e7d1cdc8b..cd2a508362c3 100644 --- a/libstdc++-v3/doc/html/manual/backwards.html +++ b/libstdc++-v3/doc/html/manual/backwards.html @@ -17,8 +17,8 @@ ISO Standard (e.g., statistical analysis). While there are a lot of really useful things that are used by a lot of people, the Standards Committee couldn't include everything, and so a lot of those âobviousâ classes didn't get included. -
Known Issues include many of the limitations of its immediate ancestor.
Portability notes and known implementation limitations are as follows.
No ios_base
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 cout in ostream.h, no cin in istream.h
+
Known Issues include many of the limitations of its immediate ancestor.
Portability notes and known implementation limitations are as follows.
No ios_base
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 cout in ostream.h, no cin in istream.h
In earlier versions of the standard, fstream.h, ostream.h @@ -44,7 +44,7 @@ considered replaced and rewritten. archived. The code is considered replaced and rewritten.
Portability notes and known implementation limitations are as follows. -
Namespace std:: not supported
+
Namespace std:: not supported
Some care is required to support C++ compiler and or library implementation that do not have the standard library in namespace std. @@ -108,7 +108,7 @@ AC_DEFUN([AC_CXX_NAMESPACE_STD], [ AC_DEFINE(HAVE_NAMESPACE_STD,,[Define if g++ supports namespace std. ]) fi ]) -
Illegal iterator usage
+
Illegal iterator usage
The following illustrate implementation-allowed illegal iterator use, and then correct use.
@@ -121,7 +121,7 @@ AC_DEFUN([AC_CXX_NAMESPACE_STD], [
if (iterator) won't work any more => use if (iterator != iterator_type()) -
isspace from cctype is a macro +
isspace from cctype is a macro
Glibc 2.0.x and 2.1.x define ctype.h functionality as macros (isspace, isalpha etc.). @@ -154,7 +154,7 @@ std:: (__ctype_b[(int) ( ( 'X' ) )] & (unsigned short int) _ISspace ) ; (ctype.h) and the definitions in namespace std:: (<cctype>). -
No vector::at, deque::at, string::at
+
No vector::at, deque::at, string::at
One solution is to add an autoconf-test for this:
AC_MSG_CHECKING(for container::at) @@ -180,7 +180,7 @@ AC_DEFINE(HAVE_CONTAINER_AT)],
If you are using other (non-GNU) compilers it might be a good idea to check for string::at separately. -
No std::char_traits<char>::eof
+
No std::char_traits<char>::eof
Use some kind of autoconf test, plus this:
#ifdef HAVE_CHAR_TRAITS @@ -188,7 +188,7 @@ AC_DEFINE(HAVE_CONTAINER_AT)], #else #define CPP_EOF EOF #endif -
No string::clear
+
No string::clear
There are two functions for deleting the contents of a string: clear and erase (the latter returns the string). @@ -206,12 +206,12 @@ erase(size_type __pos = 0, size_type __n = npos) Unfortunately, clear is not implemented in this version, so you should use erase (which is probably faster than operator=(charT*)). -
+
Removal of ostream::form and istream::scan extensions
These are no longer supported. Please use stringstreams instead. -
No basic_stringbuf, basic_stringstream
+
No basic_stringbuf, basic_stringstream
Although the ISO standard i/ostringstream-classes are provided, (sstream), for compatibility with older implementations the pre-ISO @@ -299,14 +299,14 @@ any = temp; 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 threading configuration and proper compilation. Before GCC 3.0, configuration of the threading model was dictated by compiler @@ -364,7 +364,7 @@ libstdc++-v3. of the SGI STL (version 3.3), with extensive changes.
A more formal description of the V3 goals can be found in the official design document. -
Portability notes and known implementation limitations are as follows.
Pre-ISO headers moved to backwards or removed
The pre-ISO C++ headers +
Portability notes and known implementation limitations are as follows.
Pre-ISO headers moved to backwards or removed
The pre-ISO C++ headers (iostream.h, defalloc.h etc.) are available, unlike previous libstdc++ versions, but inclusion generates a warning that you are using deprecated headers. @@ -436,7 +436,7 @@ like vector.h can be replaced with 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
At this time most of the features of the SGI STL extension have been +
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. In particular, the unordered_map and unordered_set containers of TR1 are suitable replacement for the non-standard hash_map and hash_set @@ -508,7 +508,7 @@ AC_DEFUN([AC_HEADER_EXT_HASH_SET], [ AC_DEFINE(HAVE_EXT_HASH_SET,,[Define if ext/hash_set is present. ]) fi ]) -
No ios::nocreate/ios::noreplace. +
No ios::nocreate/ios::noreplace.
The existence of ios::nocreate being used for input-streams has been confirmed, most probably because the author thought it would be more correct to specify nocreate explicitly. So @@ -519,7 +519,7 @@ open the file for reading, check if it has been opened, and then decide whether you want to create/replace or not. To my knowledge, even older implementations support app, ate and trunc (except for app ?). -
+
No stream::attach(int fd)
Phil Edwards writes: It was considered and rejected for the ISO @@ -542,7 +542,7 @@ No stream::attach(int fd) For another example of this, refer to fdstream example by Nicolai Josuttis. -
+
Support for C++98 dialect.
Check for complete library coverage of the C++1998/2003 standard.
@@ -610,7 +610,7 @@ AC_DEFUN([AC_HEADER_STDCXX_98], [ AC_DEFINE(STDCXX_98_HEADERS,,[Define if ISO C++ 1998 header files are present. ]) fi ]) -
+
Support for C++TR1 dialect.
Check for library coverage of the TR1 standard.
@@ -687,7 +687,7 @@ AC_DEFUN([AC_HEADER_TR1_UNORDERED_SET], [ AC_DEFINE(HAVE_TR1_UNORDERED_SET,,[Define if tr1/unordered_set is present. ]) fi ]) -
+
Support for C++0x dialect.
Check for baseline language coverage in the compiler for the C++0xstandard.
@@ -899,25 +899,25 @@ AC_DEFUN([AC_HEADER_UNORDERED_SET], [ AC_DEFINE(HAVE_UNORDERED_SET,,[Define if unordered_set is present. ]) fi ]) -
+
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.
+ . Dan Kegel.
Building the Whole Debian Archive with GCC 4.1: A Summary - . Martin Michlmayr.
+ . Martin Michlmayr.
Migration guide for GCC-3.2 diff --git a/libstdc++-v3/doc/html/manual/bitmap_allocator.html b/libstdc++-v3/doc/html/manual/bitmap_allocator.html index ae4a27930d84..2c621c42d540 100644 --- a/libstdc++-v3/doc/html/manual/bitmap_allocator.html +++ b/libstdc++-v3/doc/html/manual/bitmap_allocator.html @@ -103,7 +103,7 @@ else return false.

Consider a block of size 64 ints. In memory, it would look like this: (assume a 32-bit system where, size_t is a 32-bit entity). -
TableÂ 20.1.Â Bitmap Allocator Memory Map
268 0 4294967295 4294967295 Data -> Space for 64 ints

+
TableÂ 20.1.Â Bitmap Allocator Memory Map
268 0 4294967295 4294967295 Data -> Space for 64 ints

The first Column(268) represents the size of the Block in bytes as seen by the Bitmap Allocator. Internally, a global free list is used to keep track of the free blocks used and given back by the diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch17s03.html b/libstdc++-v3/doc/html/manual/bk01pt03ch17s03.html index 5ea9732886e7..bfa32155f362 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch17s03.html +++ b/libstdc++-v3/doc/html/manual/bk01pt03ch17s03.html @@ -19,6 +19,6 @@ mode or with debug mode. The following table provides the names and headers of the debugging containers: -
TableÂ 17.1.Â Debugging Containers
Container Header Debug container Debug header
std::bitset bitset __gnu_debug::bitset <debug/bitset>
std::deque deque __gnu_debug::deque <debug/deque>
std::list list __gnu_debug::list <debug/list>
std::map map __gnu_debug::map <debug/map>
std::multimap map __gnu_debug::multimap <debug/map>
std::multiset set __gnu_debug::multiset <debug/set>
std::set set __gnu_debug::set <debug/set>
std::string string __gnu_debug::string <debug/string>
std::wstring string __gnu_debug::wstring <debug/string>
std::basic_string string __gnu_debug::basic_string <debug/string>
std::vector vector __gnu_debug::vector <debug/vector>

In addition, when compiling in C++0x mode, these additional +
TableÂ 17.1.Â Debugging Containers
Container Header Debug container Debug header
std::bitset bitset __gnu_debug::bitset <debug/bitset>
std::deque deque __gnu_debug::deque <debug/deque>
std::list list __gnu_debug::list <debug/list>
std::map map __gnu_debug::map <debug/map>
std::multimap map __gnu_debug::multimap <debug/map>
std::multiset set __gnu_debug::multiset <debug/set>
std::set set __gnu_debug::set <debug/set>
std::string string __gnu_debug::string <debug/string>
std::wstring string __gnu_debug::wstring <debug/string>
std::basic_string string __gnu_debug::basic_string <debug/string>
std::vector vector __gnu_debug::vector <debug/vector>

In addition, when compiling in C++0x mode, these additional containers have additional debug capability. -
TableÂ 17.2.Â Debugging Containers C++0x
Container Header Debug container Debug header
std::unordered_map unordered_map __gnu_debug::unordered_map <debug/unordered_map>
std::unordered_multimap unordered_map __gnu_debug::unordered_multimap <debug/unordered_map>
std::unordered_set unordered_set __gnu_debug::unordered_set <debug/unordered_set>
std::unordered_multiset unordered_set __gnu_debug::unordered_multiset <debug/unordered_set>

PrevÂ Up Â Next
SemanticsÂ Home Â Design
+
TableÂ 17.2.Â Debugging Containers C++0x
Container Header Debug container Debug header
std::unordered_map unordered_map __gnu_debug::unordered_map <debug/unordered_map>
std::unordered_multimap unordered_map __gnu_debug::unordered_multimap <debug/unordered_map>
std::unordered_set unordered_set __gnu_debug::unordered_set <debug/unordered_set>
std::unordered_multiset unordered_set __gnu_debug::unordered_multiset <debug/unordered_set>

PrevÂ Up Â Next
SemanticsÂ Home Â Design
diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch18s03.html b/libstdc++-v3/doc/html/manual/bk01pt03ch18s03.html index 76645a52876d..44a7535523eb 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch18s03.html +++ b/libstdc++-v3/doc/html/manual/bk01pt03ch18s03.html @@ -63,4 +63,4 @@ Then compile this code with the prerequisite compiler flags flags for atomic operations.)
The following table provides the names and headers of all the parallel algorithms that can be used in a similar manner: -
TableÂ 18.1.Â Parallel Algorithms
Algorithm Header Parallel algorithm Parallel header
std::accumulate numeric __gnu_parallel::accumulate parallel/numeric
std::adjacent_difference numeric __gnu_parallel::adjacent_difference parallel/numeric
std::inner_product numeric __gnu_parallel::inner_product parallel/numeric
std::partial_sum numeric __gnu_parallel::partial_sum parallel/numeric
std::adjacent_find algorithm __gnu_parallel::adjacent_find parallel/algorithm
std::count algorithm __gnu_parallel::count parallel/algorithm
std::count_if algorithm __gnu_parallel::count_if parallel/algorithm
std::equal algorithm __gnu_parallel::equal parallel/algorithm
std::find algorithm __gnu_parallel::find parallel/algorithm
std::find_if algorithm __gnu_parallel::find_if parallel/algorithm
std::find_first_of algorithm __gnu_parallel::find_first_of parallel/algorithm
std::for_each algorithm __gnu_parallel::for_each parallel/algorithm
std::generate algorithm __gnu_parallel::generate parallel/algorithm
std::generate_n algorithm __gnu_parallel::generate_n parallel/algorithm
std::lexicographical_compare algorithm __gnu_parallel::lexicographical_compare parallel/algorithm
std::mismatch algorithm __gnu_parallel::mismatch parallel/algorithm
std::search algorithm __gnu_parallel::search parallel/algorithm
std::search_n algorithm __gnu_parallel::search_n parallel/algorithm
std::transform algorithm __gnu_parallel::transform parallel/algorithm
std::replace algorithm __gnu_parallel::replace parallel/algorithm
std::replace_if algorithm __gnu_parallel::replace_if parallel/algorithm
std::max_element algorithm __gnu_parallel::max_element parallel/algorithm
std::merge algorithm __gnu_parallel::merge parallel/algorithm
std::min_element algorithm __gnu_parallel::min_element parallel/algorithm
std::nth_element algorithm __gnu_parallel::nth_element parallel/algorithm
std::partial_sort algorithm __gnu_parallel::partial_sort parallel/algorithm
std::partition algorithm __gnu_parallel::partition parallel/algorithm
std::random_shuffle algorithm __gnu_parallel::random_shuffle parallel/algorithm
std::set_union algorithm __gnu_parallel::set_union parallel/algorithm
std::set_intersection algorithm __gnu_parallel::set_intersection parallel/algorithm
std::set_symmetric_difference algorithm __gnu_parallel::set_symmetric_difference parallel/algorithm
std::set_difference algorithm __gnu_parallel::set_difference parallel/algorithm
std::sort algorithm __gnu_parallel::sort parallel/algorithm
std::stable_sort algorithm __gnu_parallel::stable_sort parallel/algorithm
std::unique_copy algorithm __gnu_parallel::unique_copy parallel/algorithm

PrevÂ Up Â Next
SemanticsÂ Home Â Design
+
TableÂ 18.1.Â Parallel Algorithms
Algorithm Header Parallel algorithm Parallel header
std::accumulate numeric __gnu_parallel::accumulate parallel/numeric
std::adjacent_difference numeric __gnu_parallel::adjacent_difference parallel/numeric
std::inner_product numeric __gnu_parallel::inner_product parallel/numeric
std::partial_sum numeric __gnu_parallel::partial_sum parallel/numeric
std::adjacent_find algorithm __gnu_parallel::adjacent_find parallel/algorithm
std::count algorithm __gnu_parallel::count parallel/algorithm
std::count_if algorithm __gnu_parallel::count_if parallel/algorithm
std::equal algorithm __gnu_parallel::equal parallel/algorithm
std::find algorithm __gnu_parallel::find parallel/algorithm
std::find_if algorithm __gnu_parallel::find_if parallel/algorithm
std::find_first_of algorithm __gnu_parallel::find_first_of parallel/algorithm
std::for_each algorithm __gnu_parallel::for_each parallel/algorithm
std::generate algorithm __gnu_parallel::generate parallel/algorithm
std::generate_n algorithm __gnu_parallel::generate_n parallel/algorithm
std::lexicographical_compare algorithm __gnu_parallel::lexicographical_compare parallel/algorithm
std::mismatch algorithm __gnu_parallel::mismatch parallel/algorithm
std::search algorithm __gnu_parallel::search parallel/algorithm
std::search_n algorithm __gnu_parallel::search_n parallel/algorithm
std::transform algorithm __gnu_parallel::transform parallel/algorithm
std::replace algorithm __gnu_parallel::replace parallel/algorithm
std::replace_if algorithm __gnu_parallel::replace_if parallel/algorithm
std::max_element algorithm __gnu_parallel::max_element parallel/algorithm
std::merge algorithm __gnu_parallel::merge parallel/algorithm
std::min_element algorithm __gnu_parallel::min_element parallel/algorithm
std::nth_element algorithm __gnu_parallel::nth_element parallel/algorithm
std::partial_sort algorithm __gnu_parallel::partial_sort parallel/algorithm
std::partition algorithm __gnu_parallel::partition parallel/algorithm
std::random_shuffle algorithm __gnu_parallel::random_shuffle parallel/algorithm
std::set_union algorithm __gnu_parallel::set_union parallel/algorithm
std::set_intersection algorithm __gnu_parallel::set_intersection parallel/algorithm
std::set_symmetric_difference algorithm __gnu_parallel::set_symmetric_difference parallel/algorithm
std::set_difference algorithm __gnu_parallel::set_difference parallel/algorithm
std::sort algorithm __gnu_parallel::sort parallel/algorithm
std::stable_sort algorithm __gnu_parallel::stable_sort parallel/algorithm
std::unique_copy algorithm __gnu_parallel::unique_copy parallel/algorithm

PrevÂ Up Â Next
SemanticsÂ Home Â Design
diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch19s02.html b/libstdc++-v3/doc/html/manual/bk01pt03ch19s02.html index 1dc6efe132b0..50b3875d7dba 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch19s02.html +++ b/libstdc++-v3/doc/html/manual/bk01pt03ch19s02.html @@ -1,7 +1,7 @@ Design
Design
PrevÂ ChapterÂ 19.Â Profile Mode Â Next
Design
-
TableÂ 19.1.Â Profile Code Location
Code Location Use
libstdc++-v3/include/std/* Preprocessor code to redirect to profile extension headers.
libstdc++-v3/include/profile/* Profile extension public headers (map, vector, ...).
libstdc++-v3/include/profile/impl/* Profile extension internals. Implementation files are +
TableÂ 19.1.Â Profile Code Location
Code Location Use
libstdc++-v3/include/std/* Preprocessor code to redirect to profile extension headers.
libstdc++-v3/include/profile/* Profile extension public headers (map, vector, ...).
libstdc++-v3/include/profile/impl/* Profile extension internals. Implementation files are only included from impl/profiler.h, which is the only file included from the public headers.

Wrapper Model
diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch19s07.html b/libstdc++-v3/doc/html/manual/bk01pt03ch19s07.html index ec719afd2440..81865489ebe6 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch19s07.html +++ b/libstdc++-v3/doc/html/manual/bk01pt03ch19s07.html @@ -18,7 +18,7 @@ A high accuracy means that the diagnostic is unlikely to be wrong. These grades are not perfect. They are just meant to guide users with specific needs or time budgets. -
TableÂ 19.2.Â Profile Diagnostics
Group Flag Benefit Cost Freq. Implemented Â
+
TableÂ 19.2.Â Profile Diagnostics
Group Flag Benefit Cost Freq. Implemented Â
CONTAINERS HASHTABLE_TOO_SMALL 10 1 Â 10 yes
Â HASHTABLE_TOO_LARGE 5 1 Â 10 yes
Â diff --git a/libstdc++-v3/doc/html/manual/bk01pt03pr01.html b/libstdc++-v3/doc/html/manual/bk01pt03pr01.html index 720b22dafc64..098bade2bfe8 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03pr01.html +++ b/libstdc++-v3/doc/html/manual/bk01pt03pr01.html @@ -3,7 +3,7 @@
PrevÂ PartÂ III.Â Extensions - Â Next
+
Â Next
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, and some just seemed to appear on the doorstep. diff --git a/libstdc++-v3/doc/html/manual/concurrency.html b/libstdc++-v3/doc/html/manual/concurrency.html index 0265da4c443b..07b47bd6b7f3 100644 --- a/libstdc++-v3/doc/html/manual/concurrency.html +++ b/libstdc++-v3/doc/html/manual/concurrency.html @@ -7,7 +7,7 @@ Standard Contents
Â Next
ChapterÂ 15.Â Concurrency - +
Table of Contents
API Reference
Facilities for concurrent operation, and control thereof.
API Reference
diff --git a/libstdc++-v3/doc/html/manual/configure.html b/libstdc++-v3/doc/html/manual/configure.html index 47f58f47f891..2b8c49a09b4f 100644 --- a/libstdc++-v3/doc/html/manual/configure.html +++ b/libstdc++-v3/doc/html/manual/configure.html @@ -59,8 +59,7 @@
If not explicitly specified, the configure proccess tries to guess the most suitable package from the choices above. The default is 'generic'. On glibc-based systems of sufficient - vintage (2.2.5 and newer) and capability (with installed DE and - FR locale data), 'gnu' is automatically selected. This option + vintage (2.3 and newer), 'gnu' is automatically selected. This option can change the library ABI.
--enable-libstdcxx-allocator
This is an abbreviated form of '--enable-libstdcxx-allocator=auto' (described diff --git a/libstdc++-v3/doc/html/manual/containers.html b/libstdc++-v3/doc/html/manual/containers.html index c427178f494f..b99c3c4d612a 100644 --- a/libstdc++-v3/doc/html/manual/containers.html +++ b/libstdc++-v3/doc/html/manual/containers.html @@ -7,7 +7,7 @@ Standard Contents
Â Next
ChapterÂ 9.Â Containers - +
Table of Contents
Sequences
list
vector
Associative
Insertion Hints
bitset
Interacting with C
Containers vs. Arrays
Sequences
list
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 diff --git a/libstdc++-v3/doc/html/manual/diagnostics.html b/libstdc++-v3/doc/html/manual/diagnostics.html index 0cdf35293d04..0a03b2458e6b 100644 --- a/libstdc++-v3/doc/html/manual/diagnostics.html +++ b/libstdc++-v3/doc/html/manual/diagnostics.html @@ -7,7 +7,7 @@ Standard Contents Â Next
ChapterÂ 5.Â Diagnostics - +
Table of Contents
Exceptions
API Reference
Adding Data to exception
Concept Checking
Exceptions
API Reference
All exception objects are defined in one of the standard header files: exception, diff --git a/libstdc++-v3/doc/html/manual/documentation_style.html b/libstdc++-v3/doc/html/manual/documentation_style.html index 8292e2531657..064fa8fb682b 100644 --- a/libstdc++-v3/doc/html/manual/documentation_style.html +++ b/libstdc++-v3/doc/html/manual/documentation_style.html @@ -108,7 +108,7 @@ writing Doxygen comments. Single and double quotes, and separators in filenames are two common trouble spots. When in doubt, consult the following table. -
TableÂ A.1.Â HTML to Doxygen Markup Comparison
HTML Doxygen
\ \\
" \"
' \'
 @a word
 @b word
<code> @c word
 @a word
 two words or more

Docbook
Prerequisites
+
TableÂ A.1.Â HTML to Doxygen Markup Comparison
HTML Doxygen
\ \\
" \"
' \'
 @a word
 @b word
<code> @c word
 @a word
 two words or more

Docbook
Prerequisites
Editing the DocBook sources requires an XML editor. Many exist: some notable options include emacs, Kate, @@ -238,11 +238,11 @@ xmllint --noout --valid xml/index.xml online. An incomplete reference for HTML to Docbook conversion is detailed in the table below. -
TableÂ A.2.Â HTML to Docbook XML Markup Comparison
HTML Docbook
 <para>
<pre> <computeroutput>, <programlisting>, +
TableÂ A.2.Â HTML to Docbook XML Markup Comparison
HTML Docbook
 <para>
<pre> <computeroutput>, <programlisting>, <literallayout>
<ul> <itemizedlist>
<ol> <orderedlist>
<il> <listitem>
<dl> <variablelist>
<dt> <term>
<dd> <listitem>
<a href=""> <ulink url="">
<code> <literal>, <programlisting>
 <emphasis>
 <emphasis>
" <quote>

And examples of detailed markup for which there are no real HTML equivalents are listed in the table below. -
TableÂ A.3.Â Docbook XML Element Use
Element Use
<structname> <structname>char_traits</structname>
<classname> <classname>string</classname>
<function> +
TableÂ A.3.Â Docbook XML Element Use
Element Use
<structname> <structname>char_traits</structname>
<classname> <classname>string</classname>
<function>
<function>clear()</function>

<function>fs.clear()</function>

<type> <type>long long</type>
<varname> <varname>fs</varname>
<literal> diff --git a/libstdc++-v3/doc/html/manual/extensions.html b/libstdc++-v3/doc/html/manual/extensions.html index e1967c062d76..d9dc83365716 100644 --- a/libstdc++-v3/doc/html/manual/extensions.html +++ b/libstdc++-v3/doc/html/manual/extensions.html @@ -5,5 +5,5 @@
PrevÂ The GNU C++ Library Â Next
PartÂ III.Â Extensions - +
Table of Contents
16. Compile Time Checks
17. Debug Mode
Intro
Semantics
Using
Using the Debug Mode
Using a Specific Debug Container
Design
Goals
Methods
Other Implementations
18. Parallel Mode
Intro
Semantics
Using
Prerequisite Compiler Flags
Using Parallel Mode
Using Specific Parallel Components
Design
Interface Basics
Configuration and Tuning
Implementation Namespaces
Testing
Bibliography
19. Profile Mode
Intro
Using the Profile Mode
Tuning the Profile Mode
Design
Wrapper Model
Instrumentation
Run Time Behavior
Analysis and Diagnostics
Cost Model
Reports
Testing
Extensions for Custom Containers
Empirical Cost Model
Implementation Issues
Stack Traces
Symbolization of Instruction Addresses
Concurrency
Using the Standard Library in the Instrumentation Implementation
Malloc Hooks
Construction and Destruction of Global Objects
Developer Information
Big Picture
How To Add A Diagnostic
Diagnostics
Diagnostic Template
Containers
Algorithms
Data Locality
Multithreaded Data Access
Statistics
Bibliography
20. Allocators
mt_allocator
Intro
Design Issues
Implementation
Single Thread Example
Multiple Thread Example
bitmap_allocator
Design
Implementation
21. Containers
Policy Based Data Structures
HP/SGI
Deprecated HP/SGI
22. Utilities
23. Algorithms
24. Numerics
25. Iterators
26. Input and Output
Derived filebufs
27. Demangling
28. Concurrency
Design
Interface to Locks and Mutexes
Interface to Atomic Functions
Implementation
Using Builtin Atomic Functions
Thread Abstraction
Use
PrevÂ Up Â Next
FacetsÂ Home Â
diff --git a/libstdc++-v3/doc/html/manual/facets.html b/libstdc++-v3/doc/html/manual/facets.html index c51a54f54787..191b1d1814cc 100644 --- a/libstdc++-v3/doc/html/manual/facets.html +++ b/libstdc++-v3/doc/html/manual/facets.html @@ -3,7 +3,7 @@ Facets
Facets
PrevÂ ChapterÂ 8.Â Localization - Â Next
Facets
ctype
Implementation
Specializations
+
Â Next
Facets
ctype
Implementation
Specializations
For the required specialization codecvt<wchar_t, char, mbstate_t> , conversions are made between the internal character set (always UCS4 on GNU/Linux) and whatever the currently selected locale for the @@ -50,26 +50,26 @@ characters.
Rename abstract base class. See if just smash-overriding is a better approach. Clarify, add sanity to naming. -
Bibliography
+
Bibliography
The GNU C Library - . Roland McGrath. Ulrich Drepper. Copyright Â© 2007 FSF. Chapters 6 Character Set Handling and 7 Locales and Internationalization.
+ . Roland McGrath. Ulrich Drepper. Copyright Â© 2007 FSF. Chapters 6 Character Set Handling and 7 Locales and Internationalization.
Correspondence - . Ulrich Drepper. Copyright Â© 2002 .
+ . Ulrich Drepper. Copyright Â© 2002 .
ISO/IEC 14882:1998 Programming languages - C++ - . Copyright Â© 1998 ISO.
+ . Copyright Â© 1998 ISO.
ISO/IEC 9899:1999 Programming languages - C - . Copyright Â© 1999 ISO.
+ . Copyright Â© 1999 ISO.
The Open Group Base Specifications, Issue 6 (IEEE Std. 1003.1-2004) . Copyright Â© 1999 - The Open Group/The Institute of Electrical and Electronics Engineers, Inc..
+ The Open Group/The Institute of Electrical and Electronics Engineers, Inc..
The C++ Programming Language, Special Edition . Bjarne Stroustrup. Copyright Â© 2000 Addison Wesley, Inc.. Appendix D. Addison Wesley - .
+ .
Standard C++ IOStreams and Locales . Advanced Programmer's Guide and Reference @@ -412,17 +412,17 @@ codecvt usage.
wchar_t/char internal buffers and conversions between internal/external buffers? -
Bibliography
+
Bibliography
The GNU C Library . Roland McGrath. Ulrich Drepper. Copyright Â© 2007 FSF. Chapters 6 Character Set Handling and 7 Locales and Internationalization - .
+ .
Correspondence - . Ulrich Drepper. Copyright Â© 2002 .
+ . Ulrich Drepper. Copyright Â© 2002 .
ISO/IEC 14882:1998 Programming languages - C++ - . Copyright Â© 1998 ISO.
+ . Copyright Â© 1998 ISO.
ISO/IEC 9899:1999 Programming languages - C - . Copyright Â© 1999 ISO.
+ . Copyright Â© 1999 ISO.
System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008) @@ -431,29 +431,29 @@ codecvt usage. . Copyright Â© 2008 The Open Group/The Institute of Electrical and Electronics Engineers, Inc. - .
+ .
The C++ Programming Language, Special Edition . Bjarne Stroustrup. Copyright Â© 2000 Addison Wesley, Inc.. Appendix D. Addison Wesley - .
+ .
Standard C++ IOStreams and Locales . Advanced Programmer's Guide and Reference . Angelika Langer. Klaus Kreft. Copyright Â© 2000 Addison Wesley Longman, Inc.. Addison Wesley Longman - .
+ .
A brief description of Normative Addendum 1 - . Clive Feather. Extended Character Sets.
+ . Clive Feather. Extended Character Sets.
The Unicode HOWTO - . Bruno Haible.
+ . Bruno Haible.
UTF-8 and Unicode FAQ for Unix/Linux @@ -700,16 +700,16 @@ void test01() model. As of this writing, it is unknown how to query to see if a specified message catalog exists using the gettext package. -
Bibliography
+
Bibliography
The GNU C Library . Roland McGrath. Ulrich Drepper. Copyright Â© 2007 FSF. Chapters 6 Character Set Handling, and 7 Locales and Internationalization - .
+ .
Correspondence - . Ulrich Drepper. Copyright Â© 2002 .
+ . Ulrich Drepper. Copyright Â© 2002 .
ISO/IEC 14882:1998 Programming languages - C++ - . Copyright Â© 1998 ISO.
+ . Copyright Â© 1998 ISO.
ISO/IEC 9899:1999 Programming languages - C - . Copyright Â© 1999 ISO.
+ . Copyright Â© 1999 ISO.
System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008) @@ -718,17 +718,17 @@ void test01() . Copyright Â© 2008 The Open Group/The Institute of Electrical and Electronics Engineers, Inc. - .
+ .
The C++ Programming Language, Special Edition . Bjarne Stroustrup. Copyright Â© 2000 Addison Wesley, Inc.. Appendix D. Addison Wesley - .
+ .
Standard C++ IOStreams and Locales . Advanced Programmer's Guide and Reference . Angelika Langer. Klaus Kreft. Copyright Â© 2000 Addison Wesley Longman, Inc.. Addison Wesley Longman - .
+ .
API Specifications, Java Platform @@ -736,7 +736,7 @@ void test01() . java.util.Properties, java.text.MessageFormat, java.util.Locale, java.util.ResourceBundle - .
+ .
GNU gettext tools, version 0.10.38, Native Language Support diff --git a/libstdc++-v3/doc/html/manual/intro.html b/libstdc++-v3/doc/html/manual/intro.html index 654eb414548a..64d732800c35 100644 --- a/libstdc++-v3/doc/html/manual/intro.html +++ b/libstdc++-v3/doc/html/manual/intro.html @@ -5,5 +5,5 @@
PrevÂ The GNU C++ Library Â Next
PartÂ I.Â Introduction - +
Table of Contents
1. Status
Implementation Status
C++ 1998/2003
C++ 200x
C++ TR1
C++ TR 24733
License
The Code: GPL
The Documentation: GPL, FDL
Bugs
Implementation Bugs
Standard Bugs
2. Setup
Prerequisites
Configure
Make
3. Using
Command Options
Headers
Header Files
Mixing Headers
The C Headers and namespace std
Precompiled Headers
Macros
Namespaces
Available Namespaces
namespace std
Using Namespace Composition
Linking
Almost Nothing
Finding Dynamic or Shared Libraries
Concurrency
Prerequisites
Thread Safety
Atomics
IO
Containers
Exceptions
Exception Safety
Exception Neutrality
Doing without
Compatibility
Debugging Support
Using g++
Debug Versions of Library Binary Files
Memory Leak Hunting
Using gdb
Tracking uncaught exceptions
Debug Mode
Compile Time Checking
Profile-based Performance Analysis
PrevÂ Up Â Next
The GNU C++ LibraryÂ Home Â ChapterÂ 1.Â Status
diff --git a/libstdc++-v3/doc/html/manual/io.html b/libstdc++-v3/doc/html/manual/io.html index ab1d88338a41..62ab50f6bb8e 100644 --- a/libstdc++-v3/doc/html/manual/io.html +++ b/libstdc++-v3/doc/html/manual/io.html @@ -7,7 +7,7 @@ Standard Contents Â Next
ChapterÂ 13.Â Input and Output - +
Table of Contents
Iostream Objects
Stream Buffers
Derived streambuf Classes
Buffering
Memory Based Streams
Compatibility With strstream
File Based Streams
Copying a File
Binary Input and Output
Interacting with C
Using FILE* and file descriptors
Performance
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 <iostream> when they don't need to -- and that can penalize diff --git a/libstdc++-v3/doc/html/manual/iterators.html b/libstdc++-v3/doc/html/manual/iterators.html index ab4848eb0b50..914fc0dd668c 100644 --- a/libstdc++-v3/doc/html/manual/iterators.html +++ b/libstdc++-v3/doc/html/manual/iterators.html @@ -7,7 +7,7 @@ Standard Contents Â Next
ChapterÂ 10.Â Iterators - +
Table of Contents
Predefined
Iterators vs. Pointers
One Past the End
Predefined
Iterators vs. Pointers
The following FAQ entry points out that diff --git a/libstdc++-v3/doc/html/manual/license.html b/libstdc++-v3/doc/html/manual/license.html index 04c971a059b6..9029df217350 100644 --- a/libstdc++-v3/doc/html/manual/license.html +++ b/libstdc++-v3/doc/html/manual/license.html @@ -92,7 +92,7 @@ requirementsÂ ofÂ theÂ licenseÂ ofÂ GCC.
the web, excluding the pages generated from source comments, are copyrighted by the Free Software Foundation, and placed under the GNU Free Documentation - License version 1.2. There are no Front-Cover Texts, no + License version 1.3. There are no Front-Cover Texts, no Back-Cover Texts, and no Invariant Sections.
For documentation generated by doxygen or other automated tools diff --git a/libstdc++-v3/doc/html/manual/localization.html b/libstdc++-v3/doc/html/manual/localization.html index fdae02ae1c27..f9064b9ade1a 100644 --- a/libstdc++-v3/doc/html/manual/localization.html +++ b/libstdc++-v3/doc/html/manual/localization.html @@ -7,7 +7,7 @@ Standard Contents Â Next
ChapterÂ 8.Â Localization - +
Table of Contents
Locales
locale
Facets
ctype
codecvt
messages
Locales
locale
Describes the basic locale object, including nested classes id, facet, and the reference-counted implementation object, @@ -403,18 +403,18 @@ global locale" (emphasis Paolo), that is: What should non-required facet instantiations do? If the generic implementation is provided, then how to end-users provide specializations? -
Bibliography
+
Bibliography
The GNU C Library . Roland McGrath. Ulrich Drepper. Copyright Â© 2007 FSF. Chapters 6 Character Set Handling and 7 Locales and Internationalization - .
+ .
Correspondence - . Ulrich Drepper. Copyright Â© 2002 .
+ . Ulrich Drepper. Copyright Â© 2002 .
ISO/IEC 14882:1998 Programming languages - C++ - . Copyright Â© 1998 ISO.
+ . Copyright Â© 1998 ISO.
ISO/IEC 9899:1999 Programming languages - C - . Copyright Â© 1999 ISO.
+ . Copyright Â© 1999 ISO.
System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008) @@ -423,11 +423,11 @@ global locale" (emphasis Paolo), that is: . Copyright Â© 2008 The Open Group/The Institute of Electrical and Electronics Engineers, Inc. - .
+ .
The C++ Programming Language, Special Edition . Bjarne Stroustrup. Copyright Â© 2000 Addison Wesley, Inc.. Appendix D. Addison Wesley - .
+ .
Standard C++ IOStreams and Locales . Advanced Programmer's Guide and Reference diff --git a/libstdc++-v3/doc/html/manual/memory.html b/libstdc++-v3/doc/html/manual/memory.html index bbc0e941272a..f4a3c3250dbc 100644 --- a/libstdc++-v3/doc/html/manual/memory.html +++ b/libstdc++-v3/doc/html/manual/memory.html @@ -93,7 +93,7 @@ or loading and unloading shared objects in memory. As such, using caching allocators on systems that do not support abi::__cxa_atexit is not recommended. -
Implementation
Interface Design
+
Implementation
Interface Design
The only allocator interface that is supported is the standard C++ interface. As such, all STL containers have been adjusted, and all external allocators have @@ -106,7 +106,7 @@
The base class that allocator is derived from may not be user-configurable. -
Selecting Default Allocation Policy
+
Selecting Default Allocation Policy
It's difficult to pick an allocation strategy that will provide maximum utility, without excessively penalizing some behavior. In fact, it's difficult just deciding which typical actions to measure @@ -143,7 +143,7 @@ The current default choice for allocator is __gnu_cxx::new_allocator. -
Disabling Memory Caching
+
Disabling Memory Caching
In use, allocator may allocate and deallocate using implementation-specified strategies and heuristics. Because of this, every call to an allocator object's @@ -308,11 +308,11 @@ 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. -
Bibliography
+
Bibliography
ISO/IEC 14882:1998 Programming languages - C++ . isoc++_1998 - 20.4 Memory.
+ 20.4 Memory.
The Standard Librarian: What Are Allocators Good For? @@ -320,19 +320,19 @@ . Matt Austern. C/C++ Users Journal - .
+ .
The Hoard Memory Allocator - . Emery Berger.
+ . Emery Berger.
Reconsidering Custom Memory Allocation - . Emery Berger. Ben Zorn. Kathryn McKinley. Copyright Â© 2002 OOPSLA.
+ . Emery Berger. Ben Zorn. Kathryn McKinley. Copyright Â© 2002 OOPSLA.
Allocator Types @@ -340,9 +340,9 @@ . Klaus Kreft. Angelika Langer. C/C++ Users Journal - .
The C++ Programming Language. Bjarne Stroustrup. Copyright Â© 2000 . 19.4 Allocators. + .
The C++ Programming Language. Bjarne Stroustrup. Copyright Â© 2000 . 19.4 Allocators. Addison Wesley - .
Yalloc: A Recycling C++ Allocator. Felix Yen.
auto_ptr
Limitations
Explaining all of the fun and delicious things that can + .
Yalloc: A Recycling C++ Allocator. Felix Yen.
auto_ptr
Limitations
Explaining all of the fun and delicious things that can happen with misuse of the auto_ptr class template (called AP here) would take some time. Suffice it to say that the use of AP @@ -458,7 +458,7 @@ drops to zero. Derived classes override those functions to destroy resources in a context where the correct dynamic type is known. This is an application of the technique known as type erasure. -
Implementation
Class Hierarchy
+
Implementation
Class Hierarchy
A shared_ptr<T> contains a pointer of type T* and an object of type __shared_count. The shared_count contains a @@ -500,7 +500,7 @@ be forwarded to Tp's constructor. Unlike the other _Sp_counted_* classes, this one is parameterized on the type of object, not the type of pointer; this is purely a convenience that simplifies the implementation slightly. -
--enable-libstdcxx-allocator: This is an abbreviated form of '--enable-libstdcxx-allocator=auto' (described diff --git a/libstdc++-v3/doc/html/manual/containers.html b/libstdc++-v3/doc/html/manual/containers.html index c427178f494f..b99c3c4d612a 100644 --- a/libstdc++-v3/doc/html/manual/containers.html +++ b/libstdc++-v3/doc/html/manual/containers.html @@ -7,7 +7,7 @@ Standard Contents

Allocator (3.4)	Header (3.4)	Allocator (3.[0-3])	Header (3.[0-3])
`__gnu_cxx::new_allocator<T>`	`ext/new_allocator.h`	`std::__new_alloc`	`memory`
`__gnu_cxx::malloc_allocator<T>`	`ext/malloc_allocator.h`	`std::__malloc_alloc_template<int>`	`memory`
`__gnu_cxx::debug_allocator<T>`	`ext/debug_allocator.h`	`std::debug_alloc<T>`	`memory`
`__gnu_cxx::__pool_alloc<T>`	`ext/pool_allocator.h`	`std::__default_alloc_template<bool,int>`	`memory`
`__gnu_cxx::__mt_alloc<T>`	`ext/mt_allocator.h`
`__gnu_cxx::bitmap_allocator<T>`	`ext/bitmap_allocator.h`

Allocator (3.4)	Header (3.4)	Allocator (3.[0-3])	Header (3.[0-3])
`__gnu_cxx::new_allocator<T>`	`ext/new_allocator.h`	`std::__new_alloc`	`memory`
`__gnu_cxx::malloc_allocator<T>`	`ext/malloc_allocator.h`	`std::__malloc_alloc_template<int>`	`memory`
`__gnu_cxx::debug_allocator<T>`	`ext/debug_allocator.h`	`std::debug_alloc<T>`	`memory`
`__gnu_cxx::__pool_alloc<T>`	`ext/pool_allocator.h`	`std::__default_alloc_template<bool,int>`	`memory`
`__gnu_cxx::__mt_alloc<T>`	`ext/mt_allocator.h`
`__gnu_cxx::bitmap_allocator<T>`	`ext/bitmap_allocator.h`

Allocator	Include	Version
`__gnu_cxx::array_allocator<T>`	`ext/array_allocator.h`	4.0.0
`__gnu_cxx::throw_allocator<T>`	`ext/throw_allocator.h`	4.2.0

Allocator	Include	Version
`__gnu_cxx::array_allocator<T>`	`ext/array_allocator.h`	4.0.0
`__gnu_cxx::throw_allocator<T>`	`ext/throw_allocator.h`	4.2.0

AppendixÂ E.Â GNU Free Documentation License
PrevÂ	PartÂ IV.Â Appendices -	Â Next

Container	Header	Debug container	Debug header
`std::bitset`	`bitset`	`__gnu_debug::bitset`	`<debug/bitset>`
`std::deque`	`deque`	`__gnu_debug::deque`	`<debug/deque>`
`std::list`	`list`	`__gnu_debug::list`	`<debug/list>`
`std::map`	`map`	`__gnu_debug::map`	`<debug/map>`
`std::multimap`	`map`	`__gnu_debug::multimap`	`<debug/map>`
`std::multiset`	`set`	`__gnu_debug::multiset`	`<debug/set>`
`std::set`	`set`	`__gnu_debug::set`	`<debug/set>`
`std::string`	`string`	`__gnu_debug::string`	`<debug/string>`
`std::wstring`	`string`	`__gnu_debug::wstring`	`<debug/string>`
`std::basic_string`	`string`	`__gnu_debug::basic_string`	`<debug/string>`
`std::vector`	`vector`	`__gnu_debug::vector`	`<debug/vector>`

Container	Header	Debug container	Debug header
`std::bitset`	`bitset`	`__gnu_debug::bitset`	`<debug/bitset>`
`std::deque`	`deque`	`__gnu_debug::deque`	`<debug/deque>`
`std::list`	`list`	`__gnu_debug::list`	`<debug/list>`
`std::map`	`map`	`__gnu_debug::map`	`<debug/map>`
`std::multimap`	`map`	`__gnu_debug::multimap`	`<debug/map>`
`std::multiset`	`set`	`__gnu_debug::multiset`	`<debug/set>`
`std::set`	`set`	`__gnu_debug::set`	`<debug/set>`
`std::string`	`string`	`__gnu_debug::string`	`<debug/string>`
`std::wstring`	`string`	`__gnu_debug::wstring`	`<debug/string>`
`std::basic_string`	`string`	`__gnu_debug::basic_string`	`<debug/string>`
`std::vector`	`vector`	`__gnu_debug::vector`	`<debug/vector>`

Container	Header	Debug container	Debug header
`std::unordered_map`	`unordered_map`	`__gnu_debug::unordered_map`	`<debug/unordered_map>`
`std::unordered_multimap`	`unordered_map`	`__gnu_debug::unordered_multimap`	`<debug/unordered_map>`
`std::unordered_set`	`unordered_set`	`__gnu_debug::unordered_set`	`<debug/unordered_set>`
`std::unordered_multiset`	`unordered_set`	`__gnu_debug::unordered_multiset`	`<debug/unordered_set>`

Container	Header	Debug container	Debug header
`std::unordered_map`	`unordered_map`	`__gnu_debug::unordered_map`	`<debug/unordered_map>`
`std::unordered_multimap`	`unordered_map`	`__gnu_debug::unordered_multimap`	`<debug/unordered_map>`
`std::unordered_set`	`unordered_set`	`__gnu_debug::unordered_set`	`<debug/unordered_set>`
`std::unordered_multiset`	`unordered_set`	`__gnu_debug::unordered_multiset`	`<debug/unordered_set>`

Algorithm	Header	Parallel algorithm	Parallel header
`std::accumulate`	`numeric`	`__gnu_parallel::accumulate`	`parallel/numeric`
`std::adjacent_difference`	`numeric`	`__gnu_parallel::adjacent_difference`	`parallel/numeric`
`std::inner_product`	`numeric`	`__gnu_parallel::inner_product`	`parallel/numeric`
`std::partial_sum`	`numeric`	`__gnu_parallel::partial_sum`	`parallel/numeric`
`std::adjacent_find`	`algorithm`	`__gnu_parallel::adjacent_find`	`parallel/algorithm`
`std::count`	`algorithm`	`__gnu_parallel::count`	`parallel/algorithm`
`std::count_if`	`algorithm`	`__gnu_parallel::count_if`	`parallel/algorithm`
`std::equal`	`algorithm`	`__gnu_parallel::equal`	`parallel/algorithm`
`std::find`	`algorithm`	`__gnu_parallel::find`	`parallel/algorithm`
`std::find_if`	`algorithm`	`__gnu_parallel::find_if`	`parallel/algorithm`
`std::find_first_of`	`algorithm`	`__gnu_parallel::find_first_of`	`parallel/algorithm`
`std::for_each`	`algorithm`	`__gnu_parallel::for_each`	`parallel/algorithm`
`std::generate`	`algorithm`	`__gnu_parallel::generate`	`parallel/algorithm`
`std::generate_n`	`algorithm`	`__gnu_parallel::generate_n`	`parallel/algorithm`
`std::lexicographical_compare`	`algorithm`	`__gnu_parallel::lexicographical_compare`	`parallel/algorithm`
`std::mismatch`	`algorithm`	`__gnu_parallel::mismatch`	`parallel/algorithm`
`std::search`	`algorithm`	`__gnu_parallel::search`	`parallel/algorithm`
`std::search_n`	`algorithm`	`__gnu_parallel::search_n`	`parallel/algorithm`
`std::transform`	`algorithm`	`__gnu_parallel::transform`	`parallel/algorithm`
`std::replace`	`algorithm`	`__gnu_parallel::replace`	`parallel/algorithm`
`std::replace_if`	`algorithm`	`__gnu_parallel::replace_if`	`parallel/algorithm`
`std::max_element`	`algorithm`	`__gnu_parallel::max_element`	`parallel/algorithm`
`std::merge`	`algorithm`	`__gnu_parallel::merge`	`parallel/algorithm`
`std::min_element`	`algorithm`	`__gnu_parallel::min_element`	`parallel/algorithm`
`std::nth_element`	`algorithm`	`__gnu_parallel::nth_element`	`parallel/algorithm`
`std::partial_sort`	`algorithm`	`__gnu_parallel::partial_sort`	`parallel/algorithm`
`std::partition`	`algorithm`	`__gnu_parallel::partition`	`parallel/algorithm`
`std::random_shuffle`	`algorithm`	`__gnu_parallel::random_shuffle`	`parallel/algorithm`
`std::set_union`	`algorithm`	`__gnu_parallel::set_union`	`parallel/algorithm`
`std::set_intersection`	`algorithm`	`__gnu_parallel::set_intersection`	`parallel/algorithm`
`std::set_symmetric_difference`	`algorithm`	`__gnu_parallel::set_symmetric_difference`	`parallel/algorithm`
`std::set_difference`	`algorithm`	`__gnu_parallel::set_difference`	`parallel/algorithm`
`std::sort`	`algorithm`	`__gnu_parallel::sort`	`parallel/algorithm`
`std::stable_sort`	`algorithm`	`__gnu_parallel::stable_sort`	`parallel/algorithm`
`std::unique_copy`	`algorithm`	`__gnu_parallel::unique_copy`	`parallel/algorithm`

Algorithm	Header	Parallel algorithm	Parallel header
`std::accumulate`	`numeric`	`__gnu_parallel::accumulate`	`parallel/numeric`
`std::adjacent_difference`	`numeric`	`__gnu_parallel::adjacent_difference`	`parallel/numeric`
`std::inner_product`	`numeric`	`__gnu_parallel::inner_product`	`parallel/numeric`
`std::partial_sum`	`numeric`	`__gnu_parallel::partial_sum`	`parallel/numeric`
`std::adjacent_find`	`algorithm`	`__gnu_parallel::adjacent_find`	`parallel/algorithm`
`std::count`	`algorithm`	`__gnu_parallel::count`	`parallel/algorithm`
`std::count_if`	`algorithm`	`__gnu_parallel::count_if`	`parallel/algorithm`
`std::equal`	`algorithm`	`__gnu_parallel::equal`	`parallel/algorithm`
`std::find`	`algorithm`	`__gnu_parallel::find`	`parallel/algorithm`
`std::find_if`	`algorithm`	`__gnu_parallel::find_if`	`parallel/algorithm`
`std::find_first_of`	`algorithm`	`__gnu_parallel::find_first_of`	`parallel/algorithm`
`std::for_each`	`algorithm`	`__gnu_parallel::for_each`	`parallel/algorithm`
`std::generate`	`algorithm`	`__gnu_parallel::generate`	`parallel/algorithm`
`std::generate_n`	`algorithm`	`__gnu_parallel::generate_n`	`parallel/algorithm`
`std::lexicographical_compare`	`algorithm`	`__gnu_parallel::lexicographical_compare`	`parallel/algorithm`
`std::mismatch`	`algorithm`	`__gnu_parallel::mismatch`	`parallel/algorithm`
`std::search`	`algorithm`	`__gnu_parallel::search`	`parallel/algorithm`
`std::search_n`	`algorithm`	`__gnu_parallel::search_n`	`parallel/algorithm`
`std::transform`	`algorithm`	`__gnu_parallel::transform`	`parallel/algorithm`
`std::replace`	`algorithm`	`__gnu_parallel::replace`	`parallel/algorithm`
`std::replace_if`	`algorithm`	`__gnu_parallel::replace_if`	`parallel/algorithm`
`std::max_element`	`algorithm`	`__gnu_parallel::max_element`	`parallel/algorithm`
`std::merge`	`algorithm`	`__gnu_parallel::merge`	`parallel/algorithm`
`std::min_element`	`algorithm`	`__gnu_parallel::min_element`	`parallel/algorithm`
`std::nth_element`	`algorithm`	`__gnu_parallel::nth_element`	`parallel/algorithm`
`std::partial_sort`	`algorithm`	`__gnu_parallel::partial_sort`	`parallel/algorithm`
`std::partition`	`algorithm`	`__gnu_parallel::partition`	`parallel/algorithm`
`std::random_shuffle`	`algorithm`	`__gnu_parallel::random_shuffle`	`parallel/algorithm`
`std::set_union`	`algorithm`	`__gnu_parallel::set_union`	`parallel/algorithm`
`std::set_intersection`	`algorithm`	`__gnu_parallel::set_intersection`	`parallel/algorithm`
`std::set_symmetric_difference`	`algorithm`	`__gnu_parallel::set_symmetric_difference`	`parallel/algorithm`
`std::set_difference`	`algorithm`	`__gnu_parallel::set_difference`	`parallel/algorithm`
`std::sort`	`algorithm`	`__gnu_parallel::sort`	`parallel/algorithm`
`std::stable_sort`	`algorithm`	`__gnu_parallel::stable_sort`	`parallel/algorithm`
`std::unique_copy`	`algorithm`	`__gnu_parallel::unique_copy`	`parallel/algorithm`

Design
PrevÂ	ChapterÂ 19.Â Profile Mode	Â Next

HTML	Doxygen
\	\\
"	\"
'	\'
<i>	@a word
<b>	@b word
<code>	@c word
<em>	@a word
<em>	<em>two words or more</em>

HTML	Doxygen
\	\\
"	\"
'	\'
<i>	@a word
<b>	@b word
<code>	@c word
<em>	@a word
<em>	<em>two words or more</em>

Use

Examples

Examples of use can be found in the testsuite, under testsuite/tr1/2_general_utilities/shared_ptr. -

Unresolved Issues

The resolution to C++ Standard Library issue 674, "shared_ptr interface changes for consistency with N1856" will need to be implemented after it is accepted into the working @@ -694,7 +694,7 @@ be private. code to work with, Peter Dimov in particular for his help and invaluable advice on thread safety. Phillip Jordan and Paolo Carlini for the lock policy implementation. -

Bibliography

Improving shared_ptr for C++0x, Revision 2 @@ -702,7 +702,7 @@ be private. . N2351 - .

+ .

C++ Standard Library Active Issues List @@ -710,7 +710,7 @@ be private. . N2456 - .

+ .

Working Draft, Standard for Programming Language C++ @@ -718,7 +718,7 @@ be private. . N2461 - .

+ .

shared_ptr Boost C++ Libraries documentation, shared_ptr diff --git a/libstdc++-v3/doc/html/manual/numerics.html b/libstdc++-v3/doc/html/manual/numerics.html index 9b0ca1e65a3e..4a79b8d845f1 100644 --- a/libstdc++-v3/doc/html/manual/numerics.html +++ b/libstdc++-v3/doc/html/manual/numerics.html @@ -7,7 +7,7 @@ Standard Contents Â Next

ChapterÂ 12.Â Numerics - +

Table of Contents

Complex

complex Processing

Generalized Operations

Interacting with C

Numerics vs. Arrays
C99

Complex

complex Processing

Using complex<> becomes even more comple- er, sorry, diff --git a/libstdc++-v3/doc/html/manual/parallel_mode.html b/libstdc++-v3/doc/html/manual/parallel_mode.html index 0b4decfc067e..c3086ca77f9f 100644 --- a/libstdc++-v3/doc/html/manual/parallel_mode.html +++ b/libstdc++-v3/doc/html/manual/parallel_mode.html @@ -13,11 +13,11 @@ explicit source declaration or by compiling existing sources with a specific compiler flag.

Intro

The following library components in the include numeric are included in the parallel mode:

std::accumulate
std::adjacent_difference
std::inner_product
std::partial_sum

The following library components in the include -algorithm are included in the parallel mode:

std::adjacent_find
std::count
std::count_if
std::equal
std::find
std::find_if
std::find_first_of
std::for_each
std::generate
std::generate_n
std::lexicographical_compare
std::mismatch
std::search
std::search_n
std::transform
std::replace
std::replace_if
std::max_element
std::merge
std::min_element
std::nth_element
std::partial_sort
std::partition
std::random_shuffle
std::set_union
std::set_intersection
std::set_symmetric_difference
std::set_difference
std::sort
std::stable_sort
std::unique_copy

Bibliography

+algorithm are included in the parallel mode:
std::adjacent_find
std::count
std::count_if
std::equal
std::find
std::find_if
std::find_first_of
std::for_each
std::generate
std::generate_n
std::lexicographical_compare
std::mismatch
std::search
std::search_n
std::transform
std::replace
std::replace_if
std::max_element
std::merge
std::min_element
std::nth_element
std::partial_sort
std::partition
std::random_shuffle
std::set_union
std::set_intersection
std::set_symmetric_difference
std::set_difference
std::sort
std::stable_sort
std::unique_copy

Bibliography

+ .

The Multi-Core Standard Template Library . Johannes Singler. Peter Sanders. Felix Putze. Copyright Â© 2007 . Euro-Par 2007: Parallel Processing. (LNCS 4641) diff --git a/libstdc++-v3/doc/html/manual/profile_mode.html b/libstdc++-v3/doc/html/manual/profile_mode.html index 78e8a52a4899..a7f38d38a513 100644 --- a/libstdc++-v3/doc/html/manual/profile_mode.html +++ b/libstdc++-v3/doc/html/manual/profile_mode.html @@ -138,7 +138,7 @@ vector-size: improvement = 3: call stack = 0x804842c ... call context. (Environment variable not supported.)

Bibliography

Perflint: A Context Sensitive Performance Advisor for C++ Programs . Lixia Liu. Silvius Rus. Copyright Â© 2009 . Proceedings of the 2009 International Symposium on Code Generation diff --git a/libstdc++-v3/doc/html/manual/setup.html b/libstdc++-v3/doc/html/manual/setup.html index 23de8cc52198..749662d555bd 100644 --- a/libstdc++-v3/doc/html/manual/setup.html +++ b/libstdc++-v3/doc/html/manual/setup.html @@ -48,14 +48,8 @@
linux
If gcc 3.1.0 or later on is being used on linux, an attempt will be made to use "C" library functionality necessary for - C++ named locale support. For gcc 3.2.1 and later, this - means that glibc 2.2.5 or later is required and the "C" - library de_DE locale information must be installed. -
- Note however that the sanity checks involving the de_DE - locale are skipped when an explicit --enable-clocale=gnu - configure option is used: only the basic checks are carried - out, defending against misconfigurations. + C++ named locale support. For gcc 4.6.0 and later, this + means that glibc 2.3 or later is required.
If the 'gnu' locale model is being used, the following locales are used and tested in the libstdc++ testsuites. diff --git a/libstdc++-v3/doc/html/manual/spine.html b/libstdc++-v3/doc/html/manual/spine.html index 9de2812422fe..eb6dcdf811f6 100644 --- a/libstdc++-v3/doc/html/manual/spine.html +++ b/libstdc++-v3/doc/html/manual/spine.html @@ -2,7 +2,7 @@ The GNU C++ Library
The GNU C++ Library
PrevÂ Â Â Next
The GNU C++ Library
Copyright Â© 2009, 2010 FSF -
+
License
Table of Contents
I. Introduction @@ -61,7 +61,7 @@
D. GNU General Public License version 3 -
E. GNU Free Documentation License
List of Tables
1.1. C++ 1998/2003 Implementation Status
1.2. C++ 200x Implementation Status
1.3. C++ TR1 Implementation Status
1.4. C++ TR 24733 Implementation Status
3.1. C++ Command Options
3.2. C++ 1998 Library Headers
3.3. C++ 1998 Library Headers for C Library Facilities
3.4. C++ 200x Library Headers
3.5. C++ 200x Library Headers for C Library Facilities
3.6. C++ TR 1 Library Headers
3.7. C++ TR 1 Library Headers for C Library Facilities
3.8. C++ TR 24733 Decimal Floating-Point Header
3.9. C++ ABI Headers
3.10. Extension Headers
3.11. Extension Debug Headers
3.12. Extension Profile Headers
3.13. Extension Parallel Headers
17.1. Debugging Containers
17.2. Debugging Containers C++0x
18.1. Parallel Algorithms
19.1. Profile Code Location
19.2. Profile Diagnostics
20.1. Bitmap Allocator Memory Map
A.1. HTML to Doxygen Markup Comparison
A.2. HTML to Docbook XML Markup Comparison
A.3. Docbook XML Element Use
B.1. Extension Allocators
B.2. Extension Allocators Continued

PrevÂ Â Â Next

The GNU C++ Library DocumentationÂ

Home

Â PartÂ I.Â +

E. GNU Free Documentation License

List of Tables

1.1. C++ 1998/2003 Implementation Status
1.2. C++ 200x Implementation Status
1.3. C++ TR1 Implementation Status
1.4. C++ TR 24733 Implementation Status
3.1. C++ Command Options
3.2. C++ 1998 Library Headers
3.3. C++ 1998 Library Headers for C Library Facilities
3.4. C++ 200x Library Headers
3.5. C++ 200x Library Headers for C Library Facilities
3.6. C++ TR 1 Library Headers
3.7. C++ TR 1 Library Headers for C Library Facilities
3.8. C++ TR 24733 Decimal Floating-Point Header
3.9. C++ ABI Headers
3.10. Extension Headers
3.11. Extension Debug Headers
3.12. Extension Profile Headers
3.13. Extension Parallel Headers
17.1. Debugging Containers
17.2. Debugging Containers C++0x
18.1. Parallel Algorithms
19.1. Profile Code Location
19.2. Profile Diagnostics
20.1. Bitmap Allocator Memory Map
A.1. HTML to Doxygen Markup Comparison
A.2. HTML to Docbook XML Markup Comparison
A.3. Docbook XML Element Use
B.1. Extension Allocators
B.2. Extension Allocators Continued

PrevÂ	Â	Â Next
The GNU C++ Library DocumentationÂ	Home	Â PartÂ I.Â Introduction

diff --git a/libstdc++-v3/doc/html/manual/status.html b/libstdc++-v3/doc/html/manual/status.html index 257a1f325934..af8b1d4dbff9 100644 --- a/libstdc++-v3/doc/html/manual/status.html +++ b/libstdc++-v3/doc/html/manual/status.html @@ -8,7 +8,7 @@ This status table is based on the table of contents of ISO/IEC 14882:2003.

This page describes the C++ support in mainline GCC SVN, not in any particular release. -

TableÂ 1.1.Â C++ 1998/2003 Implementation Status

Section Description Status Comments

TableÂ 1.1.Â C++ 1998/2003 Implementation Status

Section Description Status Comments

Language support @@ -157,11 +157,11 @@ presence of the required flag.

This page describes the C++0x support in mainline GCC SVN, not in any particular release. -

TableÂ 1.2.Â C++ 200x Implementation Status

Section Description Status Comments

TableÂ 1.2.Â C++ 200x Implementation Status

Section Description Status Comments

18 Language support -

18.1 General Y Â

18.2 Types Partial Missing offsetof, max_align_t, nullptr_t

18.3 Implementation properties Â Â

18.3.1 Numeric Limits Â Â

18.3.1.1 Class template numeric_limits Y Â

18.3.1.2 numeric_limits members Partial Missing constexpr

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 Â

18.5 Start and termination Partial C library dependency for quick_exit, at_quick_exit

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 Â

18.1 General Y Â

18.2 Types Partial Missing offsetof, max_align_t

18.3 Implementation properties Â Â

18.3.1 Numeric Limits Â Â

18.3.1.1 Class template numeric_limits Y Â

18.3.1.2 numeric_limits members Partial Missing constexpr

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 Â

18.5 Start and termination Partial C library dependency for quick_exit, at_quick_exit

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 Â

19 Diagnostics @@ -169,7 +169,7 @@ particular release. 20 General utilities -

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 Â Â

20.3.5.2 Class template pair Partial Missing constexpr

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 Â Â

20.4.2 Class template tuple Partial Missing constexpr and range access

20.5 Class template bitset Partial Missing constexpr

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 Â

20.7.4.3 Type properties Partial Missing is_system_layout

20.7.5 Relationships between types Y Â

20.7.6 Transformations between types Partial Missing underlying_type

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 Class template shared_ptr Y +

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 Â Â

20.3.5.2 Class template pair Partial Missing constexpr

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 Â Â

20.4.2 Class template tuple Partial Missing constexpr and range access

20.5 Class template bitset Partial Missing constexpr

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 Â

20.7.4.3 Type properties Partial Missing is_trivially_copyable, is_literal_type, is_nothrow_constructible

20.7.5 Relationships between types Y Â

20.7.6 Transformations between types Partial Missing underlying_type

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

Class template shared_ptr

Uses code from boost::shared_ptr. @@ -214,7 +214,7 @@ particular release. 30

Thread support -

30.1 General Y Â

30.2 Requirements Y Â

30.3 Threads Â Â

30.3.1 Class thread Y Â

30.3.2 Namespace this_thread Y Â

30.4 Mutual exclusion Â Â

30.4.1 Mutex requirements Â Â

30.4.1.1 Class mutex Y Â

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 once_flag Y Missing constexpr

30.4.5.2 call_once Y Â

30.5 Condition variables Â Â

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 Error handling Y Missing constexpr

30.6.3 Class future_error Y Â

30.6.4 Associated asynchronous state Y Â

30.6.5 Class template promise Partial Missing allocator_arg_t

30.6.6 Class template future Y Â

30.6.7 Class template shared_future Y Â

30.6.8 Class template atomic_future N Â

30.6.9 Function template async Y Â

30.6.10 Class template packaged_task Partial Missing allocator_arg_t

30.1 General Y Â

30.2 Requirements Y Â

30.3 Threads Â Â

30.3.1 Class thread Partial thread::id is not trivially copyable

30.3.2 Namespace this_thread Y Â

30.4 Mutual exclusion Â Â

30.4.1 Mutex requirements Â Â

30.4.1.1 Class mutex Y Â

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 once_flag Y Missing constexpr

30.4.5.2 call_once Y Â

30.5 Condition variables Â Â

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 Error handling Y Missing constexpr

30.6.3 Class future_error Y Â

30.6.4 Associated asynchronous state Y Â

30.6.5 Class template promise Partial Missing allocator_arg_t

30.6.6 Class template future Y Â

30.6.7 Class template shared_future Y Â

30.6.8 Class template atomic_future N Â

30.6.9 Function template async Y Â

30.6.10 Class template packaged_task Partial Missing allocator_arg_t

Appendix D

Compatibility features @@ -229,7 +229,7 @@ In this implementation the header names are prefixed by

This page describes the TR1 support in mainline GCC SVN, not in any particular release. -

TableÂ 1.3.Â C++ TR1 Implementation Status

Section Description Status Comments

2 General Utilities

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

TableÂ 1.3.Â C++ TR1 Implementation Status

Section Description Status Comments

2 General Utilities

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. @@ -242,7 +242,7 @@ decimal floating-point arithmetic

This page describes the TR 24733 support in mainline GCC SVN, not in any particular release. -

TableÂ 1.4.Â C++ TR 24733 Implementation Status

Section Description Status Comments

TableÂ 1.4.Â C++ TR 24733 Implementation Status

Section	Description	Status	Comments
0	Introduction diff --git a/libstdc++-v3/doc/html/manual/strings.html b/libstdc++-v3/doc/html/manual/strings.html index 847ee3fb3534..83bd8cbead5e 100644 --- a/libstdc++-v3/doc/html/manual/strings.html +++ b/libstdc++-v3/doc/html/manual/strings.html @@ -7,7 +7,7 @@ Standard Contents			Â Next

ChapterÂ 7.Â Strings - +

Table of Contents

String Classes

Simple Transformations
Case Sensitivity
Arbitrary Character Types
Tokenizing
Shrink to Fit
CString (MFC)

String Classes

Simple Transformations

Here are Standard, simple, and portable ways to perform common transformations on a string instance, such as diff --git a/libstdc++-v3/doc/html/manual/support.html b/libstdc++-v3/doc/html/manual/support.html index d351fdf8ee52..c7e66e87a97d 100644 --- a/libstdc++-v3/doc/html/manual/support.html +++ b/libstdc++-v3/doc/html/manual/support.html @@ -7,7 +7,7 @@ Standard Contents

Â Next

ChapterÂ 4.Â Support - +

Table of Contents

Types

Fundamental Types
Numeric Properties
NULL

Dynamic Memory

Termination

Termination Handlers
Verbose Terminate Handler

This part deals with the functions called and objects created automatically during the course of a program's existence. diff --git a/libstdc++-v3/doc/html/manual/test.html b/libstdc++-v3/doc/html/manual/test.html index 31665b18de4d..c472fb8c5bca 100644 --- a/libstdc++-v3/doc/html/manual/test.html +++ b/libstdc++-v3/doc/html/manual/test.html @@ -493,7 +493,7 @@ only default variables. reporting functions including:

time_counter
resource_counter
report_performance

Special Topics

Qualifying Exception Safety Guarantees - +

Overview

Testing is composed of running a particular test sequence, and looking at what happens to the surrounding code when diff --git a/libstdc++-v3/doc/html/manual/using.html b/libstdc++-v3/doc/html/manual/using.html index 3739db609104..8b795e1056ba 100644 --- a/libstdc++-v3/doc/html/manual/using.html +++ b/libstdc++-v3/doc/html/manual/using.html @@ -11,5 +11,5 @@ enumerated and detailed in the table below.

By default, g++ is equivalent to g++ -std=gnu++98. The standard library also defaults to this dialect. -

TableÂ 3.1.Â C++ Command Options

Option Flags Description

-std=c++98 Use the 1998 ISO C++ standard plus amendments.

-std=gnu++98 As directly above, with GNU extensions.

-std=c++0x Use the working draft of the upcoming ISO C++0x standard.

-std=gnu++0x As directly above, with GNU extensions.

-fexceptions See exception-free dialect

-frtti As above, but RTTI-free dialect.

-pthread or -pthreads

For ISO C++0x <thread>, <future>, +

TableÂ 3.1.Â C++ Command Options

Option Flags	Description
`-std=c++98`	Use the 1998 ISO C++ standard plus amendments.
`-std=gnu++98`	As directly above, with GNU extensions.
`-std=c++0x`	Use the working draft of the upcoming ISO C++0x standard.
`-std=gnu++0x`	As directly above, with GNU extensions.
`-fexceptions`	See exception-free dialect
`-frtti`	As above, but RTTI-free dialect.
`-pthread` or `-pthreads`	For ISO C++0x <thread>, <future>, <mutex>, or <condition_variable>.
`-fopenmp`	For parallel mode.

PrevÂ	Up	Â Next
MakeÂ	Home	Â Headers

diff --git a/libstdc++-v3/doc/html/manual/using_exceptions.html b/libstdc++-v3/doc/html/manual/using_exceptions.html index 9a9db87e243d..2792f7000f80 100644 --- a/libstdc++-v3/doc/html/manual/using_exceptions.html +++ b/libstdc++-v3/doc/html/manual/using_exceptions.html @@ -266,7 +266,7 @@ is called. } catch(...) { this->_M_setstate(ios_base::badbit); } -

Bibliography

+ .

Error and Exception Handling @@ -285,7 +285,7 @@ is called. . David Abrahams . Boost - .

+ .

Exception-Safety in Generic Components @@ -293,7 +293,7 @@ is called. . David Abrahams. Boost - .

+ .

Standard Library Exception Policy @@ -301,7 +301,7 @@ is called. . Matt Austern. WG21 N1077 - .

+ .

ia64 c++ abi exception handling @@ -309,17 +309,17 @@ is called. . Richard Henderson. GNU - .

+ .

Appendix E: Standard-Library Exception Safety - . Bjarne Stroustrup.

+ . Bjarne Stroustrup.

Exceptional C++ . Exception-Safety Issues and Techniques - . Herb Sutter.

+ . Herb Sutter.

GCC Bug 25191: exception_defines.h #defines try/catch diff --git a/libstdc++-v3/doc/html/manual/using_headers.html b/libstdc++-v3/doc/html/manual/using_headers.html index 3fa370449b44..fdc17d1912a8 100644 --- a/libstdc++-v3/doc/html/manual/using_headers.html +++ b/libstdc++-v3/doc/html/manual/using_headers.html @@ -20,19 +20,19 @@ upcoming 200x standard.
C++98/03 include files. These are available in the default compilation mode, i.e. -std=c++98 or -std=gnu++98. -
TableÂ 3.2.Â C++ 1998 Library Headers
algorithm bitset complex deque exception
fstream functional iomanip ios iosfwd
iostream istream iterator limits list
locale map memory new numeric
ostream queue set sstream stack
stdexcept streambuf string utility typeinfo
valarray vector Â Â Â

TableÂ 3.3.Â C++ 1998 Library Headers for C Library Facilities
cassert cerrno cctype cfloat ciso646
climits clocale cmath csetjmp csignal
cstdarg cstddef cstdio cstdlib cstring
ctime cwchar cwctype Â Â

+
TableÂ 3.2.Â C++ 1998 Library Headers
algorithm bitset complex deque exception
fstream functional iomanip ios iosfwd
iostream istream iterator limits list
locale map memory new numeric
ostream queue set sstream stack
stdexcept streambuf string utility typeinfo
valarray vector Â Â Â

TableÂ 3.3.Â C++ 1998 Library Headers for C Library Facilities
cassert cerrno cctype cfloat ciso646
climits clocale cmath csetjmp csignal
cstdarg cstddef cstdio cstdlib cstring
ctime cwchar cwctype Â Â

C++0x include files. These are only available in C++0x compilation mode, i.e. -std=c++0x or -std=gnu++0x. -
TableÂ 3.4.Â C++ 200x Library Headers
algorithm array bitset chrono complex
condition_variable deque exception forward_list fstream
functional future initalizer_list iomanip ios
iosfwd iostream istream iterator limits
list locale map memory mutex
new numeric ostream queue random
ratio regex set sstream stack
stdexcept streambuf string system_error thread
tuple type_traits typeinfo unordered_map unordered_set
utility valarray vector Â Â

TableÂ 3.5.Â C++ 200x Library Headers for C Library Facilities
cassert ccomplex cctype cerrno cfenv
cfloat cinttypes ciso646 climits clocale
cmath csetjmp csignal cstdarg cstdbool
cstddef cstdint cstdlib cstdio cstring
ctgmath ctime cuchar cwchar cwctype
stdatomic.h Â Â Â Â

+
TableÂ 3.4.Â C++ 200x Library Headers
algorithm array bitset chrono complex
condition_variable deque exception forward_list fstream
functional future initalizer_list iomanip ios
iosfwd iostream istream iterator limits
list locale map memory mutex
new numeric ostream queue random
ratio regex set sstream stack
stdexcept streambuf string system_error thread
tuple type_traits typeinfo unordered_map unordered_set
utility valarray vector Â Â

TableÂ 3.5.Â C++ 200x Library Headers for C Library Facilities
cassert ccomplex cctype cerrno cfenv
cfloat cinttypes ciso646 climits clocale
cmath csetjmp csignal cstdarg cstdbool
cstddef cstdint cstdlib cstdio cstring
ctgmath ctime cuchar cwchar cwctype
stdatomic.h Â Â Â Â

In addition, TR1 includes as: -
TableÂ 3.6.Â C++ TR 1 Library Headers
tr1/array tr1/complex tr1/memory tr1/functional tr1/random
tr1/regex tr1/tuple tr1/type_traits tr1/unordered_map tr1/unordered_set
tr1/utility Â Â Â Â

TableÂ 3.7.Â C++ TR 1 Library Headers for C Library Facilities
tr1/ccomplex tr1/cfenv tr1/cfloat tr1/cmath tr1/cinttypes
tr1/climits tr1/cstdarg tr1/cstdbool tr1/cstdint tr1/cstdio
tr1/cstdlib tr1/ctgmath tr1/ctime tr1/cwchar tr1/cwctype

Decimal floating-point arithmetic is available if the C++ +
TableÂ 3.6.Â C++ TR 1 Library Headers
tr1/array tr1/complex tr1/memory tr1/functional tr1/random
tr1/regex tr1/tuple tr1/type_traits tr1/unordered_map tr1/unordered_set
tr1/utility Â Â Â Â

TableÂ 3.7.Â C++ TR 1 Library Headers for C Library Facilities
tr1/ccomplex tr1/cfenv tr1/cfloat tr1/cmath tr1/cinttypes
tr1/climits tr1/cstdarg tr1/cstdbool tr1/cstdint tr1/cstdio
tr1/cstdlib tr1/ctgmath tr1/ctime tr1/cwchar tr1/cwctype

Decimal floating-point arithmetic is available if the C++ compiler supports scalar decimal floating-point types defined via __attribute__((mode(SD|DD|LD))). -
TableÂ 3.8.Â C++ TR 24733 Decimal Floating-Point Header
decimal/decimal

+
TableÂ 3.8.Â C++ TR 24733 Decimal Floating-Point Header
decimal/decimal

Also included are files for the C++ ABI interface: -
TableÂ 3.9.Â C++ ABI Headers
cxxabi.h cxxabi_forced.h

+
TableÂ 3.9.Â C++ ABI Headers
cxxabi.h cxxabi_forced.h

And a large variety of extensions. -
TableÂ 3.10.Â Extension Headers
ext/algorithm ext/atomicity.h ext/array_allocator.h ext/bitmap_allocator.h ext/cast.h
ext/codecvt_specializations.h ext/concurrence.h ext/debug_allocator.h ext/enc_filebuf.h ext/extptr_allocator.h
ext/functional ext/iterator ext/malloc_allocator.h ext/memory ext/mt_allocator.h
ext/new_allocator.h ext/numeric ext/numeric_traits.h ext/pb_ds/assoc_container.h ext/pb_ds/priority_queue.h
ext/pod_char_traits.h ext/pool_allocator.h ext/rb_tree ext/rope ext/slist
ext/stdio_filebuf.h ext/stdio_sync_filebuf.h ext/throw_allocator.h ext/typelist.h ext/type_traits.h
ext/vstring.h Â Â Â Â

TableÂ 3.11.Â Extension Debug Headers
debug/bitset debug/deque debug/list debug/map debug/set
debug/string debug/unordered_map debug/unordered_set debug/vector Â

TableÂ 3.12.Â Extension Profile Headers
profile/bitset profile/deque profile/list profile/map
profile/set profile/unordered_map profile/unordered_set profile/vector

TableÂ 3.13.Â Extension Parallel Headers
parallel/algorithm parallel/numeric

Mixing Headers

A few simple rules. +

TableÂ 3.10.Â Extension Headers
ext/algorithm ext/atomicity.h ext/array_allocator.h ext/bitmap_allocator.h ext/cast.h
ext/codecvt_specializations.h ext/concurrence.h ext/debug_allocator.h ext/enc_filebuf.h ext/extptr_allocator.h
ext/functional ext/iterator ext/malloc_allocator.h ext/memory ext/mt_allocator.h
ext/new_allocator.h ext/numeric ext/numeric_traits.h ext/pb_ds/assoc_container.h ext/pb_ds/priority_queue.h
ext/pod_char_traits.h ext/pool_allocator.h ext/rb_tree ext/rope ext/slist
ext/stdio_filebuf.h ext/stdio_sync_filebuf.h ext/throw_allocator.h ext/typelist.h ext/type_traits.h
ext/vstring.h Â Â Â Â

TableÂ 3.11.Â Extension Debug Headers
debug/bitset debug/deque debug/list debug/map debug/set
debug/string debug/unordered_map debug/unordered_set debug/vector Â

TableÂ 3.12.Â Extension Profile Headers
profile/bitset profile/deque profile/list profile/map
profile/set profile/unordered_map profile/unordered_set profile/vector

TableÂ 3.13.Â Extension Parallel Headers
parallel/algorithm parallel/numeric

Mixing Headers

A few simple rules.

First, mixing different dialects of the standard headers is not possible. It's an all-or-nothing affair. Thus, code like

diff --git a/libstdc++-v3/doc/html/manual/utilities.html b/libstdc++-v3/doc/html/manual/utilities.html
index 85bf5ace3528..35a5942c6527 100644
--- a/libstdc++-v3/doc/html/manual/utilities.html
+++ b/libstdc++-v3/doc/html/manual/utilities.html
@@ -7,7 +7,7 @@
   Standard Contents

Â Next

ChapterÂ 6.Â Utilities - +

Table of Contents

Functors

Pairs

Memory

Allocators
auto_ptr
shared_ptr

Traits

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 diff --git a/libstdc++-v3/doc/xml/gnu/fdl-1.3.xml b/libstdc++-v3/doc/xml/gnu/fdl-1.3.xml new file mode 100644 index 000000000000..4abbd1d779f9 --- /dev/null +++ b/libstdc++-v3/doc/xml/gnu/fdl-1.3.xml @@ -0,0 +1,560 @@ + + + GNU Free Documentation License + Version 1.3, 3 November 2008 + + 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: + 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 + publisher a way to get credit for their work, while not being considered + responsible for modifications made by others. + + + 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. + + + We have designed this License in order to use it for manuals for free + software, because free software needs free documentation: a free program + should come with manuals providing the same freedoms that the software + does. But this License is not limited to software manuals; it can be used + 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 + + + This License applies to any manual or other work, in any medium, that + 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, + 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, + modify or distribute the work in a way requiring permission under + copyright law. + + + 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 + section of the Document that deals exclusively with the relationship of + 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 + mathematics.) The relationship could be a matter of historical connection + with the subject or with related matters, or of legal, commercial, + philosophical, ethical or political position regarding them. + + + 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 + be designated as Invariant. The Document may contain zero Invariant + Sections. If the Document does not identify any Invariant Sections then + there are none. + + + 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 + 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 + pixels) generic paint programs or (for drawings) some widely available + drawing editor, and that is suitable for input to text formatters or for + automatic translation to a variety of formats suitable for input to text + formatters. A copy made in an otherwise Transparent file format whose + 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”. + + + Examples of suitable formats for Transparent copies include plain ASCII + without markup, Texinfo input format, LaTeX input format, SGML or XML + using a publicly available DTD, and standard-conforming simple HTML, + PostScript or PDF designed for human modification. Examples of transparent + image formats include PNG, XCF and JPG. Opaque formats include proprietary + formats that can be read and edited only by proprietary word processors, + SGML or XML for which the DTD and/or processing tools are not generally + available, and the machine-generated HTML, PostScript or PDF produced by + some word processors for output purposes only. + + + 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 + title, preceding the beginning of the body of the text. + + + 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 + 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 + definition. + + + The Document may include Warranty Disclaimers next to the notice which + states that this License applies to the Document. These Warranty + Disclaimers are considered to be included by reference in this License, + but only as regards disclaiming warranties: any other implication that + these Warranty Disclaimers may have is void and has no effect on the + meaning of this License. + + + 2. VERBATIM COPYING + + + You may copy and distribute the Document in any medium, either + commercially or noncommercially, provided that this License, the copyright + notices, and the license notice saying this License applies to the + Document are reproduced in all copies, and that you add no other + conditions whatsoever to those of this License. You may not use technical + measures to obstruct or control the reading or further copying of the + copies you make or distribute. However, you may accept compensation in + exchange for copies. If you distribute a large enough number of copies you + must also follow the conditions in section 3. + + + 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 + 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 + publisher of these copies. The front cover must present the full title + with all words of the title equally prominent and visible. You may add + other material on the covers in addition. Copying with changes limited to + the covers, as long as they preserve the title of the Document and satisfy + these conditions, can be treated as verbatim copying in other respects. + + + If the required texts for either cover are too voluminous to fit legibly, + you should put the first ones listed (as many as fit reasonably) on the + actual cover, and continue the rest onto adjacent pages. + + + If you publish or distribute Opaque copies of the Document numbering more + than 100, you must either include a machine-readable Transparent copy + along with each Opaque copy, or state in or with each Opaque copy a + computer-network location from which the general network-using public has + access to download using public-standard network protocols a complete + Transparent copy of the Document, free of added material. If you use the + latter option, you must take reasonably prudent steps, when you begin + distribution of Opaque copies in quantity, to ensure that this Transparent + copy will remain thus accessible at the stated location until at least one + year after the last time you distribute an Opaque copy (directly or + through your agents or retailers) of that edition to the public. + + + It is requested, but not required, that you contact the authors of the + 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 + + + You may copy and distribute a Modified Version of the Document under the + conditions of sections 2 and 3 above, provided that you release the + Modified Version under precisely this License, with the Modified Version + filling the role of the Document, thus licensing distribution and + modification of the Modified Version to whoever possesses a copy of it. In + addition, you must do these things in the Modified Version: + + + + + Use in the Title Page (and on the covers, if any) a title distinct + from that of the Document, and from those of previous versions (which + should, if there were any, be listed in the History section of the + Document). You may use the same title as a previous version if the + original publisher of that version gives permission. + + + + + List on the Title Page, as authors, one or more persons or entities + responsible for authorship of the modifications in the Modified + Version, together with at least five of the principal authors of the + Document (all of its principal authors, if it has fewer than five), + unless they release you from this requirement. + + + + + State on the Title page the name of the publisher of the Modified + Version, as the publisher. + + + + + Preserve all the copyright notices of the Document. + + + + + Add an appropriate copyright notice for your modifications adjacent to + the other copyright notices. + + + + + Include, immediately after the copyright notices, a license notice + giving the public permission to use the Modified Version under the + terms of this License, in the form shown in the Addendum below. + + + + + Preserve in that license notice the full lists of Invariant Sections + and required Cover Texts given in the Document’s license + notice. + + + + + Include an unaltered copy of this License. + + + + + 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 + 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. + + + + + 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” + 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. + + + + + 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. + + + + + Preserve all the Invariant Sections of the Document, unaltered in + their text and in their titles. Section numbers or the equivalent are + not considered part of the section titles. + + + + + 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 + Section. + + + + + Preserve any Warranty Disclaimers. + + + + + If the Modified Version includes new front-matter sections or appendices + 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 + must be distinct from any other section titles. + + + 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 + has been approved by an organization as the authoritative definition of a + standard. + + + You may add a passage of up to five words as a Front-Cover Text, and a + passage of up to 25 words as a Back-Cover Text, to the end of the list of + Cover Texts in the Modified Version. Only one passage of Front-Cover Text + and one of Back-Cover Text may be added by (or through arrangements made + by) any one entity. If the Document already includes a cover text for the + same cover, previously added by you or by arrangement made by the same + entity you are acting on behalf of, you may not add another; but you may + replace the old one, on explicit permission from the previous publisher + that added the old one. + + + The author(s) and publisher(s) of the Document do not by this License give + permission to use their names for publicity for or to assert or imply + endorsement of any Modified Version. + + + 5. COMBINING DOCUMENTS + + + You may combine the Document with other documents released under this + License, under the terms defined in section 4 above for modified versions, + provided that you include in the combination all of the Invariant Sections + of all of the original documents, unmodified, and list them all as + Invariant Sections of your combined work in its license notice, and that + you preserve all their Warranty Disclaimers. + + + The combined work need only contain one copy of this License, and multiple + identical Invariant Sections may be replaced with a single copy. If there + are multiple Invariant Sections with the same name but different contents, + make the title of each such section unique by adding at the end of it, in + parentheses, the name of the original author or publisher of that section + if known, or else a unique number. Make the same adjustment to the section + titles in the list of Invariant Sections in the license notice of the + combined work. + + + 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”. + + + 6. COLLECTIONS OF DOCUMENTS + + + You may make a collection consisting of the Document and other documents + released under this License, and replace the individual copies of this + License in the various documents with a single copy that is included in + the collection, provided that you follow the rules of this License for + verbatim copying of each of the documents in all other respects. + + + You may extract a single document from such a collection, and distribute + it individually under this License, provided you insert a copy of this + 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 + resulting from the compilation is not used to limit the legal rights of + 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. + + + 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 + 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 + + + Translation is considered a kind of modification, so you may distribute + translations of the Document under the terms of section 4. Replacing + Invariant Sections with translations requires special permission from + their copyright holders, but you may include translations of some or all + Invariant Sections in addition to the original versions of these Invariant + Sections. You may include a translation of this License, and all the + license notices in the Document, and any Warranty Disclaimers, provided + that you also include the original English version of this License and the + original versions of those notices and disclaimers. In case of a + disagreement between the translation and the original version of this + 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 + (section 4) to Preserve its Title (section 1) will typically require + changing the actual title. + + + 9. TERMINATION + + + You may not copy, modify, sublicense, or distribute the Document except as + expressly provided under this License. Any attempt otherwise to copy, + modify, sublicense, or distribute it is void, and will automatically + terminate your rights under this License. + + + However, if you cease all violation of this License, then your license + from a particular copyright holder is reinstated (a) provisionally, unless + and until the copyright holder explicitly and finally terminates your + license, and (b) permanently, if the copyright holder fails to notify you + of the violation by some reasonable means prior to 60 days after the + cessation. + + + Moreover, your license from a particular copyright holder is reinstated + permanently if the copyright holder notifies you of the violation by some + reasonable means, this is the first time you have received notice of + violation of this License (for any work) from that copyright holder, and + you cure the violation prior to 30 days after your receipt of the notice. + + + Termination of your rights under this section does not terminate the + licenses of parties who have received copies or rights from you under this + License. If your rights have been terminated and not permanently + 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 + + + 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 + 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 + 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 + 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 + 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 + works thus published on the MMC site. + + + “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 + whole or in part, as part of another Document. + + + 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 + sections, and (2) were thus incorporated prior to November 1, 2008. + + + The operator of an MMC Site may republish an MMC contained in the site + 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 + + + To use this License in a document you have written, include a copy of the + License in the document and put the following copyright and license + notices just after the title page: + + 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”. + + If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts, + 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. + + If you have Invariant Sections without Cover Texts, or some other + combination of the three, merge those two alternatives to suit the + situation. + + + If your document contains nontrivial examples of program code, we + recommend releasing these examples in parallel under your choice of free + software license, such as the GNU General Public License, to permit their + use in free software. + + diff --git a/libstdc++-v3/doc/xml/manual/intro.xml b/libstdc++-v3/doc/xml/manual/intro.xml index c1c1ee4de04a..a6dff4daf152 100644 --- a/libstdc++-v3/doc/xml/manual/intro.xml +++ b/libstdc++-v3/doc/xml/manual/intro.xml @@ -166,8 +166,8 @@ requirements of the license of GCC. The documentation shipped with the library and made available over the web, excluding the pages generated from source comments, are copyrighted by the Free Software Foundation, and placed under the - GNU Free Documentation - License version 1.2. There are no Front-Cover Texts, no + GNU Free Documentation + License version 1.3. There are no Front-Cover Texts, no Back-Cover Texts, and no Invariant Sections. diff --git a/libstdc++-v3/doc/xml/manual/spine.xml b/libstdc++-v3/doc/xml/manual/spine.xml index 1c806ca18b87..edb650c879c8 100644 --- a/libstdc++-v3/doc/xml/manual/spine.xml +++ b/libstdc++-v3/doc/xml/manual/spine.xml @@ -131,7 +131,7 @@ + parse="xml" href="../gnu/fdl-1.3.xml">

PrevÂ	Up	Â Next
The GNU C++ LibraryÂ	Home	Â ChapterÂ 1.Â Status

Bibliography

Bibliography

ChapterÂ 11.Â Algorithms - +

AppendixÂ A.Â Contributing - +

AppendixÂ C.Â Free Software Needs Free Documentation - +