Design

Bibliography

ABIcheck, a vague idea of checking ABI compatibility - .

+ .

C++ ABI Reference - .

+ .

Intel Compilers for Linux Compatibility with the GNU Compilers - .

+ .

Sun Solaris 2.9 : Linker and Libraries Guide (document 816-1386) - .

+ .

Sun Solaris 2.9 : C++ Migration Guide (document 816-2459) - .

+ .

How to Write Shared Libraries - . Ulrich Drepper.

+ . Ulrich Drepper.

C++ ABI for the ARM Architecture - .

+ .

Dynamic Shared Objects: Survey and Issues @@ -514,7 +514,7 @@ gcc test.c -g -O2 -L. -lone -ltwo /usr/lib/libstdc++.so.5 /usr/lib/libstdc++.so. . ISO C++ J16/06-0046 - . Benjamin Kosnik.

+ . Benjamin Kosnik.

Versioning With Namespaces @@ -522,7 +522,7 @@ gcc test.c -g -O2 -L. -lone -ltwo /usr/lib/libstdc++.so.5 /usr/lib/libstdc++.so. . ISO C++ J16/06-0083 - . Benjamin Kosnik.

+ . Benjamin Kosnik.

Binary Compatibility of Shared Libraries Implemented in C++ diff --git a/libstdc++-v3/doc/html/manual/algorithms.html b/libstdc++-v3/doc/html/manual/algorithms.html index 3e5b3a5a86e..eaeb50939b0 100644 --- a/libstdc++-v3/doc/html/manual/algorithms.html +++ b/libstdc++-v3/doc/html/manual/algorithms.html @@ -7,7 +7,7 @@ Standard Contents Â Next

ChapterÂ 11.Â Algorithms - +

Table of Contents

Mutating

swap

The neatest accomplishment of the algorithms sect1 is that all the work is done via iterators, not containers directly. This means two diff --git a/libstdc++-v3/doc/html/manual/api.html b/libstdc++-v3/doc/html/manual/api.html index a8b88b7d5a9..a2103fd1d0c 100644 --- a/libstdc++-v3/doc/html/manual/api.html +++ b/libstdc++-v3/doc/html/manual/api.html @@ -75,11 +75,11 @@ _Alloc_traits have been removed. __alloc to select an underlying allocator that satisfied memory allocation requests. The selection of this underlying allocator was not user-configurable. -

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

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 467f7fd0988..1d95a0ea3a1 100644 --- a/libstdc++-v3/doc/html/manual/appendix_contributing.html +++ b/libstdc++-v3/doc/html/manual/appendix_contributing.html @@ -7,7 +7,7 @@ Appendices Â Next

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

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

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

AppendixÂ A.Â Contributing - +

Table of Contents

Contributor Checklist

Reading
Assignment
Getting Sources
Submitting Patches

Directory Layout and Source Conventions

Coding Style

Bad Identifiers
By Example

Documentation Style

Doxygen
Docbook
Combines

Design Notes

The GNU C++ Library follows an open development model. Active contributors are assigned maintainer-ship responsibility, and given diff --git a/libstdc++-v3/doc/html/manual/appendix_free.html b/libstdc++-v3/doc/html/manual/appendix_free.html index bc6c37655ea..0c653a4a256 100644 --- a/libstdc++-v3/doc/html/manual/appendix_free.html +++ b/libstdc++-v3/doc/html/manual/appendix_free.html @@ -7,7 +7,7 @@ Appendices Â Next

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

The biggest deficiency in free operating systems is not in the software--it is the lack of good free manuals that we can include in diff --git a/libstdc++-v3/doc/html/manual/appendix_gpl.html b/libstdc++-v3/doc/html/manual/appendix_gpl.html index 42a68eca06d..5652d7a93b3 100644 --- a/libstdc++-v3/doc/html/manual/appendix_gpl.html +++ b/libstdc++-v3/doc/html/manual/appendix_gpl.html @@ -78,7 +78,7 @@

The precise terms and conditions for copying, distribution and modification follow. -

+
TERMS AND CONDITIONS
0. Definitions. @@ -619,7 +619,7 @@ waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. -
+
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs diff --git a/libstdc++-v3/doc/html/manual/appendix_porting.html b/libstdc++-v3/doc/html/manual/appendix_porting.html index 47d342a193f..70fb023bd02 100644 --- a/libstdc++-v3/doc/html/manual/appendix_porting.html +++ b/libstdc++-v3/doc/html/manual/appendix_porting.html @@ -7,7 +7,7 @@ Appendices Â Next

AppendixÂ B.Â Porting and Maintenance - +

Configure and Build Hacking

Prerequisites

As noted previously, certain other tools are necessary for hacking on files that diff --git a/libstdc++-v3/doc/html/manual/atomics.html b/libstdc++-v3/doc/html/manual/atomics.html index 1db9a81fbe1..62eec540c4f 100644 --- a/libstdc++-v3/doc/html/manual/atomics.html +++ b/libstdc++-v3/doc/html/manual/atomics.html @@ -7,7 +7,7 @@ Standard Contents Â Next

ChapterÂ 14.Â Atomics - +

Table of Contents

API Reference

Facilities for atomic operations.

API Reference

diff --git a/libstdc++-v3/doc/html/manual/backwards.html b/libstdc++-v3/doc/html/manual/backwards.html index 8656c934d1f..8ef440766fd 100644 --- a/libstdc++-v3/doc/html/manual/backwards.html +++ b/libstdc++-v3/doc/html/manual/backwards.html @@ -17,8 +17,8 @@ ISO Standard (e.g., statistical analysis). While there are a lot of really useful things that are used by a lot of people, the Standards Committee couldn't include everything, and so a lot of those âobviousâ classes didn't get included. -

Known Issues include many of the limitations of its immediate ancestor.

Portability notes and known implementation limitations are as follows.

No `ios_base`

At least some older implementations don't have std::ios_base, so you should use std::ios::badbit, std::ios::failbit and std::ios::eofbit and std::ios::goodbit. -

No `cout` in `ostream.h`, no `cin` in `istream.h`

Known Issues include many of the limitations of its immediate ancestor.

Portability notes and known implementation limitations are as follows.

No `ios_base`

At least some older implementations don't have std::ios_base, so you should use std::ios::badbit, std::ios::failbit and std::ios::eofbit and std::ios::goodbit. +

No `cout` in `ostream.h`, no `cin` in `istream.h`

In earlier versions of the standard, fstream.h, ostream.h @@ -44,7 +44,7 @@ considered replaced and rewritten. archived. The code is considered replaced and rewritten.

Portability notes and known implementation limitations are as follows. -

Namespace `std::` not supported

Some care is required to support C++ compiler and or library implementation that do not have the standard library in namespace std. @@ -108,7 +108,7 @@ AC_DEFUN([AC_CXX_NAMESPACE_STD], [ AC_DEFINE(HAVE_NAMESPACE_STD,,[Define if g++ supports namespace std. ]) fi ]) -

Illegal iterator usage

The following illustrate implementation-allowed illegal iterator use, and then correct use.

@@ -121,7 +121,7 @@ AC_DEFUN([AC_CXX_NAMESPACE_STD], [
if (iterator) won't work any more => use if (iterator != iterator_type()) -

`isspace` from `cctype` is a macro +

`isspace` from `cctype` is a macro

Glibc 2.0.x and 2.1.x define ctype.h functionality as macros (isspace, isalpha etc.). @@ -154,7 +154,7 @@ std:: (__ctype_b[(int) ( ( 'X' ) )] & (unsigned short int) _ISspace ) ; (ctype.h) and the definitions in namespace std:: (<cctype>). -

No `vector::at`, `deque::at`, `string::at`

One solution is to add an autoconf-test for this:

 AC_MSG_CHECKING(for container::at)
@@ -180,7 +180,7 @@ AC_DEFINE(HAVE_CONTAINER_AT)],

If you are using other (non-GNU) compilers it might be a good idea to check for string::at separately. -

No `std::char_traits<char>::eof`

Use some kind of autoconf test, plus this:

 #ifdef HAVE_CHAR_TRAITS
@@ -188,7 +188,7 @@ AC_DEFINE(HAVE_CONTAINER_AT)],
 #else
 #define CPP_EOF EOF
 #endif
-

No `string::clear`

There are two functions for deleting the contents of a string: clear and erase (the latter returns the string). @@ -206,12 +206,12 @@ erase(size_type __pos = 0, size_type __n = npos) Unfortunately, clear is not implemented in this version, so you should use erase (which is probably faster than operator=(charT*)). -

+

Removal of `ostream::form` and `istream::scan` extensions

These are no longer supported. Please use stringstreams instead. -

No `basic_stringbuf`, `basic_stringstream`

Although the ISO standard i/ostringstream-classes are provided, (sstream), for compatibility with older implementations the pre-ISO @@ -299,14 +299,14 @@ any = temp; Another example of using stringstreams is in this howto.

There is additional information in the libstdc++-v2 info files, in particular âinfo iostreamâ. -

Little or no wide character support

Classes wstring and char_traits<wchar_t> are not supported. -

No templatized iostreams

Classes wfilebuf and wstringstream are not supported. -

Thread safety issues

Earlier GCC releases had a somewhat different approach to threading configuration and proper compilation. Before GCC 3.0, configuration of the threading model was dictated by compiler @@ -364,7 +364,7 @@ libstdc++-v3. of the SGI STL (version 3.3), with extensive changes.

A more formal description of the V3 goals can be found in the official design document. -

Portability notes and known implementation limitations are as follows.

Pre-ISO headers moved to backwards or removed

The pre-ISO C++ headers +

Portability notes and known implementation limitations are as follows.

Pre-ISO headers moved to backwards or removed

The pre-ISO C++ headers (iostream.h, defalloc.h etc.) are available, unlike previous libstdc++ versions, but inclusion generates a warning that you are using deprecated headers. @@ -436,7 +436,7 @@ like vector.h can be replaced with using namespace std; can be put at the global scope. This should be enough to get this code compiling, assuming the other usage is correct. -

Extension headers hash_map, hash_set moved to ext or backwards

At this time most of the features of the SGI STL extension have been +

Extension headers hash_map, hash_set moved to ext or backwards

At this time most of the features of the SGI STL extension have been replaced by standardized libraries. In particular, the unordered_map and unordered_set containers of TR1 are suitable replacement for the non-standard hash_map and hash_set @@ -508,7 +508,7 @@ AC_DEFUN([AC_HEADER_EXT_HASH_SET], [ AC_DEFINE(HAVE_EXT_HASH_SET,,[Define if ext/hash_set is present. ]) fi ]) -

No `ios::nocreate/ios::noreplace`. +

No `ios::nocreate/ios::noreplace`.

The existence of ios::nocreate being used for input-streams has been confirmed, most probably because the author thought it would be more correct to specify nocreate explicitly. So @@ -519,7 +519,7 @@ open the file for reading, check if it has been opened, and then decide whether you want to create/replace or not. To my knowledge, even older implementations support app, ate and trunc (except for app ?). -

+

No `stream::attach(int fd)`

