diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog
index 3aba1123ac1..aab4cd674c5 100644
--- a/libstdc++-v3/ChangeLog
+++ b/libstdc++-v3/ChangeLog
@@ -7,6 +7,31 @@
* doc/xml/manual/iterators.xml: Same.
* doc/xml/manual/spine.xml: Same.
+ * doc/xml/faq.xml: Remove redundant xreflabel entities.
+ * doc/xml/gnu/gpl-3.0.xml: Same.
+ * doc/xml/manual/mt_allocator.xml: Same.
+ * doc/xml/manual/allocator.xml: Same.
+ * doc/xml/manual/ctype.xml: Same.
+ * doc/xml/manual/codecvt.xml: Same.
+ * doc/xml/manual/backwards_compatibility.xml: Same.
+ * doc/xml/manual/shared_ptr.xml: Same.
+ * doc/xml/manual/abi.xml: Same.
+ * doc/xml/manual/auto_ptr.xml: Same.
+ * doc/xml/manual/internals.xml: Same.
+ * doc/xml/manual/parallel_mode.xml: Same.
+ * doc/xml/manual/bitmap_allocator.xml: Same.
+ * doc/xml/manual/build_hacking.xml: Same.
+ * doc/xml/manual/evolution.xml: Same.
+ * doc/xml/manual/debug.xml: Same.
+ * doc/xml/manual/localization.xml: Same.
+ * doc/xml/manual/appendix_contributing.xml: Same.
+ * doc/xml/manual/locale.xml: Same.
+ * doc/xml/manual/messages.xml: Same.
+ * doc/xml/manual/spine.xml: Same.
+ * doc/xml/manual/test.xml: Same.
+ * doc/xml/book.txml: Same.
+ * doc/xml/spine.xml: Same.
+
* doc/html: Regenerate.
2009-07-18 Paolo Carlini
diff --git a/libstdc++-v3/doc/html/faq.html b/libstdc++-v3/doc/html/faq.html index e8121106b0e..a701450d395 100644 --- a/libstdc++-v3/doc/html/faq.html +++ b/libstdc++-v3/doc/html/faq.html @@ -3,7 +3,7 @@
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/algorithms.html b/libstdc++-v3/doc/html/manual/algorithms.html
index fb8be43ee4b..5455d7c50a3 100644
--- a/libstdc++-v3/doc/html/manual/algorithms.html
+++ b/libstdc++-v3/doc/html/manual/algorithms.html
@@ -5,5 +5,5 @@
Prev The GNU C++ Library Next
Table of Contents
Table B.1. Extension Allocators
Allocator (3.4) | Header (3.4) | Allocator (3.[0-3]) | Header (3.[0-3]) |
---|---|---|---|
__gnu_cxx::new_allocator<T> | ext/new_allocator.h | std::__new_alloc | memory |
__gnu_cxx::malloc_allocator<T> | ext/malloc_allocator.h | std::__malloc_alloc_template<int> | memory |
__gnu_cxx::debug_allocator<T> | ext/debug_allocator.h | std::debug_alloc<T> | memory |
__gnu_cxx::__pool_alloc<T> | ext/pool_allocator.h | std::__default_alloc_template<bool,int> | memory |
__gnu_cxx::__mt_alloc<T> | ext/mt_allocator.h | ||
__gnu_cxx::bitmap_allocator<T> | ext/bitmap_allocator.h |
Releases after gcc-3.4 have continued to add to the collection +
Table B.1. Extension Allocators
Allocator (3.4) | Header (3.4) | Allocator (3.[0-3]) | Header (3.[0-3]) |
---|---|---|---|
__gnu_cxx::new_allocator<T> | ext/new_allocator.h | std::__new_alloc | memory |
__gnu_cxx::malloc_allocator<T> | ext/malloc_allocator.h | std::__malloc_alloc_template<int> | memory |
__gnu_cxx::debug_allocator<T> | ext/debug_allocator.h | std::debug_alloc<T> | memory |
__gnu_cxx::__pool_alloc<T> | ext/pool_allocator.h | std::__default_alloc_template<bool,int> | memory |
__gnu_cxx::__mt_alloc<T> | ext/mt_allocator.h | ||
__gnu_cxx::bitmap_allocator<T> | ext/bitmap_allocator.h |
Releases after gcc-3.4 have continued to add to the collection of available allocators. All of these new allocators are standard-style. The following table includes details, along with the first released version of GCC that included the extension allocator. -
Table B.2. Extension Allocators Continued
Allocator | Include | Version |
---|---|---|
__gnu_cxx::array_allocator<T> | ext/array_allocator.h | 4.0.0 |
__gnu_cxx::throw_allocator<T> | ext/throw_allocator.h | 4.2.0 |
+
Table B.2. Extension Allocators Continued
Allocator | Include | Version |
---|---|---|
__gnu_cxx::array_allocator<T> | ext/array_allocator.h | 4.0.0 |
__gnu_cxx::throw_allocator<T> | ext/throw_allocator.h | 4.2.0 |
Debug mode first appears.
Precompiled header support PCH support. diff --git a/libstdc++-v3/doc/html/manual/appendix_contributing.html b/libstdc++-v3/doc/html/manual/appendix_contributing.html index cf91fa68e04..88309a58046 100644 --- a/libstdc++-v3/doc/html/manual/appendix_contributing.html +++ b/libstdc++-v3/doc/html/manual/appendix_contributing.html @@ -5,7 +5,7 @@
Table of Contents
The GNU C++ Library follows an open development model. Active contributors are assigned maintainer-ship responsibility, and given diff --git a/libstdc++-v3/doc/html/manual/appendix_free.html b/libstdc++-v3/doc/html/manual/appendix_free.html index d82448ee58e..f86149e0d63 100644 --- a/libstdc++-v3/doc/html/manual/appendix_free.html +++ b/libstdc++-v3/doc/html/manual/appendix_free.html @@ -5,7 +5,7 @@
The biggest deficiency in free operating systems is not in the software--it is the lack of good free manuals that we can include in diff --git a/libstdc++-v3/doc/html/manual/appendix_gpl.html b/libstdc++-v3/doc/html/manual/appendix_gpl.html index e68a06e986c..f6957cae42a 100644 --- a/libstdc++-v3/doc/html/manual/appendix_gpl.html +++ b/libstdc++-v3/doc/html/manual/appendix_gpl.html @@ -8,7 +8,7 @@ Version 3, 29 June 2007
Copyright © 2007 Free Software Foundation, Inc. - http://fsf.org/ + http://www.fsf.org/
Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. @@ -76,7 +76,7 @@
The precise terms and conditions for copying, distribution and modification follow. -
Table of Contents
As noted previously, certain other tools are necessary for hacking on files that diff --git a/libstdc++-v3/doc/html/manual/backwards.html b/libstdc++-v3/doc/html/manual/backwards.html index 30b860921e6..12fd1832714 100644 --- a/libstdc++-v3/doc/html/manual/backwards.html +++ b/libstdc++-v3/doc/html/manual/backwards.html @@ -17,8 +17,8 @@ ISO Standard (e.g., statistical analysis). While there are a lot of really useful things that are used by a lot of people, the Standards Committee couldn't include everything, and so a lot of those “obvious” classes didn't get included. -
Known Issues include many of the limitations of its immediate ancestor.
Portability notes and known implementation limitations are as follows.
At least some older implementations don't have std::ios_base
, so you should use std::ios::badbit
, std::ios::failbit
and std::ios::eofbit
and std::ios::goodbit
.
-
+
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 std::ios_base
, so you should use std::ios::badbit
, std::ios::failbit
and std::ios::eofbit
and std::ios::goodbit
.
+
In earlier versions of the standard,
fstream.h
,
ostream.h
@@ -44,7 +44,7 @@ considered replaced and rewritten.
archived. The code is considered replaced and rewritten.
Portability notes and known implementation limitations are as follows. -
+
Some care is required to support C++ compiler and or library
implementation that do not have the standard library in
namespace std
.
@@ -108,7 +108,7 @@ AC_DEFUN([AC_CXX_NAMESPACE_STD], [
AC_DEFINE(HAVE_NAMESPACE_STD,,[Define if g++ supports namespace std. ])
fi
])
-
The following illustrate implementation-allowed illegal iterator use, and then correct use.
@@ -121,7 +121,7 @@ AC_DEFUN([AC_CXX_NAMESPACE_STD], [
if (iterator)
won't work any more => use
if (iterator != iterator_type())
-
Glibc 2.0.x and 2.1.x define ctype.h
functionality as macros
(isspace, isalpha etc.).
@@ -154,7 +154,7 @@ std:: (__ctype_b[(int) ( ( 'X' ) )] & (unsigned short int) _ISspace ) ;
(ctype.h
) and the
definitions in namespace std::
(<cctype>
).
-
One solution is to add an autoconf-test for this:
AC_MSG_CHECKING(for container::at) @@ -180,7 +180,7 @@ AC_DEFINE(HAVE_CONTAINER_AT)],
If you are using other (non-GNU) compilers it might be a good idea
to check for string::at
separately.
-
Use some kind of autoconf test, plus this:
#ifdef HAVE_CHAR_TRAITS @@ -188,7 +188,7 @@ AC_DEFINE(HAVE_CONTAINER_AT)], #else #define CPP_EOF EOF #endif -
There are two functions for deleting the contents of a string:
clear
and erase
(the latter returns the
string).
@@ -206,12 +206,12 @@ erase(size_type __pos = 0, size_type __n = npos)
Unfortunately, clear
is not implemented in this
version, so you should use erase
(which is probably
faster than operator=(charT*)
).
-
These are no longer supported. Please use stringstreams instead. -
Although the ISO standard i/ostringstream
-classes are
provided, (sstream
), for
compatibility with older implementations the pre-ISO
@@ -299,14 +299,14 @@ any = temp;
Another example of using stringstreams is in this howto.
There is additional information in the libstdc++-v2 info files, in particular “info iostream”. -
Earlier GCC releases had a somewhat different approach to threading configuration and proper compilation. Before GCC 3.0, configuration of the threading model was dictated by compiler @@ -364,7 +364,7 @@ libstdc++-v3. of the SGI STL (version 3.3), with extensive changes.
A more formal description of the V3 goals can be found in the official design document. -
Portability notes and known implementation limitations are as follows.
The pre-ISO C++ headers +
Portability notes and known implementation limitations are as follows.
The pre-ISO C++ headers
(iostream.h
, defalloc.h
etc.) are
available, unlike previous libstdc++ versions, but inclusion
generates a warning that you are using deprecated headers.
@@ -436,7 +436,7 @@ like vector.h
can be replaced with using namespace std;
can be put at the global
scope. This should be enough to get this code compiling, assuming the
other usage is correct.
-
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 @@ -508,7 +508,7 @@ AC_DEFUN([AC_HEADER_EXT_HASH_SET], [ AC_DEFINE(HAVE_EXT_HASH_SET,,[Define if ext/hash_set is present. ]) fi ]) -
The existence of ios::nocreate
being used for
input-streams has been confirmed, most probably because the author
thought it would be more correct to specify nocreate explicitly. So
@@ -519,7 +519,7 @@ open the file for reading, check if it has been opened, and then
decide whether you want to create/replace or not. To my knowledge,
even older implementations support app
, ate
and trunc
(except for app
?).
-
Phil Edwards writes: It was considered and rejected for the ISO
@@ -542,7 +542,7 @@ No stream::attach(int fd)
For another example of this, refer to
fdstream example
by Nicolai Josuttis.
-
Check for complete library coverage of the C++1998/2003 standard.
@@ -610,7 +610,7 @@ AC_DEFUN([AC_HEADER_STDCXX_98], [ AC_DEFINE(STDCXX_98_HEADERS,,[Define if ISO C++ 1998 header files are present. ]) fi ]) -
Check for library coverage of the TR1 standard.
@@ -687,7 +687,7 @@ AC_DEFUN([AC_HEADER_TR1_UNORDERED_SET], [ AC_DEFINE(HAVE_TR1_UNORDERED_SET,,[Define if tr1/unordered_set is present. ]) fi ]) -
Check for baseline language coverage in the compiler for the C++0xstandard.
@@ -899,27 +899,27 @@ AC_DEFUN([AC_HEADER_UNORDERED_SET], [ AC_DEFINE(HAVE_UNORDERED_SET,,[Define if unordered_set is present. ]) fi ]) -
[ 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 9b51fc10750..b2bc4c36589 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 diff --git a/libstdc++-v3/doc/html/manual/bk01ix01.html b/libstdc++-v3/doc/html/manual/bk01ix01.html index e6ddafafeb9..09c9495aeae 100644 --- a/libstdc++-v3/doc/html/manual/bk01ix01.html +++ b/libstdc++-v3/doc/html/manual/bk01ix01.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/bk01pt09pr02.html b/libstdc++-v3/doc/html/manual/bk01pt09pr02.html index 0474fe9aa3f..68c83a49f7c 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt09pr02.html +++ b/libstdc++-v3/doc/html/manual/bk01pt09pr02.html @@ -3,7 +3,7 @@
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 6ce83b3a011..33a9da6da6d 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
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 |
In addition, when compiling in C++0x mode, these additional +
Table 30.1. Debugging Containers
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 |
In addition, when compiling in C++0x mode, these additional containers have additional debug capability. -
Table 30.2. Debugging Containers C++0x
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 |
Table 30.2. Debugging Containers C++0x
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 |
The following table provides the names and headers of all the parallel algorithms that can be used in a similar manner: -
Table 31.1. Parallel Algorithms
Algorithm | Header | Parallel algorithm | Parallel header |
---|---|---|---|
std::accumulate | numeric | __gnu_parallel::accumulate | parallel/numeric |
std::adjacent_difference | numeric | __gnu_parallel::adjacent_difference | parallel/numeric |
std::inner_product | numeric | __gnu_parallel::inner_product | parallel/numeric |
std::partial_sum | numeric | __gnu_parallel::partial_sum | parallel/numeric |
std::adjacent_find | algorithm | __gnu_parallel::adjacent_find | parallel/algorithm |
std::count | algorithm | __gnu_parallel::count | parallel/algorithm |
std::count_if | algorithm | __gnu_parallel::count_if | parallel/algorithm |
std::equal | algorithm | __gnu_parallel::equal | parallel/algorithm |
std::find | algorithm | __gnu_parallel::find | parallel/algorithm |
std::find_if | algorithm | __gnu_parallel::find_if | parallel/algorithm |
std::find_first_of | algorithm | __gnu_parallel::find_first_of | parallel/algorithm |
std::for_each | algorithm | __gnu_parallel::for_each | parallel/algorithm |
std::generate | algorithm | __gnu_parallel::generate | parallel/algorithm |
std::generate_n | algorithm | __gnu_parallel::generate_n | parallel/algorithm |
std::lexicographical_compare | algorithm | __gnu_parallel::lexicographical_compare | parallel/algorithm |
std::mismatch | algorithm | __gnu_parallel::mismatch | parallel/algorithm |
std::search | algorithm | __gnu_parallel::search | parallel/algorithm |
std::search_n | algorithm | __gnu_parallel::search_n | parallel/algorithm |
std::transform | algorithm | __gnu_parallel::transform | parallel/algorithm |
std::replace | algorithm | __gnu_parallel::replace | parallel/algorithm |
std::replace_if | algorithm | __gnu_parallel::replace_if | parallel/algorithm |
std::max_element | algorithm | __gnu_parallel::max_element | parallel/algorithm |
std::merge | algorithm | __gnu_parallel::merge | parallel/algorithm |
std::min_element | algorithm | __gnu_parallel::min_element | parallel/algorithm |
std::nth_element | algorithm | __gnu_parallel::nth_element | parallel/algorithm |
std::partial_sort | algorithm | __gnu_parallel::partial_sort | parallel/algorithm |
std::partition | algorithm | __gnu_parallel::partition | parallel/algorithm |
std::random_shuffle | algorithm | __gnu_parallel::random_shuffle | parallel/algorithm |
std::set_union | algorithm | __gnu_parallel::set_union | parallel/algorithm |
std::set_intersection | algorithm | __gnu_parallel::set_intersection | parallel/algorithm |
std::set_symmetric_difference | algorithm | __gnu_parallel::set_symmetric_difference | parallel/algorithm |
std::set_difference | algorithm | __gnu_parallel::set_difference | parallel/algorithm |
std::sort | algorithm | __gnu_parallel::sort | parallel/algorithm |
std::stable_sort | algorithm | __gnu_parallel::stable_sort | parallel/algorithm |
std::unique_copy | algorithm | __gnu_parallel::unique_copy | parallel/algorithm |
Table 31.1. Parallel Algorithms
Algorithm | Header | Parallel algorithm | Parallel header |
---|---|---|---|
std::accumulate | numeric | __gnu_parallel::accumulate | parallel/numeric |
std::adjacent_difference | numeric | __gnu_parallel::adjacent_difference | parallel/numeric |
std::inner_product | numeric | __gnu_parallel::inner_product | parallel/numeric |
std::partial_sum | numeric | __gnu_parallel::partial_sum | parallel/numeric |
std::adjacent_find | algorithm | __gnu_parallel::adjacent_find | parallel/algorithm |
std::count | algorithm | __gnu_parallel::count | parallel/algorithm |
std::count_if | algorithm | __gnu_parallel::count_if | parallel/algorithm |
std::equal | algorithm | __gnu_parallel::equal | parallel/algorithm |
std::find | algorithm | __gnu_parallel::find | parallel/algorithm |
std::find_if | algorithm | __gnu_parallel::find_if | parallel/algorithm |
std::find_first_of | algorithm | __gnu_parallel::find_first_of | parallel/algorithm |
std::for_each | algorithm | __gnu_parallel::for_each | parallel/algorithm |
std::generate | algorithm | __gnu_parallel::generate | parallel/algorithm |
std::generate_n | algorithm | __gnu_parallel::generate_n | parallel/algorithm |
std::lexicographical_compare | algorithm | __gnu_parallel::lexicographical_compare | parallel/algorithm |
std::mismatch | algorithm | __gnu_parallel::mismatch | parallel/algorithm |
std::search | algorithm | __gnu_parallel::search | parallel/algorithm |
std::search_n | algorithm | __gnu_parallel::search_n | parallel/algorithm |
std::transform | algorithm | __gnu_parallel::transform | parallel/algorithm |
std::replace | algorithm | __gnu_parallel::replace | parallel/algorithm |
std::replace_if | algorithm | __gnu_parallel::replace_if | parallel/algorithm |
std::max_element | algorithm | __gnu_parallel::max_element | parallel/algorithm |
std::merge | algorithm | __gnu_parallel::merge | parallel/algorithm |
std::min_element | algorithm | __gnu_parallel::min_element | parallel/algorithm |
std::nth_element | algorithm | __gnu_parallel::nth_element | parallel/algorithm |
std::partial_sort | algorithm | __gnu_parallel::partial_sort | parallel/algorithm |
std::partition | algorithm | __gnu_parallel::partition | parallel/algorithm |
std::random_shuffle | algorithm | __gnu_parallel::random_shuffle | parallel/algorithm |
std::set_union | algorithm | __gnu_parallel::set_union | parallel/algorithm |
std::set_intersection | algorithm | __gnu_parallel::set_intersection | parallel/algorithm |
std::set_symmetric_difference | algorithm | __gnu_parallel::set_symmetric_difference | parallel/algorithm |
std::set_difference | algorithm | __gnu_parallel::set_difference | parallel/algorithm |
std::sort | algorithm | __gnu_parallel::sort | parallel/algorithm |
std::stable_sort | algorithm | __gnu_parallel::stable_sort | parallel/algorithm |
std::unique_copy | algorithm | __gnu_parallel::unique_copy | parallel/algorithm |
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 2b8e6856401..166a6834b37 100644 --- a/libstdc++-v3/doc/html/manual/codecvt.html +++ b/libstdc++-v3/doc/html/manual/codecvt.html @@ -337,41 +337,41 @@ codecvt usage.
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.
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/containers.html b/libstdc++-v3/doc/html/manual/containers.html
index 4517cea9ef7..ff9f3044ec5 100644
--- a/libstdc++-v3/doc/html/manual/containers.html
+++ b/libstdc++-v3/doc/html/manual/containers.html
@@ -5,5 +5,5 @@
Prev The GNU C++ Library Next