diff --git a/libstdc++-v3/doc/html/faq.html b/libstdc++-v3/doc/html/faq.html index 2eecd342830..7667530732a 100644 --- a/libstdc++-v3/doc/html/faq.html +++ b/libstdc++-v3/doc/html/faq.html @@ -4,7 +4,7 @@ 2008, 2010 FSF -

Bibliography

. ABIcheck, a vague idea of checking ABI compatibility - .

+ .

. C++ ABI Reference - .

+ .

. Intel Compilers for Linux Compatibility with the GNU Compilers - .

+ .

. Linker and Libraries Guide (document 819-0690) - .

+ .

. Sun Studio 11: C++ Migration Guide (document 819-3689) - .

+ .

. How to Write Shared Libraries - . Ulrich Drepper.

+ . Ulrich Drepper.

. C++ ABI for the ARM Architecture - .

+ .

. Dynamic Shared Objects: Survey and Issues . ISO C++ J16/06-0046 - . Benjamin Kosnik.

+ . Benjamin Kosnik.

. Versioning With Namespaces . ISO C++ J16/06-0083 - . Benjamin Kosnik.

+ . Benjamin Kosnik.

. Binary Compatibility of Shared Libraries Implemented in C++ on GNU/Linux Systems diff --git a/libstdc++-v3/doc/html/manual/algorithms.html b/libstdc++-v3/doc/html/manual/algorithms.html index a508625a00e..8cf55cf8651 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 1511ab51874..cd9541d01ba 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.6.Â 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.6.Â 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.7.Â 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.7.Â 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 e591a5bf834..bbf124164d2 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

Contributing - +

Table of Contents

Contributor Checklist

Reading
Assignment
Getting Sources
Submitting Patches

Directory Layout and Source Conventions

Coding Style

Bad Identifiers
By Example

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 02af726d1be..8449abb6184 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

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 ee1af6c937c..376ac4ebd30 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 6a4e9fd97ea..9fc23776388 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

Porting and Maintenance - +

Configure and Build Hacking

Prerequisites

As noted previously, certain other tools are necessary for hacking on files that @@ -19,7 +19,7 @@ in GCC try to stay in sync with each other in terms of versions of the auto-tools used, so please try to play nicely with the neighbors. -

Overview: What Comes from Where

FigureÂ B.1.Â Configure and Build File Dependencies

Overview: What Comes from Where

FigureÂ B.1.Â Configure and Build File Dependencies

Regenerate all generated files by using the command sequence "autoreconf" at the top level of the libstdc++ source directory. The following will also work, but is much more complex: diff --git a/libstdc++-v3/doc/html/manual/atomics.html b/libstdc++-v3/doc/html/manual/atomics.html index 392322d1a3c..1a24059a904 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 8c4695c8789..2497438a1e9 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.

