From 4394b61e02706f4315e0cb68d728e2e5019788c4 Mon Sep 17 00:00:00 2001
From: Benjamin Kosnik
diff --git a/libstdc++-v3/doc/html/faq.html b/libstdc++-v3/doc/html/faq.html
index b46c2b7ab5a..b4c548309fb 100644
--- a/libstdc++-v3/doc/html/faq.html
+++ b/libstdc++-v3/doc/html/faq.html
@@ -487,7 +487,7 @@
enough to detect when the minimal support to
enable wchar_t and C++ library structures
like wstring
were present. This impacted Solaris,
- Darwin, and BSD varients, and is fixed in libstdc++ versions post 4.1.0.
+ Darwin, and BSD variants, and is fixed in libstdc++ versions post 4.1.0.
7.4.
Extensions and Backward Compatibility
- See the link on backwards compatiblity and link on evolution. + See the link on backwards compatibility and link on evolution.
7.5.
Does libstdc++ support TR1?
diff --git a/libstdc++-v3/doc/html/manual/abi.html b/libstdc++-v3/doc/html/manual/abi.html index d86bb47918b..1be31b3f575 100644 --- a/libstdc++-v3/doc/html/manual/abi.html +++ b/libstdc++-v3/doc/html/manual/abi.html @@ -54,7 +54,7 @@ given compiler ABI. In a nutshell: created with the same constraints.
To use a specific version of the C++ ABI, one must use a - corresponding GNU C++ toolchain (Ie, g++ and libstdc++) that + corresponding GNU C++ toolchain (i.e., g++ and libstdc++) that implements the C++ ABI in question.
The C++ interface has evolved throughout the history of the GNU C++ toolchain. With each release, various details have been changed so @@ -84,7 +84,7 @@ release of the series to remain link compatible. others, this is libgcc_s.so.1.
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 preceeding + is not listed, it has the same version labels as the preceding release.
This corresponds to the mapfile: gcc/libgcc-std.ver
gcc-3.0.0: GCC_3.0
gcc-3.3.0: GCC_3.3
gcc-3.3.1: GCC_3.3.1
gcc-3.3.2: GCC_3.3.2
gcc-3.3.4: GCC_3.3.4
gcc-3.4.0: GCC_3.4
gcc-3.4.2: GCC_3.4.2
gcc-3.4.4: GCC_3.4.4
gcc-4.0.0: GCC_4.0.0
gcc-4.1.0: GCC_4.1.0
gcc-4.2.0: GCC_4.2.0
Release versioning on the libstdc++.so binary, implemented in the same was as the libgcc_s.so binary, above.
It is versioned as follows:
gcc-3.0.0: libstdc++.so.3.0.0
gcc-3.0.1: libstdc++.so.3.0.1
gcc-3.0.2: libstdc++.so.3.0.2
gcc-3.0.3: libstdc++.so.3.0.2 (Error should be libstdc++.so.3.0.3)
gcc-3.0.4: libstdc++.so.3.0.4
gcc-3.1.0: libstdc++.so.4.0.0
gcc-3.1.1: libstdc++.so.4.0.1
gcc-3.2.0: libstdc++.so.5.0.0
gcc-3.2.1: libstdc++.so.5.0.1
gcc-3.2.2: libstdc++.so.5.0.2
gcc-3.2.3: libstdc++.so.5.0.3 (Not strictly required)
gcc-3.3.0: libstdc++.so.5.0.4
gcc-3.3.1: libstdc++.so.5.0.5
gcc-3.3.2: libstdc++.so.5.0.5
gcc-3.3.3: libstdc++.so.5.0.5
gcc-3.4.0: libstdc++.so.6.0.0
gcc-3.4.1: libstdc++.so.6.0.1
gcc-3.4.2: libstdc++.so.6.0.2
gcc-3.4.3: libstdc++.so.6.0.3
gcc-3.4.4: libstdc++.so.6.0.3
gcc-3.4.5: libstdc++.so.6.0.3
gcc-3.4.6: libstdc++.so.6.0.3
gcc-4.0.0: libstdc++.so.6.0.4
gcc-4.0.1: libstdc++.so.6.0.5
gcc-4.0.2: libstdc++.so.6.0.6
gcc-4.0.3: libstdc++.so.6.0.7
gcc-4.1.0: libstdc++.so.6.0.7
gcc-4.1.1: libstdc++.so.6.0.8
gcc-4.1.2: libstdc++.so.6.0.8
gcc-4.2.0: libstdc++.so.6.0.9
Symbol versioning on the libstdc++.so binary.
mapfile: libstdc++/config/linker-map.gnu
It is versioned with the following labels and version definitions, where the version definition is the maximum for a @@ -95,7 +95,7 @@ release of the series to remain link compatible. gcc-3.2.1 release, which has GLIBCPP_3.2.1 for new symbols and GLIBCPP_3.2 for symbols that were introduced in the gcc-3.2.0 release.) If a particular release is not listed, it has the same - version labels as the preceeding release. + version labels as the preceding release.
gcc-3.0.0: (Error, not versioned)
gcc-3.0.1: (Error, not versioned)
gcc-3.0.2: (Error, not versioned)
gcc-3.0.3: (Error, not versioned)
gcc-3.0.4: (Error, not versioned)
gcc-3.1.0: GLIBCPP_3.1, CXXABI_1
gcc-3.1.1: GLIBCPP_3.1, CXXABI_1
gcc-3.2.0: GLIBCPP_3.2, CXXABI_1.2
gcc-3.2.1: GLIBCPP_3.2.1, CXXABI_1.2
gcc-3.2.2: GLIBCPP_3.2.2, CXXABI_1.2
gcc-3.2.3: GLIBCPP_3.2.2, CXXABI_1.2
gcc-3.3.0: GLIBCPP_3.2.2, CXXABI_1.2.1
gcc-3.3.1: GLIBCPP_3.2.3, CXXABI_1.2.1
gcc-3.3.2: GLIBCPP_3.2.3, CXXABI_1.2.1
gcc-3.3.3: GLIBCPP_3.2.3, CXXABI_1.2.1
gcc-3.4.0: GLIBCXX_3.4, CXXABI_1.3
gcc-3.4.1: GLIBCXX_3.4.1, CXXABI_1.3
gcc-3.4.2: GLIBCXX_3.4.2
gcc-3.4.3: GLIBCXX_3.4.3
gcc-4.0.0: GLIBCXX_3.4.4, CXXABI_1.3.1
gcc-4.0.1: GLIBCXX_3.4.5
gcc-4.0.2: GLIBCXX_3.4.6
gcc-4.0.3: GLIBCXX_3.4.7
gcc-4.1.1: GLIBCXX_3.4.8
gcc-4.2.0: GLIBCXX_3.4.9
Incremental bumping of a compiler pre-defined macro,
__GXX_ABI_VERSION. This macro is defined as the version of the
compiler v3 ABI, with g++ 3.0.x being version 100. This macro will
@@ -287,7 +287,7 @@ class in registers, the compiler will be forced to use memory. See Defaults to exporting all symbols in label
- Defaults to not exporting any symbols in label
Defaults to not exported, no items are allowed to be visible. Defaults to not exporting any symbols in label
@@ -428,7 +428,7 @@ gcc test.c -g -O2 -L. -lone -ltwo /usr/lib/libstdc++.so.5 /usr/lib/libstdc++.so.
difficult. In particular, compiler generated constructs such as
implicit instantiations for templates, typeinfo information, and
virtual tables all may cause ABI leakage across shared library
- boundaries. Because of this, mixing C++ ABI's is not recommended at
+ boundaries. Because of this, mixing C++ ABIs is not recommended at
this time.
For more background on this issue, see these bugzilla entries:
@@ -436,54 +436,54 @@ 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
-
Versioning With Namespaces
.
ISO C++ J16/06-0083
diff --git a/libstdc++-v3/doc/html/manual/api.html b/libstdc++-v3/doc/html/manual/api.html
index 6da7e73c058..c8c6d0e220c 100644
--- a/libstdc++-v3/doc/html/manual/api.html
+++ b/libstdc++-v3/doc/html/manual/api.html
@@ -1,7 +1,7 @@
-A list of user-visible changes, in cronological order
+A list of user-visible changes, in chronological order
Extensions moved to
@@ -52,7 +52,7 @@ _Alloc_traits have been removed.
Default behavior of
Previous versions prior to 3.4 cache allocations in a memory
pool, instead of passing through to call the global allocation
- operators (ie, Previously, all allocators were written to the SGI
@@ -72,11 +72,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 Releases after gcc-3.4 have continued to add to the collection
+ Table B.1. Extension Allocators 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
+ Table B.2. Extension Allocators Continued
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 007c7fe52a6..08032d04056 100644
--- a/libstdc++-v3/doc/html/manual/appendix_contributing.html
+++ b/libstdc++-v3/doc/html/manual/appendix_contributing.html
@@ -1,6 +1,6 @@
- Table of Contents
+ Table of Contents
The GNU C++ Library follows an open development model. Active
contributors are assigned maintainer-ship responsibility, and given
write access to the source repository. First time contributors
diff --git a/libstdc++-v3/doc/html/manual/appendix_porting.html b/libstdc++-v3/doc/html/manual/appendix_porting.html
index 001943516a3..9cd2ebf224e 100644
--- a/libstdc++-v3/doc/html/manual/appendix_porting.html
+++ b/libstdc++-v3/doc/html/manual/appendix_porting.html
@@ -47,7 +47,7 @@
discourage that.
Most comments should use {octothorpes, shibboleths, hash marks,
- pound signs, whatevers} rather than "dnl". Nearly all comments in
+ pound signs, whatever} rather than "dnl". Nearly all comments in
configure.ac should. Comments inside macros written in ancilliary
.m4 files should. About the only comments which should
not use #, but use dnl instead, are comments
diff --git a/libstdc++-v3/doc/html/manual/backwards.html b/libstdc++-v3/doc/html/manual/backwards.html
index 3bdf1937aad..6475a7e8a25 100644
--- a/libstdc++-v3/doc/html/manual/backwards.html
+++ b/libstdc++-v3/doc/html/manual/backwards.html
@@ -14,8 +14,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. At least some older implementations don't have
+ Known Issues include many of the limitations of its immediate ancestor. Portability notes and known implementation limitations are as follows. At least some older implementations don't have
In earlier versions of the standard,
Portability notes and known implementation limitations are as follows.
-
+
Some care is required to support C++ compiler and or library
implementation that do not have the standard library in
The following illustrate implementation-allowed illegal iterator
use, and then correct use.
@@ -118,7 +118,7 @@ AC_DEFUN([AC_CXX_NAMESPACE_STD], [
Glibc 2.0.x and 2.1.x define
One solution is to add an autoconf-test for this:
If you are using other (non-GNU) compilers it might be a good idea
to check for
Use some kind of autoconf test, plus this:
There are two functions for deleting the contents of a string:
- Unfortunately, ut
These are no longer supported. Please use stringstreams instead.
-
Although the ISO standard There is additional information in the libstdc++-v2 info files, in
particular âinfo iostreamâ.
-
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
@@ -361,7 +361,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. The pre-ISO C++ headers
+ Portability notes and known implementation limitations are as follows. The pre-ISO C++ headers
( At this time most of the features of the SGI STL extension have been
+ 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
@@ -505,7 +505,7 @@ AC_DEFUN([AC_HEADER_EXT_HASH_SET], [
AC_DEFINE(HAVE_EXT_HASH_SET,,[Define if ext/hash_set is present. ])
fi
])
- The existence of
Phil Edwards writes: It was considered and rejected for the ISO
@@ -524,7 +524,7 @@ No
For a portable solution (among systems which use
- filedescriptors), you need to implement a subclass of
+ file descriptors), you need to implement a subclass of
Check for complete library coverage of the C++1998/2003 standard.
Check for library coverage of the TR1 standard.
Check for baseline language coverage in the compiler for the C++0xstandard.
[
lbl32
]
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 88b44157bd7..3aa04e1ed8e 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).
-
+
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
@@ -141,8 +141,8 @@ else return false.
(32 x k + 1) / (2 x (32 x k + 1 + 32 x c)) x 100.
- Where, k => The constant overhead per node. eg. for list, it is
- 8 bytes, and for map it is 12 bytes. c => The size of the
+ where k is the constant overhead per node (e.g., for list, it is
+ 8 bytes, and for map it is 12 bytes) and c is the size of the
base type on which the map/list is instantiated. Thus, suppose the
type1 is int and type2 is double, they are related by the relation
sizeof(double) == 2*sizeof(int). Thus, all types must have this
diff --git a/libstdc++-v3/doc/html/manual/bk01apas03.html b/libstdc++-v3/doc/html/manual/bk01apas03.html
index 620968d2750..1f5e5f7b3c3 100644
--- a/libstdc++-v3/doc/html/manual/bk01apas03.html
+++ b/libstdc++-v3/doc/html/manual/bk01apas03.html
@@ -1,7 +1,7 @@
-
+
Identifiers that conflict and should be avoided.
Editing the DocBook sources requires an XML editor. Many
- exist: some noteable options
+ exist: some notable options
include emacs, Kate,
or Conglomerate.
@@ -103,7 +103,7 @@
in
- For procesessing XML, an XML processor and some style
+ For processing XML, an XML processor and some style
sheets are necessary. Defaults are xsltproc
provided by
@@ -153,10 +153,10 @@ xmllint --noout --valid
This page describes the TR1 support in mainline GCC SVN, not in any particular
release.
- Table 1.1. C++ TR1 Implementation Status
+ Table 1.1. C++ TR1 Implementation Status
Footnotes
The shared_ptr implementation uses some code from the
@@ -6120,9 +6120,9 @@ 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 Table 1.2. C++ 200x Implementation Status
+
Footnotes
The shared_ptr implementation uses some code from the
diff --git a/libstdc++-v3/doc/html/manual/bk01pt01ch03s02.html b/libstdc++-v3/doc/html/manual/bk01pt01ch03s02.html
index 6bdc0333a32..6daf4365f73 100644
--- a/libstdc++-v3/doc/html/manual/bk01pt01ch03s02.html
+++ b/libstdc++-v3/doc/html/manual/bk01pt01ch03s02.html
@@ -19,15 +19,15 @@
the 1998 standard as updated for 2003, and the draft of the
upcoming 200x standard.
- C++98/03 include files. These are available in the default compilation mode, ie Table 3.1. C++ 1998 Library Headers Table 3.2. C++ 1998 Library Headers for C Library Facilities C++0x include files. These are only available in C++0x compilation mode, ie Table 3.3. C++ 200x Library Headers Table 3.4. C++ 200x Library Headers for C Library Facilities
+ C++98/03 include files. These are available in the default compilation mode, i.e. Table 3.1. C++ 1998 Library Headers Table 3.2. C++ 1998 Library Headers for C Library Facilities C++0x include files. These are only available in C++0x compilation mode, i.e. Table 3.3. C++ 200x Library Headers Table 3.4. C++ 200x Library Headers for C Library Facilities
In addition, TR1 includes as:
- Table 3.5. C++ TR1 Library Headers Table 3.6. C++ TR1 Library Headers for C Library Facilities
+ Table 3.5. C++ TR1 Library Headers Table 3.6. C++ TR1 Library Headers for C Library Facilities
Also included are files for the C++ ABI interface:
-
+
And a large variety of extensions.
- Table 3.8. Extension Headers Table 3.9. Extension Debug Headers A few simple rules.
+ Table 3.8. Extension Headers Table 3.9. Extension Debug 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
There are three main namespaces.
std The ISO C++ standards specify that "all library entities are defined
-within namespace std." This includes namepaces nested
+within namespace std." This includes namespaces nested
within abi Specified by the C++ ABI. This ABI specifies a number of type and
diff --git a/libstdc++-v3/doc/html/manual/bk01pt02pr01.html b/libstdc++-v3/doc/html/manual/bk01pt02pr01.html
index 46dbe2ab865..811d492188b 100644
--- a/libstdc++-v3/doc/html/manual/bk01pt02pr01.html
+++ b/libstdc++-v3/doc/html/manual/bk01pt02pr01.html
@@ -1,6 +1,6 @@
-
+
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/bk01pt03ch07.html b/libstdc++-v3/doc/html/manual/bk01pt03ch07.html
index a258631cb16..e29d2bf2d49 100644
--- a/libstdc++-v3/doc/html/manual/bk01pt03ch07.html
+++ b/libstdc++-v3/doc/html/manual/bk01pt03ch07.html
@@ -11,6 +11,6 @@
Derived from this are several classes that may have a
-
@@ -90,7 +90,7 @@
or loading and unloading shared objects in memory. As such, using
caching allocators on systems that do not support
The only allocator interface that
is support is the standard C++ interface. As such, all STL
containers have been adjusted, and all external allocators have
@@ -103,7 +103,7 @@
The base class that
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
@@ -140,7 +140,7 @@
The current default choice for
In use,
Includes memory tracking and marking abilities as well as hooks for
- throwing exceptinos at configurable intervals (including random,
+ throwing exceptions at configurable intervals (including random,
all, none).
The
For thread-enabled configurations, the pool is locked with a
single big lock. In some situations, this implementation detail
- may result in severe performance degredation.
+ may result in severe performance degradation.
(Note that the GCC thread abstraction layer allows us to provide
safe zero-overhead stubs for the threading routines, if threads
@@ -305,11 +305,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.
- Yalloc: A Recycling C++ Allocator.
yenf
Copyright © .
diff --git a/libstdc++-v3/doc/html/manual/bk01pt05ch13.html b/libstdc++-v3/doc/html/manual/bk01pt05ch13.html
index bc03ae817d9..e50eb1fe71c 100644
--- a/libstdc++-v3/doc/html/manual/bk01pt05ch13.html
+++ b/libstdc++-v3/doc/html/manual/bk01pt05ch13.html
@@ -1,13 +1,13 @@
- Table of Contents
+ Table of Contents
Here are Standard, simple, and portable ways to perform common
transformations on a
- This code will go through some iterations. Here's a simiple
+ This code will go through some iterations. Here's a simple
version:
Obviously, the calls to
+
The well-known-and-if-it-isn't-well-known-it-ought-to-be
Guru of the Week
discussions held on Usenet covered this topic in January of 1998.
diff --git a/libstdc++-v3/doc/html/manual/bk01pt05ch13s03.html b/libstdc++-v3/doc/html/manual/bk01pt05ch13s03.html
index c321667a729..49f416a170c 100644
--- a/libstdc++-v3/doc/html/manual/bk01pt05ch13s03.html
+++ b/libstdc++-v3/doc/html/manual/bk01pt05ch13s03.html
@@ -1,6 +1,6 @@
-
+
The
Literally, a facet is strictly defined:
- Dontaining the following public data member:
+ Containing the following public data member:
@@ -42,11 +42,11 @@ class id
Provides an index for looking up specific facets.
The major design challenge is fitting an object-orientated and
-non-global locale design ontop of POSIX and other relevant stanards,
+non-global locale design on top of POSIX and other relevant standards,
which include the Single Unix (nee X/Open.)
Because C and earlier versions of POSIX falls down so completely,
-portibility is an issue.
+portability is an issue.
affects the C functions as if the following call was made:
- On the other hand, there is *no* viceversa, that is, calling
+ On the other hand, there is *no* vice versa, that is, calling
setlocale has *no* whatsoever on the C++ locale mechanism, in
particular on the working of locale(""), which constructs the locale
object from the environment of the running program, that is, in
@@ -383,7 +383,7 @@ global locale" (emphasis Paolo), that is:
has already taken place?
Document how named locales error check when filling data
- members. Ie, a fr_FR locale that doesn't have
+ members. I.e., a fr_FR locale that doesn't have
numpunct::truename(): does it use "true"? Or is it a blank
string? What's the convention?
@@ -393,27 +393,27 @@ global locale" (emphasis Paolo), that is:
language code and ISO country code (say, "de_DE").
What should non-required facet instantiations do? If the
- generic implemenation is provided, then how to end-users
+ generic implementation is provided, then how to end-users
provide specializations?
-
The GNU C Library
- . Copyright © 2007 FSF. Chapters 6 Character Set Handling and 7 Locales and Internationalization.
+ . Copyright © 2007 FSF. Chapters 6 Character Set Handling and 7 Locales and Internationalization.
System Interface Definitions, Issue 6 (IEEE Std. 1003.1-200x)
. Copyright © 1999
The Open Group/The Institute of Electrical and Electronics Engineers, Inc..
- .
The C++ Programming Language, Special Edition
. 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/bk01pt06ch15.html b/libstdc++-v3/doc/html/manual/bk01pt06ch15.html
index 2a3811806a7..7bad31da01b 100644
--- a/libstdc++-v3/doc/html/manual/bk01pt06ch15.html
+++ b/libstdc++-v3/doc/html/manual/bk01pt06ch15.html
@@ -1,6 +1,6 @@
- Table of Contents
+ Table of Contents
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
@@ -41,31 +41,31 @@ characters.
this class?
Get the ctype<wchar_t>::mask stuff under control. Need to
- make some kind of static table, and not do lookup evertime
+ make some kind of static table, and not do lookup every time
somebody hits the do_is... functions. Too bad we can't just
redefine mask for ctype<wchar_t>
Rename abstract base class. See if just smash-overriding is a
better approach. Clarify, add sanity to naming.
-
The GNU C Library
- . Copyright © 2007 FSF. Chapters 6 Character Set Handling and 7 Locales and Internationalization.
+ . Copyright © 2007 FSF. Chapters 6 Character Set Handling and 7 Locales and Internationalization.
System Interface Definitions, Issue 6 (IEEE Std. 1003.1-200x)
. Copyright © 1999
The Open Group/The Institute of Electrical and Electronics Engineers, Inc..
- .
The C++ Programming Language, Special Edition
. 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/bk01pt09pr02.html b/libstdc++-v3/doc/html/manual/bk01pt09pr02.html
index d5cedbdfd3f..365ae11cb8d 100644
--- a/libstdc++-v3/doc/html/manual/bk01pt09pr02.html
+++ b/libstdc++-v3/doc/html/manual/bk01pt09pr02.html
@@ -1,6 +1,6 @@
-
+
The neatest accomplishment of the algorithms chapter is that all the
work is done via iterators, not containers directly. This means two
important things:
diff --git a/libstdc++-v3/doc/html/manual/bk01pt12ch30s03.html b/libstdc++-v3/doc/html/manual/bk01pt12ch30s03.html
index d52674bbb3d..e293caa2668 100644
--- a/libstdc++-v3/doc/html/manual/bk01pt12ch30s03.html
+++ b/libstdc++-v3/doc/html/manual/bk01pt12ch30s03.html
@@ -19,6 +19,6 @@
mode or with debug mode. The
following table provides the names and headers of the debugging
containers:
- Table 30.1. Debugging Containers In addition, when compiling in C++0x mode, these additional
+ Table 30.1. Debugging Containers In addition, when compiling in C++0x mode, these additional
containers have additional debug capability.
- Table 30.2. Debugging Containers C++0x Table 30.2. Debugging Containers C++0x Achieving link- and run-time coexistence is not a trivial
implementation task. To achieve this goal we required a small
diff --git a/libstdc++-v3/doc/html/manual/bk01pt12ch31s02.html b/libstdc++-v3/doc/html/manual/bk01pt12ch31s02.html
index e06362edd9f..a22fd095932 100644
--- a/libstdc++-v3/doc/html/manual/bk01pt12ch31s02.html
+++ b/libstdc++-v3/doc/html/manual/bk01pt12ch31s02.html
@@ -1,7 +1,7 @@
The parallel mode STL algorithms are currently not exception-safe,
-i. e. user-defined functors must not throw exceptions.
+i.e. user-defined functors must not throw exceptions.
Since the current GCC OpenMP implementation does not support
OpenMP parallel regions in concurrent threads,
it is not possible to call parallel STL algorithm in
diff --git a/libstdc++-v3/doc/html/manual/bk01pt12ch31s03.html b/libstdc++-v3/doc/html/manual/bk01pt12ch31s03.html
index 97fdb5ba1b5..2e03e0e9943 100644
--- a/libstdc++-v3/doc/html/manual/bk01pt12ch31s03.html
+++ b/libstdc++-v3/doc/html/manual/bk01pt12ch31s03.html
@@ -1,20 +1,22 @@
- To use the libstdc++ parallel mode, compile your application with
- the compiler flag
+ To use the libstdc++ parallel mode, compile your application with
+ the compiler flag Note that the Note that the When it is not feasible to recompile your entire application, or
+ and cannot be confused with normal mode symbols.
+ When it is not feasible to recompile your entire application, or
only specific algorithms need to be parallel-aware, individual
parallel algorithms can be made available explicitly. These
parallel algorithms are functionally equivalent to the standard
@@ -23,4 +25,4 @@
compiled with either release mode or with parallel mode. The
following table provides the names and headers of the parallel
algorithms:
- Table 31.1. Parallel Algorithms Table 31.1. Parallel Algorithms But.... why the elipses?
- The elipses in the example above represent additional overloads
+ But.... why the ellipses?
+ The ellipses in the example above represent additional overloads
required for the parallel version of the function. These additional
overloads are used to dispatch calls from the ISO C++ function
signature to the appropriate parallel function (or sequential
function, if no parallel functions are deemed worthy), based on either
compile-time or run-time conditions.
Compile-time conditions are referred to as "embarrassingly
-parallel," and are denoted with the appropriate dispatch object, ie
+parallel," and are denoted with the appropriate dispatch object, i.e.,
one of
-The default parallization strategy, the choice of specific algorithm
+The default parallelization strategy, the choice of specific algorithm
strategy, the minimum threshold limits for individual parallel
algorithms, and aspects of the underlying hardware can be specified as
desired via manipulation
@@ -120,7 +118,7 @@ value of enum __gnu_parallel::_AlgorithmStrategy
type. Choices
include: heuristic, force_sequential,
and force_parallel. The default is
-implementation-deduced, ie heuristic.
+implementation-deduced, i.e. heuristic.
Next, the sub-choices for algorithm implementation. Specific
algorithms like
Likewise for setting the minimal threshold for algorithm
-paralleization. Parallelism always incurs some overhead. Thus, it is
+parallelization. Parallelism always incurs some overhead. Thus, it is
not helpful to parallelize operations on very small sets of
data. Because of this, measures are taken to avoid parallelizing below
a certain, pre-determined threshold. For each algorithm, a minimum
diff --git a/libstdc++-v3/doc/html/manual/bk01pt12ch31s05.html b/libstdc++-v3/doc/html/manual/bk01pt12ch31s05.html
index 698ba3906de..ff3ea023344 100644
--- a/libstdc++-v3/doc/html/manual/bk01pt12ch31s05.html
+++ b/libstdc++-v3/doc/html/manual/bk01pt12ch31s05.html
@@ -10,15 +10,15 @@
The log and summary files for conformance testing are in the
-
To run the performance tests with the parallel mode active,
The result file for performance testing are in the
- 25.3 (sorting 'n' heaps 'n' stuff) is extended with some helper
predicates. Look in the doxygen-generated pages for notes on these.
25.3.8 (lexigraphical_compare) is extended with
+ nondescending order. 25.3.8 (lexicographical_compare) is extended with
which does... what?
diff --git a/libstdc++-v3/doc/html/manual/bk01pt12ch39.html b/libstdc++-v3/doc/html/manual/bk01pt12ch39.html
index 666a384f507..15ba1ca3d2d 100644
--- a/libstdc++-v3/doc/html/manual/bk01pt12ch39.html
+++ b/libstdc++-v3/doc/html/manual/bk01pt12ch39.html
@@ -1,7 +1,7 @@
- Transforming C++ ABI itentifiers (like RTTI symbols) into the
+ Transforming C++ ABI identifiers (like RTTI symbols) into the
original C++ source identifiers is called
âdemangling.â
diff --git a/libstdc++-v3/doc/html/manual/bk01pt12ch40s02.html b/libstdc++-v3/doc/html/manual/bk01pt12ch40s02.html
index 6f1f5df4b23..2e4aee7aa08 100644
--- a/libstdc++-v3/doc/html/manual/bk01pt12ch40s02.html
+++ b/libstdc++-v3/doc/html/manual/bk01pt12ch40s02.html
@@ -1,6 +1,6 @@
- The functions for atomic operations described above are either
+ The functions for atomic operations described above are either
implemented via compiler intrinsics (if the underlying host is
capable) or by library fallbacks. Compiler intrinsics (builtins) are always preferred. However, as
the compiler builtins for atomics are not universally implemented,
@@ -22,7 +22,7 @@ hardware, hand-crafted assembly is selected. This is the case for the following
cris hppa i386 i486 m48k mips sparc And for the rest, a simulated atomic lock via pthreads.
Detailed information about compiler intrinsics for atomic operations can be found in the GCC documentation.
More details on the library fallbacks from the porting section.
- A thin layer above IEEE 1003.1 (i.e. pthreads) is used to abstract
the thread interface for GCC. This layer is called "gthread," and is
comprised of one header file that wraps the host's default thread layer with
a POSIX-like interface.
diff --git a/libstdc++-v3/doc/html/manual/bk01pt12pr03.html b/libstdc++-v3/doc/html/manual/bk01pt12pr03.html
index 79d6d356f2c..589c107502b 100644
--- a/libstdc++-v3/doc/html/manual/bk01pt12pr03.html
+++ b/libstdc++-v3/doc/html/manual/bk01pt12pr03.html
@@ -1,6 +1,6 @@
-
+
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/codecvt.html b/libstdc++-v3/doc/html/manual/codecvt.html
index 17230b9b3c1..3af9d23abba 100644
--- a/libstdc++-v3/doc/html/manual/codecvt.html
+++ b/libstdc++-v3/doc/html/manual/codecvt.html
@@ -111,7 +111,7 @@ UCS2, UCS4, UNICODE, UNICODEBIG, UNICODELIcodeLE, US-ASCII, US, UTF-8,
UTF-16, UTF8, UTF16).
For iconv-based implementations, string literals for each of the
-encodings (ie. "UCS-2" and "UTF-8") are necessary,
+encodings (i.e. "UCS-2" and "UTF-8") are necessary,
although for other,
non-iconv implementations a table of enumerated values or some other
mechanism may be required.
@@ -130,7 +130,7 @@ mechanism may be required.
conversion descriptor encodes more information than a simple encoding
state type.
- Conversion descriptors for both directions of encoding. (ie, both
+ Conversion descriptors for both directions of encoding. (i.e., both
UCS-2 to UTF-8 and UTF-8 to UCS-2.)
Something to indicate if the conversion requested if valid.
@@ -179,7 +179,7 @@ The two required specializations are implemented as follows:
codecvt<char, char, mbstate_t>
-This is a degenerate (ie, does nothing) specialization. Implementing
+This is a degenerate (i.e., does nothing) specialization. Implementing
this was a piece of cake.
wchar_t/char internal buffers and conversions between
internal/external buffers?
-
The GNU C Library
- . Copyright © 2007 FSF. Chapters 6 Character Set Handling and 7 Locales and Internationalization.
+ . Copyright © 2007 FSF. Chapters 6 Character Set Handling and 7 Locales and Internationalization.
System Interface Definitions, Issue 6 (IEEE Std. 1003.1-200x)
. Copyright © 1999
The Open Group/The Institute of Electrical and Electronics Engineers, Inc..
- .
The C++ Programming Language, Special Edition
. Copyright © 2000 Addison Wesley, Inc.. Appendix D.
Addison Wesley
- .
Standard C++ IOStreams and Locales
.
Advanced Programmer's Guide and Reference
. Copyright © 2000 Addison Wesley Longman, Inc..
Addison Wesley Longman
- .
UTF-8 and Unicode FAQ for Unix/Linux
.
diff --git a/libstdc++-v3/doc/html/manual/concurrency.html b/libstdc++-v3/doc/html/manual/concurrency.html
index 6b3705aabc2..561c2cf288d 100644
--- a/libstdc++-v3/doc/html/manual/concurrency.html
+++ b/libstdc++-v3/doc/html/manual/concurrency.html
@@ -1,6 +1,6 @@
- Table of Contents The file <ext/concurrence.h> contains all the higher-level
+ Table of Contents The file <ext/concurrence.h> contains all the higher-level
constructs for playing with threads. In contrast to the atomics layer,
the concurrence layer consists largely of types. All types are defined within
diff --git a/libstdc++-v3/doc/html/manual/extensions.html b/libstdc++-v3/doc/html/manual/extensions.html
index bbd57bafde9..c4f6ac8bac0 100644
--- a/libstdc++-v3/doc/html/manual/extensions.html
+++ b/libstdc++-v3/doc/html/manual/extensions.html
@@ -1,3 +1,3 @@
-
Making the message catalogs can be initially tricky, but become
quite simple with practice. For complete info, see the gettext
@@ -205,7 +205,7 @@ void test01()
There are issues with gettext needing the global locale set
to extract a message. This dependence on the global locale
makes the current "gnu" model non MT-safe. Future versions
- of glibc, ie glibc 2.3.x will fix this, and the C++ library
+ of glibc, i.e. glibc 2.3.x will fix this, and the C++ library
bits are already in place.
Development versions of the GNU "C" library, glibc 2.3 will allow
@@ -218,7 +218,7 @@ void test01()
library functionality.
At some point in the near future, std::numpunct will probably use
- std::messages facilities to implement truename/falename
+ std::messages facilities to implement truename/falsename
correctly. This is currently not done, but entries in
libstdc++.pot have already been made for "true" and "false" string
literals, so all that remains is the std::numpunct coding and the
@@ -241,38 +241,38 @@ 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.
-
The GNU C Library
. Copyright © 2007 FSF. Chapters 6 Character Set Handling, and 7 Locales and Internationalization
- .
System Interface Definitions, Issue 6 (IEEE Std. 1003.1-200x)
. Copyright © 1999
The Open Group/The Institute of Electrical and Electronics Engineers, Inc..
- .
The C++ Programming Language, Special Edition
. Copyright © 2000 Addison Wesley, Inc.. Appendix D.
Addison Wesley
- .
Standard C++ IOStreams and Locales
.
Advanced Programmer's Guide and Reference
. Copyright © 2000 Addison Wesley Longman, Inc..
Addison Wesley Longman
- .
Java 2 Platform, Standard Edition, v 1.3.1 API Specification
. java.util.Properties, java.text.MessageFormat,
java.util.Locale, java.util.ResourceBundle.
- .
GNU gettext tools, version 0.10.38, Native Language Support
Library and Tools.
.
diff --git a/libstdc++-v3/doc/html/manual/parallel_mode.html b/libstdc++-v3/doc/html/manual/parallel_mode.html
index 137d041e749..17c3eadda8e 100644
--- a/libstdc++-v3/doc/html/manual/parallel_mode.html
+++ b/libstdc++-v3/doc/html/manual/parallel_mode.html
@@ -4,18 +4,17 @@
implementation of many algorithms the C++ Standard Library.
Several of the standard algorithms, for instance
- The following library components in the include
- The following library components in the include
- The following library components in the includes
-
+ The following library components in the include
+
Parallelization of Bulk Operations for STL Dictionaries
. Copyright © 2007 .
Workshop on Highly Parallel Processing on a Chip (HPPC) 2007. (LNCS)
- .
The Multi-Core Standard Template Library
. Copyright © 2007 .
Euro-Par 2007: Parallel Processing. (LNCS 4641)
diff --git a/libstdc++-v3/doc/html/manual/shared_ptr.html b/libstdc++-v3/doc/html/manual/shared_ptr.html
index 21d38d3e3d6..c5aed380204 100644
--- a/libstdc++-v3/doc/html/manual/shared_ptr.html
+++ b/libstdc++-v3/doc/html/manual/shared_ptr.html
@@ -29,7 +29,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.
-
A
The interface of
There is a single
The classes derived from
As noted in N2351, these functions can be implemented non-intrusively using
the alias constructor. However the aliasing constructor is only available
@@ -214,10 +214,10 @@ is called. Users should not try to use this.
As well as the extra constructors, this implementation also needs some
members of _Sp_counted_deleter to be protected where they could otherwise
be private.
-
Examples of use can be found in the testsuite, under
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
@@ -265,7 +265,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.
- [
n2456
]
C++ Standard Library Active Issues List (Revision R52)
@@ -283,7 +283,7 @@ be private.
.
- . [
n2461
]
Working Draft, Standard for Programming Language C++
@@ -292,7 +292,7 @@ be private.
.
- . [
boostshared_ptr
]
Boost C++ Libraries documentation - shared_ptr class template
diff --git a/libstdc++-v3/doc/html/manual/spine.html b/libstdc++-v3/doc/html/manual/spine.html
index ba20f193d8e..0a0b3d7f4fe 100644
--- a/libstdc++-v3/doc/html/manual/spine.html
+++ b/libstdc++-v3/doc/html/manual/spine.html
@@ -2,6 +2,6 @@
Table of Contents List of Tables Table of Contents List of Tables
This file indicates that the host system can run tests which
- incolved multiple threads.
+ involved multiple threads.
testsuite_wchar_t
@@ -324,7 +324,7 @@ runtest --tool libstdc++ --srcdir=/path/to/gcc/libstdc++-v3/testsuite
flux.
We are interested in any strange failures of the testsuite;
- please email the main libstdc++ mainling list if you see
+ please email the main libstdc++ mailing list if you see
something odd or have questions.
To run the libstdc++ test suite under the debug mode, edit
diff --git a/libstdc++-v3/doc/html/spine.html b/libstdc++-v3/doc/html/spine.html
index 12840aaa909..e6812dab59e 100644
--- a/libstdc++-v3/doc/html/spine.html
+++ b/libstdc++-v3/doc/html/spine.html
@@ -2,4 +2,4 @@
Copyright © 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
FSF
- Table of Contents Table of Contentsnamespace std
GLIBCXX
that do not begin with an underscore, ie
+GLIBCXX
that do not begin with an underscore, i.e.,
__test_func
would not be exported by default. Select
exceptional symbols are allowed to be visible.namespace __gnu_cxx
GLIBCXX
, select items are allowed to be visible.namespace __gnu_internal
namespace __cxxabiv1
, aliased to namespace abi
include/ext
.
std::allocator
has changed.__gnu_cxx::pool_allocator
). More
+ operators (i.e., __gnu_cxx::pool_allocator
). More
recent versions default to the
simpler __gnu_cxx::new_allocator
.
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 std::ios_base
, so you should use std::ios::badbit
, std::ios::failbit
and std::ios::eofbit
and std::ios::goodbit
.
-std::ios_base
, so you should use std::ios::badbit
, std::ios::failbit
and std::ios::eofbit
and std::ios::goodbit
.
+fstream.h
,
ostream.h
@@ -41,7 +41,7 @@ considered replaced and rewritten.
archived. The code is considered replaced and rewritten.
namespace std
.
@@ -77,7 +77,7 @@ considered replaced and rewritten.
then using that to set a value for the NAMESPACE_STD
macro. At that point, one is able to use
NAMESPACE_STD::string
, which will evaluate to
- std::string
or ::string
(ie, in the
+ std::string
or ::string
(i.e., in the
global namespace on systems that do not put string
in
std::
).
@@ -105,7 +105,7 @@ AC_DEFUN([AC_CXX_NAMESPACE_STD], [
AC_DEFINE(HAVE_NAMESPACE_STD,,[Define if g++ supports namespace std. ])
fi
])
-
if (iterator)
won't work any more => use
if (iterator != iterator_type())
- ctype.h
functionality as macros
(isspace, isalpha etc.).
@@ -151,7 +151,7 @@ std:: (__ctype_b[(int) ( ( 'X' ) )] & (unsigned short int) _ISspace ) ;
(ctype.h
) and the
definitions in namespace std::
(<cctype>
).
-
AC_MSG_CHECKING(for container::at)
@@ -177,7 +177,7 @@ AC_DEFINE(HAVE_CONTAINER_AT)],
string::at
separately.
-
#ifdef HAVE_CHAR_TRAITS
@@ -185,7 +185,7 @@ AC_DEFINE(HAVE_CONTAINER_AT)],
#else
#define CPP_EOF EOF
#endif
-
clear
and erase
(the latter returns the
string).
@@ -200,15 +200,15 @@ erase(size_type __pos = 0, size_type __n = npos)
_M_data(), _M_data());
}
clear
is not implemented in this
+ Unfortunately, clear
is not implemented in this
version, so you should use erase
(which is probably
faster than operator=(charT*)
).
-i/ostringstream
-classes are
provided, (sstream
), for
compatibility with older implementations the pre-ISO
@@ -296,14 +296,14 @@ any = temp;
Another example of using stringstreams is in this howto.
iostream.h
, defalloc.h
etc.) are
available, unlike previous libstdc++ versions, but inclusion
generates a warning that you are using deprecated headers.
@@ -433,7 +433,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.
-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
@@ -516,7 +516,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
?).
-stream::attach(int fd)
that do, not all of them use integers to represent them.
std::streambuf
(or
std::basic_streambuf<..>
) which opens a file
given a descriptor, and then pass an instance of this to the
@@ -539,7 +539,7 @@ No stream::attach(int fd)
For another example of this, refer to
fdstream example
by Nicolai Josuttis.
-
@@ -607,7 +607,7 @@ AC_DEFUN([AC_HEADER_STDCXX_98], [
AC_DEFINE(STDCXX_98_HEADERS,,[Define if ISO C++ 1998 header files are present. ])
fi
])
-
@@ -684,7 +684,7 @@ AC_DEFUN([AC_HEADER_TR1_UNORDERED_SET], [
AC_DEFINE(HAVE_TR1_UNORDERED_SET,,[Define if tr1/unordered_set is present. ])
fi
])
-
@@ -896,27 +896,27 @@ AC_DEFUN([AC_HEADER_UNORDERED_SET], [
AC_DEFINE(HAVE_UNORDERED_SET,,[Define if unordered_set is present. ])
fi
])
-
      This is the list of names âreserved to the