Phil Edwards writes: It was considered and rejected for the ISO @@ -542,7 +542,7 @@ No stream::attach(int fd) For another example of this, refer to fdstream example by Nicolai Josuttis. -

+

Support for C++98 dialect.

Check for complete library coverage of the C++1998/2003 standard.

@@ -610,7 +610,7 @@ AC_DEFUN([AC_HEADER_STDCXX_98], [
     AC_DEFINE(STDCXX_98_HEADERS,,[Define if ISO C++ 1998 header files are present. ])
   fi
 ])
-

+

Support for C++TR1 dialect.

Check for library coverage of the TR1 standard.

@@ -687,7 +687,7 @@ AC_DEFUN([AC_HEADER_TR1_UNORDERED_SET], [
     AC_DEFINE(HAVE_TR1_UNORDERED_SET,,[Define if tr1/unordered_set is present. ])
   fi
 ])
-

+

Support for C++0x dialect.

Check for baseline language coverage in the compiler for the C++0xstandard.

@@ -899,25 +899,25 @@ AC_DEFUN([AC_HEADER_UNORDERED_SET], [
     AC_DEFINE(HAVE_UNORDERED_SET,,[Define if unordered_set is present. ])
   fi
 ])
-

+

Container::iterator_type is not necessarily Container::value_type*

This is a change in behavior from the previous version. Now, most iterator_type typedefs in container classes are POD objects, not value_type pointers. -

Bibliography

Migrating to GCC 4.1 - . Dan Kegel.

+ . Dan Kegel.

Building the Whole Debian Archive with GCC 4.1: A Summary - . Martin Michlmayr.

+ . Martin Michlmayr.

Migration guide for GCC-3.2 diff --git a/libstdc++-v3/doc/html/manual/bitmap_allocator.html b/libstdc++-v3/doc/html/manual/bitmap_allocator.html index 2d750160b29..b7ad95697bc 100644 --- a/libstdc++-v3/doc/html/manual/bitmap_allocator.html +++ b/libstdc++-v3/doc/html/manual/bitmap_allocator.html @@ -103,7 +103,7 @@ else return false.

Consider a block of size 64 ints. In memory, it would look like this: (assume a 32-bit system where, size_t is a 32-bit entity). -

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

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

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

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

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

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

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

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

PrevÂ	Up	Â Next
SemanticsÂ	Home	Â Design

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

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

PrevÂ	Up	Â Next
SemanticsÂ	Home	Â Design

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

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

PrevÂ	Up	Â Next
SemanticsÂ	Home	Â Design

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

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

PrevÂ	Up	Â Next
SemanticsÂ	Home	Â Design

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