`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,19 +899,19 @@ 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 .

PrevÂ Up Â Next

API Evolution and Deprecation HistoryÂ

Home

Â AppendixÂ C.Â diff --git a/libstdc++-v3/doc/html/manual/bitmap_allocator.html b/libstdc++-v3/doc/html/manual/bitmap_allocator.html index ca6326129c9..9f750e9c0dc 100644 --- a/libstdc++-v3/doc/html/manual/bitmap_allocator.html +++ b/libstdc++-v3/doc/html/manual/bitmap_allocator.html @@ -3,7 +3,7 @@ bitmap_allocator

bitmap_allocator
PrevÂ	ChapterÂ 20.Â Allocators	Â Next

bitmap_allocator

Design

As this name suggests, this allocator uses a bit-map to keep track - of the used and unused memory locations for it's book-keeping + of the used and unused memory locations for its book-keeping purposes.

This allocator will make use of 1 single bit to keep track of @@ -47,7 +47,7 @@ however, lg(64) == 6 comparisons are enough to locate the correct free list if it exists.

- Suppose the free list size has reached it's threshold, then the + Suppose the free list size has reached its threshold, then the largest block from among those in the list and the new block will be selected and given back to the OS. This is done because it reduces external fragmentation, and allows the OS to use the @@ -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

4294967295

Data -> Space for 64 ints

TableÂ 20.1.Â Bitmap Allocator Memory Map

268

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 @@ -304,7 +304,7 @@ Block a bitmap as well? testing, I've decided to keep these bitmaps close to the actual blocks. This will help in 2 ways.

Constant time access for the bitmap themselves, since no kind of -look up will be needed to find the correct bitmap list or it's +look up will be needed to find the correct bitmap list or its equivalent.
And also this would preserve the cache as far as possible.

So in effect, this kind of an allocator might prove beneficial from a purely cache point of view. But this allocator has been made to try and diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch17s03.html b/libstdc++-v3/doc/html/manual/bk01pt03ch17s03.html index fa817e0a805..bff64a3747b 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch17s03.html +++ b/libstdc++-v3/doc/html/manual/bk01pt03ch17s03.html @@ -19,6 +19,6 @@ mode or with debug mode. The following table provides the names and headers of the debugging containers: -

TableÂ 17.1.Â Debugging Containers

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

In addition, when compiling in C++0x mode, these additional +

TableÂ 17.1.Â Debugging Containers

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

In addition, when compiling in C++0x mode, these additional containers have additional debug capability. -

TableÂ 17.2.Â Debugging Containers C++0x

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

PrevÂ	Up	Â Next
SemanticsÂ	Home	Â Design

TableÂ 17.2.Â Debugging Containers C++0x

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

PrevÂ	Up	Â Next
SemanticsÂ	Home	Â Design

diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch18s03.html b/libstdc++-v3/doc/html/manual/bk01pt03ch18s03.html index de1457cfd00..564989e02b6 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch18s03.html +++ b/libstdc++-v3/doc/html/manual/bk01pt03ch18s03.html @@ -63,4 +63,4 @@ Then compile this code with the prerequisite compiler flags flags for atomic operations.)

The following table provides the names and headers of all the parallel algorithms that can be used in a similar manner: -

TableÂ 18.1.Â Parallel Algorithms

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

PrevÂ	Up	Â Next
SemanticsÂ	Home	Â Design

TableÂ 18.1.Â Parallel Algorithms

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

PrevÂ	Up	Â Next
SemanticsÂ	Home	Â Design

diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch19s02.html b/libstdc++-v3/doc/html/manual/bk01pt03ch19s02.html index 979394407d4..2f640624c8b 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 a7c4c72f0b0..33377853d40 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

TableÂ 19.2.Â Profile Diagnostics

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,23 +50,23 @@ characters.

Rename abstract base class. See if just smash-overriding is a better approach. Clarify, add sanity to naming. -

Bibliography

+ The Open Group/The Institute of Electrical and Electronics Engineers, Inc..

+ .

Standard C++ IOStreams and Locales . Advanced Programmer's Guide and Reference @@ -409,39 +409,39 @@ codecvt usage.
wchar_t/char internal buffers and conversions between internal/external buffers? -

Bibliography

+ .

. 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 . Markus Khun.

messages

@@ -685,37 +685,37 @@ 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

+ .

. API Specifications, Java Platform . java.util.Properties, java.text.MessageFormat, java.util.Locale, java.util.ResourceBundle - .

+ .

. GNU gettext tools, version 0.10.38, Native Language Support Library and Tools. diff --git a/libstdc++-v3/doc/html/manual/intro.html b/libstdc++-v3/doc/html/manual/intro.html index 52c96abeb1e..a7c6bd2149a 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 Manual

Â Next

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

diff --git a/libstdc++-v3/doc/html/manual/io.html b/libstdc++-v3/doc/html/manual/io.html index e35da576ea4..5591e165d6c 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Â 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 a36a0fdb242..e440c5a10cd 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,28 +403,28 @@ 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

+ .

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 c9bc92abbd4..69de53d3b95 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

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

In use, allocator may allocate and deallocate using implementation-specified strategies and heuristics. Because of this, every call to an allocator object's @@ -308,29 +308,29 @@ 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

ISO/IEC 14882:1998 Programming languages - C++ . isoc++_1998 - 20.4 Memory.

+ 20.4 Memory.

. The Standard Librarian: What Are Allocators Good For? . Matt Austern. C/C++ Users Journal - .

+ .

. The Hoard Memory Allocator - . Emery Berger.

+ . Emery Berger.

. Allocator Types . Klaus Kreft. Angelika Langer. C/C++ Users Journal - .

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 @@ -446,7 +446,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 @@ -488,7 +488,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

C++0x-only features are: rvalue-ref/move support, allocator support, aliasing constructor, make_shared & allocate_shared. Additionally, the constructors taking auto_ptr parameters are @@ -538,7 +538,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

There is a single _Sp_counted_base class, which is a template parameterized on the enum @@ -579,7 +579,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

The interface of tr1::shared_ptr was extended for C++0x with support for rvalue-references and the other features from N2351. The _Sp_counted_base base class is implemented in @@ -596,7 +596,7 @@ 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 _Sp_counted_base and only make changes to the C++0x version. -

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 @@ -629,13 +629,13 @@ 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, testsuite/20_util/shared_ptr and testsuite/20_util/weak_ptr. -

Unresolved Issues

The shared_ptr atomic access clause in the C++0x working draft is not implemented in GCC.

@@ -676,22 +676,22 @@ be private. code to work with, Peter Dimov in particular for his help and invaluable advice on thread safety. Phillip Jordan and Paolo Carlini for the lock policy implementation. -

Bibliography

. Improving shared_ptr for C++0x, Revision 2 . N2351 - .

+ .

. C++ Standard Library Active Issues List . N2456 - .

+ .

. Working Draft, Standard for Programming Language C++ . N2461 - .

shared_ptr + .

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 9557d9c0d7a..d5ccecef9c3 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 205c0d0ce4a..435f37443c5 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.

Bibliography

+algorithm are included in the parallel mode:

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

Bibliography

+ .

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

Bibliography

Perflint: A Context Sensitive Performance Advisor for C++ Programs . Lixia Liu. Silvius Rus. Copyright Â© 2009 . Proceedings of the 2009 International Symposium on Code Generation diff --git a/libstdc++-v3/doc/html/manual/spine.html b/libstdc++-v3/doc/html/manual/spine.html index 5abc3a44e16..688d0625510 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 Manual
The GNU C++ Library Manual
PrevÂ Â Â Next
The GNU C++ Library Manual
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 Figures
B.1. Configure and Build File Dependencies
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
B.1. Doxygen Prerequisites
B.2. HTML to Doxygen Markup Comparison
B.3. Docbook Prerequisites
B.4. HTML to Docbook XML Markup Comparison
B.5. Docbook XML Element Use
B.6. Extension Allocators
B.7. Extension Allocators Continued
PrevÂ Â Â Next
The GNU C++ LibraryÂ Home Â PartÂ I.Â +
E. GNU Free Documentation License
List of Figures
B.1. Configure and Build File Dependencies
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
B.1. Doxygen Prerequisites
B.2. HTML to Doxygen Markup Comparison
B.3. Docbook Prerequisites
B.4. HTML to Docbook XML Markup Comparison
B.5. Docbook XML Element Use
B.6. Extension Allocators
B.7. Extension Allocators Continued
PrevÂ Â Â Next
The GNU C++ LibraryÂ Home Â PartÂ I.Â Introduction
diff --git a/libstdc++-v3/doc/html/manual/status.html b/libstdc++-v3/doc/html/manual/status.html index 7ac4ec0a576..f7fdb486604 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 @@ -157,11 +157,11 @@ presence of the required flag.
This page describes the C++0x support in mainline GCC SVN, not in any particular release. -
TableÂ 1.2.Â C++ 200x Implementation Status
Section Description Status Comments
+
TableÂ 1.2.Â C++ 200x Implementation Status
Section Description Status Comments
18 Language support -
18.1 General Y Â
18.2 Types Partial Missing offsetof, max_align_t
18.3 Implementation properties Â Â
18.3.2 Numeric Limits Â Â
18.3.2.3 Class template numeric_limits Y Â
18.3.2.4 numeric_limits members Y Â
18.3.2.5 float_round_style N Â
18.3.2.6 float_denorm_style N Â
18.3.2.7 numeric_limits specializations Y Â
18.3.3 C Library Y Â
18.4 Integer types Â Â
18.4.1 Header <cstdint> synopsis Y Â
18.5 Start and termination Partial C library dependency for quick_exit, at_quick_exit
18.6 Dynamic memory management Y Â
18.7 Type identification Â Â
18.7.1 Class type_info Y Â
18.7.2 Class bad_cast Y Â
18.7.3 Class bad_typeid Y Â
18.8 Exception handling Â Â
18.8.1 Class exception Y Â
18.8.2 Class bad_exception Y Â
18.8.3 Abnormal termination Y Â
18.8.4 uncaught_exception Y Â
18.8.5 Exception Propagation Y Â
18.8.6 nested_exception Y Â
18.9 Initializer lists Â Â
18.9.1 Initializer list constructors Y Â
18.9.2 Initializer list access Y Â
18.9.3 Initializer list range access N Â
18.10 Other runtime support Y Â
+
18.1 General Y Â
18.2 Types Partial Missing offsetof, max_align_t
18.3 Implementation properties Â Â
18.3.2 Numeric Limits Â Â
18.3.2.3 Class template numeric_limits Y Â
18.3.2.4 numeric_limits members Y Â
18.3.2.5 float_round_style N Â
18.3.2.6 float_denorm_style N Â
18.3.2.7 numeric_limits specializations Y Â
18.3.3 C Library Y Â
18.4 Integer types Â Â
18.4.1 Header <cstdint> synopsis Y Â
18.5 Start and termination Partial C library dependency for quick_exit, at_quick_exit
18.6 Dynamic memory management Y Â
18.7 Type identification Â Â
18.7.1 Class type_info Y Â
18.7.2 Class bad_cast Y Â
18.7.3 Class bad_typeid Y Â
18.8 Exception handling Â Â
18.8.1 Class exception Y Â
18.8.2 Class bad_exception 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 Y Â
18.10 Other runtime support Y Â
19 Diagnostics @@ -169,7 +169,7 @@ particular release. 20 General utilities -
20.1 General Â Â
20.2 Utility components Â Â
20.2.1 Operators Y Â
20.2.2 Swap Y Â
20.2.3 forward and move helpers Y Â
20.2.4 Function template declval Y Â
20.3 Pairs Â Â
20.3.1 In general Â Â
20.3.2 Class template pair Y Â
20.3.3 Specialized algorithms Y Â
20.3.4 Tuple-like access to pair Y Â
20.3.5 Piecewise construction Y Â
20.4 Tuples Â Â
20.4.1 In general Â Â
20.4.2 Class template tuple Â Â
20.4.2.1 Construction Y Â
20.4.2.2 Assignment Y Â
20.4.2.3 Swap Y Â
20.4.2.4 Tuple creation functions Partial tuple_cat should be a single variadic signature (DR 1385)
20.4.2.5 Tuple helper classes Y Â
20.4.2.6 Element access Y Â
20.4.2.7 Relational operators Y Â
20.4.2.8 Tuple traits N Â
20.4.2.9 Tuple specialized algorithms Y Â
20.5 Class template bitset Y Â
20.5.1 bitset constructors Y Â
20.5.2 bitset members Y Â
20.5.3 bitset hash support Y Â
20.5.4 bitset operators Y Â
20.6 Memory Â Â
20.6.1 In general Â Â
20.6.2 Header <memory> synopsis Â Â
20.6.3 Pointer traits N Â
20.6.4 Pointer safety Partial Â
20.6.5 Align N Â
20.6.6 Allocator argument tag Y Â
20.6.7 uses_allocator Y Â
20.6.8 Allocator traits N Â
20.6.9 The default allocator Y Â
20.6.10 Raw storage iterator Y Â
20.6.11 Temporary buffers Y Â
20.6.12 Specialized algorithms Â Â
20.6.12.1 addressof Y Â
20.6.12.2 uninitialized_copy Y Â
20.6.12.3 uninitialized_fill Y Â
20.6.12.4 uninitialized_fill_n Y Â
20.6.13 C library Y Â
20.7 Smart pointers Â Â
20.7.1 Class template unique_ptr Y Â
20.7.2 Shared-ownership pointers Y Â
20.7.2.1 Class bad_weak_ptr Y Â
20.7.2.2 Class template shared_ptr Y +
20.1 General Â Â
20.2 Utility components Â Â
20.2.1 Operators Y Â
20.2.2 Swap Y Â
20.2.3 forward and move helpers Y Â
20.2.4 Function template declval Y Â
20.3 Pairs Â Â
20.3.1 In general Â Â
20.3.2 Class template pair Y Â
20.3.3 Specialized algorithms Y Â
20.3.4 Tuple-like access to pair Y Â
20.3.5 Piecewise construction Y Â
20.4 Tuples Â Â
20.4.1 In general Â Â
20.4.2 Class template tuple Â Â
20.4.2.1 Construction Y Â
20.4.2.2 Assignment Y Â
20.4.2.3 Swap Y Â
20.4.2.4 Tuple creation functions Partial tuple_cat should be a single variadic signature (DR 1385)
20.4.2.5 Tuple helper classes Y Â
20.4.2.6 Element access Y Â
20.4.2.7 Relational operators Y Â
20.4.2.8 Tuple traits Y Â
20.4.2.9 Tuple specialized algorithms Y Â
20.5 Class template bitset Y Â
20.5.1 bitset constructors Y Â
20.5.2 bitset members Y Â
20.5.3 bitset hash support Y Â
20.5.4 bitset operators Y Â
20.6 Memory Â Â
20.6.1 In general Â Â
20.6.2 Header <memory> synopsis Â Â
20.6.3 Pointer traits Partial Missing rebind
20.6.4 Pointer safety Partial Â
20.6.5 Align N Â
20.6.6 Allocator argument tag Y Â
20.6.7 uses_allocator Y Â
20.6.8 Allocator traits Partial Missing rebind_alloc and rebind_traits
20.6.9 The default allocator Y Â
20.6.10 Raw storage iterator Y Â
20.6.11 Temporary buffers Y Â
20.6.12 Specialized algorithms Â Â
20.6.12.1 addressof Y Â
20.6.12.2 uninitialized_copy Y Â
20.6.12.3 uninitialized_fill Y Â
20.6.12.4 uninitialized_fill_n Y Â
20.6.13 C library Y Â
20.7 Smart pointers Â Â
20.7.1 Class template unique_ptr Y Â
20.7.2 Shared-ownership pointers Y Â
20.7.2.1 Class bad_weak_ptr Y Â
20.7.2.2 Class template shared_ptr Y
Uses code from boost::shared_ptr. @@ -200,7 +200,7 @@ particular release. 24
Iterators -
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 Â
+
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 Y Â
25 Algorithms @@ -208,7 +208,7 @@ particular release. 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 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.2 Class template discard_block_engine Y Missing constexpr
26.5.4.3 Class template independent_bits_engine Y Missing constexpr
26.5.4.4 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.2 Uniform distributions Â Â
26.5.8.2.1 Class template uniform_int_distribution Y Â
26.5.8.2.2 Class template uniform_real_distribution Y Â
26.5.8.3 Bernoulli distributions Â Â
26.5.8.3.1 Class bernoulli_distribution Y Â
26.5.8.3.2 Class template binomial_distribution Y Â
26.5.8.3.3 Class template geometric_distribution Y Â
26.5.8.3.4 Class template negative_binomial_distribution Y Â
26.5.8.4 Poisson distributions Â Â
26.5.8.4.1 Class template poisson_distribution Y Â
26.5.8.4.2 Class template exponential_distribution Y Â
26.5.8.4.3 Class template gamma_distribution Y Â
26.5.8.4.4 Class template weibull_distribution Y Â
26.5.8.4.5 Class template extreme_value_distribution Y Â
26.5.8.5 Normal distributions Â Â
26.5.8.5.1 Class template normal_distribution Y Â
26.5.8.5.2 Class template lognormal_distribution Y Â
26.5.8.5.3 Class template chi_squared_distribution Y Â
26.5.8.5.4 Class template cauchy_distribution Y Â
26.5.8.5.5 Class template fisher_f_distribution Y Â
26.5.8.5.6 Class template student_t_distribution Y Â
26.5.8.6 Sampling distributions Â Â
26.5.8.6.1 Class template discrete_distribution Y Â
26.5.8.6.2 Class template piecewise_constant_distribution Y Â
26.5.8.6.3 Class template piecewise_linear_distribution Y Â
26.6 Numeric arrays Â Â
26.6.1 Header <valarray> synopsis Y Â
26.6.2 Class template valarray Partial Missing move and swap operations
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 Y Â
26.7 Generalized numeric operations Â Â
26.7.1 Header <numeric> synopsis Y Â
26.7.2 accumulate Y Â
26.7.3 inner_product Y Â
26.7.4 partial_sum Y Â
26.7.5 adjacent_difference Y Â
26.7.6 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.2 Class template discard_block_engine Y Missing constexpr
26.5.4.3 Class template independent_bits_engine Y Missing constexpr
26.5.4.4 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.2 Uniform distributions Â Â
26.5.8.2.1 Class template uniform_int_distribution Y Â
26.5.8.2.2 Class template uniform_real_distribution Y Â
26.5.8.3 Bernoulli distributions Â Â
26.5.8.3.1 Class bernoulli_distribution Y Â
26.5.8.3.2 Class template binomial_distribution Y Â
26.5.8.3.3 Class template geometric_distribution Y Â
26.5.8.3.4 Class template negative_binomial_distribution Y Â
26.5.8.4 Poisson distributions Â Â
26.5.8.4.1 Class template poisson_distribution Y Â
26.5.8.4.2 Class template exponential_distribution Y Â
26.5.8.4.3 Class template gamma_distribution Y Â
26.5.8.4.4 Class template weibull_distribution Y Â
26.5.8.4.5 Class template extreme_value_distribution Y Â
26.5.8.5 Normal distributions Â Â
26.5.8.5.1 Class template normal_distribution Y Â
26.5.8.5.2 Class template lognormal_distribution Y Â
26.5.8.5.3 Class template chi_squared_distribution Y Â
26.5.8.5.4 Class template cauchy_distribution Y Â
26.5.8.5.5 Class template fisher_f_distribution Y Â
26.5.8.5.6 Class template student_t_distribution Y Â
26.5.8.6 Sampling distributions Â Â
26.5.8.6.1 Class template discrete_distribution Y Â
26.5.8.6.2 Class template piecewise_constant_distribution Y Â
26.5.8.6.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 Y Â
26.7 Generalized numeric operations Â Â
26.7.1 Header <numeric> synopsis Y Â
26.7.2 accumulate Y Â
26.7.3 inner_product Y Â
26.7.4 partial_sum Y Â
26.7.5 adjacent_difference Y Â
26.7.6 iota Y Â
26.8 C Library Y Â
27 Input/output library @@ -230,7 +230,7 @@ particular release. 30 Thread support -
30.1 General Y Â
30.2 Requirements Y Â
30.3 Threads Â Â
30.3.1 Class thread Partial thread::id comparisons not well-defined
30.3.2 Namespace this_thread Y Â
30.4 Mutual exclusion Â Â
30.4.1 Mutex requirements Â Â
30.4.1.1 In general Â Â
30.4.1.2 Mutex types Â Â
30.4.1.2.1 Class mutex Y Â
30.4.1.2.2 Class recursive_mutex Y Â
30.4.1.3 Timed mutex types Â Â
30.4.1.3.1 Class timed_mutex Y Â
30.4.1.3.2 Class recursive_timed_mutex Y Â
30.4.2 Locks Â Â
30.4.2.1 Class template lock_guard Y Â
30.4.2.2 Class template unique_lock Y Â
30.4.3 Generic locking algorithms Y Â
30.4.4 Call once Â Â
30.4.4.1 Struct once_flag Y Â
30.4.4.2 Function call_once Y Â
30.5 Condition variables Partial Missing notify_all_at_thread_exit
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 Â
30.6.3 Class future_error Y Â
30.6.4 Shared state Y Â
30.6.5 Class template promise Partial Missing set_*_at_thread_exit
30.6.6 Class template future Partial Missing future_status and future::share()
30.6.7 Class template shared_future Partial Missing future_status
30.6.8 Function template async Y Â
30.6.9 Class template packaged_task Partial Missing make_ready_at_thread_exit
+
30.1 General Y Â
30.2 Requirements Y Â
30.3 Threads Â Â
30.3.1 Class thread Partial thread::id comparisons not well-defined
30.3.2 Namespace this_thread Y Â
30.4 Mutual exclusion Â Â
30.4.1 Mutex requirements Â Â
30.4.1.1 In general Â Â
30.4.1.2 Mutex types Â Â
30.4.1.2.1 Class mutex Y Â
30.4.1.2.2 Class recursive_mutex Y Â
30.4.1.3 Timed mutex types Â Â
30.4.1.3.1 Class timed_mutex Y Â
30.4.1.3.2 Class recursive_timed_mutex Y Â
30.4.2 Locks Â Â
30.4.2.1 Class template lock_guard Y Â
30.4.2.2 Class template unique_lock Y Â
30.4.3 Generic locking algorithms Y Â
30.4.4 Call once Â Â
30.4.4.1 Struct once_flag Y Â
30.4.4.2 Function call_once Y Â
30.5 Condition variables Partial Missing notify_all_at_thread_exit
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 Â
30.6.3 Class future_error Y Â
30.6.4 Shared state Y Â
30.6.5 Class template promise Partial Missing set_*_at_thread_exit
30.6.6 Class template future Partial Timed waiting functions do not return future_status
30.6.7 Class template shared_future Partial Timed waiting functions do not return future_status
30.6.8 Function template async Y Â
30.6.9 Class template packaged_task Partial Missing make_ready_at_thread_exit
Appendix D Compatibility features @@ -245,7 +245,7 @@ In this implementation the header names are prefixed by
This page describes the TR1 support in mainline GCC SVN, not in any particular release. -
TableÂ 1.3.Â C++ TR1 Implementation Status
Section Description Status Comments
2 General Utilities
2.1 Reference wrappers Â Â
2.1.1 Additions to header <functional> synopsis Y Â
2.1.2 Class template reference_wrapper Â Â
2.1.2.1 reference_wrapper construct/copy/destroy Y Â
2.1.2.2 reference_wrapper assignment Y Â
2.1.2.3 reference_wrapper access Y Â
2.1.2.4 reference_wrapper invocation Y Â
2.1.2.5 reference_wrapper helper functions Y Â
2.2 Smart pointers Â Â
2.2.1 Additions to header <memory> synopsis Y Â
2.2.2 Class bad_weak_ptr Y Â
2.2.3 Class template shared_ptr Â +
TableÂ 1.3.Â C++ TR1 Implementation Status
Section Description Status Comments
2 General Utilities
2.1 Reference wrappers Â Â
2.1.1 Additions to header <functional> synopsis Y Â
2.1.2 Class template reference_wrapper Â Â
2.1.2.1 reference_wrapper construct/copy/destroy Y Â
2.1.2.2 reference_wrapper assignment Y Â
2.1.2.3 reference_wrapper access Y Â
2.1.2.4 reference_wrapper invocation Y Â
2.1.2.5 reference_wrapper helper functions Y Â
2.2 Smart pointers Â Â
2.2.1 Additions to header <memory> synopsis Y Â
2.2.2 Class bad_weak_ptr Y Â
2.2.3 Class template shared_ptr Â
Uses code from boost::shared_ptr. @@ -258,7 +258,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 f2c448f73f2..fd13422585d 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 34d836579da..842eb11d924 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 f82cdb5129c..f6523c09359 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 4c48d0eae09..a425e022371 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 2b60c7a8b40..a0adc01d1af 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) . @@ -274,34 +274,34 @@ is called. . Copyright Â© 2008 The Open Group/The Institute of Electrical and Electronics Engineers, Inc. - .
+ .
. Error and Exception Handling . David Abrahams . Boost - .
+ .
. Exception-Safety in Generic Components . David Abrahams. Boost - .
+ .
. Standard Library Exception Policy . Matt Austern. WG21 N1077 - .
+ .
. ia64 c++ abi exception handling . 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 .
PrevÂ Up Â Next
ConcurrencyÂ Home Â Debugging Support
diff --git a/libstdc++-v3/doc/html/manual/using_headers.html b/libstdc++-v3/doc/html/manual/using_headers.html index 9527b4d3432..073070960b8 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

+
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

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 0087bb57858..61dc2c8c862 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 d0add6c2e8b..5c4bc5de0bd 100644 --- a/libstdc++-v3/doc/xml/manual/status_cxx200x.xml +++ b/libstdc++-v3/doc/xml/manual/status_cxx200x.xml @@ -247,10 +247,9 @@ particular release. - 18.9.3 Initializer list range access - N + Y @@ -469,10 +468,9 @@ particular release. - 20.4.2.8 Tuple traits - N + Y @@ -530,11 +528,11 @@ particular release. - + 20.6.3 Pointer traits - N - + Partial + Missing rebind @@ -563,11 +561,11 @@ particular release. - + 20.6.8 Allocator traits - N - + Partial + Missing rebind_alloc and rebind_traits 20.6.9 @@ -1619,10 +1617,9 @@ particular release. - 24.6.5 range access - N + Y @@ -2523,14 +2520,14 @@ particular release. 30.6.6 Class template future Partial - Missing future_status and future::share() + Timed waiting functions do not return future_status 30.6.7 Class template shared_future Partial - Missing future_status + Timed waiting functions do not return future_status 30.6.8