@@ -330,7 +330,7 @@
      for definitions. For C++, where we have member functions that can
      be either inline definitions or declarations, keeping to this
      standard allows all member function names for a given class to be
-      aligned to the same margin, increasing readibility.
+      aligned to the same margin, increasing readability.
      10. Invocation of member functions with "this->"
@@ -356,7 +356,7 @@
      12. Spacing under protected and private in class declarations:
      space above, none below
-Â Â Â Â Â Â ie
+Â Â Â Â Â Â i.e.
      public:
      int foo;
@@ -368,7 +368,7 @@
      13. Spacing WRT return statements.
      no extra spacing before returns, no parenthesis
-Â Â Â Â Â Â ie
+Â Â Â Â Â Â i.e.
      }
      return __ret;
@@ -385,7 +385,7 @@
      14. Location of global variables.
-      All global variables of class type, whether in the "user visable"
+      All global variables of class type, whether in the "user visible"
      space (e.g., cin) or the implementation namespace, must be defined
      as a character array with the appropriate alignment and then later
      re-initialized to the correct value.
diff --git a/libstdc++-v3/doc/html/manual/bk01apas04.html b/libstdc++-v3/doc/html/manual/bk01apas04.html
index ceb73d88346..1ca6ed93900 100644
--- a/libstdc++-v3/doc/html/manual/bk01apas04.html
+++ b/libstdc++-v3/doc/html/manual/bk01apas04.html
@@ -83,7 +83,7 @@
(Examples of all these abound in the present code.)
doc/Makefile.am
and defaults
to /usr/share/sgml/docbook/xsl-stylesheets
.
libxslt
.
xml/index.xml
      faq.xml  - index to FAQ
      api.xml  - index to source level / APIÂ