Wrapper Model
diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch19s07.html b/libstdc++-v3/doc/html/manual/bk01pt03ch19s07.html index e5d00f5a9d9..5f2607bd481 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch19s07.html +++ b/libstdc++-v3/doc/html/manual/bk01pt03ch19s07.html @@ -18,7 +18,7 @@ A high accuracy means that the diagnostic is unlikely to be wrong. These grades are not perfect. They are just meant to guide users with specific needs or time budgets. -
TableÂ 19.2.Â Profile Diagnostics
Group Flag Benefit Cost Freq. Implemented Â
+
TableÂ 19.2.Â Profile Diagnostics
Group Flag Benefit Cost Freq. Implemented Â
CONTAINERS HASHTABLE_TOO_SMALL 10 1 Â 10 yes
Â HASHTABLE_TOO_LARGE 5 1 Â 10 yes
Â diff --git a/libstdc++-v3/doc/html/manual/bk01pt03pr01.html b/libstdc++-v3/doc/html/manual/bk01pt03pr01.html index be1c0f16ae2..5f049deb4c2 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03pr01.html +++ b/libstdc++-v3/doc/html/manual/bk01pt03pr01.html @@ -3,7 +3,7 @@
PrevÂ PartÂ III.Â Extensions - Â Next
+
Â Next
Here we will make an attempt at describing the non-Standard extensions to the library. Some of these are from SGI's STL, some of these are GNU's, and some just seemed to appear on the doorstep. diff --git a/libstdc++-v3/doc/html/manual/concurrency.html b/libstdc++-v3/doc/html/manual/concurrency.html index 86de72e9c04..bbb50d4bede 100644 --- a/libstdc++-v3/doc/html/manual/concurrency.html +++ b/libstdc++-v3/doc/html/manual/concurrency.html @@ -7,7 +7,7 @@ Standard Contents
Â Next
ChapterÂ 15.Â Concurrency - +
Table of Contents
API Reference
Facilities for concurrent operation, and control thereof.
API Reference
diff --git a/libstdc++-v3/doc/html/manual/containers.html b/libstdc++-v3/doc/html/manual/containers.html index 4aceb1bbedc..43382dd2530 100644 --- a/libstdc++-v3/doc/html/manual/containers.html +++ b/libstdc++-v3/doc/html/manual/containers.html @@ -7,7 +7,7 @@ Standard Contents
Â Next
ChapterÂ 9.Â Containers - +
Table of Contents
Sequences
list
vector
Associative
Insertion Hints
bitset
Interacting with C
Containers vs. Arrays
Sequences
list
list::size() is O(n)
Yes it is, and that's okay. This is a decision that we preserved when we imported SGI's STL implementation. The following is diff --git a/libstdc++-v3/doc/html/manual/diagnostics.html b/libstdc++-v3/doc/html/manual/diagnostics.html index d04585fbcd9..197a482239c 100644 --- a/libstdc++-v3/doc/html/manual/diagnostics.html +++ b/libstdc++-v3/doc/html/manual/diagnostics.html @@ -7,7 +7,7 @@ Standard Contents Â Next
ChapterÂ 5.Â Diagnostics - +
Table of Contents
Exceptions
API Reference
Adding Data to exception
Concept Checking
Exceptions
API Reference
All exception objects are defined in one of the standard header files: exception, diff --git a/libstdc++-v3/doc/html/manual/documentation_style.html b/libstdc++-v3/doc/html/manual/documentation_style.html index e32947a2626..7d4b8c9c2f9 100644 --- a/libstdc++-v3/doc/html/manual/documentation_style.html +++ b/libstdc++-v3/doc/html/manual/documentation_style.html @@ -4,7 +4,7 @@ Contributing Â Next
Documentation Style
Doxygen
Prerequisites
- Prerequisite tools are Bash 2.x or higher, + Prerequisite tools are Bash 2.0 or later, Doxygen, and the GNU coreutils. (GNU versions of find, xargs, and possibly @@ -108,7 +108,7 @@ writing Doxygen comments. Single and double quotes, and separators in filenames are two common trouble spots. When in doubt, consult the following table. -
TableÂ A.1.Â HTML to Doxygen Markup Comparison
HTML Doxygen
\ \\
" \"
' \'
 @a word
 @b word
<code> @c word
 @a word
 two words or more

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

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

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

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

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

There is a single _Sp_counted_base class, which is a template parameterized on the enum @@ -599,7 +599,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. -
Dual C++0x and TR1 Implementation
+
Dual C++0x and TR1 Implementation
The classes derived from _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 @@ -610,7 +610,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. -
Related functions and classes
dynamic_pointer_cast, static_pointer_cast, +
Related functions and classes
dynamic_pointer_cast, static_pointer_cast, const_pointer_cast
As noted in N2351, these functions can be implemented non-intrusively using the alias constructor. However the aliasing constructor is only available @@ -643,10 +643,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. -
Use
Examples
+
Use
Examples
Examples of use can be found in the testsuite, under testsuite/tr1/2_general_utilities/shared_ptr. -
Unresolved Issues
+
Unresolved Issues
The resolution to C++ Standard Library issue 674, "shared_ptr interface changes for consistency with N1856" will need to be implemented after it is accepted into the working @@ -694,7 +694,7 @@ be private. code to work with, Peter Dimov in particular for his help and invaluable advice on thread safety. Phillip Jordan and Paolo Carlini for the lock policy implementation. -
Bibliography
+
Bibliography
Improving shared_ptr for C++0x, Revision 2 @@ -702,7 +702,7 @@ be private. . N2351 - .
+ .
C++ Standard Library Active Issues List @@ -710,7 +710,7 @@ be private. . N2456 - .
+ .
Working Draft, Standard for Programming Language C++ @@ -718,7 +718,7 @@ be private. . N2461 - .
+ .
shared_ptr Boost C++ Libraries documentation, shared_ptr diff --git a/libstdc++-v3/doc/html/manual/numerics.html b/libstdc++-v3/doc/html/manual/numerics.html index de57145c948..7c039dcd7bc 100644 --- a/libstdc++-v3/doc/html/manual/numerics.html +++ b/libstdc++-v3/doc/html/manual/numerics.html @@ -7,7 +7,7 @@ Standard Contents Â Next
ChapterÂ 12.Â Numerics - +
Table of Contents
Complex
complex Processing
Generalized Operations
Interacting with C
Numerics vs. Arrays
C99
Complex

complex Processing

Using complex<> becomes even more comple- er, sorry, diff --git a/libstdc++-v3/doc/html/manual/parallel_mode.html b/libstdc++-v3/doc/html/manual/parallel_mode.html index b8993b5c9d2..6e7d9e723e3 100644 --- a/libstdc++-v3/doc/html/manual/parallel_mode.html +++ b/libstdc++-v3/doc/html/manual/parallel_mode.html @@ -13,11 +13,11 @@ explicit source declaration or by compiling existing sources with a specific compiler flag.
Intro
The following library components in the include numeric are included in the parallel mode:
std::accumulate
std::adjacent_difference
std::inner_product
std::partial_sum
The following library components in the include -algorithm are included in the parallel mode:
std::adjacent_find
std::count
std::count_if
std::equal
std::find
std::find_if
std::find_first_of
std::for_each
std::generate
std::generate_n
std::lexicographical_compare
std::mismatch
std::search
std::search_n
std::transform
std::replace
std::replace_if
std::max_element
std::merge
std::min_element
std::nth_element
std::partial_sort
std::partition
std::random_shuffle
std::set_union
std::set_intersection
std::set_symmetric_difference
std::set_difference
std::sort
std::stable_sort
std::unique_copy
Bibliography
+algorithm are included in the parallel mode:
std::adjacent_find
std::count
std::count_if
std::equal
std::find
std::find_if
std::find_first_of
std::for_each
std::generate
std::generate_n
std::lexicographical_compare
std::mismatch
std::search
std::search_n
std::transform
std::replace
std::replace_if
std::max_element
std::merge
std::min_element
std::nth_element
std::partial_sort
std::partition
std::random_shuffle
std::set_union
std::set_intersection
std::set_symmetric_difference
std::set_difference
std::sort
std::stable_sort
std::unique_copy
Bibliography
Parallelization of Bulk Operations for STL Dictionaries . Johannes Singler. Leonor Frias. Copyright Â© 2007 . Workshop on Highly Parallel Processing on a Chip (HPPC) 2007. (LNCS) - .
+ .
The Multi-Core Standard Template Library . Johannes Singler. Peter Sanders. Felix Putze. Copyright Â© 2007 . Euro-Par 2007: Parallel Processing. (LNCS 4641) diff --git a/libstdc++-v3/doc/html/manual/profile_mode.html b/libstdc++-v3/doc/html/manual/profile_mode.html index 8fc828ef1e3..73e28d1041b 100644 --- a/libstdc++-v3/doc/html/manual/profile_mode.html +++ b/libstdc++-v3/doc/html/manual/profile_mode.html @@ -138,7 +138,7 @@ vector-size: improvement = 3: call stack = 0x804842c ... call context. (Environment variable not supported.)
-
Bibliography
+
Bibliography
Perflint: A Context Sensitive Performance Advisor for C++ Programs . Lixia Liu. Silvius Rus. Copyright Â© 2009 . Proceedings of the 2009 International Symposium on Code Generation diff --git a/libstdc++-v3/doc/html/manual/spine.html b/libstdc++-v3/doc/html/manual/spine.html index bbc038e09bd..b1db6ae56a9 100644 --- a/libstdc++-v3/doc/html/manual/spine.html +++ b/libstdc++-v3/doc/html/manual/spine.html @@ -2,7 +2,7 @@ The GNU C++ Library
The GNU C++ Library
PrevÂ Â Â Next
The GNU C++ Library
Copyright Â© 2009, 2010 FSF -
+
License
Table of Contents
I. Introduction @@ -61,7 +61,7 @@
D. GNU General Public License version 3 -
E. GNU Free Documentation License
List of Tables
1.1. C++ 1998/2003 Implementation Status
1.2. C++ 200x Implementation Status
1.3. C++ TR1 Implementation Status
1.4. C++ TR 24733 Implementation Status
3.1. C++ Command Options
3.2. C++ 1998 Library Headers
3.3. C++ 1998 Library Headers for C Library Facilities
3.4. C++ 200x Library Headers
3.5. C++ 200x Library Headers for C Library Facilities
3.6. C++ TR 1 Library Headers
3.7. C++ TR 1 Library Headers for C Library Facilities
3.8. C++ TR 24733 Decimal Floating-Point Header
3.9. C++ ABI Headers
3.10. Extension Headers
3.11. Extension Debug Headers
3.12. Extension Profile Headers
3.13. Extension Parallel Headers
17.1. Debugging Containers
17.2. Debugging Containers C++0x
18.1. Parallel Algorithms
19.1. Profile Code Location
19.2. Profile Diagnostics
20.1. Bitmap Allocator Memory Map
A.1. HTML to Doxygen Markup Comparison
A.2. HTML to Docbook XML Markup Comparison
A.3. Docbook XML Element Use
B.1. Extension Allocators
B.2. Extension Allocators Continued
PrevÂ Â Â Next
The GNU C++ Library DocumentationÂ Home Â PartÂ I.Â +
E. GNU Free Documentation License
List of Tables
1.1. C++ 1998/2003 Implementation Status
1.2. C++ 200x Implementation Status
1.3. C++ TR1 Implementation Status
1.4. C++ TR 24733 Implementation Status
3.1. C++ Command Options
3.2. C++ 1998 Library Headers
3.3. C++ 1998 Library Headers for C Library Facilities
3.4. C++ 200x Library Headers
3.5. C++ 200x Library Headers for C Library Facilities
3.6. C++ TR 1 Library Headers
3.7. C++ TR 1 Library Headers for C Library Facilities
3.8. C++ TR 24733 Decimal Floating-Point Header
3.9. C++ ABI Headers
3.10. Extension Headers
3.11. Extension Debug Headers
3.12. Extension Profile Headers
3.13. Extension Parallel Headers
17.1. Debugging Containers
17.2. Debugging Containers C++0x
18.1. Parallel Algorithms
19.1. Profile Code Location
19.2. Profile Diagnostics
20.1. Bitmap Allocator Memory Map
A.1. HTML to Doxygen Markup Comparison
A.2. HTML to Docbook XML Markup Comparison
A.3. Docbook XML Element Use
B.1. Extension Allocators
B.2. Extension Allocators Continued
PrevÂ Â Â Next
The GNU C++ Library DocumentationÂ Home Â PartÂ I.Â Introduction
diff --git a/libstdc++-v3/doc/html/manual/status.html b/libstdc++-v3/doc/html/manual/status.html index 8f61c984a43..419b5e12f2d 100644 --- a/libstdc++-v3/doc/html/manual/status.html +++ b/libstdc++-v3/doc/html/manual/status.html @@ -8,7 +8,7 @@ This status table is based on the table of contents of ISO/IEC 14882:2003.
This page describes the C++ support in mainline GCC SVN, not in any particular release. -
TableÂ 1.1.Â C++ 1998/2003 Implementation Status
Section Description Status Comments
+
TableÂ 1.1.Â C++ 1998/2003 Implementation Status
Section Description Status Comments
18 Language support @@ -144,8 +144,8 @@ particular release. a get area exists will... whatever fflush() does, I think.
C++ 200x
This table is based on the table of contents of ISO/IEC -Doc No: N3000=09-0190 Date: 2009-11-09 -Working Draft, Standard for Programming Language C++ +JTC1 SC22 WG21 Doc No: N3092 Date: 2010-03-26 +Final Committee Draft, Standard for Programming Language C++
In this implementation -std=gnu++0x or -std=c++0x flags must be used to enable language @@ -157,56 +157,56 @@ presence of the required flag.
This page describes the C++0x support in mainline GCC SVN, not in any particular release. -
TableÂ 1.2.Â C++ 200x Implementation Status
Section Description Status Comments
+
TableÂ 1.2.Â C++ 200x Implementation Status
Section Description Status Comments
18 Language support -
18.1 General Y Â
18.2 Types Partial Missing offsetof, max_align_t, nullptr_t
18.3 Implementation properties Â Â
18.3.1 Numeric Limits Â Â
18.3.1.1 Class template numeric_limits Y Â
18.3.1.2 numeric_limits members Partial Missing constexpr
18.3.1.3 float_round_style N Â
18.3.1.4 float_denorm_style N Â
18.3.1.5 numeric_limits specializations Y Â
18.3.2 C Library Y Â
18.4 Integer types Â Â
18.4.1 Header <cstdint> synopsis Y Â
18.4.2 The header <stdint.h> Partial May use configure-generated stdint.h via GCC_HEADER_STDINT
18.5 Start and termination Partial Missing quick_exit, at_quick_exit
18.6 Dynamic memory management Y Â
18.7 Type identification Â Â
18.7.1 Class type_info Y Â
18.7.2 Class type_index N Â
18.7.3 Class bad_cast Y Â
18.7.4 Class bad_typeid Y Â
18.8 Exception handling Â Â
18.8.1 Class exception Y Â
18.8.2 Violation exception-specifications Y Â
18.8.3 Abnormal termination Y Â
18.8.4 uncaught_exception Y Â
18.8.5 Propagation Y Â
18.8.6 Class nested_exception Y Â
18.9 Initializer lists Â Â
18.9.1 Initializer list constructors Y Â
18.9.2 Initializer list access Y Â
18.9.3 Initializer list concept maps N Â
18.10 Other runtime support Y Â
+
18.1 General Y Â
18.2 Types Partial Missing offsetof, max_align_t, nullptr_t
18.3 Implementation properties Â Â
18.3.1 Numeric Limits Â Â
18.3.1.1 Class template numeric_limits Y Â
18.3.1.2 numeric_limits members Partial Missing constexpr
18.3.1.3 float_round_style N Â
18.3.1.4 float_denorm_style N Â
18.3.1.5 numeric_limits specializations Y Â
18.3.2 C Library Y Â
18.4 Integer types Â Â
18.4.1 Header <cstdint> synopsis Y Â
18.5 Start and termination Partial Missing quick_exit, at_quick_exit
18.6 Dynamic memory management Y Â
18.7 Type identification Â Â
18.7.1 Class type_info Y Â
18.7.2 Class bad_cast Y Â
18.7.3 Class bad_typeid Y Â
18.8 Exception handling Â Â
18.8.1 Class exception Y Â
18.8.2 Violating exception-specifications Y Â
18.8.3 Abnormal termination Y Â
18.8.4 uncaught_exception Y Â
18.8.5 Exception Propagation Y Â
18.8.6 nested_exception Y Â
18.9 Initializer lists Â Â
18.9.1 Initializer list constructors Y Â
18.9.2 Initializer list access Y Â
18.9.3 Initializer list range access N Â
18.10 Other runtime support Y Â
19 Diagnostics -
19.1 General Y Â
19.2 Exception classes Y Â
19.3 Assertions Y Â
19.4 Error numbers Y Â
19.5 System error support Â Â
19.5.1 Class error_category Y Â
19.5.2 Class error_code Partial Missing concept ErrorCodeEnum
19.5.3 Class error_condition Partial Missing concept ErrorConditionEnum
19.5.4 Comparison operators Y Â
19.5.5 Class system_error Y Â
+
19.1 General Y Â
19.2 Exception classes Y Â
19.3 Assertions Y Â
19.4 Error numbers Y Â
19.5 System error support Â Â
19.5.1 Class error_category Y Â
19.5.2 Class error_code Y Â
19.5.3 Class error_condition Y Â
19.5.4 Comparison operators Y Â
19.5.5 Class system_error Y Â
20 General utilities -
20.1 General Partial Missing all concepts
20.2 Concepts N Â
20.3 Utility components Â Â
20.3.1 Operators Y Â
20.3.2 forward and move helpers Y Â
20.3.3 pair Y Â
20.3.4 tuple-like access to pair Y Â
20.3.5 Range concept maps for pair N Â
20.3.6 Class template bitset Partial Missing constexpr
20.4 Compile-time rational arithmetic Â Â
20.4.1 Class template ratio Y Â
20.4.2 Arithmetic on ratio types Y Â
20.4.3 Comparison of ratio types Y Â
20.4.4 SI types Y Â
20.5 Tuples Â Â
20.5.1 General Y Â
20.5.2 Class template tuple Partial Missing range concept maps
20.6 Metaprogramming and type traits Â Â
20.6.1 Requirements Y Â
20.6.2 Header <type_traits> synopsis Â Â
20.6.3 Helper classes Y Â
20.6.4 Unary Type Traits Â Â
20.6.4.1 Primary type categories Y Â
20.6.4.2 Composite type traits Y Â
20.6.4.3 Type properties Partial Missing is_system_layout
20.6.5 Relationships between types Y Â
20.6.6 Transformations between types Â Â
20.6.6.1 Const-volatile modifications Y Â
20.6.6.2 Reference modifications Y Â
20.6.6.3 Sign modifications Y Â
20.6.6.4 Array modifications Y Â
20.6.6.5 Pointer modifications Y Â
20.6.7 Other transformations Partial Missing decay
20.7 Function objects Â Â
20.7.1 Definitions Y Â
20.7.3 Base Y Â
20.7.4 Function object return types Y Â
20.7.5 Class template reference_wrapper Y Â
20.7.6 Identity operation N Â
20.7.7 Arithmetic operation Y Â
20.7.8 Comparisons Y Â
20.7.9 Logical operations Y Â
20.7.10 Bitwise operations Y Â
20.7.11 Negators Y Â
20.7.12 Template function and function template bind Y Â
20.7.13 Adaptors for pointers to functions Y Â
20.7.14 Adaptors for pointers to members Y Â
20.7.15 Function template mem_fn Y Â
20.7.16 Polymorphic function wrappers Â Â
20.7.16.1 Class bad_function_call Y Â
20.7.16.2 Class template function Y Â
20.7.17 Class template hash Y Â
20.7.18 Class template reference_closure N Â
20.8 Memory Â Â
20.8.01 Allocator argument tag N Â
20.8.02 Allocators Â Â
20.8.02.1 General Y Â
20.8.02.2 Allocator concept N Â
20.8.02.3 Support for legacy allocators N Â
20.8.02.4 Allocator and Legacy Allocator members N Â
20.8.03 Allocator-related element concepts N Â
20.8.04 Allocator propagation traits N Â
20.8.05 Allocator propagation map N Â
20.8.06 The default allocator Y Â
20.8.07 Scoped allocator adaptor Â Â
20.8.07.1 scoped_allocator_adaptor_base N Â
20.8.07.2 scoped_allocator_adaptor constructors N Â
20.8.07.3 scoped_allocator_adaptor2 N Â
20.8.07.3 scoped_allocator_adaptor members N Â
20.8.07.4 scoped_allocator_adaptor globals N Â
20.8.08 Raw storage iterator Y Â
20.8.09 Temporary buffers Y Â
20.8.10 construct_element N Â
20.8.11 Specialized algorithms Â Â
20.8.11.1 addressof N Â
20.8.11.2 uninitialized_copy Y Â
20.8.11.3 uninitialized_fill Y Â
20.8.11.4 uninitialized_fill_n Y Â
20.8.12 Class template unique_ptr Y Â
20.8.13 Smart pointers Â Â
20.8.13.1 Class bad_weak_ptr Y Â
20.8.13.2 Class template shared_ptr Y +
20.1 General Â Â
20.2 Requirements Â Â
20.3 Utility components Â Â
20.3.1 Operators Y Â
20.3.2 Swap Y Â
20.3.3 forward and move helpers Y Â
20.3.4 Function template declval Y Â
20.3.5 Pairs Â Â
20.3.5.1 In general Â Â
20.3.5.2 Class template pair Partial Missing constexpr
20.3.5.3 Tuple-like access to pair Y Â
20.3.5.4 pair range access N Â
20.3.5.5 Piecewise construction N Â
20.4 Tuples Â Â
20.4.1 In general Â Â
20.4.2 Class template tuple Partial Missing constexpr and range access
20.5 Class template bitset Partial Missing constexpr
20.6 Compile-time rational arithmetic Â Â
20.6.1 Class template ratio Y Â
20.6.2 Arithmetic on ratio types Y Â
20.6.3 Comparison of ratio types Y Â
20.6.4 SI types for ratio Y Â
20.7 Metaprogramming and type traits Â Â
20.7.1 Requirements Y Â
20.7.2 Header <type_traits> synopsis Â Â
20.7.3 Helper classes Y Â
20.7.4 Unary Type Traits Y Â
20.7.4.1 Primary type categories Y Â
20.7.4.2 Composite type traits Y Â
20.7.4.3 Type properties Partial Missing is_system_layout
20.7.5 Relationships between types Y Â
20.7.6 Transformations between types Partial Missing underlying_type
20.7.6.1 Const-volatile modifications Y Â
20.7.6.2 Reference modifications Y Â
20.7.6.3 Sign modifications Y Â
20.7.6.4 Array modifications Y Â
20.7.6.5 Pointer modifications Y Â
20.7.6.6 Other transformations Y Â
20.8 Function objects Â Â
20.8.1 Definitions Y Â
20.8.2 Requirements Y Â
20.8.3 Base Y Â
20.8.4 Class template reference_wrapper Y Â
20.8.5 Arithmetic operation Y Â
20.8.6 Comparisons Y Â
20.8.7 Logical operations Y Â
20.8.8 Bitwise operations Y Â
20.8.9 Negators Y Â
20.8.10 Function template bind Y Â
20.8.11 Adaptors for pointers to functions Y Â
20.8.12 Adaptors for pointers to members Y Â
20.8.13 Function template mem_fn Y Â
20.8.14 Polymorphic function wrappers Â Â
20.8.14.1 Class bad_function_call Y Â
20.8.14.2 Class template function Y Â
20.8.15 Class template hash Y Â
20.9 Memory Â Â
20.9.1 Allocator argument tag N Â
20.9.2 uses_allocator N Â
20.9.3 Pointer traits N Â
20.9.4 Allocator traits N Â
20.9.5 The default allocator Y Â
20.9.6 Scoped allocator adaptor Â Â
20.9.6.1 Scoped allocator adaptor member types N Â
20.9.6.2 Scoped allocator adaptor constructors N Â
20.9.6.3 Scoped allocator adaptor members N Â
20.9.7 Raw storage iterator Y Â
20.9.8 Temporary buffers Y Â
20.9.9 Specialized algorithms Â Â
20.9.9.1 addressof N Â
20.9.9.2 uninitialized_copy Y Â
20.9.9.3 uninitialized_fill Y Â
20.9.9.4 uninitialized_fill_n Y Â
20.9.10 Class template unique_ptr Y Â
20.9.11 Smart pointers Â Â
20.9.11.1 Class bad_weak_ptr Y Â
20.9.11.2 Class template shared_ptr Y
Uses code from boost::shared_ptr.
-
20.8.13.3 Class template weak_ptr Y Â
20.8.13.4 Class template owner_less Y Â
20.8.13.5 Class template emable_shared_from_this Y Â
20.8.13.6 shared_ptr atomic access Partial Â
20.8.13.7 Pointer safety Partial Â
20.8.14 Align N Â
20.8.15 C library Y Â
20.9 Time utilities Â Â
20.9.1 Clock requirements Y Â
20.9.2 Time-related traits Â Â
20.9.2.1 treat_as_floating_point Y Â
20.9.2.2 duration_values Partial Missing constexpr
20.9.2.3 Specializations of common_type Y Â
20.9.3 Class template duration Partial Missing constexpr
20.9.4 Class template time_point Partial Missing constexpr
20.9.5 Clocks Â Â
20.9.5.1 Class system_clock Y Â
20.9.5.2 Class monotonic_clock Y Â
20.9.5.3 Class high_resolution_clock Y Â
20.10 Date and time functions Y Â
+
20.9.11.3 Class template weak_ptr Y Â
20.9.11.4 Class template emable_shared_from_this Y Â
20.9.11.5 shared_ptr atomic access Partial Â
20.9.11.6 Hash support Y Â
20.9.12 Pointer safety Partial Â
20.9.13 Align N Â
20.9.16 C library Y Â
20.10 Time utilities Â Â
20.10.1 Clock requirements Y Â
20.10.2 Time-related traits Â Â
20.10.2.1 treat_as_floating_point Y Â
20.10.2.2 duration_values Partial Missing constexpr
20.10.2.3 Specializations of common_type Y Â
20.10.3 Class template duration Partial Missing constexpr
20.10.4 Class template time_point Partial Missing constexpr
20.10.5 Clocks Â Â
20.10.5.1 Class system_clock Y Â
20.10.5.2 Class monotonic_clock Y Â
20.10.5.3 Class high_resolution_clock Y Â
20.11 Date and time functions Y Â
20.12 Class type_index N Â
21 Strings -
21.1 General Y Â
21.2 Character traits Â Â
21.2.1 Character traits requirements Y Â
21.2.2 traits typedef Y Â
21.2.3 char_traits specializations Â Â
21.2.3.1 struct char_traits<char> Partial Missing constexpr
21.2.3.2 struct char_traits<char16_t> Partial Missing constexpr
21.2.3.3 struct char_traits<char32_t> Partial Missing constexpr
21.2.3.4 struct char_traits<wchar_t> Partial Missing constexpr
21.3 String classes Y Â
21.4 Class template basic_string Y Â
21.5 Numeric Conversions Y Â
21.6 Null-terminated sequence utilities Y C library dependency
+
21.1 General Y Â
21.2 Character traits Â Â
21.2.1 Character traits requirements Y Â
21.2.2 traits typedefs Y Â
21.2.3 char_traits specializations Â Â
21.2.3.1 struct char_traits<char> Partial Missing constexpr
21.2.3.2 struct char_traits<char16_t> Partial Missing constexpr
21.2.3.3 struct char_traits<char32_t> Partial Missing constexpr
21.2.3.4 struct char_traits<wchar_t> Partial Missing constexpr
21.3 String classes Y Â
21.4 Class template basic_string Y Â
21.5 Numeric Conversions Y Â
21.6 Hash support Y Â
21.7 Null-terminated sequence utilities Y C library dependency
22 Localization -
22.1 General Y Â
22.2 Header <locale> synopsis Y Â
22.3 Locales Â Â
22.3.1 Class locale Y Â
22.3.2 locale globals Y Â
22.3.3 Convenience interfaces Â Â
22.3.3.1 Character classification Y Â
22.3.3.2 Conversions Â Â
22.3.3.2.1 Character Y Â
22.3.3.2.2 String N Â
22.3.3.2.3 Buffer N Â
22.4 Standard locale categories Â Â
22.4.1 ctype Y Â
22.4.2 Numeric Â Â
22.4.2.1 num_get Y Â
22.4.2.2 num_put Y Â
22.4.3 num_punct Y Â
22.4.4 collate Y Â
22.4.5 Time Â Â
22.4.5.1 time_get Y Â
22.4.5.2 time_get_byname Y Â
22.4.5.3 time_put Y Â
22.4.5.3 time_put_byname Y Â
22.4.6 Monetary Â Â
22.4.6.1 money_get Y Â
22.4.6.2 money_put Y Â
22.4.6.3 money_punct Y Â
22.4.6.4 money_punct_byname Y Â
22.4.7 messages Y Â
22.4.8 Program-defined facets Y Â
22.5 Standard code conversion facets N Â
22.6 C Library Locales Y Â
+
22.1 General Y Â
22.2 Header <locale> synopsis Y Â
22.3 Locales Â Â
22.3.1 Class locale Y Â
22.3.2 locale globals Y Â
22.3.3 Convenience interfaces Â Â
22.3.3.1 Character classification Y Â
22.3.3.2 Conversions Â Â
22.3.3.2.1 Character conversions Y Â
22.3.3.2.2 string conversions N Â
22.3.3.2.3 Buffer conversions N Â
22.4 Standard locale categories Â Â
22.4.1 The ctype category Y Â
22.4.2 The numeric category Â Â
22.4.2.1 num_get Y Â
22.4.2.2 num_put Y Â
22.4.3 The numeric punctuation facet Y Â
22.4.4 The collate category Y Â
22.4.5 The time category Â Â
22.4.5.1 Class template time_get Y Â
22.4.5.2 Class template time_get_byname Y Â
22.4.5.3 Class template time_put Y Â
22.4.5.3 Class template time_put_byname Y Â
22.4.6 The monetary category Â Â
22.4.6.1 Class template money_get Y Â
22.4.6.2 Class template money_put Y Â
22.4.6.3 Class template money_punct Y Â
22.4.6.4 Class template money_punct_byname Y Â
22.4.7 The message retrieval category Y Â
22.4.8 Program-defined facets Y Â
22.5 Standard code conversion facets N Â
22.6 C Library Locales Y Â
23 Containers -
23.1 General Partial Missing concepts
23.2 Container requirements Â Â
23.2.1 General requirements Partial Missing construct_element
23.2.2 Data races Y Â
23.3 Sequence containers Â Â
23.3.1 Class template array Partial Missing constexpr
23.3.2 Class template deque Y Â
23.3.3 Class template forward_list Y Â
23.3.4 Class template list Y Â
23.3.5 Adaptors Â Â
23.3.5.1 Class template queue Y Â
23.3.5.2 Class template priority_queue Y Â
23.3.5.3 Class template stack Y Â
23.3.6 Class template vector Y Â
23.3.7 Class vector<bool> Y Â
23.4 Associative containers Â Â
23.4.1 Class template map Y Â
23.4.2 Class template multimap Y Â
23.4.3 Class template set Y Â
23.4.4 Class template multiset Y Â
23.5 Unordered associative containers Â Â
23.5.1 Class template unordered_map Y Â
23.5.2 Class template unordered_multimap Y Â
23.5.3 Class template unordered_set Y Â
23.5.4 Class template unordered_multiset Y Â
+
23.1 General Â Â
23.2 Container requirements Â Â
23.2.1 General container requirements Y Â
23.2.2 Data races Y Â
23.2.3 Sequence containers Y Â
23.2.4 Associative containers Y Â
23.2.5 Unordered associative containers Y Â
23.3 Sequence containers Â Â
23.3.1 Class template array Partial Missing constexpr
23.3.2 Class template deque Y Â
23.3.3 Class template forward_list Y Â
23.3.4 Class template list Y Â
23.3.5 Container adaptors Â Â
23.3.5.1 Class template queue Y Â
23.3.5.2 Class template priority_queue Y Â
23.3.5.3 Class template stack Y Â
23.3.6 Class template vector Y Â
23.3.7 Class vector<bool> Y Â
23.4 Associative containers Â Â
23.4.1 Class template map Y Â
23.4.2 Class template multimap Y Â
23.4.3 Class template set Y Â
23.4.4 Class template multiset Y Â
23.5 Unordered associative containers Â Â
23.5.1 Class template unordered_map Y Â
23.5.2 Class template unordered_multimap Y Â
23.5.3 Class template unordered_set Y Â
23.5.4 Class template unordered_multiset Y Â
24 Iterators -
24.1 General Partial Missing concepts
24.2 Iterator concepts N Â
24.3 Header <iterator> synopsis Partial Missing concepts
24.4 Iterator operations Y Â
24.5 Predefined iterators and Iterator adaptors Â Â
24.5.1 Reverse iterators Y Â
24.5.2 Insert iterators Y Â
24.5.3 Move iterators Y Â
24.6 Stream iterators Â Â
24.6.1 Class template istream_iterator Y Â
24.6.2 Class template ostream_iterator Y Â
24.6.3 Class template istreambuf_iterator Y Â
24.6.4 Class template ostreambuf_iterator Y Â
24.7 Insert iterators Â Â
24.7.1 Class template back_insert_iterator Y Â
24.7.3 Class template front_insert_iterator Y Â
24.7.5 Class template insert_iterator Y Â
+
24.1 General Y Â
24.2 Iterator requirements Y Â
24.3 Header <iterator> synopsis Y Â
24.4 Iterator primitives Y Â
24.5 Iterator adaptors Â Â
24.5.1 Reverse iterators Y Â
24.5.2 Insert iterators Y Â
24.5.3 Move iterators Y Â
24.6 Stream iterators Â Â
24.6.1 Class template istream_iterator Y Â
24.6.2 Class template ostream_iterator Y Â
24.6.3 Class template istreambuf_iterator Y Â
24.6.4 Class template ostreambuf_iterator Y Â
24.6.5 range access N Â
25 Algorithms -
25.1 General Partial Missing concepts
25.2 Header <algorithm> synopsis Y Â
25.3 Non-modifying sequence operations Y Â
25.4 Mutating sequence operations Y Â
25.5 Sorting and related operations Y Â
25.6 C library algorithms Y Â
+
25.1 General Â Â
25.2 Non-modifying sequence operations Y Â
25.3 Mutating sequence operations Y Â
25.4 Sorting and related operations Y Â
25.5 C library algorithms Y Â
26 Numerics -
26.1 General Y Â
26.2 Numeric type requirements Y Â
26.3 The floating-point environment Y Â
26.4 Complex numbers Partial Missing constexpr
26.5 Random number generation Â Â
26.5.1 Header <random> synopsis Partial Missing concepts
26.5.2 Concepts and related requirements N Â
26.5.3 Random number engines Â Â
26.5.3.1 Class template linear_congruential_engine Y Missing constexpr
26.5.3.2 Class template mersenne_twister_engine Y Missing constexpr
26.5.3.3 Class template subtract_with_carry_engine Y Missing constexpr
26.5.4 Random number engine adaptors Â Â
26.5.4.1 Class template discard_block_engine Y Missing constexpr
26.5.4.2 Class template independent_bits_engine Y Missing constexpr
26.5.4.3 Class template shuffle_order_engine Y Missing constexpr
26.5.5 Engines and engine adaptors with predefined parameters Y Â
26.5.6 Class random_device Y Missing constexpr
26.5.7 Utilities Â Â
26.5.7.1 Class seed_seq Y Â
26.5.7.2 Function template generate_canonical Y Â
26.5.8 Random number distributions Â Â
26.5.8.1 Uniform distributions Â Â
26.5.8.1.1 Class template uniform_int_distribution Y Â
26.5.8.1.2 Class template uniform_real_distribution Y Â
26.5.8.2 Bernoulli distributions Â Â
26.5.8.2.1 Class bernoulli_distribution Y Â
26.5.8.2.2 Class template binomial_distribution Y Â
26.5.8.2.3 Class template geometric_distribution Y Â
26.5.8.2.4 Class template negative_binomial_distribution Y Â
26.5.8.3 Poisson distributions Â Â
26.5.8.3.1 Class template poisson_distribution Y Â
26.5.8.3.2 Class template exponential_distribution Y Â
26.5.8.3.3 Class template gamma_distribution Y Â
26.5.8.3.4 Class template weibull_distribution Y Â
26.5.8.3.5 Class template extreme_value_distribution Y Â
26.5.8.4 Normal distributions Â Â
26.5.8.4.1 Class template normal_distribution Y Â
26.5.8.4.2 Class template lognormal_distribution Y Â
26.5.8.4.3 Class template chi_squared_distribution Y Â
26.5.8.4.4 Class template cauchy_distribution Y Â
26.5.8.4.5 Class template fisher_f_distribution Y Â
26.5.8.4.6 Class template student_t_distribution Y Â
26.5.8.5 Sampling distributions Â Â
26.5.8.5.1 Class template discrete_distribution Y Â
26.5.8.5.2 Class template piecewise_constant_distribution Y Â
26.5.8.5.3 Class template piecewise_linear_distribution Y Â
26.6 Numeric arrays Â Â
26.6.1 Header <valarray> synopsis Y Â
26.6.2 Class template valarray Y Â
26.6.3 valarray non-member operations Y Â
26.6.4 Class slice Y Â
26.6.5 Class template slice_array Y Â
26.6.6 Class gslice Y Â
26.6.7 Class template gslice_array Y Â
26.6.8 Class template mask_array Y Â
26.6.9 Class template indirect_array Y Â
26.7 Generalized numeric operations Â Â
26.7.1 accumulate Y Â
26.7.2 inner_product Y Â
26.7.3 partial_sum Y Â
26.7.4 adjacent_difference Y Â
26.7.5 iota Y Â
26.8 C Library Y Â
+
26.1 General Y Â
26.2 Numeric type requirements Y Â
26.3 The floating-point environment Y Â
26.4 Complex numbers Partial Missing constexpr
26.5 Random number generation Â Â
26.5.1 Requirements Â Â
26.5.2 Header <random> synopsis Â Â
26.5.3 Random number engine class templates Â Â
26.5.3.1 Class template linear_congruential_engine Y Missing constexpr
26.5.3.2 Class template mersenne_twister_engine Y Missing constexpr
26.5.3.3 Class template subtract_with_carry_engine Y Missing constexpr
26.5.4 Random number engine adaptor class templates Â Â
26.5.4.1 Class template discard_block_engine Y Missing constexpr
26.5.4.2 Class template independent_bits_engine Y Missing constexpr
26.5.4.3 Class template shuffle_order_engine Y Missing constexpr
26.5.5 Engines and engine adaptors with predefined parameters Y Â
26.5.6 Class random_device Y Missing constexpr
26.5.7 Utilities Â Â
26.5.7.1 Class seed_seq Y Â
26.5.7.2 Function template generate_canonical Y Â
26.5.8 Random number distribution class templates Â Â
26.5.8.1 Uniform distributions Â Â
26.5.8.1.1 Class template uniform_int_distribution Y Â
26.5.8.1.2 Class template uniform_real_distribution Y Â
26.5.8.2 Bernoulli distributions Â Â
26.5.8.2.1 Class bernoulli_distribution Y Â
26.5.8.2.2 Class template binomial_distribution Y Â
26.5.8.2.3 Class template geometric_distribution Y Â
26.5.8.2.4 Class template negative_binomial_distribution Y Â
26.5.8.3 Poisson distributions Â Â
26.5.8.3.1 Class template poisson_distribution Y Â
26.5.8.3.2 Class template exponential_distribution Y Â
26.5.8.3.3 Class template gamma_distribution Y Â
26.5.8.3.4 Class template weibull_distribution Y Â
26.5.8.3.5 Class template extreme_value_distribution Y Â
26.5.8.4 Normal distributions Â Â
26.5.8.4.1 Class template normal_distribution Y Â
26.5.8.4.2 Class template lognormal_distribution Y Â
26.5.8.4.3 Class template chi_squared_distribution Y Â
26.5.8.4.4 Class template cauchy_distribution Y Â
26.5.8.4.5 Class template fisher_f_distribution Y Â
26.5.8.4.6 Class template student_t_distribution Y Â
26.5.8.5 Sampling distributions Â Â
26.5.8.5.1 Class template discrete_distribution Y Â
26.5.8.5.2 Class template piecewise_constant_distribution Y Â
26.5.8.5.3 Class template piecewise_linear_distribution Y Â
26.6 Numeric arrays Â Â
26.6.1 Header <valarray> synopsis Y Â
26.6.2 Class template valarray Y Â
26.6.3 valarray non-member operations Y Â
26.6.4 Class slice Y Â
26.6.5 Class template slice_array Y Â
26.6.6 The gslice class Y Â
26.6.7 Class template gslice_array Y Â
26.6.8 Class template mask_array Y Â
26.6.9 Class template indirect_array Y Â
26.6.10 valarray range access N Â
26.7 Generalized numeric operations Â Â
26.7.1 accumulate Y Â
26.7.2 inner_product Y Â
26.7.3 partial_sum Y Â
26.7.4 adjacent_difference Y Â
26.7.5 iota Y Â
26.8 C Library Y Â
27 - Input/output -
27.1 General Y Â
27.2 Requirements Y Â
27.2.1 Imbue limitations Y Â
27.2.2 Positioning type limitations Y Â
27.2.3 Thread safety Partial Â
27.3 Forward declarations Y Â
27.4 Standard iostream objects Y Â
27.4.1 Narrow stream objects Y Â
27.4.2 Wide stream objects Y Â
27.5 Iostreams base classes Y Â
27.6 Stream buffers Y Â
27.7 Formatting and manipulators Y Â
27.8 String-based streams Y Â
27.9 File-based streams Y Â
+ Input/output library +
27.1 General Y Â
27.2 Iostreams requirements Y Â
27.2.1 Imbue Limitations Y Â
27.2.2 Positioning Type Limitations Y Â
27.2.3 Thread safety Partial Â
27.3 Forward declarations Y Â
27.4 Standard iostream objects Y Â
27.4.1 Narrow stream objects Y Â
27.4.2 Wide stream objects Y Â
27.5 Iostreams base classes Y Â
27.6 Stream buffers Y Â
27.7 Formatting and manipulators Y Â
27.8 String-based streams Y Â
27.9 File-based streams Y Â
28 Regular expressions -
28.01 General N Â
28.02 Definitions N Â
28.03 Requirements N Â
28.04 Regular expressions summary N Â
28.05 Header <regex> synopsis N Â
28.06 Namespace std::regex_constants Y Â
28.07 Class regex_error Y Â
28.08 Class template regex_traits Partial Â
28.09 Class template basic_regex Partial Â
28.10 Class template sub_match Partial Â
28.11 Class template match_results Partial Â
28.12 Regular expression algorithms N Â
28.13 Regular expression Iterators N Â
28.14 Modified ECMAScript regular expression grammar N Â
+
28.1 General N Â
28.2 Definitions N Â
28.3 Requirements N Â
28.4 Header <regex> synopsis N Â
28.5 Namespace std::regex_constants Y Â
28.6 Class regex_error Y Â
28.7 Class template regex_traits Partial Â
28.8 Class template basic_regex Partial Â
28.9 Class template sub_match Partial Â
28.10 Class template match_results Partial Â
28.11 Regular expression algorithms N Â
28.12 Regular expression Iterators N Â
28.13 Modified ECMAScript regular expression grammar N Â
29 Atomic operations @@ -214,11 +214,11 @@ particular release. 30 Thread support -
30.1 General Y Â
30.2 Requirements Y Â
30.3 Threads Â Â
30.3.1 Class thread Y Â
30.3.2 Namespace this_thread Y Â
30.4 Mutual exclusion Â Â
30.4.1 Mutex requirements Â Â
30.4.1.1 Class mutex Y Â
30.4.1.2 Class recursive_mutex Y Â
30.4.2 Timed mutex requirements Â Â
30.4.2.1 Class timed_mutex Y Â
30.4.2.2 Class recursive_timed_mutex Y Â
30.4.3 Locks Â Â
30.4.3.1 Class template lock_guard Y Â
30.4.3.2 Class template unique_lock Y Â
30.4.4 Generic locking algorithms Y Â
30.4.5 Call once Â Â
30.4.5.1 once_flag Y Missing constexpr
30.4.5.2 call_once Y Â
30.5 Condition variables Â Â
30.5.1 Class condition_variable Y Â
30.5.2 Class condition_variable_any Y Â
30.6 Futures Â Â
30.6.1 Overview Â Â
30.6.2 Error handling Y Missing constexpr
30.6.3 Class future_error Y Â
30.6.4 Associated asynchronous state Y Â
30.6.5 Class template promise Y Missing allocator_arg_t
30.6.6 Class template future Y Â
30.6.7 Class template shared_future Y Â
30.6.8 Class template atomic_future N Â
30.6.9 Function template async Y Â
30.6.10 Class template packaged_task Y Missing allocator_arg_t
+
30.1 General Y Â
30.2 Requirements Y Â
30.3 Threads Â Â
30.3.1 Class thread Y Â
30.3.2 Namespace this_thread Y Â
30.4 Mutual exclusion Â Â
30.4.1 Mutex requirements Â Â
30.4.1.1 Class mutex Y Â
30.4.1.2 Class recursive_mutex Y Â
30.4.2 Timed mutex requirements Â Â
30.4.2.1 Class timed_mutex Y Â
30.4.2.2 Class recursive_timed_mutex Y Â
30.4.3 Locks Â Â
30.4.3.1 Class template lock_guard Y Â
30.4.3.2 Class template unique_lock Y Â
30.4.4 Generic locking algorithms Y Â
30.4.5 Call once Â Â
30.4.5.1 once_flag Y Missing constexpr
30.4.5.2 call_once Y Â
30.5 Condition variables Â Â
30.5.1 Class condition_variable Y Â
30.5.2 Class condition_variable_any Y Â
30.6 Futures Â Â
30.6.1 Overview Â Â
30.6.2 Error handling Y Missing constexpr
30.6.3 Class future_error Y Â
30.6.4 Associated asynchronous state Y Â
30.6.5 Class template promise Partial Missing allocator_arg_t
30.6.6 Class template future Y Â
30.6.7 Class template shared_future Y Â
30.6.8 Class template atomic_future N Â
30.6.9 Function template async Y Â
30.6.10 Class template packaged_task Partial Missing allocator_arg_t
Appendix D Compatibility features -
D.1 Increment operator with bool operand Â Â
D.2 static keyword Â Â
D.3 Access declarations Â Â
D.4 Implicit conversion from const strings Â Â
D.5 C standard library headers Â Â
D.6 Old iostreams members Â Â
D.7 char* streams Â Â
D.8 Binders Â Â
D.9 auto_ptr Â Â
D.10 Iterator primitives Â Â

C++ TR1
+
D.1 Increment operator with bool operand Â Â
D.2 static keyword Â Â
D.3 Access declarations Â Â
D.4 register keyword Â Â
D.5 Dynamic exception specifications Â Â
D.6 C standard library headers Â Â
D.7 Old iostreams members Â Â
D.8 char* streams Â Â
D.9 Binders Â Â
D.10 auto_ptr Â Â

C++ TR1
This table is based on the table of contents of ISO/IEC DTR 19768 Doc No: N1836=05-0096 Date: 2005-06-24 Draft Technical Report on C++ Library Extensions @@ -229,7 +229,7 @@ In this implementation the header names are prefixed by
This page describes the TR1 support in mainline GCC SVN, not in any particular release. -
TableÂ 1.3.Â C++ TR1 Implementation Status
Section Description Status Comments
2 General Utilities
2.1 Reference wrappers Â Â
2.1.1 Additions to header <functional> synopsis Y Â
2.1.2 Class template reference_wrapper Â Â
2.1.2.1 reference_wrapper construct/copy/destroy Y Â
2.1.2.2 reference_wrapper assignment Y Â
2.1.2.3 reference_wrapper access Y Â
2.1.2.4 reference_wrapper invocation Y Â
2.1.2.5 reference_wrapper helper functions Y Â
2.2 Smart pointers Â Â
2.2.1 Additions to header <memory> synopsis Y Â
2.2.2 Class bad_weak_ptr Y Â
2.2.3 Class template shared_ptr Â +
TableÂ 1.3.Â C++ TR1 Implementation Status
+ 18 @@ -151,13 +152,6 @@ particular release. - 18.4.2 - The header <stdint.h> - Partial - May use configure-generated stdint.h via GCC_HEADER_STDINT - - - 18.5 Start and termination Partial @@ -182,20 +176,13 @@ particular release. - 18.7.2 - Class type_index - N - - - - 18.7.3 Class bad_cast Y - 18.7.4 + 18.7.3 Class bad_typeid Y @@ -214,7 +201,7 @@ particular release. 18.8.2 - Violation exception-specifications + Violating exception-specifications Y @@ -232,13 +219,13 @@ particular release. 18.8.5 - Propagation + Exception Propagation Y 18.8.6 - Class nested_exception + nested_exception Y @@ -263,7 +250,7 @@ particular release. 18.9.3 - Initializer list concept maps + Initializer list range access N @@ -318,18 +305,16 @@ particular release. - 19.5.2 Class error_code - Partial - Missing concept ErrorCodeEnum + Y + - 19.5.3 Class error_condition - Partial - Missing concept ErrorConditionEnum + Y + 19.5.4 @@ -352,17 +337,15 @@ particular release. - 20.1 General - Partial - Missing all concepts + + - 20.2 - Concepts - N + Requirements + @@ -379,489 +362,453 @@ particular release. 20.3.2 - forward and move helpers + Swap Y 20.3.3 - pair + forward and move helpers Y 20.3.4 - tuple-like access to pair + Function template declval Y - 20.3.5 - Range concept maps for pair - N + Pairs + - 20.3.6 - Class template bitset + 20.3.5.1 + In general + + + + + + 20.3.5.2 + Class template pair Partial Missing constexpr + 20.3.5.3 + Tuple-like access to pair + Y + + + + + 20.3.5.4 + pair range access + N + + + + + 20.3.5.5 + Piecewise construction + N + + + 20.4 - Compile-time rational arithmetic + Tuples 20.4.1 - Class template ratio - Y + In general + + 20.4.2 - Arithmetic on ratio types - Y - + Class template tuple + Partial + Missing constexpr and range access - 20.4.3 - Comparison of ratio types - Y + 20.5 + Class template bitset + Partial + Missing constexpr + + + 20.6 + Compile-time rational arithmetic + - 20.4.4 - SI types + 20.6.1 + Class template ratio Y - 20.5 - Tuples - + 20.6.2 + Arithmetic on ratio types + Y - 20.5.1 - General + 20.6.3 + Comparison of ratio types Y - - 20.5.2 - Class template tuple - Partial - Missing range concept maps + 20.6.4 + SI types for ratio + Y + - 20.6 + 20.7 Metaprogramming and type traits - 20.6.1 + 20.7.1 Requirements Y - - 20.6.2 + 20.7.2 Header <type_traits> synopsis - 20.6.3 + 20.7.3 Helper classes Y - 20.6.4 + 20.7.4 Unary Type Traits - + Y - 20.6.4.1 + 20.7.4.1 Primary type categories Y - 20.6.4.2 + 20.7.4.2 Composite type traits Y - 20.6.4.3 + 20.7.4.3 Type properties Partial Missing is_system_layout - 20.6.5 + 20.7.5 Relationships between types Y - 20.6.6 + + 20.7.6 Transformations between types - - + Partial + Missing underlying_type - 20.6.6.1 + 20.7.6.1 Const-volatile modifications Y - 20.6.6.2 + 20.7.6.2 Reference modifications Y - 20.6.6.3 + 20.7.6.3 Sign modifications Y - 20.6.6.4 + 20.7.6.4 Array modifications Y - 20.6.6.5 + 20.7.6.5 Pointer modifications Y - - 20.6.7 + 20.7.6.6 Other transformations - Partial - Missing decay + Y + - 20.7 + 20.8 Function objects - 20.7.1 + 20.8.1 Definitions Y - 20.7.3 - Base + 20.8.2 + Requirements Y - 20.7.4 - Function object return types + 20.8.3 + Base Y - 20.7.5 + 20.8.4 Class template reference_wrapper Y - - 20.7.6 - Identity operation - N - - - - 20.7.7 + 20.8.5 Arithmetic operation Y - 20.7.8 + 20.8.6 Comparisons Y - 20.7.9 + 20.8.7 Logical operations Y - 20.7.10 + 20.8.8 Bitwise operations Y - 20.7.11 + 20.8.9 Negators Y - 20.7.12 - Template function and function template bind + 20.8.10 + Function template bind Y - 20.7.13 + 20.8.11 Adaptors for pointers to functions Y - 20.7.14 + 20.8.12 Adaptors for pointers to members Y - 20.7.15 + 20.8.13 Function template mem_fn Y - 20.7.16 + 20.8.14 Polymorphic function wrappers - 20.7.16.1 + 20.8.14.1 Class bad_function_call Y - 20.7.16.2 + 20.8.14.2 Class template function Y - 20.7.17 + 20.8.15 Class template hash Y - - 20.7.18 - Class template reference_closure - N - - - - 20.8 + 20.9 Memory - 20.8.01 + 20.9.1 Allocator argument tag N - 20.8.02 - Allocators - - - - - 20.8.02.1 - General - Y - - - - - 20.8.02.2 - Allocator concept - N - - - - - 20.8.02.3 - Support for legacy allocators - N - - - - 20.8.02.4 - Allocator and Legacy Allocator members - N - - - - - 20.8.03 - Allocator-related element concepts + 20.9.2 + uses_allocator N - 20.8.04 - Allocator propagation traits + 20.9.3 + Pointer traits N - 20.8.05 - Allocator propagation map + 20.9.4 + Allocator traits N - 20.8.06 + 20.9.5 The default allocator Y - 20.8.07 - Scoped allocator adaptor - - - - - 20.8.07.1 - scoped_allocator_adaptor_base - N + 20.9.6 + Scoped allocator adaptor - - - - 20.8.07.2 - scoped_allocator_adaptor constructors - N - 20.8.07.3 - scoped_allocator_adaptor2 + 20.9.6.1 + Scoped allocator adaptor member types N - 20.8.07.3 - scoped_allocator_adaptor members + 20.9.6.2 + Scoped allocator adaptor constructors N - 20.8.07.4 - scoped_allocator_adaptor globals + 20.9.6.3 + Scoped allocator adaptor members N - 20.8.08 + 20.9.7 Raw storage iterator Y - 20.8.09 + 20.9.8 Temporary buffers Y - - 20.8.10 - construct_element - N - - - - 20.8.11 + 20.9.9 Specialized algorithms - 20.8.11.1 + 20.9.9.1 addressof N - 20.8.11.2 + 20.9.9.2 uninitialized_copy Y - 20.8.11.3 + 20.9.9.3 uninitialized_fill Y - 20.8.11.4 + 20.9.9.4 uninitialized_fill_n Y - 20.8.12 + 20.9.10 Class template unique_ptr Y - 20.8.13 + 20.9.11 Smart pointers - 20.8.13.1 + 20.9.11.1 Class bad_weak_ptr Y - 20.8.13.2 + 20.9.11.2 Class template shared_ptr Y @@ -872,129 +819,136 @@ particular release. - 20.8.13.3 + 20.9.11.3 Class template weak_ptr Y - 20.8.13.4 - Class template owner_less - Y - - - - 20.8.13.5 + 20.9.11.4 Class template emable_shared_from_this Y - 20.8.13.6 + 20.9.11.5 shared_ptr atomic access Partial + 20.9.11.6 + Hash support + Y + + + - 20.8.13.7 + 20.9.12 Pointer safety Partial - 20.8.14 + 20.9.13 Align N - 20.8.15 + 20.9.16 C library Y - 20.9 + 20.10 Time utilities - 20.9.1 + 20.10.1 Clock requirements Y - 20.9.2 + 20.10.2 Time-related traits - 20.9.2.1 + 20.10.2.1 treat_as_floating_point Y - 20.9.2.2 + 20.10.2.2 duration_values Partial Missing constexpr - 20.9.2.3 + 20.10.2.3 Specializations of common_type Y - 20.9.3 + 20.10.3 Class template duration Partial Missing constexpr - 20.9.4 + 20.10.4 Class template time_point Partial Missing constexpr - 20.9.5 + 20.10.5 Clocks - 20.9.5.1 + 20.10.5.1 Class system_clock Y - 20.9.5.2 + 20.10.5.2 Class monotonic_clock Y - 20.9.5.3 + 20.10.5.3 Class high_resolution_clock Y - 20.10 + 20.11 Date and time functions Y + + 20.12 + Class type_index + N + + + 21 @@ -1022,7 +976,7 @@ particular release. 21.2.2 - traits typedef + traits typedefs Y @@ -1076,6 +1030,12 @@ particular release. 21.6 + Hash support + Y + + + + 21.7 Null-terminated sequence utilities Y C library dependency @@ -1138,39 +1098,39 @@ particular release. 22.3.3.2.1 - Character + Character conversions Y 22.3.3.2.2 - String + string conversions N 22.3.3.2.3 - Buffer + Buffer conversions N 22.4 - Standard locale categories + Standard locale categories 22.4.1 - ctype + The ctype category Y 22.4.2 - Numeric + The numeric category @@ -1188,79 +1148,79 @@ particular release. 22.4.3 - num_punct + The numeric punctuation facet Y 22.4.4 - collate + The collate category Y 22.4.5 - Time + The time category 22.4.5.1 - time_get + Class template time_get Y 22.4.5.2 - time_get_byname + Class template time_get_byname Y 22.4.5.3 - time_put + Class template time_put Y 22.4.5.3 - time_put_byname + Class template time_put_byname Y 22.4.6 - Monetary + The monetary category 22.4.6.1 - money_get + Class template money_get Y 22.4.6.2 - money_put + Class template money_put Y 22.4.6.3 - money_punct + Class template money_punct Y 22.4.6.4 - money_punct_byname + Class template money_punct_byname Y 22.4.7 - messages + The message retrieval category Y @@ -1292,11 +1252,10 @@ particular release. - 23.1 General - Partial - Missing concepts + + 23.2 @@ -1305,11 +1264,10 @@ particular release. - 23.2.1 - General requirements - Partial - Missing construct_element + General container requirements + Y + 23.2.2 @@ -1318,6 +1276,24 @@ particular release. + 23.2.3 + Sequence containers + Y + + + + 23.2.4 + Associative containers + Y + + + + 23.2.5 + Unordered associative containers + Y + + + 23.3 Sequence containers @@ -1349,7 +1325,7 @@ particular release. 23.3.5 - Adaptors + Container adaptors @@ -1452,35 +1428,32 @@ particular release. - 24.1 General - Partial - Missing concepts + Y + - 24.2 - Iterator concepts - N + Iterator requirements + Y - 24.3 Header <iterator> synopsis - Partial - Missing concepts + Y + 24.4 - Iterator operations + Iterator primitives Y 24.5 - Predefined iterators and Iterator adaptors + Iterator adaptors @@ -1533,27 +1506,10 @@ particular release. - 24.7 - Insert iterators - - - - - 24.7.1 - Class template back_insert_iterator - Y - - - - 24.7.3 - Class template front_insert_iterator - Y - - - - 24.7.5 - Class template insert_iterator - Y + + 24.6.5 + range access + N @@ -1565,38 +1521,31 @@ particular release. - 25.1 General - Partial - Missing concepts - - - 25.2 - Header <algorithm> synopsis - Y + - 25.3 + 25.2 Non-modifying sequence operations Y - 25.4 + 25.3 Mutating sequence operations Y - 25.5 + 25.4 Sorting and related operations Y - 25.6 + 25.5 C library algorithms Y @@ -1640,22 +1589,20 @@ particular release. - 26.5.1 - Header <random> synopsis - Partial - Missing concepts + Requirements + + - 26.5.2 - Concepts and related requirements - N + Header <random> synopsis + 26.5.3 - Random number engines + Random number engine class templates @@ -1679,7 +1626,7 @@ particular release. 26.5.4 - Random number engine adaptors + Random number engine adaptor class templates @@ -1727,13 +1674,13 @@ particular release. 26.5.7.2 - Function template generate_canonical + Function template generate_canonical Y 26.5.8 - Random number distributions + Random number distribution class templates @@ -1925,7 +1872,7 @@ particular release. 26.6.6 - Class gslice + The gslice class Y @@ -1948,6 +1895,13 @@ particular release. + + 26.6.10 + valarray range access + N + + + 26.7 Generalized numeric operations @@ -1994,7 +1948,7 @@ particular release. 27 - Input/output + Input/output library @@ -2005,19 +1959,19 @@ particular release. 27.2 - Requirements + Iostreams requirements Y 27.2.1 - Imbue limitations + Imbue Limitations Y 27.2.2 - Positioning type limitations + Positioning Type Limitations Y @@ -2092,96 +2046,89 @@ particular release. - 28.01 + 28.1 General N - 28.02 + 28.2 Definitions N - 28.03 + 28.3 Requirements N - 28.04 - Regular expressions summary - N - - - - - 28.05 + 28.4 Header <regex> synopsis N - 28.06 + 28.5 Namespace std::regex_constants Y - 28.07 + 28.6 Class regex_error Y - 28.08 + 28.7 Class template regex_traits Partial - 28.09 + 28.8 Class template basic_regex Partial - 28.10 + 28.9 Class template sub_match Partial - 28.11 + 28.10 Class template match_results Partial - 28.12 + 28.11 Regular expression algorithms N - 28.13 + 28.12 Regular expression Iterators N - 28.14 + 28.13 Modified ECMAScript regular expression grammar N @@ -2433,9 +2380,10 @@ particular release. + 30.6.5 Class template promise - Y + Partial Missing allocator_arg_t @@ -2464,9 +2412,10 @@ particular release. + 30.6.10 Class template packaged_task - Y + Partial Missing allocator_arg_t @@ -2479,7 +2428,7 @@ particular release. D.1 - Increment operator with bool operand + Increment operator with bool operand @@ -2497,43 +2446,43 @@ particular release. D.4 - Implicit conversion from const strings + register keyword D.5 - C standard library headers + Dynamic exception specifications D.6 - Old iostreams members + C standard library headers D.7 - char* streams + Old iostreams members D.8 - Binders + char* streams D.9 - auto_ptr + Binders D.10 - Iterator primitives + auto_ptr
Section Description Status Comments
2 General Utilities
2.1 Reference wrappers Â Â
2.1.1 Additions to header <functional> synopsis Y Â
2.1.2 Class template reference_wrapper Â Â
2.1.2.1 reference_wrapper construct/copy/destroy Y Â
2.1.2.2 reference_wrapper assignment Y Â
2.1.2.3 reference_wrapper access Y Â
2.1.2.4 reference_wrapper invocation Y Â
2.1.2.5 reference_wrapper helper functions Y Â
2.2 Smart pointers Â Â
2.2.1 Additions to header <memory> synopsis Y Â
2.2.2 Class bad_weak_ptr Y Â
2.2.3 Class template shared_ptr Â
Uses code from boost::shared_ptr. @@ -242,7 +242,7 @@ decimal floating-point arithmetic
This page describes the TR 24733 support in mainline GCC SVN, not in any particular release. -
TableÂ 1.4.Â C++ TR 24733 Implementation Status
Section Description Status Comments
+
TableÂ 1.4.Â C++ TR 24733 Implementation Status
Section Description Status Comments
0 Introduction diff --git a/libstdc++-v3/doc/html/manual/strings.html b/libstdc++-v3/doc/html/manual/strings.html index d1dfd3b2f71..3ca51e98049 100644 --- a/libstdc++-v3/doc/html/manual/strings.html +++ b/libstdc++-v3/doc/html/manual/strings.html @@ -7,7 +7,7 @@ Standard Contents Â Next
ChapterÂ 7.Â Strings - +
Table of Contents
String Classes
Simple Transformations
Case Sensitivity
Arbitrary Character Types
Tokenizing
Shrink to Fit
CString (MFC)
String Classes
Simple Transformations
Here are Standard, simple, and portable ways to perform common transformations on a string instance, such as diff --git a/libstdc++-v3/doc/html/manual/support.html b/libstdc++-v3/doc/html/manual/support.html index de3237b4b76..bb597b02561 100644 --- a/libstdc++-v3/doc/html/manual/support.html +++ b/libstdc++-v3/doc/html/manual/support.html @@ -7,7 +7,7 @@ Standard Contents
Â Next
ChapterÂ 4.Â Support - +
Table of Contents
Types
Fundamental Types
Numeric Properties
NULL
Dynamic Memory
Termination
Termination Handlers
Verbose Terminate Handler
This part deals with the functions called and objects created automatically during the course of a program's existence. diff --git a/libstdc++-v3/doc/html/manual/test.html b/libstdc++-v3/doc/html/manual/test.html index 9065845c34c..81da3a78e7e 100644 --- a/libstdc++-v3/doc/html/manual/test.html +++ b/libstdc++-v3/doc/html/manual/test.html @@ -493,7 +493,7 @@ only default variables. reporting functions including:
time_counter
resource_counter
report_performance
Special Topics
Qualifying Exception Safety Guarantees - +
Overview
Testing is composed of running a particular test sequence, and looking at what happens to the surrounding code when diff --git a/libstdc++-v3/doc/html/manual/using.html b/libstdc++-v3/doc/html/manual/using.html index 51dd333bab4..73287731315 100644 --- a/libstdc++-v3/doc/html/manual/using.html +++ b/libstdc++-v3/doc/html/manual/using.html @@ -11,5 +11,5 @@ enumerated and detailed in the table below.
By default, g++ is equivalent to g++ -std=gnu++98. The standard library also defaults to this dialect. -
TableÂ 3.1.Â C++ Command Options
Option Flags Description
-std=c++98 Use the 1998 ISO C++ standard plus amendments.
-std=gnu++98 As directly above, with GNU extensions.
-std=c++0x Use the working draft of the upcoming ISO C++0x standard.
-std=gnu++0x As directly above, with GNU extensions.
-fexceptions See exception-free dialect
-frtti As above, but RTTI-free dialect.
-pthread or -pthreads For ISO C++0x <thread>, <future>, +
TableÂ 3.1.Â C++ Command Options
Option Flags Description
-std=c++98 Use the 1998 ISO C++ standard plus amendments.
-std=gnu++98 As directly above, with GNU extensions.
-std=c++0x Use the working draft of the upcoming ISO C++0x standard.
-std=gnu++0x As directly above, with GNU extensions.
-fexceptions See exception-free dialect
-frtti As above, but RTTI-free dialect.
-pthread or -pthreads For ISO C++0x <thread>, <future>, <mutex>, or <condition_variable>.
-fopenmp For parallel mode.

PrevÂ Up Â Next
MakeÂ Home Â Headers
diff --git a/libstdc++-v3/doc/html/manual/using_exceptions.html b/libstdc++-v3/doc/html/manual/using_exceptions.html index dc8c4daec8b..f0fb2e1f167 100644 --- a/libstdc++-v3/doc/html/manual/using_exceptions.html +++ b/libstdc++-v3/doc/html/manual/using_exceptions.html @@ -266,7 +266,7 @@ is called. } catch(...) { this->_M_setstate(ios_base::badbit); } -
Bibliography
+
Bibliography
System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008) @@ -277,7 +277,7 @@ is called. . Copyright Â© 2008 The Open Group/The Institute of Electrical and Electronics Engineers, Inc. - .
+ .
Error and Exception Handling @@ -285,7 +285,7 @@ is called. . David Abrahams . Boost - .
+ .
Exception-Safety in Generic Components @@ -293,7 +293,7 @@ is called. . David Abrahams. Boost - .
+ .
Standard Library Exception Policy @@ -301,7 +301,7 @@ is called. . Matt Austern. WG21 N1077 - .
+ .
ia64 c++ abi exception handling @@ -309,17 +309,17 @@ is called. . Richard Henderson. GNU - .
+ .
Appendix E: Standard-Library Exception Safety - . Bjarne Stroustrup.
+ . Bjarne Stroustrup.
Exceptional C++ . Exception-Safety Issues and Techniques - . Herb Sutter.
+ . Herb Sutter.
GCC Bug 25191: exception_defines.h #defines try/catch diff --git a/libstdc++-v3/doc/html/manual/using_headers.html b/libstdc++-v3/doc/html/manual/using_headers.html index 155d82874bc..6d78db9bbfc 100644 --- a/libstdc++-v3/doc/html/manual/using_headers.html +++ b/libstdc++-v3/doc/html/manual/using_headers.html @@ -20,19 +20,19 @@ upcoming 200x standard.
C++98/03 include files. These are available in the default compilation mode, i.e. -std=c++98 or -std=gnu++98. -
TableÂ 3.2.Â C++ 1998 Library Headers
algorithm bitset complex deque exception
fstream functional iomanip ios iosfwd
iostream istream iterator limits list
locale map memory new numeric
ostream queue set sstream stack
stdexcept streambuf string utility typeinfo
valarray vector Â Â Â

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Mixing Headers
A few simple rules.
First, mixing different dialects of the standard headers is not possible. It's an all-or-nothing affair. Thus, code like
diff --git a/libstdc++-v3/doc/html/manual/utilities.html b/libstdc++-v3/doc/html/manual/utilities.html index 9a801d7a6b3..e9f81e5ef6c 100644 --- a/libstdc++-v3/doc/html/manual/utilities.html +++ b/libstdc++-v3/doc/html/manual/utilities.html @@ -7,7 +7,7 @@ Standard Contents
Â Next
ChapterÂ 6.Â Utilities - +
Table of Contents
Functors
Pairs
Memory
Allocators
auto_ptr
shared_ptr
Traits
Functors
If you don't know what functors are, you're not alone. Many people get slightly the wrong idea. In the interest of not reinventing the wheel, we will refer you to the introduction to the functor diff --git a/libstdc++-v3/doc/xml/manual/status_cxx200x.xml b/libstdc++-v3/doc/xml/manual/status_cxx200x.xml index e3c723b050f..df6fae57390 100644 --- a/libstdc++-v3/doc/xml/manual/status_cxx200x.xml +++ b/libstdc++-v3/doc/xml/manual/status_cxx200x.xml @@ -16,8 +16,8 @@ This table is based on the table of contents of ISO/IEC -Doc No: N3000=09-0190 Date: 2009-11-09 -Working Draft, Standard for Programming Language C++ +JTC1 SC22 WG21 Doc No: N3092 Date: 2010-03-26 +Final Committee Draft, Standard for Programming Language C++ @@ -61,6 +61,7 @@ particular release.

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

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