-      All *.txml files are template xml files, ie otherwise empty files with
+      All *.txml files are template xml files, i.e., otherwise empty files with
      the correct structure, suitable for filling in with new information.
-      Cannonical Writing Style
+      Canonical Writing Style
      class template
      function template
diff --git a/libstdc++-v3/doc/html/manual/bk01apas05.html b/libstdc++-v3/doc/html/manual/bk01apas05.html
index 27baae87413..79d6f217bc0 100644
--- a/libstdc++-v3/doc/html/manual/bk01apas05.html
+++ b/libstdc++-v3/doc/html/manual/bk01apas05.html
@@ -210,7 +210,7 @@
    "export") is badly needed.
    When building a shared library, the current compiler/linker cannot
-    automatically generate the instantiatiations needed. This creates a
+    automatically generate the instantiations needed. This creates a
    miserable situation; it means any time something is changed in the
    library, before a shared library can be built someone must manually
    copy the declarations of all templates that are needed by other parts
@@ -814,7 +814,7 @@
    by filebuf. These wrappings have not been completed, though there
    is scaffolding in place.
-    The encapulation of certain C header <cstdio> names presents an
+    The encapsulation of certain C header <cstdio> names presents an
    interesting problem. It is possible to define an inline std::fprintf()
    implemented in terms of the 'extern "C"' vfprintf(), but there is no
    standard vfscanf() to use to implement std::fscanf(). It appears that
diff --git a/libstdc++-v3/doc/html/manual/bk01pt01ch01.html b/libstdc++-v3/doc/html/manual/bk01pt01ch01.html
index ab5c04569e7..cf60565fdd9 100644
--- a/libstdc++-v3/doc/html/manual/bk01pt01ch01.html
+++ b/libstdc++-v3/doc/html/manual/bk01pt01ch01.html
@@ -6101,7 +6101,7 @@ In this implementation the header names are prefixed by
Section Description Done Broken Missing Comments 2 General Utilities 2.1 Reference wrappers done    2.1.1 Additions to header <functional>
synopsisdone    2.1.2 Class template reference_wrapper
done    2.1.2.1 reference_wrapper
construct/copy/destroydone    2.1.2.2 reference_wrapper
assignmentdone    2.1.2.3 reference_wrapper
accessdone    2.1.2.4 reference_wrapper
invocationdone    2.1.2.5 reference_wrapper
helper functionsdone    2.2 Smart pointers done    2.2.1 Additions to header <memory>
synopsisdone    2.2.2 Class bad_weak_ptr
done    2.2.3 Class template shared_ptr
done   See Footnotes 2.2.3.1 shared_ptr
constructorsdone    2.2.3.2 shared_ptr
destructordone    2.2.3.3 shared_ptr
assignmentdone    2.2.3.4 shared_ptr
modifiersdone    2.2.3.5 shared_ptr
observersdone    2.2.3.6 shared_ptr
comparisondone    2.2.3.7 shared_ptr
I/Odone    2.2.3.8 shared_ptr
specialized algorithmsdone    2.2.3.9 shared_ptr
castsdone    2.2.3.10 get_deleter
done    2.2.4 Class template weak_ptr
done    2.2.4.1 weak_ptr
constructorsdone    2.2.4.2 weak_ptr
destructordone    2.2.4.3 weak_ptr
assignmentdone    2.2.4.4 weak_ptr
modifiersdone    2.2.4.5 weak_ptr
observersdone    2.2.4.6 weak_ptr
comparisondone    2.2.4.7 weak_ptr
specialized algorithmsdone    2.2.5 Class template enable_shared_from_this
done    3 Function Objects 3.1 Definitions done    3.2 Additions to <functional> synopsis
done    3.3 Requirements done    3.4 Function return types done    3.5 Function template mem_fn
done    3.6 Function object binders done    3.6.1 Class template is_bind_expression
done    3.6.2 Class template is_placeholder
done    3.6.3 Function template bind
done    3.6.4 Placeholders done    3.7 Polymorphic function wrappers done    3.7.1 Class bad_function_call
done    3.7.1.1 bad_function_call
constructordone    3.7.2 Class template function
done    3.7.2.1 function
construct/copy/destroydone    3.7.2.2 function
modifiersdone    3.7.2.3 function
capacitydone    3.7.2.4 function
invocationdone    3.7.2.5 function
target accessdone    3.7.2.6 undefined operators done    3.7.2.7 null pointer comparison operators done    3.7.2.8 specialized algorithms done    4 Metaprogramming and type traits 4.1 Requirements done    4.2 Header <type_traits>
synopsisdone    4.3 Helper classes done    4.4 General Requirements done    4.5 Unary Type Traits done    4.5.1 Primary Type Categories done    4.5.2 Composite type traits done    4.5.3 Type properties done    4.6 Relationships between types done    4.7 Transformations between types done    4.7.1 Const-volatile modifications done    4.7.2 Reference modifications done    4.7.3 Array modifications done    4.7.4 Pointer modifications done    4.8 Other transformations done    4.9 Implementation requirements done    5 Numerical Facilities 5.1 Random number generation done    5.1.1 Requirements done    5.1.2 Header <random>
synopsisdone    5.1.3 Class template variate_generator
done    5.1.4 Random number engine class templates done    5.1.4.1 Class template linear_congruential
done    5.1.4.2 Class template mersenne_twister
done    5.1.4.3 Class template subtract_with_carry
done    5.1.4.4 Class template subtract_with_carry_01
done    5.1.4.5 Class template discard_block
done    5.1.4.6 Class template xor_combine
done   operator()() per N2079 5.1.5 Engines with predefined parameters done    5.1.6 Class random_device
done    5.1.7 Random distribution class templates done    5.1.7.1 Class template uniform_int
done    5.1.7.2 Class bernoulli_distribution
done    5.1.7.3 Class template geometric_distribution
done    5.1.7.4 Class template poisson_distribution
done    5.1.7.5 Class template binomial_distribution
done    5.1.7.6 Class template uniform_real
done    5.1.7.7 Class template exponential_distribution
done    5.1.7.8 Class template normal_distribution
done    5.1.7.9 Class template gamma_distribution
done    5.2 Mathematical special functions done    5.2.1 Additions to header <cmath>
synopsisdone    5.2.1.1 associated Laguerre polynomials done    5.2.1.2 associated Legendre functions done    5.2.1.3 beta function done    5.2.1.4 (complete) elliptic integral of the first kind done    5.2.1.5 (complete) elliptic integral of the second kind done    5.2.1.6 (complete) elliptic integral of the third kind done    5.2.1.7 confluent hypergeometric functions done    5.2.1.8 regular modified cylindrical Bessel functions done    5.2.1.9 cylindrical Bessel functions (of the first kind) done    5.2.1.10 irregular modified cylindrical Bessel functions done    5.2.1.11 cylindrical Neumann functions done    5.2.1.12 (incomplete) elliptic integral of the first kind done    5.2.1.13 (incomplete) elliptic integral of the second kind done    5.2.1.14 (incomplete) elliptic integral of the third kind done    5.2.1.15 exponential integral done    5.2.1.16 Hermite polynomials done    5.2.1.17 hypergeometric functions done    5.2.1.18 Laguerre polynomials done    5.2.1.19 Legendre polynomials done    5.2.1.20 Riemann zeta function done    5.2.1.21 spherical Bessel functions (of the first kind) done    5.2.1.22 spherical associated Legendre functions done    5.2.1.23 spherical Neumann functions done    5.2.2 Additions to header <math.h>
synopsisdone    6 Containers 6.1 Tuple types done    6.1.1 Header <tuple>
synopsisdone    6.1.2 Additions to header <utility>
synopsisdone    6.1.3 Class template tuple
done    6.1.3.1 Construction done    6.1.3.2 Tuple creation functions done    6.1.3.3 Tuple helper classes done    6.1.3.4 Element access done    6.1.3.5 Relational operators done    6.1.4 Pairs done    6.2 Fixed size array done    6.2.1 Header <array>
synopsisdone    6.2.2 Class template array
done    6.2.2.1 array
constructors, copy, and assignmentdone    6.2.2.2 array
specialized algorithmsdone    6.2.2.3 array
sizedone    6.2.2.4 Zero sized array
sdone    6.2.2.5 Tuple interface to class template array
done    6.3 Unordered associative containers done    6.3.1 Unordered associative container requirements done    6.3.1.1 Exception safety guarantees done    6.3.2 Additions to header <functional>
synopsisdone    6.3.3 Class template hash
done    6.3.4 Unordered associative container classes done    6.3.4.1 Header <unordered_set>
synopsisdone    6.3.4.2 Header <unordered_map>
synopsisdone    6.3.4.3 Class template unordered_set
done    6.3.4.3.1 unordered_set
constructorsdone    6.3.4.3.2 unordered_set
swapdone    6.3.4.4 Class template unordered_map
done    6.3.4.4.1 unordered_map
constructorsdone    6.3.4.4.2 unordered_map
element accessdone    6.3.4.4.3 unordered_map
swapdone    6.3.4.5 Class template unordered_multiset
done    6.3.4.5.1 unordered_multiset
constructorsdone    6.3.4.5.2 unordered_multiset
swapdone    6.3.4.6 Class template unordered_multimap
done    6.3.4.6.1 unordered_multimap
constructorsdone    6.3.4.6.2 unordered_multimap
swapdone    7 Regular Expressions 7.1 Definitions   missing  7.2 Requirements   missing  7.3 Regular expressions summary   missing  7.4 Header <regex>
synopsis  missing  7.5 Namespace tr1::regex_constants
  missing  7.5.1 Bitmask Type syntax_option_type
  missing  7.5.2 Bitmask Type regex_constants::match_flag_type
  missing  7.5.3 Implementation defined error_type
  missing  7.6 Class regex_error
  missing  7.7 Class template regex_traits
  missing  7.8 Class template basic_regex
  missing  7.8.1 basic_regex
constants  missing  7.8.2 basic_regex
constructors  missing  7.8.3 basic_regex
assign  missing  7.8.4 basic_regex
constant operations  missing  7.8.5 basic_regex
locale  missing  7.8.6 basic_regex
swap  missing  7.8.7 basic_regex
non-member functions  missing  7.8.7.1 basic_regex
non-member swap  missing  7.9 Class template sub_match
  missing  7.9.1 sub_match
members  missing  7.9.2 sub_match
non-member operators  missing  7.10 Class template match_results
  missing  7.10.1 match_results
constructors  missing  7.10.2 match_results
size  missing  7.10.3 match_results
element access  missing  7.10.4 match_results
formatting  missing  7.10.5 match_results
allocator  missing  7.10.6 match_results
swap  missing  7.11 Regular expression algorithms   missing  7.11.1 exceptions   missing  7.11.2 regex_match
  missing  7.11.3 regex_search
  missing  7.11.4 regex_replace
  missing  7.12 Regular expression Iterators   missing  7.12.1 Class template regex_iterator
  missing  7.12.1.1 regex_iterator
constructors  missing  7.12.1.2 regex_iterator
comparisons  missing  7.12.1.3 regex_iterator
dereference  missing  7.12.1.4 regex_iterator
increment  missing  7.12.2 Class template regex_token_iterator
  missing  7.12.2.1 regex_token_iterator
constructors  missing  7.12.2.2 regex_token_iterator
comparisons  missing  7.12.2.3 regex_token_iterator
dereference  missing  7.12.2.4 regex_token_iterator
increment  missing  7.13 Modified ECMAScript regular expression grammar   missing  8 C Compatibility 8.1 Additions to header <complex>
done    8.1.1 Synopsis done    8.1.2 Function acos
done    8.1.3 Function asin
done    8.1.4 Function atan
done    8.1.5 Function acosh
done    8.1.6 Function asinh
done    8.1.7 Function atanh
done    8.1.8 Function fabs
done    8.1.9 Additional Overloads done    8.2 Header <ccomplex>
  missing DR 551 8.3 Header <complex.h>
  missing DR 551 8.4 Additions to header <cctype>
done    8.4.1 Synopsis done    8.4.2 Function isblank
done    8.5 Additions to header <ctype.h>
done    8.6 Header <cfenv>
done    8.6.1 Synopsis done    8.6.2 Definitions done    8.7 Header <fenv.h>
done    8.8 Additions to header <cfloat>
done    8.9 Additions to header <float.h>
done    8.10 Additions to header <ios>
  missing  8.10.1 Synopsis   missing  8.10.2 Function hexfloat
  missing  8.11 Header <cinttypes>
done    8.11.1 Synopsis done   DR 557 8.11.2 Definitions done    8.12 Header <inttypes.h>
done    8.13 Additions to header <climits>
done    8.14 Additions to header <limits.h>
done    8.15 Additions to header <locale>
  missing  8.16 Additions to header <cmath>