Bibliography

Bibliography

ChapterÂ 11.Â Algorithms - +

AppendixÂ A.Â Contributing - +

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

TERMS AND CONDITIONS

0. Definitions. @@ -619,7 +619,7 @@ waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. -

+

END OF TERMS AND CONDITIONS

AppendixÂ B.Â Porting and Maintenance - +

Configure and Build Hacking

Prerequisites

ChapterÂ 14.Â Atomics - +

API Reference

No ios_base

No cout in ostream.h, no cin in istream.h

No ios_base

No cout in ostream.h, no cin in istream.h

Namespace std:: not supported

Namespace std:: not supported

Illegal iterator usage

Illegal iterator usage

isspace from cctype is a macro +

isspace from cctype is a macro

No vector::at, deque::at, string::at

No vector::at, deque::at, string::at

No std::char_traits<char>::eof

No std::char_traits<char>::eof

No string::clear

No string::clear

+

Removal of ostream::form and istream::scan extensions

No basic_stringbuf, basic_stringstream

No basic_stringbuf, basic_stringstream

Little or no wide character support

Little or no wide character support

No templatized iostreams

No templatized iostreams

Thread safety issues

Thread safety issues

Pre-ISO headers moved to backwards or removed

Pre-ISO headers moved to backwards or removed