done    8.16.1 Synopsis done    8.16.2 Definitions done    8.16.3 Function template definitions done    8.16.4 Additional overloads done   DR 568; DR 550 8.17 Additions to header <math.h>
done    8.18 Additions to header <cstdarg>
done    8.19 Additions to header <stdarg.h>
done    8.20 The header <cstdbool>
done    8.21 The header <stdbool.h>
done    8.22 The header <cstdint>
done    8.22.1 Synopsis done    8.22.2 Definitions done    8.23 The header <stdint.h>
done    8.24 Additions to header <cstdio>
done    8.24.1 Synopsis done    8.24.2 Definitions done    8.24.3 Additional format specifiers done   C library responsibility 8.24.4 Additions to header <stdio.h>
done    8.25 Additions to header <cstdlib>
done    8.25.1 Synopsis done    8.25.2 Definitions done    8.25.3 Function abs
done    8.25.4 Function div
done    8.26 Additions to header <stdlib.h>
done    8.27 Header <ctgmath>
done   DR 551 8.28 Header <tgmath.h>
done   DR 551 8.29 Additions to header <ctime>
done   C library responsibility 8.30 Additions to header <cwchar>
done    8.30.1 Synopsis done    8.30.2 Definitions done    8.30.3 Additional wide format specifiers done   C library responsibility 8.31 Additions to header <wchar.h>
done    8.32 Additions to header <cwctype>
done    8.32.1 Synopsis done    8.32.2 Function iswblank
done    8.33 Additions to header <wctype.h>
done    Section Description Done Broken Missing Comments 2 General Utilities 2.1 Reference wrappers done    2.1.1 Additions to header <functional>
synopsisdone    2.1.2 Class template reference_wrapper
done    2.1.2.1 reference_wrapper
construct/copy/destroydone    2.1.2.2 reference_wrapper
assignmentdone    2.1.2.3 reference_wrapper
accessdone    2.1.2.4 reference_wrapper
invocationdone    2.1.2.5 reference_wrapper
helper functionsdone    2.2 Smart pointers done    2.2.1 Additions to header <memory>
synopsisdone    2.2.2 Class bad_weak_ptr
done    2.2.3 Class template shared_ptr
done   See Footnotes 2.2.3.1 shared_ptr
constructorsdone    2.2.3.2 shared_ptr
destructordone    2.2.3.3 shared_ptr
assignmentdone    2.2.3.4 shared_ptr
modifiersdone    2.2.3.5 shared_ptr
observersdone    2.2.3.6 shared_ptr
comparisondone    2.2.3.7 shared_ptr
I/Odone    2.2.3.8 shared_ptr
specialized algorithmsdone    2.2.3.9 shared_ptr
castsdone    2.2.3.10 get_deleter
done    2.2.4 Class template weak_ptr
done    2.2.4.1 weak_ptr
constructorsdone    2.2.4.2 weak_ptr
destructordone    2.2.4.3 weak_ptr
assignmentdone    2.2.4.4 weak_ptr
modifiersdone    2.2.4.5 weak_ptr
observersdone    2.2.4.6 weak_ptr
comparisondone    2.2.4.7 weak_ptr
specialized algorithmsdone    2.2.5 Class template enable_shared_from_this
done    3 Function Objects 3.1 Definitions done    3.2 Additions to <functional> synopsis
done    3.3 Requirements done    3.4 Function return types done    3.5 Function template mem_fn
done    3.6 Function object binders done    3.6.1 Class template is_bind_expression
done    3.6.2 Class template is_placeholder
done    3.6.3 Function template bind
done    3.6.4 Placeholders done    3.7 Polymorphic function wrappers done    3.7.1 Class bad_function_call
done    3.7.1.1 bad_function_call
constructordone    3.7.2 Class template function
done    3.7.2.1 function
construct/copy/destroydone    3.7.2.2 function
modifiersdone    3.7.2.3 function
capacitydone    3.7.2.4 function
invocationdone    3.7.2.5 function
target accessdone    3.7.2.6 undefined operators done    3.7.2.7 null pointer comparison operators done    3.7.2.8 specialized algorithms done    4 Metaprogramming and type traits 4.1 Requirements done    4.2 Header <type_traits>
synopsisdone    4.3 Helper classes done    4.4 General Requirements done    4.5 Unary Type Traits done    4.5.1 Primary Type Categories done    4.5.2 Composite type traits done    4.5.3 Type properties done    4.6 Relationships between types done    4.7 Transformations between types done    4.7.1 Const-volatile modifications done    4.7.2 Reference modifications done    4.7.3 Array modifications done    4.7.4 Pointer modifications done    4.8 Other transformations done    4.9 Implementation requirements done    5 Numerical Facilities 5.1 Random number generation done    5.1.1 Requirements done    5.1.2 Header <random>
synopsisdone    5.1.3 Class template variate_generator
done    5.1.4 Random number engine class templates done    5.1.4.1 Class template linear_congruential
done    5.1.4.2 Class template mersenne_twister
done    5.1.4.3 Class template subtract_with_carry
done    5.1.4.4 Class template subtract_with_carry_01
done    5.1.4.5 Class template discard_block
done    5.1.4.6 Class template xor_combine
done   operator()() per N2079 5.1.5 Engines with predefined parameters done    5.1.6 Class random_device
done    5.1.7 Random distribution class templates done    5.1.7.1 Class template uniform_int
done    5.1.7.2 Class bernoulli_distribution
done    5.1.7.3 Class template geometric_distribution
done    5.1.7.4 Class template poisson_distribution
done    5.1.7.5 Class template binomial_distribution
done    5.1.7.6 Class template uniform_real
done    5.1.7.7 Class template exponential_distribution
done    5.1.7.8 Class template normal_distribution
done    5.1.7.9 Class template gamma_distribution
done    5.2 Mathematical special functions done    5.2.1 Additions to header <cmath>
synopsisdone    5.2.1.1 associated Laguerre polynomials done    5.2.1.2 associated Legendre functions done    5.2.1.3 beta function done    5.2.1.4 (complete) elliptic integral of the first kind done    5.2.1.5 (complete) elliptic integral of the second kind done    5.2.1.6 (complete) elliptic integral of the third kind done    5.2.1.7 confluent hypergeometric functions done    5.2.1.8 regular modified cylindrical Bessel functions done    5.2.1.9 cylindrical Bessel functions (of the first kind) done    5.2.1.10 irregular modified cylindrical Bessel functions done    5.2.1.11 cylindrical Neumann functions done    5.2.1.12 (incomplete) elliptic integral of the first kind done    5.2.1.13 (incomplete) elliptic integral of the second kind done    5.2.1.14 (incomplete) elliptic integral of the third kind done    5.2.1.15 exponential integral done    5.2.1.16 Hermite polynomials done    5.2.1.17 hypergeometric functions done    5.2.1.18 Laguerre polynomials done    5.2.1.19 Legendre polynomials done    5.2.1.20 Riemann zeta function done    5.2.1.21 spherical Bessel functions (of the first kind) done    5.2.1.22 spherical associated Legendre functions done    5.2.1.23 spherical Neumann functions done    5.2.2 Additions to header <math.h>
synopsisdone    6 Containers 6.1 Tuple types done    6.1.1 Header <tuple>
synopsisdone    6.1.2 Additions to header <utility>
synopsisdone    6.1.3 Class template tuple
done    6.1.3.1 Construction done    6.1.3.2 Tuple creation functions done    6.1.3.3 Tuple helper classes done    6.1.3.4 Element access done    6.1.3.5 Relational operators done    6.1.4 Pairs done    6.2 Fixed size array done    6.2.1 Header <array>
synopsisdone    6.2.2 Class template array
done    6.2.2.1 array
constructors, copy, and assignmentdone    6.2.2.2 array
specialized algorithmsdone    6.2.2.3 array
sizedone    6.2.2.4 Zero sized array
sdone    6.2.2.5 Tuple interface to class template array
done    6.3 Unordered associative containers done    6.3.1 Unordered associative container requirements done    6.3.1.1 Exception safety guarantees done    6.3.2 Additions to header <functional>
synopsisdone    6.3.3 Class template hash
done    6.3.4 Unordered associative container classes done    6.3.4.1 Header <unordered_set>
synopsisdone    6.3.4.2 Header <unordered_map>
synopsisdone    6.3.4.3 Class template unordered_set
done    6.3.4.3.1 unordered_set
constructorsdone    6.3.4.3.2 unordered_set
swapdone    6.3.4.4 Class template unordered_map
done    6.3.4.4.1 unordered_map
constructorsdone    6.3.4.4.2 unordered_map
element accessdone    6.3.4.4.3 unordered_map
swapdone    6.3.4.5 Class template unordered_multiset
done    6.3.4.5.1 unordered_multiset
constructorsdone    6.3.4.5.2 unordered_multiset
swapdone    6.3.4.6 Class template unordered_multimap
done    6.3.4.6.1 unordered_multimap
constructorsdone    6.3.4.6.2 unordered_multimap
swapdone    7 Regular Expressions 7.1 Definitions   missing  7.2 Requirements   missing  7.3 Regular expressions summary   missing  7.4 Header <regex>
synopsis  missing  7.5 Namespace tr1::regex_constants
  missing  7.5.1 Bitmask Type syntax_option_type
  missing  7.5.2 Bitmask Type regex_constants::match_flag_type
  missing  7.5.3 Implementation defined error_type
  missing  7.6 Class regex_error
  missing  7.7 Class template regex_traits
  missing  7.8 Class template basic_regex
  missing  7.8.1 basic_regex
constants  missing  7.8.2 basic_regex
constructors  missing  7.8.3 basic_regex
assign  missing  7.8.4 basic_regex
constant operations  missing  7.8.5 basic_regex
locale  missing  7.8.6 basic_regex
swap  missing  7.8.7 basic_regex
non-member functions  missing  7.8.7.1 basic_regex
non-member swap  missing  7.9 Class template sub_match
  missing  7.9.1 sub_match
members  missing  7.9.2 sub_match
non-member operators  missing  7.10 Class template match_results
  missing  7.10.1 match_results
constructors  missing  7.10.2 match_results
size  missing  7.10.3 match_results
element access  missing  7.10.4 match_results
formatting  missing  7.10.5 match_results
allocator  missing  7.10.6 match_results
swap  missing  7.11 Regular expression algorithms   missing  7.11.1 exceptions   missing  7.11.2 regex_match
  missing  7.11.3 regex_search
  missing  7.11.4 regex_replace
  missing  7.12 Regular expression Iterators   missing  7.12.1 Class template regex_iterator
  missing  7.12.1.1 regex_iterator
constructors  missing  7.12.1.2 regex_iterator
comparisons  missing  7.12.1.3 regex_iterator
dereference  missing  7.12.1.4 regex_iterator
increment  missing  7.12.2 Class template regex_token_iterator
  missing  7.12.2.1 regex_token_iterator
constructors  missing  7.12.2.2 regex_token_iterator
comparisons  missing  7.12.2.3 regex_token_iterator
dereference  missing  7.12.2.4 regex_token_iterator
increment  missing  7.13 Modified ECMAScript regular expression grammar   missing  8 C Compatibility 8.1 Additions to header <complex>
done    8.1.1 Synopsis done    8.1.2 Function acos
done    8.1.3 Function asin
done    8.1.4 Function atan
done    8.1.5 Function acosh
done    8.1.6 Function asinh
done    8.1.7 Function atanh
done    8.1.8 Function fabs
done    8.1.9 Additional Overloads done    8.2 Header <ccomplex>
  missing DR 551 8.3 Header <complex.h>
  missing DR 551 8.4 Additions to header <cctype>
done    8.4.1 Synopsis done    8.4.2 Function isblank
done    8.5 Additions to header <ctype.h>
done    8.6 Header <cfenv>
done    8.6.1 Synopsis done    8.6.2 Definitions done    8.7 Header <fenv.h>
done    8.8 Additions to header <cfloat>
done    8.9 Additions to header <float.h>
done    8.10 Additions to header <ios>
  missing  8.10.1 Synopsis   missing  8.10.2 Function hexfloat
  missing  8.11 Header <cinttypes>
done    8.11.1 Synopsis done   DR 557 8.11.2 Definitions done    8.12 Header <inttypes.h>
done    8.13 Additions to header <climits>
done    8.14 Additions to header <limits.h>
done    8.15 Additions to header <locale>
  missing  8.16 Additions to header <cmath>
done    8.16.1 Synopsis done    8.16.2 Definitions done    8.16.3 Function template definitions done    8.16.4 Additional overloads done   DR 568; DR 550 8.17 Additions to header <math.h>
done    8.18 Additions to header <cstdarg>
done    8.19 Additions to header <stdarg.h>
done    8.20 The header <cstdbool>
done    8.21 The header <stdbool.h>
done    8.22 The header <cstdint>
done    8.22.1 Synopsis done    8.22.2 Definitions done    8.23 The header <stdint.h>
done    8.24 Additions to header <cstdio>
done    8.24.1 Synopsis done    8.24.2 Definitions done    8.24.3 Additional format specifiers done   C library responsibility 8.24.4 Additions to header <stdio.h>
done    8.25 Additions to header <cstdlib>
done    8.25.1 Synopsis done    8.25.2 Definitions done    8.25.3 Function abs
done    8.25.4 Function div
done    8.26 Additions to header <stdlib.h>
done    8.27 Header <ctgmath>
done   DR 551 8.28 Header <tgmath.h>
done   DR 551 8.29 Additions to header <ctime>
done   C library responsibility 8.30 Additions to header <cwchar>
done    8.30.1 Synopsis done    8.30.2 Definitions done    8.30.3 Additional wide format specifiers done   C library responsibility 8.31 Additions to header <wchar.h>
done    8.32 Additions to header <cwctype>
done    8.32.1 Synopsis done    8.32.2 Function iswblank
done    8.33 Additions to header <wctype.h>
done    Section Description Done Broken Missing Comments 20 General Utilities 20.2 Utility Components   incomplete  20.2.1 Operators   partial  20.2.2 forward/move helpers   partial  20.2.3 Pairs done    20.3 Header <tuple>
synopsisdone    20.3.1 Class template tuple
done    20.3.1.1 Construction done    20.3.1.2 Tuple creation functions done    20.3.1.3 Tuple helper classes done    20.3.1.4 Element access done    20.3.1.5 Relational operators done    20.4 Metaprogramming and type traits 20.4.1 Requirements done    20.4.2 Header <type_traits>
synopsisdone    20.4.3 Helper classes done    20.4.4 General Requirements done    20.4.5 Unary Type Traits done    20.4.5.1 Primary Type Categories done    20.4.5.2 Composite type traits done    20.4.5.3 Type properties done    20.4.6 Relationships between types done    20.4.7 Transformations between types done    20.4.7.1 Const-volatile modifications done    20.4.7.2 Reference modifications done    20.4.7.3 Array modifications done    20.4.7.4 Pointer modifications done    20.4.8 Other transformations done    20.4.9 Implementation requirements done    20.5 Function Objects done    20.5 Additions to header <functional>
synopsisdone    20.5.1 Definitions done    20.5.2 Requirements done    20.5.3 Base done    20.5.4 Function return types done    20.5.5 Class template reference_wrapper
done    20.5.5.1 reference_wrapper
construct/copy/destroydone    20.5.5.2 reference_wrapper
assignmentdone    20.5.5.3 reference_wrapper
accessdone    20.5.5.4 reference_wrapper
invocationdone    20.5.5.5 reference_wrapper
helper functionsdone    20.5.14 Function template mem_fn
done    20.5.11 Template function bind done    20.5.11.1 Function object binders done    20.5.11.1.1 Class template is_bind_expression
done    20.5.11.1.2 Class template is_placeholder
done    20.5.11.1.3 Function template bind
done    20.5.11.1.4 Placeholders done    20.5.15 Polymorphic function wrappers done    20.5.15.1 Class bad_function_call
done    20.5.15.1.1 bad_function_call
constructordone    20.5.15.2 Class template function
done    20.5.15.2.1 function
construct/copy/destroydone    20.5.15.2.2 function
modifiersdone    20.5.15.2.3 function
capacitydone    20.5.15.2.4 function
invocationdone    20.5.15.2.5 function
target accessdone    20.5.15.2.7 null pointer comparison operators done    20.5.15.2.8 specialized algorithms done    20.5.16 Class template hash
done    20.6 Additions to header <memory>
synopsis  partial missing unique_ptr
20.6.5 Class template unique_ptr
  missing  20.6.6 Smart pointers done    20.6.6.1 Class bad_weak_ptr
done    20.6.6.2 Class template shared_ptr
done   See Footnotes. 20.6.6.2.1 shared_ptr
constructorsdone    20.6.6.2.2 shared_ptr
destructordone    20.6.6.2.3 shared_ptr
assignmentdone    20.6.6.2.4 shared_ptr
modifiersdone    20.6.6.2.5 shared_ptr
observersdone    20.6.6.2.6 shared_ptr
creationdone  Â
+ Section Description Done Broken Missing Comments 20 General Utilities 20.2 Utility Components   incomplete  20.2.1 Operators   partial  20.2.2 forward/move helpers   partial  20.2.3 Pairs done    20.3 Header <tuple>
synopsisdone    20.3.1 Class template tuple
done    20.3.1.1 Construction done    20.3.1.2 Tuple creation functions done    20.3.1.3 Tuple helper classes done    20.3.1.4 Element access done    20.3.1.5 Relational operators done    20.4 Metaprogramming and type traits 20.4.1 Requirements done    20.4.2 Header <type_traits>
synopsisdone    20.4.3 Helper classes done    20.4.4 General Requirements done    20.4.5 Unary Type Traits done    20.4.5.1 Primary Type Categories done    20.4.5.2 Composite type traits done    20.4.5.3 Type properties done    20.4.6 Relationships between types done    20.4.7 Transformations between types done    20.4.7.1 Const-volatile modifications done    20.4.7.2 Reference modifications done    20.4.7.3 Array modifications done    20.4.7.4 Pointer modifications done    20.4.8 Other transformations done    20.4.9 Implementation requirements done    20.5 Function Objects done    20.5 Additions to header <functional>
synopsisdone    20.5.1 Definitions done    20.5.2 Requirements done    20.5.3 Base done    20.5.4 Function return types done    20.5.5 Class template reference_wrapper
done    20.5.5.1 reference_wrapper
construct/copy/destroydone    20.5.5.2 reference_wrapper
assignmentdone    20.5.5.3 reference_wrapper
accessdone    20.5.5.4 reference_wrapper
invocationdone    20.5.5.5 reference_wrapper
helper functionsdone    20.5.14 Function template mem_fn
done    20.5.11 Template function bind done    20.5.11.1 Function object binders done    20.5.11.1.1 Class template is_bind_expression
done    20.5.11.1.2 Class template is_placeholder
done    20.5.11.1.3 Function template bind
done    20.5.11.1.4 Placeholders done    20.5.15 Polymorphic function wrappers done    20.5.15.1 Class bad_function_call
done    20.5.15.1.1 bad_function_call
constructordone    20.5.15.2 Class template function
done    20.5.15.2.1 function
construct/copy/destroydone    20.5.15.2.2 function
modifiersdone    20.5.15.2.3 function
capacitydone    20.5.15.2.4 function
invocationdone    20.5.15.2.5 function
target accessdone    20.5.15.2.7 null pointer comparison operators done    20.5.15.2.8 specialized algorithms done    20.5.16 Class template hash
done    20.6 Additions to header <memory>
synopsis  partial missing unique_ptr
20.6.5 Class template unique_ptr
  missing  20.6.6 Smart pointers done    20.6.6.1 Class bad_weak_ptr
done    20.6.6.2 Class template shared_ptr
done   See Footnotes. 20.6.6.2.1 shared_ptr
constructorsdone    20.6.6.2.2 shared_ptr
destructordone    20.6.6.2.3 shared_ptr
assignmentdone    20.6.6.2.4 shared_ptr
modifiersdone    20.6.6.2.5 shared_ptr
observersdone    20.6.6.2.6 shared_ptr
creationdone  Â
N2351
- 20.6.6.2.7 shared_ptr
comparisondone    20.6.6.2.8 shared_ptr
I/Odone    20.6.6.2.9 shared_ptr
specialized algorithmsdone    20.6.6.2.10 shared_ptr
castsdone    20.6.6.2.11 get_deleter
done    20.6.6.3 Class template weak_ptr
done    20.6.6.3.1 weak_ptr
constructorsdone    20.6.6.3.2 weak_ptr
destructordone    20.6.6.3.3 weak_ptr
assignmentdone    20.6.6.3.4 weak_ptr
modifiersdone    20.6.6.3.5 weak_ptr
observersdone    20.6.6.3.6 weak_ptr
comparisondone    20.6.6.3.7 weak_ptr
specialized algorithmsdone    20.6.6.4 Class template enable_shared_from_this
done    23 Containers 23.2.1 Header <array>
synopsisdone    23.2.1 Class template array done    23.2.1.1 array
constructors, copy, and assignmentdone    23.2.1.2 array
specialized algorithmsdone    23.2.1.3 array
sizedone    23.2.1.4 array
datadone    23.2.1.5 Zero sized array
sdone    23.2.1.6 Tuple interface to class template array
done    23.4 Unordered associative containers done    23.4.1 Class template unordered_map
done    23.4.1.1 unordered_map
constructorsdone    23.4.1.2 unordered_map
element accessdone    23.4.1.3 unordered_map
swapdone    23.4.2 Class template unordered_multimap
done    23.4.2.1 unordered_multimap
constructorsdone    23.4.2.2 unordered_multimap
swapdone    23.4.3 Class template unordered_set
done    23.4.3.1 unordered_set
constructorsdone    23.4.3.2 unordered_set
swapdone    23.4.4 Class template unordered_multiset
done    23.4.4.1 unordered_multiset
constructorsdone    23.4.4.2 unordered_multiset
swapdone    26 Numerics 26.4 Random number generation done    26.4.1 Requirements done    26.4.2 Header <random>
synopsis  partial  26.4.3 Random number engine class templates done    26.4.3.1 Class template linear_congruential_engine
done    26.4.3.2 Class template mersenne_twister_engine
done    26.4.3.3 Class template subtract_with_carry_engine
done    26.4.4 Random number engine adaptor class templates done    26.4.4.1 Class template discard_block_engine
done    26.4.4.2 Class template independent_bits_engine
done    26.4.4.3 Class template shuffle_order_engine
done    26.4.4.4 Class template xor_combine_engine
done   operator()() per N2079 26.4.5 Engines and engine adaptors with predefined parameters done    26.4.6 Class random_device
done    26.4.7 Utilities done    26.4.7.1 Class seed_seq
  missing  26.4.7.2 Function template generate_cannonical
  missing  26.4.8 Random number generation class templates done    26.4.8.1 Uniform distributions   partial  26.4.8.1 Class template uniform_int_distribution
  missing  26.4.8.1 Class template uniform_real_distribution
  missing  26.4.8.2 Bernoulli distributions   partial  26.4.8.2.1 Class bernoulli_distribution
done    26.4.8.2.2 Class template binomial_distribution
done    26.4.8.2.3 Class template geometric_distribution
done    26.4.8.2.4 Class template negative_binomial_distribution
  missing  26.4.8.3 Poisson distributions   partial  26.4.8.3.1 Class template poisson_distribution
done    26.4.8.3.2 Class template exponential_distribution
done    26.4.8.3.3 Class template gamma_distribution
done    26.4.8.3.4 Class template weibull_distribution
  missing  26.4.8.3.5 Class template extreme_value_distribution
  missing  26.4.8.4 Normal distributions   partial  26.4.8.4.1 Class template normal_distribution
done    26.4.8.4.2 Class template lognormal_distribution
  missing  26.4.8.4.3 Class template chi_squared_distribution
  missing  26.4.8.4.4 Class template cauchy_distribution
  missing  26.4.8.4.5 Class template fisher_f_distribution
  missing  26.4.8.4.6 Class template student_t_distribution
  missing  26.4.8.5 Sampling distributions   missing  26.4.8.5.1 Class template discrete_distribution
  missing  26.4.8.5.1 Class template piecewise_constant_distribution
  missing  26.4.8.5.1 Class template general_pdf_distribution
  missing  28 Regular Expressions 28.1 Definitions   missing  28.2 Requirements   missing  28.3 Regular expressions summary   missing  28.4 Header <regex>
synopsis  missing  28.5 Namespace tr1::regex_constants
  missing  28.5.1 Bitmask Type syntax_option_type
  missing  28.5.2 Bitmask Type regex_constants::match_flag_type
  missing  28.5.3 Implementation defined error_type
  missing  28.6 Class regex_error
  missing  28.7 Class template regex_traits
  missing  28.8 Class template basic_regex
  missing  28.8.1 basic_regex
constants  missing  28.8.2 basic_regex
constructors  missing  28.8.3 basic_regex
assign  missing  28.8.4 basic_regex
constant operations  missing  28.8.5 basic_regex
locale  missing  28.8.6 basic_regex
swap  missing  28.8.7 basic_regex
non-member functions  missing  28.8.7.1 basic_regex
non-member swap  missing  28.9 Class template sub_match
  missing  28.9.1 sub_match
members  missing  28.9.2 sub_match
non-member operators  missing  28.10 Class template match_results
  missing  28.10.1 match_results
constructors  missing  28.10.2 match_results
size  missing  28.10.3 match_results
element access  missing  28.10.4 match_results
formatting  missing  28.10.5 match_results
allocator  missing  28.10.6 match_results
swap  missing  28.11 Regular expression algorithms   missing  28.11.1 exceptions   missing  28.11.2 regex_match
  missing  28.11.3 regex_search
  missing  28.11.4 regex_replace
  missing  28.12 Regular expression Iterators   missing  28.12.1 Class template regex_iterator
  missing  28.12.1.1 regex_iterator
constructors  missing  28.12.1.2 regex_iterator
comparisons  missing  28.12.1.3 regex_iterator
dereference  missing  28.12.1.4 regex_iterator
increment  missing  28.12.2 Class template regex_token_iterator
  missing  28.12.2.1 regex_token_iterator
constructors  missing  28.12.2.2 regex_token_iterator
comparisons  missing  28.12.2.3 regex_token_iterator
dereference  missing  28.12.2.4 regex_token_iterator
increment  missing  28.13 Modified ECMAScript regular expression grammar   missing  C C Compatibility C2.1 Additions to header <complex>
done    C2.1.1 Synopsis done    C2.1.2 Function acos
done    C2.1.3 Function asin
done    C2.1.4 Function atan
done    C2.1.5 Function acosh
done    C2.1.6 Function asinh
done    C2.1.7 Function atanh
done    C2.1.8 Function fabs
done    C2.1.9 Additional Overloads done    C2.2 Header <ccomplex>
  missing DR 551 C2.3 Header <complex.h>
  missing DR 551 C2.4 Additions to header <cctype>
done    C2.4.1 Synopsis done    C2.4.2 Function isblank
done    C2.5 Additions to header <ctype.h>
done    C2.6 Header <cfenv>
done    C2.6.1 Synopsis done    C2.6.2 Definitions done    C2.7 Header <fenv.h>
done    C2.8 Additions to header <cfloat>
done    C2.9 Additions to header <float.h>
done    C2.10 Additions to header <ios>
  missing  C2.10.1 Synopsis   missing  C2.10.2 Function hexfloat
  missing  C2.11 Header <cinttypes>
done    C2.11.1 Synopsis done   DR 557 C2.11.2 Definitions done    C2.12 Header <inttypes.h>
done    C2.13 Additions to header <climits>
done    C2.14 Additions to header <limits.h>
done    C2.15 Additions to header <locale>
  missing  C2.16 Additions to header <cmath>