Extension headers hash_map, hash_set moved to ext or backwards

Extension headers hash_map, hash_set moved to ext or backwards

No ios::nocreate/ios::noreplace. +

No ios::nocreate/ios::noreplace.

+

No stream::attach(int fd)

+

Support for C++98 dialect.

+

Support for C++TR1 dialect.

+

Support for C++0x dialect.

+

Container::iterator_type is not necessarily Container::value_type*

Bibliography

Bibliography

Design

Wrapper Model

ChapterÂ 15.Â Concurrency - +

API Reference

ChapterÂ 9.Â Containers - +

Sequences

list

list::size() is O(n)

ChapterÂ 5.Â Diagnostics - +

Exceptions

API Reference

Documentation Style

Doxygen

Prerequisites

Docbook

Prerequisites

Docbook

Prerequisites

PartÂ III.Â Extensions - +

Facets

ctype

Implementation

No `ios_base`

No `cout` in `ostream.h`, no `cin` in `istream.h`

No `ios_base`

No `cout` in `ostream.h`, no `cin` in `istream.h`

Namespace `std::` not supported

Namespace `std::` not supported

`isspace` from `cctype` is a macro +

`isspace` from `cctype` is a macro

No `vector::at`, `deque::at`, `string::at`

No `vector::at`, `deque::at`, `string::at`

No `std::char_traits<char>::eof`

No `std::char_traits<char>::eof`

No `string::clear`

No `string::clear`

Removal of `ostream::form` and `istream::scan` extensions

No `basic_stringbuf`, `basic_stringstream`

No `basic_stringbuf`, `basic_stringstream`

No `ios::nocreate/ios::noreplace`. +

No `ios::nocreate/ios::noreplace`.

No `stream::attach(int fd)`