done    C2.16.1 Synopsis done    C2.16.2 Definitions done    C2.16.3 Function template definitions done    C2.16.4 Additional overloads done   DR 568; DR 550 C2.17 Additions to header <math.h>
done    C2.18 Additions to header <cstdarg>
done    C2.19 Additions to header <stdarg.h>
done    C2.20 The header <cstdbool>
done    C2.21 The header <stdbool.h>
done    C2.22 The header <cstdint>
done    C2.22.1 Synopsis done    C2.22.2 Definitions done    C2.23 The header <stdint.h>
done    C2.24 Additions to header <cstdio>
done    C2.24.1 Synopsis done    C2.24.2 Definitions done    C2.24.3 Additional format specifiers done   C library responsibility C2.24.4 Additions to header <stdio.h>
done    C2.25 Additions to header <cstdlib>
done    C2.25.1 Synopsis done    C2.25.2 Definitions done    C2.25.3 Function abs
done    C2.25.4 Function div
done    C2.26 Additions to header <stdlib.h>
done    C2.27 Header <ctgmath>
done   DR 551 C2.28 Header <tgmath.h>
done   DR 551 C2.29 Additions to header <ctime>
done   C library responsibility C2.30 Additions to header <cwchar>
done    C2.30.1 Synopsis done    C2.30.2 Definitions done    C2.30.3 Additional wide format specifiers done   C library responsibility C2.31 Additions to header <wchar.h>
done    C2.32 Additions to header <cwctype>
done    C2.32.1 Synopsis done    C2.32.2 Function iswblank
done    C2.33 Additions to header <wctype.h>
done    D Compatibility Features D.6 Old iostream members done    D.8 Binders done   33911 D.9 Class template auto_ptr
done   33911 20.6.6.2.7 shared_ptr
comparisondone    20.6.6.2.8 shared_ptr
I/Odone    20.6.6.2.9 shared_ptr
specialized algorithmsdone    20.6.6.2.10 shared_ptr
castsdone    20.6.6.2.11 get_deleter
done    20.6.6.3 Class template weak_ptr
done    20.6.6.3.1 weak_ptr
constructorsdone    20.6.6.3.2 weak_ptr
destructordone    20.6.6.3.3 weak_ptr
assignmentdone    20.6.6.3.4 weak_ptr
modifiersdone    20.6.6.3.5 weak_ptr
observersdone    20.6.6.3.6 weak_ptr
comparisondone    20.6.6.3.7 weak_ptr
specialized algorithmsdone    20.6.6.4 Class template enable_shared_from_this
done    23 Containers 23.2.1 Header <array>
synopsisdone    23.2.1 Class template array done    23.2.1.1 array
constructors, copy, and assignmentdone    23.2.1.2 array
specialized algorithmsdone    23.2.1.3 array
sizedone    23.2.1.4 array
datadone    23.2.1.5 Zero sized array
sdone    23.2.1.6 Tuple interface to class template array
done    23.4 Unordered associative containers done    23.4.1 Class template unordered_map
done    23.4.1.1 unordered_map
constructorsdone    23.4.1.2 unordered_map
element accessdone    23.4.1.3 unordered_map
swapdone    23.4.2 Class template unordered_multimap
done    23.4.2.1 unordered_multimap
constructorsdone    23.4.2.2 unordered_multimap
swapdone    23.4.3 Class template unordered_set
done    23.4.3.1 unordered_set
constructorsdone    23.4.3.2 unordered_set
swapdone    23.4.4 Class template unordered_multiset
done    23.4.4.1 unordered_multiset
constructorsdone    23.4.4.2 unordered_multiset
swapdone    26 Numerics 26.4 Random number generation done    26.4.1 Requirements done    26.4.2 Header <random>
synopsis  partial  26.4.3 Random number engine class templates done    26.4.3.1 Class template linear_congruential_engine
done    26.4.3.2 Class template mersenne_twister_engine
done    26.4.3.3 Class template subtract_with_carry_engine
done    26.4.4 Random number engine adaptor class templates done    26.4.4.1 Class template discard_block_engine
done    26.4.4.2 Class template independent_bits_engine
done    26.4.4.3 Class template shuffle_order_engine
done    26.4.4.4 Class template xor_combine_engine
done   operator()() per N2079 26.4.5 Engines and engine adaptors with predefined parameters done    26.4.6 Class random_device
done    26.4.7 Utilities done    26.4.7.1 Class seed_seq
  missing  26.4.7.2 Function template generate_canonical
  missing  26.4.8 Random number generation class templates done    26.4.8.1 Uniform distributions   partial  26.4.8.1 Class template uniform_int_distribution
  missing  26.4.8.1 Class template uniform_real_distribution
  missing  26.4.8.2 Bernoulli distributions   partial  26.4.8.2.1 Class bernoulli_distribution
done    26.4.8.2.2 Class template binomial_distribution
done    26.4.8.2.3 Class template geometric_distribution
done    26.4.8.2.4 Class template negative_binomial_distribution
  missing  26.4.8.3 Poisson distributions   partial  26.4.8.3.1 Class template poisson_distribution
done    26.4.8.3.2 Class template exponential_distribution
done    26.4.8.3.3 Class template gamma_distribution
done    26.4.8.3.4 Class template weibull_distribution
  missing  26.4.8.3.5 Class template extreme_value_distribution
  missing  26.4.8.4 Normal distributions   partial  26.4.8.4.1 Class template normal_distribution
done    26.4.8.4.2 Class template lognormal_distribution
  missing  26.4.8.4.3 Class template chi_squared_distribution
  missing  26.4.8.4.4 Class template cauchy_distribution
  missing  26.4.8.4.5 Class template fisher_f_distribution
  missing  26.4.8.4.6 Class template student_t_distribution
  missing  26.4.8.5 Sampling distributions   missing  26.4.8.5.1 Class template discrete_distribution
  missing  26.4.8.5.1 Class template piecewise_constant_distribution
  missing  26.4.8.5.1 Class template general_pdf_distribution
  missing  28 Regular Expressions 28.1 Definitions   missing  28.2 Requirements   missing  28.3 Regular expressions summary   missing  28.4 Header <regex>
synopsis  missing  28.5 Namespace tr1::regex_constants
  missing  28.5.1 Bitmask Type syntax_option_type
  missing  28.5.2 Bitmask Type regex_constants::match_flag_type
  missing  28.5.3 Implementation defined error_type
  missing  28.6 Class regex_error
  missing  28.7 Class template regex_traits
  missing  28.8 Class template basic_regex
  missing  28.8.1 basic_regex
constants  missing  28.8.2 basic_regex
constructors  missing  28.8.3 basic_regex
assign  missing  28.8.4 basic_regex
constant operations  missing  28.8.5 basic_regex
locale  missing  28.8.6 basic_regex
swap  missing  28.8.7 basic_regex
non-member functions  missing  28.8.7.1 basic_regex
non-member swap  missing  28.9 Class template sub_match
  missing  28.9.1 sub_match
members  missing  28.9.2 sub_match
non-member operators  missing  28.10 Class template match_results
  missing  28.10.1 match_results
constructors  missing  28.10.2 match_results
size  missing  28.10.3 match_results
element access  missing  28.10.4 match_results
formatting  missing  28.10.5 match_results
allocator  missing  28.10.6 match_results
swap  missing  28.11 Regular expression algorithms   missing  28.11.1 exceptions   missing  28.11.2 regex_match
  missing  28.11.3 regex_search
  missing  28.11.4 regex_replace
  missing  28.12 Regular expression Iterators   missing  28.12.1 Class template regex_iterator
  missing  28.12.1.1 regex_iterator
constructors  missing  28.12.1.2 regex_iterator
comparisons  missing  28.12.1.3 regex_iterator
dereference  missing  28.12.1.4 regex_iterator
increment  missing  28.12.2 Class template regex_token_iterator
  missing  28.12.2.1 regex_token_iterator
constructors  missing  28.12.2.2 regex_token_iterator
comparisons  missing  28.12.2.3 regex_token_iterator
dereference  missing  28.12.2.4 regex_token_iterator
increment  missing  28.13 Modified ECMAScript regular expression grammar   missing  C C Compatibility C2.1 Additions to header <complex>
done    C2.1.1 Synopsis done    C2.1.2 Function acos
done    C2.1.3 Function asin
done    C2.1.4 Function atan
done    C2.1.5 Function acosh
done    C2.1.6 Function asinh
done    C2.1.7 Function atanh
done    C2.1.8 Function fabs
done    C2.1.9 Additional Overloads done    C2.2 Header <ccomplex>
  missing DR 551 C2.3 Header <complex.h>
  missing DR 551 C2.4 Additions to header <cctype>
done    C2.4.1 Synopsis done    C2.4.2 Function isblank
done    C2.5 Additions to header <ctype.h>
done    C2.6 Header <cfenv>
done    C2.6.1 Synopsis done    C2.6.2 Definitions done    C2.7 Header <fenv.h>
done    C2.8 Additions to header <cfloat>
done    C2.9 Additions to header <float.h>
done    C2.10 Additions to header <ios>
  missing  C2.10.1 Synopsis   missing  C2.10.2 Function hexfloat
  missing  C2.11 Header <cinttypes>
done    C2.11.1 Synopsis done   DR 557 C2.11.2 Definitions done    C2.12 Header <inttypes.h>
done    C2.13 Additions to header <climits>
done    C2.14 Additions to header <limits.h>
done    C2.15 Additions to header <locale>
  missing  C2.16 Additions to header <cmath>
done    C2.16.1 Synopsis done    C2.16.2 Definitions done    C2.16.3 Function template definitions done    C2.16.4 Additional overloads done   DR 568; DR 550 C2.17 Additions to header <math.h>
done    C2.18 Additions to header <cstdarg>
done    C2.19 Additions to header <stdarg.h>
done    C2.20 The header <cstdbool>
done    C2.21 The header <stdbool.h>
done    C2.22 The header <cstdint>
done    C2.22.1 Synopsis done    C2.22.2 Definitions done    C2.23 The header <stdint.h>
done    C2.24 Additions to header <cstdio>
done    C2.24.1 Synopsis done    C2.24.2 Definitions done    C2.24.3 Additional format specifiers done   C library responsibility C2.24.4 Additions to header <stdio.h>
done    C2.25 Additions to header <cstdlib>
done    C2.25.1 Synopsis done    C2.25.2 Definitions done    C2.25.3 Function abs
done    C2.25.4 Function div
done    C2.26 Additions to header <stdlib.h>
done    C2.27 Header <ctgmath>
done   DR 551 C2.28 Header <tgmath.h>
done   DR 551 C2.29 Additions to header <ctime>
done   C library responsibility C2.30 Additions to header <cwchar>
done    C2.30.1 Synopsis done    C2.30.2 Definitions done    C2.30.3 Additional wide format specifiers done   C library responsibility C2.31 Additions to header <wchar.h>
done    C2.32 Additions to header <cwctype>
done    C2.32.1 Synopsis done    C2.32.2 Function iswblank
done    C2.33 Additions to header <wctype.h>
done    D Compatibility Features D.6 Old iostream members done    D.8 Binders done   33911 D.9 Class template auto_ptr
done   33911 -std=c++98
or -std=gnu++98
.
- algorithm
iomanip
list
ostream
streambuf
bitset
ios
locale
queue
string
complex
iosfwd
map
set
typeinfo
deque
iostream
memory
sstream
utility
exception
istream
new
stack
valarray
fstream
iterator
numeric
stdexcept
vector
functional
limits
   cassert
ciso646
csetjmp
cstdio
ctime
cctype
climits
csignal
cstdlib
cwchar
cerrno
clocale
cstdarg
cstring
cwctype
cfloat
cmath
cstddef
  -std=c++0x
or -std=gnu++0x
.
-algorithm
iomanip
locale
regex
tuple
array
ios
map
set
typeinfo
bitset
iosfwd
memory
sstream
type_traits
complex
iostream
new
stack
unordered_map
deque
istream
numeric
stdexcept
unordered_set
exception
iterator
ostream
streambuf
utility
fstream
limits
queue
string
valarray
functional
list
random
system_error
vector
cassert
cfloat
cmath
cstddef
ctgmath
ccomplex
cinttypes
csetjmp
cstdint
ctime
cctype
ciso646
csignal
cstdio
cuchar
cerrno
climits
cstdarg
cstdlib
cwchar
cfenv
clocale
cstdbool
cstring
cwctype
-std=c++98
or -std=gnu++98
.
+ algorithm
iomanip
list
ostream
streambuf
bitset
ios
locale
queue
string
complex
iosfwd
map
set
typeinfo
deque
iostream
memory
sstream
utility
exception
istream
new
stack
valarray
fstream
iterator
numeric
stdexcept
vector
functional
limits
   cassert
ciso646
csetjmp
cstdio
ctime
cctype
climits
csignal
cstdlib
cwchar
cerrno
clocale
cstdarg
cstring
cwctype
cfloat
cmath
cstddef
  -std=c++0x
or -std=gnu++0x
.
+algorithm
iomanip
locale
regex
tuple
array
ios
map
set
typeinfo
bitset
iosfwd
memory
sstream
type_traits
complex
iostream
new
stack
unordered_map
deque
istream
numeric
stdexcept
unordered_set
exception
iterator
ostream
streambuf
utility
fstream
limits
queue
string
valarray
functional
list
random
system_error
vector
cassert
cfloat
cmath
cstddef
ctgmath
ccomplex
cinttypes
csetjmp
cstdint
ctime
cctype
ciso646
csignal
cstdio
cuchar
cerrno
climits
cstdarg
cstdlib
cwchar
cfenv
clocale
cstdbool
cstring
cwctype
tr1/array
tr1/memory
tr1/regex
tr1/type_traits
tr1/unordered_set
tr1/complex
tr1/random
tr1/tuple
tr1/unordered_map
tr1/utility
tr1/functional
    tr1/cmath
tr1/cfloat
tr1/cstdarg
tr1/cstdio
tr1/ctime
tr1/ccomplex
tr1/cinttypes
tr1/cstdbool
tr1/cstdlib
tr1/cwchar
tr1/cfenv
tr1/climits
tr1/cstdint
tr1/ctgmath
tr1/cwctype
tr1/array
tr1/memory
tr1/regex
tr1/type_traits
tr1/unordered_set
tr1/complex
tr1/random
tr1/tuple
tr1/unordered_map
tr1/utility
tr1/functional
    tr1/cmath
tr1/cfloat
tr1/cstdarg
tr1/cstdio
tr1/ctime
tr1/ccomplex
tr1/cinttypes
tr1/cstdbool
tr1/cstdlib
tr1/cwchar
tr1/cfenv
tr1/climits
tr1/cstdint
tr1/ctgmath
tr1/cwctype
ext/algorithm
ext/debug_allocator.h
ext/mt_allocator.h
ext/pod_char_traits.h
ext/stdio_sync_filebuf.h
ext/array_allocator.h
ext/enc_filebuf.h
ext/new_allocator.h
ext/pool_allocator.h
ext/throw_allocator.h
ext/atomicity.h
ext/functional
ext/numeric
ext/rb_tree
ext/typelist.h
ext/bitmap_allocator.h
ext/iterator
ext/numeric_traits.h
ext/rope
ext/type_traits.h
ext/codecvt_specializations.h
ext/malloc_allocator.h
ext/pb_ds/assoc_container.h
ext/slist
ext/vstring.h
ext/concurrence.h
ext/memory
ext/pb_ds/priority_queue.h
ext/stdio_filebuf.h
 debug/bitset
debug/list
debug/set
debug/unordered_map
debug/vector
debug/deque
debug/map
debug/string
debug/unordered_set
 ext/algorithm
ext/debug_allocator.h
ext/mt_allocator.h
ext/pod_char_traits.h
ext/stdio_sync_filebuf.h
ext/array_allocator.h
ext/enc_filebuf.h
ext/new_allocator.h
ext/pool_allocator.h
ext/throw_allocator.h
ext/atomicity.h
ext/functional
ext/numeric
ext/rb_tree
ext/typelist.h
ext/bitmap_allocator.h
ext/iterator
ext/numeric_traits.h
ext/rope
ext/type_traits.h
ext/codecvt_specializations.h
ext/malloc_allocator.h
ext/pb_ds/assoc_container.h
ext/slist
ext/vstring.h
ext/concurrence.h
ext/memory
ext/pb_ds/priority_queue.h
ext/stdio_filebuf.h
 debug/bitset
debug/list
debug/set
debug/unordered_map
debug/vector
debug/deque
debug/map
debug/string
debug/unordered_set
Â
diff --git a/libstdc++-v3/doc/html/manual/bk01pt01ch03s03.html b/libstdc++-v3/doc/html/manual/bk01pt01ch03s03.html
index 50ea8771de3..bb6e28196fd 100644
--- a/libstdc++-v3/doc/html/manual/bk01pt01ch03s03.html
+++ b/libstdc++-v3/doc/html/manual/bk01pt01ch03s03.html
@@ -2,7 +2,7 @@
namespace std
, such as namespace
std::tr1
.
string
member.
string
member: a full heirarchy can be
+ string
member: a full hierarchy can be
found in the source documentation.
allocator
. The
allocator
abstraction is used throughout the
library in string
, container classes,
- algorithnms, and parts of iostreams. This class, and base classes of
+ algorithms, and parts of iostreams. This class, and base classes of
it, are the superset of available free store (âheapâ)
management classes.
abi::__cxa_atexit
is not recommended.
- allocator
is derived from
may not be user-configurable.
-allocator
is
__gnu_cxx::new_allocator
.
- allocator
may allocate and
deallocate using implementation-specified strategies and
heuristics. Because of this, every call to an allocator object's
@@ -161,7 +161,7 @@
directly, for every allocation. (See
include/ext/new_allocator.h
, for instance.)
However, that option would involve changing source code to use
- the a non-default allocator. Another option is to force the
+ a non-default allocator. Another option is to force the
default allocator to remove caching and pools, and to directly
allocate with every call of allocate
and
directly deallocate with every call of
@@ -245,7 +245,7 @@
throw_allocator
__pool_alloc
@@ -282,13 +282,13 @@
thr
boolean determines whether the
pool should be manipulated atomically or not. When
thr
= true
, the allocator
- is is threadsafe, while thr
=
+ is is thread-safe, while thr
=
false
, and is slightly faster but unsafe for
multiple threads.
string
instance, such as
"convert to all upper case." The word transformations
is especially apt, because the standard template function
transform<>
is used.
#include <string>
@@ -86,4 +86,4 @@
str.erase(notwhite+1);
find
could be inserted directly
into the calls to erase
, in case your compiler does not
optimize named temporaries out of existence.
- std::basic_string
is tantalizingly general, in that
it is parameterized on the type of the characters which it holds.
In theory, you could whip up a Unicode character class and instantiate
@@ -54,4 +54,4 @@
nice-looking first attempt turned out to not
be conforming C++, due to the rule that CharT must be a POD.
(See how tricky this is?)
- static locale::id id;
`locale -a`
displays available locales.
@@ -372,7 +372,7 @@ relation (of the C++ locale mechanism) to the C locale mechanism: the
global C locale is modified if a named C++ locale object is set as the
global locale" (emphasis Paolo), that is:
std::locale::global(std::locale(""));
std::setlocale(LC_ALL, "");
Container Header Debug container Debug header   std::bitset
bitset
__gnu_debug::bitset
bitset
  std::deque
deque
__gnu_debug::deque
deque
  std::list
list
__gnu_debug::list
list
  std::map
map
__gnu_debug::map
map
  std::multimap
map
__gnu_debug::multimap
map
  std::multiset
set
__gnu_debug::multiset
set
  std::set
set
__gnu_debug::set
set
  std::string
string
__gnu_debug::string
string
  std::wstring
string
__gnu_debug::wstring
string
  std::basic_string
string
__gnu_debug::basic_string
string
  std::vector
vector
__gnu_debug::vector
vector
  Container Header Debug container Debug header   std::bitset
bitset
__gnu_debug::bitset
bitset
  std::deque
deque
__gnu_debug::deque
deque
  std::list
list
__gnu_debug::list
list
  std::map
map
__gnu_debug::map
map
  std::multimap
map
__gnu_debug::multimap
map
  std::multiset
set
__gnu_debug::multiset
set
  std::set
set
__gnu_debug::set
set
  std::string
string
__gnu_debug::string
string
  std::wstring
string
__gnu_debug::wstring
string
  std::basic_string
string
__gnu_debug::basic_string
string
  std::vector
vector
__gnu_debug::vector
vector
  Container Header Debug container Debug header   std::unordered_map
unordered_map
__gnu_debug::unordered_map
unordered_map
  std::unordered_multimap
unordered_map
__gnu_debug::unordered_multimap
unordered_map
  std::unordered_set
unordered_set
__gnu_debug::unordered_set
unordered_set
  std::unordered_multiset
unordered_set
__gnu_debug::unordered_multiset
unordered_set
  Container Header Debug container Debug header   std::unordered_map
unordered_map
__gnu_debug::unordered_map
unordered_map
  std::unordered_multimap
unordered_map
__gnu_debug::unordered_multimap
unordered_map
  std::unordered_set
unordered_set
__gnu_debug::unordered_set
unordered_set
  std::unordered_multiset
unordered_set
__gnu_debug::unordered_multiset
unordered_set
  -D_GLIBCXX_PARALLEL -fopenmp
. This
+-D_GLIBCXX_PARALLEL -fopenmp
. This
will link in libgomp
, the GNU OpenMP implementation,
whose presence is mandatory. In addition, hardware capable of atomic
operations is mandatory. Actually activating these atomic
operations may require explicit compiler flags on some targets
- (like sparc and x86), such as -march=i686
,
- -march=native
or -mcpu=v9
.
-_GLIBCXX_PARALLEL
define may change the
+ (like sparc and x86), such as -march=i686
,
+ -march=native
or -mcpu=v9
.
+_GLIBCXX_PARALLEL
define may change the
sizes and behavior of standard class templates such as
- std::search
, and therefore one can only link code
+ std::search
, and therefore one can only link code
compiled with parallel mode and code compiled without parallel mode
if no instantiation of a container is passed between the two
translation units. Parallel mode functionality has distinct linkage,
- and cannot be confused with normal mode symbols.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
__gnu_parallel::sequential_tag
,
__gnu_parallel::parallel_tag
,
__gnu_parallel::balanced_tag
,
@@ -74,8 +74,6 @@ int main()
const int threads_wanted = 20;
omp_set_dynamic(false);
omp_set_num_threads(threads_wanted);
- if (omp_get_num_threads() != threads_wanted)
- abort();
// Do work.
@@ -107,7 +105,7 @@ at compile-time.
See compiletime_settings.h
and
See features.h
for details.
find
or sort
@@ -133,7 +131,7 @@ enum __gnu_parallel::_SortAlgorithm: QS_BALANCED.
make check-parallel
testsuite/parallel
directory.
+ testsuite/parallel
directory.
-
check-performance-parallel
+ make check-performance-parallel
testsuite
directory, in the file
- libstdc++_performance.sum
. In addition, the
+ testsuite
directory, in the file
+ libstdc++_performance.sum
. In addition, the
policy-based containers have their own visualizations, which have
additional software dependencies than the usual bare-boned text
file, and can be generated by using the make
diff --git a/libstdc++-v3/doc/html/manual/bk01pt12ch35.html b/libstdc++-v3/doc/html/manual/bk01pt12ch35.html
index 1ab65c963a7..ac3e3955327 100644
--- a/libstdc++-v3/doc/html/manual/bk01pt12ch35.html
+++ b/libstdc++-v3/doc/html/manual/bk01pt12ch35.html
@@ -13,7 +13,7 @@
is_heap
tests whether or not a range is a heap.is_sorted
tests whether or not a range is sorted in
- nondescending order.
lexicographical_compare_3way(_InputIter1 first1, _InputIter1 last1,
_InputIter2 first2, _InputIter2 last2)
@@ -337,41 +337,41 @@ codecvt usage.
namespace __gnu_cxx
.
LC_MESSAGES
mask: LC_CTYPE
is also
necessary. To avoid any unpleasantness, all bits of the "C" mask
- (ie LC_ALL
) are set before retrieving messages.
+ (i.e. LC_ALL
) are set before retrieving messages.
std::sort
, are made parallel using OpenMP
+std::sort
, are made parallel using OpenMP
annotations. These parallel mode constructs and can be invoked by
explicit source declaration or by compiling existing sources with a
specific compiler flag.
<numeric>
are included in the parallel mode:std::accumulate
std::adjacent_difference
std::inner_product
std::partial_sum
<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
<set>
and <map>
are included in the parallel mode:std::(multi_)map/set<T>::(multi_)map/set(Iterator begin, Iterator end)
(bulk construction)std::(multi_)map/set<T>::insert(Iterator begin, Iterator end)
(bulk insertion)numeric
are included in the parallel mode:std::accumulate
std::adjacent_difference
std::inner_product
std::partial_sum
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
shared_ptr<T>
contains a pointer of
type T* and an object of type
__shared_count
. The shared_count contains a
@@ -71,7 +71,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.
- tr1::shared_ptr
was extended for C++0x
with support for rvalue-references and the other features from
N2351. As with other libstdc++ headers shared by TR1 and C++0x,
@@ -129,7 +129,7 @@ compiler, standard library, platform etc. For the version of
shared_ptr in libstdc++ the compiler and library are fixed, which
makes things much simpler: we have an atomic CAS or we don't, see Lock
Policy below for details.
-_Sp_counted_base
class,
which is a template parameterized on the enum
@@ -170,7 +170,7 @@ used when libstdc++ is built without --enable-threadsext/atomicity.h
, which detect if the program
is multi-threaded. If only one thread of execution exists in
the program then less expensive non-atomic operations are used.
- _Sp_counted_base
(see Class Hierarchy
below) and __shared_count
are implemented separately for C++0x
and TR1, in bits/boost_sp_shared_count.h
and
@@ -181,7 +181,7 @@ The TR1 implementation is considered relatively stable, so is unlikely to
change unless bug fixes require it. If the code that is common to both
C++0x and TR1 modes needs to diverge further then it might be necessary to
duplicate additional classes and only make changes to the C++0x versions.
-dynamic_pointer_cast
, static_pointer_cast
,
+dynamic_pointer_cast
, static_pointer_cast
,
const_pointer_cast
testsuite/tr1/2_general_utilities/shared_ptr
.
- NAMESPACE_STD
macro. At that point, one is able to use
NAMESPACE_STD::string
, which will evaluate to
- std::string
or ::string
(ie, in the
+ std::string
or ::string
(i.e., in the
global namespace on systems that do not put string
in
std::
).
@@ -346,7 +346,7 @@ erase(size_type __pos = 0, size_type __n = npos)
clear
is not implemented in this
+ Unfortunately, clear
is not implemented in this
version, so you should use erase
(which is probably
faster than operator=(charT*)
).
stream::attach(int fd)
std::streambuf
(or
std::basic_streambuf<..>
) which opens a file
given a descriptor, and then pass an instance of this to the
@@ -1312,4 +1312,4 @@ AC_DEFUN([AC_HEADER_UNORDERED_SET], [
-
\ No newline at end of file
+
diff --git a/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml b/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml
index e05fc16c56a..1815a39c4c0 100644
--- a/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml
+++ b/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml
@@ -240,8 +240,8 @@ else return false.is_sorted
tests whether or not a range is sorted in
nondescending order.demangling.
static locale::id id;
@@ -95,13 +95,13 @@ Provides an index for looking up specific facets.
LC_MESSAGES
mask: LC_CTYPE
is also
necessary. To avoid any unpleasantness, all bits of the "C" mask
- (ie LC_ALL
) are set before retrieving messages.
+ (i.e. LC_ALL
) are set before retrieving messages.
std::(multi_)map/set<T>::(multi_)map/set(Iterator begin, Iterator end)
(bulk construction)std::(multi_)map/set<T>::insert(Iterator begin, Iterator end)
(bulk insertion)__gnu_parallel::sequential_tag
,
__gnu_parallel::parallel_tag
,
__gnu_parallel::balanced_tag
,
@@ -533,8 +526,6 @@ int main()
const int threads_wanted = 20;
omp_set_dynamic(false);
omp_set_num_threads(threads_wanted);
- if (omp_get_num_threads() != threads_wanted)
- abort();
// Do work.
@@ -593,7 +584,7 @@ See -std=c++98
or -std=gnu++98
.
+ C++98/03 include files. These are available in the default compilation mode, i.e. -std=c++98
or -std=gnu++98
.
@@ -149,7 +149,7 @@
--std=c++0x
or -std=gnu++0x
.
+-std=c++0x
or -std=gnu++0x
.
namespace std
, such as namespace
std::tr1
.