Index

Allocator changes. Change __malloc_alloc to malloc_allocator and __new_alloc to new_allocator.

For GCC releases from 2.95 through the 3.1 series, defining __USE_MALLOC on the gcc command line would change the default allocation strategy to instead use malloc and - free. See - this note - for details as to why this was something needing improvement. + free. (This same functionality is now spelled _GLIBCXX_FORCE_NEW, see + this page + for details.

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

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

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

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

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

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 9aea48ecd823..cbb522069be9 100644 --- a/libstdc++-v3/doc/html/manual/appendix_free.html +++ b/libstdc++-v3/doc/html/manual/appendix_free.html @@ -5,7 +5,7 @@ PrevÂ The GNU C++ LibraryÂ 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 772cb083f7e6..d087283907b8 100644 --- a/libstdc++-v3/doc/html/manual/appendix_gpl.html +++ b/libstdc++-v3/doc/html/manual/appendix_gpl.html @@ -76,7 +76,7 @@

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

+

TERMS AND CONDITIONS

0. Definitions. @@ -617,7 +617,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 73d9e8b0cdaf..b49a2928abbc 100644 --- a/libstdc++-v3/doc/html/manual/appendix_porting.html +++ b/libstdc++-v3/doc/html/manual/appendix_porting.html @@ -5,7 +5,7 @@ PrevÂ The GNU C++ LibraryÂ Next

AppendixÂ B.Â Porting and Maintenance - +

Configure and Build Hacking

Prerequisites

As noted previously, certain other tools are necessary for hacking on files that @@ -196,7 +196,7 @@

If you're wondering what that line noise in the last example was, that's how you embed autoconf special characters in output text. - They're called quadrigraphs + They're called quadrigraphs and you should use them whenever necessary.

HELP-STRING is what you think it is. Do not include the "default" text like we used to do; it will be done for you by diff --git a/libstdc++-v3/doc/html/manual/auto_ptr.html b/libstdc++-v3/doc/html/manual/auto_ptr.html index 437760424df6..88b3397b419a 100644 --- a/libstdc++-v3/doc/html/manual/auto_ptr.html +++ b/libstdc++-v3/doc/html/manual/auto_ptr.html @@ -52,7 +52,7 @@ own auto_array_ptr for that situation (in fact, this has been done many times; check the mailing lists, Usenet, Boost, etc).

Use in Containers

All of the containers +

All of the containers described in the standard library require their contained types to have, among other things, a copy constructor like this:

@@ -74,7 +74,7 @@
      guaranteed to be messy.
    

      To prevent you from doing this to yourself, the
-      concept checks built
+      concept checks built
       in to this implementation will issue an error if you try to
       compile code like this:
    
diff --git a/libstdc++-v3/doc/html/manual/backwards.html b/libstdc++-v3/doc/html/manual/backwards.html
index f13370c04cf4..2ae9d5f05371 100644
--- a/libstdc++-v3/doc/html/manual/backwards.html
+++ b/libstdc++-v3/doc/html/manual/backwards.html
@@ -17,8 +17,8 @@ ISO Standard (e.g., statistical analysis).  While there are a lot of
 really useful things that are used by a lot of people, the Standards
 Committee couldn't include everything, and so a lot of those
 âobviousâ classes didn't get included.
-
Known Issues include many of the limitations of its immediate ancestor.
Portability notes and known implementation limitations are as follows.
No ios_base
 At least some older implementations don't have std::ios_base, so you should use std::ios::badbit, std::ios::failbit and std::ios::eofbit and std::ios::goodbit.
-
No cout in ostream.h, no cin in istream.h

+
Known Issues include many of the limitations of its immediate ancestor.
Portability notes and known implementation limitations are as follows.
No ios_base
 At least some older implementations don't have std::ios_base, so you should use std::ios::badbit, std::ios::failbit and std::ios::eofbit and std::ios::goodbit.
+
No cout in ostream.h, no cin in istream.h

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

   Portability notes and known implementation limitations are as follows.
-
Namespace std:: not supported

+
Namespace std:: not supported

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

Illegal iterator usage

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,27 +899,27 @@ AC_DEFUN([AC_HEADER_UNORDERED_SET], [
     AC_DEFINE(HAVE_UNORDERED_SET,,[Define if unordered_set is present. ])
   fi
 ])
-

+

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

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

Bibliography

[ +

Bibliography

[ kegel41 ] Migrating to GCC 4.1 . Dan Kegel. - .

[ + .

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

[ + .

[ lbl32 ] Migration guide for GCC-3.2 diff --git a/libstdc++-v3/doc/html/manual/bitmap_allocator.html b/libstdc++-v3/doc/html/manual/bitmap_allocator.html index c0e6178a0fbe..029753fda8e2 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Â 32.1.Â Bitmap Allocator Memory Map
268 0 4294967295 4294967295 Data -> Space for 64 ints

+
TableÂ 32.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/bk01ix01.html b/libstdc++-v3/doc/html/manual/bk01ix01.html index f311678b4946..87410e4932a0 100644 --- a/libstdc++-v3/doc/html/manual/bk01ix01.html +++ b/libstdc++-v3/doc/html/manual/bk01ix01.html @@ -1,6 +1,6 @@ -Index
Index
PrevÂ The GNU C++ Library Â Next
Index
A
Algorithms, +Index
Index
PrevÂ The GNU C++ Library Â Next
Index
A
Algorithms, Algorithms
Appendix
Contributing, diff --git a/libstdc++-v3/doc/html/manual/bk01pt02pr01.html b/libstdc++-v3/doc/html/manual/bk01pt02pr01.html index bcfde213a0c5..784412f23ef4 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt02pr01.html +++ b/libstdc++-v3/doc/html/manual/bk01pt02pr01.html @@ -3,7 +3,7 @@
PrevÂ PartÂ II.Â Support - Â Next
+Â Next
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/bk01pt03ch08.html b/libstdc++-v3/doc/html/manual/bk01pt03ch08.html index 31e0c44e960d..758405f356c0 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch08.html +++ b/libstdc++-v3/doc/html/manual/bk01pt03ch08.html @@ -31,7 +31,7 @@
They are off by default for all versions of GCC. They can be enabled at configure time with - --enable-concept-checks. + --enable-concept-checks. You can enable them on a per-translation-unit basis with -D_GLIBCXX_CONCEPT_CHECKS.
diff --git a/libstdc++-v3/doc/html/manual/bk01pt09pr02.html b/libstdc++-v3/doc/html/manual/bk01pt09pr02.html index c0c0f3ea3899..d5e4fdf4f43c 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt09pr02.html +++ b/libstdc++-v3/doc/html/manual/bk01pt09pr02.html @@ -3,7 +3,7 @@
PrevÂ PartÂ IX.Â Algorithms - Â Next
+Â Next
The neatest accomplishment of the algorithms chapter is that all the work is done via iterators, not containers directly. This means two important things: @@ -24,13 +24,13 @@ for algorithms, just to keep things simple. The use of N as a size in the examples is to keep things easy to read but probably won't be valid code. You can - use wrappers such as those described in the containers chapter to + use wrappers such as those described in the containers chapter to keep real code readable.
The single thing that trips people up the most is the definition of range used with iterators; the famous "past-the-end" rule that everybody loves to hate. The - iterators + iterators chapter of this document has a complete explanation of this simple rule that seems to cause so much confusion. Once you get range into your head (it's not that diff --git a/libstdc++-v3/doc/html/manual/bk01pt12ch30s03.html b/libstdc++-v3/doc/html/manual/bk01pt12ch30s03.html index 90bb7e1106a4..62f46e7303b2 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt12ch30s03.html +++ b/libstdc++-v3/doc/html/manual/bk01pt12ch30s03.html @@ -19,6 +19,6 @@ mode or with debug mode. The following table provides the names and headers of the debugging containers: -
TableÂ 30.1.Â Debugging Containers
Container Header Debug container Debug header
std::bitset bitset __gnu_debug::bitset bitset
std::deque deque __gnu_debug::deque deque
std::list list __gnu_debug::list list
std::map map __gnu_debug::map map
std::multimap map __gnu_debug::multimap map
std::multiset set __gnu_debug::multiset set
std::set set __gnu_debug::set set
std::string string __gnu_debug::string string
std::wstring string __gnu_debug::wstring string
std::basic_string string __gnu_debug::basic_string string
std::vector vector __gnu_debug::vector vector

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

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

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

PrevÂ Up Â Next
SemanticsÂ Home Â Design
diff --git a/libstdc++-v3/doc/html/manual/bk01pt12ch30s04.html b/libstdc++-v3/doc/html/manual/bk01pt12ch30s04.html index 2aaeef69f4b0..32dc8d72c015 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt12ch30s04.html +++ b/libstdc++-v3/doc/html/manual/bk01pt12ch30s04.html @@ -1,7 +1,7 @@ Design
Design
PrevÂ ChapterÂ 30.Â Debug Mode Â Next
Design
-
Goals
+
Goals

The libstdc++ debug mode replaces unsafe (but efficient) standard containers and iterators with semantically equivalent safe standard containers and iterators to aid in debugging user programs. The @@ -89,7 +89,7 @@ (performance regression) or allocating extra memory associated with each iterator with new (changes the program semantics).
-
Methods
+
Methods

This section provides an overall view of the design of the libstdc++ debug mode and details the relationship between design decisions and the stated design goals.
The Wrapper Model
The libstdc++ debug mode uses a wrapper model where the @@ -388,7 +388,7 @@ test02() that breaks user specialization), and additional testcases will be added as we are able to identify other typical problem cases. These test cases will serve as a benchmark by which we can compare debug - mode implementations.
Other Implementations
+ mode implementations.
Other Implementations

There are several existing implementations of debug modes for C++ standard library implementations, although none of them directly supports debugging for programs using libstdc++. The existing diff --git a/libstdc++-v3/doc/html/manual/bk01pt12ch31s03.html b/libstdc++-v3/doc/html/manual/bk01pt12ch31s03.html index 9bafdd369a22..26b2e0bd84d7 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt12ch31s03.html +++ b/libstdc++-v3/doc/html/manual/bk01pt12ch31s03.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Â 31.1.Â Parallel Algorithms
Algorithm Header Parallel algorithm Parallel header
std::accumulate numeric __gnu_parallel::accumulate parallel/numeric
std::adjacent_difference numeric __gnu_parallel::adjacent_difference parallel/numeric
std::inner_product numeric __gnu_parallel::inner_product parallel/numeric
std::partial_sum numeric __gnu_parallel::partial_sum parallel/numeric
std::adjacent_find algorithm __gnu_parallel::adjacent_find parallel/algorithm
std::count algorithm __gnu_parallel::count parallel/algorithm
std::count_if algorithm __gnu_parallel::count_if parallel/algorithm
std::equal algorithm __gnu_parallel::equal parallel/algorithm
std::find algorithm __gnu_parallel::find parallel/algorithm
std::find_if algorithm __gnu_parallel::find_if parallel/algorithm
std::find_first_of algorithm __gnu_parallel::find_first_of parallel/algorithm
std::for_each algorithm __gnu_parallel::for_each parallel/algorithm
std::generate algorithm __gnu_parallel::generate parallel/algorithm
std::generate_n algorithm __gnu_parallel::generate_n parallel/algorithm
std::lexicographical_compare algorithm __gnu_parallel::lexicographical_compare parallel/algorithm
std::mismatch algorithm __gnu_parallel::mismatch parallel/algorithm
std::search algorithm __gnu_parallel::search parallel/algorithm
std::search_n algorithm __gnu_parallel::search_n parallel/algorithm
std::transform algorithm __gnu_parallel::transform parallel/algorithm
std::replace algorithm __gnu_parallel::replace parallel/algorithm
std::replace_if algorithm __gnu_parallel::replace_if parallel/algorithm
std::max_element algorithm __gnu_parallel::max_element parallel/algorithm
std::merge algorithm __gnu_parallel::merge parallel/algorithm
std::min_element algorithm __gnu_parallel::min_element parallel/algorithm
std::nth_element algorithm __gnu_parallel::nth_element parallel/algorithm
std::partial_sort algorithm __gnu_parallel::partial_sort parallel/algorithm
std::partition algorithm __gnu_parallel::partition parallel/algorithm
std::random_shuffle algorithm __gnu_parallel::random_shuffle parallel/algorithm
std::set_union algorithm __gnu_parallel::set_union parallel/algorithm
std::set_intersection algorithm __gnu_parallel::set_intersection parallel/algorithm
std::set_symmetric_difference algorithm __gnu_parallel::set_symmetric_difference parallel/algorithm
std::set_difference algorithm __gnu_parallel::set_difference parallel/algorithm
std::sort algorithm __gnu_parallel::sort parallel/algorithm
std::stable_sort algorithm __gnu_parallel::stable_sort parallel/algorithm
std::unique_copy algorithm __gnu_parallel::unique_copy parallel/algorithm

Index
PrevÂ	The GNU C++ Library	Â Next

Index
PrevÂ	The GNU C++ Library	Â Next


PrevÂ	PartÂ II.Â Support -	Â Next


PrevÂ	PartÂ IX.Â Algorithms -	Â Next

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

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

Container	Header	Debug container	Debug header
`std::unordered_map`	`unordered_map`	`__gnu_debug::unordered_map`	`unordered_map`
`std::unordered_multimap`	`unordered_map`	`__gnu_debug::unordered_multimap`	`unordered_map`
`std::unordered_set`	`unordered_set`	`__gnu_debug::unordered_set`	`unordered_set`
`std::unordered_multiset`	`unordered_set`	`__gnu_debug::unordered_multiset`	`unordered_set`

Container	Header	Debug container	Debug header
`std::unordered_map`	`unordered_map`	`__gnu_debug::unordered_map`	`unordered_map`
`std::unordered_multimap`	`unordered_map`	`__gnu_debug::unordered_multimap`	`unordered_map`
`std::unordered_set`	`unordered_set`	`__gnu_debug::unordered_set`	`unordered_set`
`std::unordered_multiset`	`unordered_set`	`__gnu_debug::unordered_multiset`	`unordered_set`

Design
PrevÂ	ChapterÂ 30.Â Debug Mode	Â Next

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

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/bk01pt12ch31s04.html b/libstdc++-v3/doc/html/manual/bk01pt12ch31s04.html index bd6f768d6995..26ea42d83983 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt12ch31s04.html +++ b/libstdc++-v3/doc/html/manual/bk01pt12ch31s04.html @@ -1,7 +1,7 @@ Design
Design
PrevÂ ChapterÂ 31.Â Parallel Mode Â Next
Design
-
Interface Basics
+
Interface Basics
All parallel algorithms are intended to have signatures that are equivalent to the ISO C++ algorithms replaced. For instance, the std::adjacent_find function is declared as: @@ -42,7 +42,7 @@ algorithms/algorithm classes.
The general view of overloads for the paral ISO C++ signature to the correct parallel version. Also, some of the algorithms do not have support for run-time conditions, so the last overload is therefore missing. -
Configuration and Tuning
Setting up the OpenMP Environment
+
Configuration and Tuning
Setting up the OpenMP Environment
Several aspects of the overall runtime environment can be manipulated by standard OpenMP function calls.
@@ -194,7 +194,7 @@ int main() return 0; } -
Implementation Namespaces
One namespace contain versions of code that are always +
Implementation Namespaces
One namespace contain versions of code that are always explicitly sequential: __gnu_serial.
Two namespaces contain the parallel mode: diff --git a/libstdc++-v3/doc/html/manual/bk01pt12pr03.html b/libstdc++-v3/doc/html/manual/bk01pt12pr03.html index f4bc91d10f95..8d187bf61ee0 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt12pr03.html +++ b/libstdc++-v3/doc/html/manual/bk01pt12pr03.html @@ -3,7 +3,7 @@
PrevÂ PartÂ XII.Â 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. @@ -19,8 +19,7 @@ extensions, be aware of two things: versions of g++ or libstdc++ may not recognize these names, or treat them differently, or...
- You should know how to access - these headers properly. + You should know how to access these headers properly.
PrevÂ Up Â Next
PartÂ XII.Â Extensions diff --git a/libstdc++-v3/doc/html/manual/codecvt.html b/libstdc++-v3/doc/html/manual/codecvt.html index d8cc175028d2..0e8610ec55db 100644 --- a/libstdc++-v3/doc/html/manual/codecvt.html +++ b/libstdc++-v3/doc/html/manual/codecvt.html @@ -337,41 +337,41 @@ codecvt usage.
wchar_t/char internal buffers and conversions between internal/external buffers? -
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.
System Interface Definitions, Issue 6 (IEEE Std. 1003.1-200x) . Copyright Â© 1999 The Open Group/The Institute of Electrical and Electronics Engineers, Inc.. - .
+ .
The C++ Programming Language, Special Edition . 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. - .
+ .
The Unicode HOWTO . Bruno Haible. - .
+ .
UTF-8 and Unicode FAQ for Unix/Linux . Markus Khun. diff --git a/libstdc++-v3/doc/html/manual/containers.html b/libstdc++-v3/doc/html/manual/containers.html index 7126049d63af..e93823119641 100644 --- a/libstdc++-v3/doc/html/manual/containers.html +++ b/libstdc++-v3/doc/html/manual/containers.html @@ -5,5 +5,5 @@
PrevÂ The GNU C++ Library Â Next
PartÂ VII.Â Containers - +
Table of Contents
16. Sequences
list
list::size() is O(n)
vector
Space Overhead Management
17. Associative
Insertion Hints
bitset
Size Variable
Type String
18. Interacting with C
Containers vs. Arrays
PrevÂ Up Â Next
messagesÂ Home Â ChapterÂ 16.Â Sequences
diff --git a/libstdc++-v3/doc/html/manual/debug_mode.html b/libstdc++-v3/doc/html/manual/debug_mode.html index 2ee76137f10e..bebd380b89bb 100644 --- a/libstdc++-v3/doc/html/manual/debug_mode.html +++ b/libstdc++-v3/doc/html/manual/debug_mode.html @@ -3,7 +3,7 @@ ChapterÂ 30.Â Debug Mode
ChapterÂ 30.Â Debug Mode
PrevÂ PartÂ XII.Â Extensions - Â Next
ChapterÂ 30.Â Debug Mode
Table of Contents
Intro
Semantics
Using
Using the Debug Mode
Using a Specific Debug Container
Design
Goals
Methods
Other Implementations
Intro
+Â Next
ChapterÂ 30.Â Debug Mode
Table of Contents
Intro
Semantics
Using
Using the Debug Mode
Using a Specific Debug Container
Design
Goals
Methods
Other Implementations
Intro
By default, libstdc++ is built with efficiency in mind, and therefore performs little or no error checking that is not required by the C++ standard. This means that programs that diff --git a/libstdc++-v3/doc/html/manual/diagnostics.html b/libstdc++-v3/doc/html/manual/diagnostics.html index f9f03cb322ad..0de3c941e509 100644 --- a/libstdc++-v3/doc/html/manual/diagnostics.html +++ b/libstdc++-v3/doc/html/manual/diagnostics.html @@ -5,5 +5,5 @@ PrevÂ The GNU C++ LibraryÂ Next
PartÂ III.Â Diagnostics - +
Table of Contents
7. Exceptions
Exception Classes
Adding Data to Exceptions
Cancellation
8. Concept Checking
PrevÂ Up Â Next
Verbose Terminate HandlerÂ Home Â ChapterÂ 7.Â Exceptions
diff --git a/libstdc++-v3/doc/html/manual/documentation_style.html b/libstdc++-v3/doc/html/manual/documentation_style.html index 64309ebd9e6c..7dae04eb9f38 100644 --- a/libstdc++-v3/doc/html/manual/documentation_style.html +++ b/libstdc++-v3/doc/html/manual/documentation_style.html @@ -211,11 +211,11 @@ Complete details on Docbook markup can be found in the DocBook Element Reference, online. An incomplete reference for HTML to Docbook conversion is detailed in the table below. -
TableÂ A.1.Â HTML to Docbook XML markup comparison
HTML XML
<p> <para>
<pre> <computeroutput>, <programlisting>, +
TableÂ A.1.Â HTML to Docbook XML markup comparison
HTML XML
<p> <para>
<pre> <computeroutput>, <programlisting>, <literallayout>
<ul> <itemizedlist>
<ol> <orderedlist>
<il> <listitem>
<dl> <variablelist>
<dt> <term>
<dd> <listitem>
<a href=""> <ulink url="">
<code> <literal>, <programlisting>
<strong> <emphasis>
<em> <emphasis>
" <quote>

And examples of detailed markup for which there are no real HTML equivalents are listed in the table below. -
TableÂ A.2.Â Docbook XML Element Use
Element Use
<structname> <structname>char_traits</structname>
<classname> <classname>string</classname>
<function> +
TableÂ A.2.Â 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/exceptions.html b/libstdc++-v3/doc/html/manual/exceptions.html index 83ce7f13d503..74bcdebe14f8 100644 --- a/libstdc++-v3/doc/html/manual/exceptions.html +++ b/libstdc++-v3/doc/html/manual/exceptions.html @@ -15,7 +15,7 @@
Derived from this are several classes that may have a string member: a full hierarchy can be - found in the source documentation. + found in the source documentation.
PrevÂ Up Â Next
PartÂ III.Â Diagnostics diff --git a/libstdc++-v3/doc/html/manual/ext_compile_checks.html b/libstdc++-v3/doc/html/manual/ext_compile_checks.html index 34747be271a9..fa438da43dec 100644 --- a/libstdc++-v3/doc/html/manual/ext_compile_checks.html +++ b/libstdc++-v3/doc/html/manual/ext_compile_checks.html @@ -28,7 +28,7 @@
They are off by default for all versions of GCC from 3.0 to 3.4 (the latest release at the time of writing). They can be enabled at configure time with - --enable-concept-checks. + --enable-concept-checks. You can enable them on a per-translation-unit basis with #define _GLIBCXX_CONCEPT_CHECKS for GCC 3.4 and higher (or with #define _GLIBCPP_CONCEPT_CHECKS for versions diff --git a/libstdc++-v3/doc/html/manual/ext_io.html b/libstdc++-v3/doc/html/manual/ext_io.html index cd2ef8385d67..53618a049750 100644 --- a/libstdc++-v3/doc/html/manual/ext_io.html +++ b/libstdc++-v3/doc/html/manual/ext_io.html @@ -44,8 +44,7 @@ descriptor, and provides the fd() function.
If you want to access a filebuf's file descriptor to implement file locking (e.g. using the fcntl() system - call) then you might be interested in Henry Suter's - RWLock - class. + call) then you might be interested in Henry Suter's RWLock class. +

PrevÂ Up Â Next
ChapterÂ 37.Â IteratorsÂ Home Â ChapterÂ 39.Â Demangling
diff --git a/libstdc++-v3/doc/html/manual/ext_numerics.html b/libstdc++-v3/doc/html/manual/ext_numerics.html index 7880e35580e9..f1bb1ac93eb1 100644 --- a/libstdc++-v3/doc/html/manual/ext_numerics.html +++ b/libstdc++-v3/doc/html/manual/ext_numerics.html @@ -8,7 +8,7 @@
power (x, n); power (x, n, moniod_operation);
Returns, in FORTRAN syntax, "x ** n" where n>=0. In the - case of n == 0, returns the identity element for the + case of n == 0, returns the identity element for the monoid operation. The two-argument signature uses multiplication (for a true "power" implementation), but addition is supported as well. The operation functor must be associative. diff --git a/libstdc++-v3/doc/html/manual/extensions.html b/libstdc++-v3/doc/html/manual/extensions.html index 71c6dbc7432d..c47409d7a706 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Â XII.Â Extensions - -
Table of Contents
29. Compile Time Checks
30. Debug Mode
Intro
Semantics
Using
Using the Debug Mode
Using a Specific Debug Container
Design
Goals
Methods
Other Implementations
31. 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
32. Allocators
mt_allocator
Intro
Design Issues
Implementation
Single Thread Example
Multiple Thread Example
bitmap_allocator
Design
Implementation
33. Containers
Policy Based Data Structures
HP/SGI
Deprecated HP/SGI
34. Utilities
35. Algorithms
36. Numerics
37. Iterators
38. Input and Output
Derived filebufs
39. Demangling
40. Concurrency
Design
Interface to Locks and Mutexes
Interface to Atomic Functions
Implementation
Using Builtin Atomic Functions
Thread Abstraction
Use
PrevÂ Up Â Next
PerformanceÂ Home Â
+ +
Table of Contents
29. Compile Time Checks
30. Debug Mode
Intro
Semantics
Using
Using the Debug Mode
Using a Specific Debug Container
Design
Goals
Methods
Other Implementations
31. 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
32. Allocators
mt_allocator
Intro
Design Issues
Implementation
Single Thread Example
Multiple Thread Example
bitmap_allocator
Design
Implementation
33. Containers
Policy Based Data Structures
HP/SGI
Deprecated HP/SGI
34. Utilities
35. Algorithms
36. Numerics
37. Iterators
38. Input and Output
Derived filebufs
39. Demangling
40. Concurrency
Design
Interface to Locks and Mutexes
Interface to Atomic Functions
Implementation
Using Builtin Atomic Functions
Thread Abstraction
Use
PrevÂ Up Â Next
PerformanceÂ Home Â
diff --git a/libstdc++-v3/doc/html/manual/facets.html b/libstdc++-v3/doc/html/manual/facets.html index 293b33f6b7a2..c034c52d29fe 100644 --- a/libstdc++-v3/doc/html/manual/facets.html +++ b/libstdc++-v3/doc/html/manual/facets.html @@ -3,7 +3,7 @@ ChapterÂ 15.Â Facets aka Categories
ChapterÂ 15.Â Facets aka Categories
PrevÂ PartÂ VI.Â Localization - Â Next
ChapterÂ 15.Â Facets aka Categories
Table of Contents
ctype
Implementation
Future
codecvt
Requirements
Design
Implementation
Use
Future
messages
Requirements
Design
Implementation
Use
Future
ctype
Implementation
Specializations
+
Â Next
ChapterÂ 15.Â Facets aka Categories
Table of Contents
ctype
Implementation
Future
codecvt
Requirements
Design
Implementation
Use
Future
messages
Requirements
Design
Implementation
Use
Future
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,25 +50,25 @@ 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.
System Interface Definitions, Issue 6 (IEEE Std. 1003.1-200x) . Copyright Â© 1999 The Open Group/The Institute of Electrical and Electronics Engineers, Inc.. - .
+ .
The C++ Programming Language, Special Edition . 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/intro.html b/libstdc++-v3/doc/html/manual/intro.html index 9ad54c0c87b5..ab564b9794ab 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++ TR1
C++ 200x
License
The Code: GPL
The Documentation: GPL, FDL
Bugs
Implementation Bugs
Standard Bugs
2. Setup
Prerequisites
Configure
Make
Test
Organization
Running the Testsuite
Writing a new test case
Test Harness and Utilities
3. Using
Linking Library Binary Files
Headers
Header Files
Mixing Headers
The C Headers and namespace std
Precompiled Headers
Namespaces
Available Namespaces
namespace std
Using Namespace Composition
Macros
Concurrency
Prerequisites
Thread Safety
Atomics
IO
Containers
Exceptions
Propagating Exceptions aka Exception Neutrality
Exception Safety
Support for -fno-exceptions
Debugging Support
Using g++
Debug Versions of Library Binary Files
Memory Leak Hunting
Using gdb
Tracking uncaught exceptions
Debug Mode
Compile Time Checking
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 579c0f2449f9..7095c81a7910 100644 --- a/libstdc++-v3/doc/html/manual/io.html +++ b/libstdc++-v3/doc/html/manual/io.html @@ -5,5 +5,5 @@
PrevÂ The GNU C++ Library Â Next
PartÂ XI.Â Input and Output - +
Table of Contents
24. Iostream Objects
25. Stream Buffers
Derived streambuf Classes
Buffering
26. Memory Based Streams
Compatibility With strstream
27. File Based Streams
Copying a File
Binary Input and Output
28. Interacting with C
Using FILE* and file descriptors
Performance
PrevÂ Up Â Next
C99Â Home Â ChapterÂ 24.Â Iostream Objects
diff --git a/libstdc++-v3/doc/html/manual/iterators.html b/libstdc++-v3/doc/html/manual/iterators.html index aa5a5806764d..f0d1db046f70 100644 --- a/libstdc++-v3/doc/html/manual/iterators.html +++ b/libstdc++-v3/doc/html/manual/iterators.html @@ -5,5 +5,5 @@ PrevÂ The GNU C++ LibraryÂ Next
PartÂ VIII.Â Iterators - +
Table of Contents
19. Predefined
Iterators vs. Pointers
One Past the End
PrevÂ Up Â Next
bitsetÂ Home Â ChapterÂ 19.Â Predefined
diff --git a/libstdc++-v3/doc/html/manual/locales.html b/libstdc++-v3/doc/html/manual/locales.html index 39145e1597b6..ea30f5f4916a 100644 --- a/libstdc++-v3/doc/html/manual/locales.html +++ b/libstdc++-v3/doc/html/manual/locales.html @@ -398,25 +398,25 @@ 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.
+ . 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 6 (IEEE Std. 1003.1-200x) . Copyright Â© 1999 The Open Group/The Institute of Electrical and Electronics Engineers, Inc.. - .
+ .
The C++ Programming Language, Special Edition . 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/localization.html b/libstdc++-v3/doc/html/manual/localization.html index 8d1c0accaa6f..487475ad02f0 100644 --- a/libstdc++-v3/doc/html/manual/localization.html +++ b/libstdc++-v3/doc/html/manual/localization.html @@ -5,5 +5,5 @@ PrevÂ The GNU C++ LibraryÂ Next
PartÂ VI.Â Localization - +
Table of Contents
14. Locales
locale
Requirements
Design
Implementation
Future
15. Facets aka Categories
ctype
Implementation
Future
codecvt
Requirements
Design
Implementation
Use
Future
messages
Requirements
Design
Implementation
Use
Future
PrevÂ Up Â Next
CString (MFC)Â Home Â ChapterÂ 14.Â Locales
diff --git a/libstdc++-v3/doc/html/manual/memory.html b/libstdc++-v3/doc/html/manual/memory.html index 6fa78a6fb277..188e34e215dc 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 support 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.
The Standard Librarian: What Are Allocators Good + 20.4 Memory.
The Standard Librarian: What Are Allocators Good . austernm Matt Austern. @@ -320,28 +320,28 @@ . - .
The Hoard Memory Allocator. + .
The Hoard Memory Allocator. emeryb Emery Berger. - .
Reconsidering Custom Memory Allocation. + .
Reconsidering Custom Memory Allocation. bergerzorn Emery Berger. Ben Zorn. Kathryn McKinley. Copyright Â© 2002 OOPSLA. - .
Allocator Types. + .
Allocator Types. kreftlanger Klaus Kreft. Angelika Langer. C/C++ Users Journal . - .
The C++ Programming Language. + .
The C++ Programming Language. tcpl Bjarne Stroustrup. Copyright Â© 2000 . 19.4 Allocators. Addison Wesley - .
Yalloc: A Recycling C++ Allocator. + .
Yalloc: A Recycling C++ Allocator. yenf Felix Yen. Copyright Â© . diff --git a/libstdc++-v3/doc/html/manual/messages.html b/libstdc++-v3/doc/html/manual/messages.html index 2097b7ed61e1..d6e5422caa93 100644 --- a/libstdc++-v3/doc/html/manual/messages.html +++ b/libstdc++-v3/doc/html/manual/messages.html @@ -241,38 +241,38 @@ void test01() model. As of this writing, it is unknown how to query to see if a specified message catalog exists using the gettext package. -
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 6 (IEEE Std. 1003.1-200x) . Copyright Â© 1999 The Open Group/The Institute of Electrical and Electronics Engineers, Inc.. - .
+ .
The C++ Programming Language, Special Edition . 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 - .
+ .
Java 2 Platform, Standard Edition, v 1.3.1 API Specification . java.util.Properties, java.text.MessageFormat, java.util.Locale, java.util.ResourceBundle. - .
+ .
GNU gettext tools, version 0.10.38, Native Language Support Library and Tools. . diff --git a/libstdc++-v3/doc/html/manual/numerics.html b/libstdc++-v3/doc/html/manual/numerics.html index cd062c0b9f41..b01d58cc19dc 100644 --- a/libstdc++-v3/doc/html/manual/numerics.html +++ b/libstdc++-v3/doc/html/manual/numerics.html @@ -5,5 +5,5 @@ PrevÂ The GNU C++ LibraryÂ Next
PartÂ X.Â Numerics - +
Table of Contents
21. Complex
complex Processing
22. Generalized Operations
23. Interacting with C
Numerics vs. Arrays
C99
PrevÂ Up Â Next
ChapterÂ 20.Â MutatingÂ Home Â ChapterÂ 21.Â Complex
diff --git a/libstdc++-v3/doc/html/manual/parallel_mode.html b/libstdc++-v3/doc/html/manual/parallel_mode.html index b69396156347..e6d4e54b85be 100644 --- a/libstdc++-v3/doc/html/manual/parallel_mode.html +++ b/libstdc++-v3/doc/html/manual/parallel_mode.html @@ -3,7 +3,7 @@ ChapterÂ 31.Â Parallel Mode
ChapterÂ 31.Â Parallel Mode
PrevÂ PartÂ XII.Â Extensions - Â Next
ChapterÂ 31.Â Parallel Mode
Table of Contents
Intro
Semantics
Using
Prerequisite Compiler Flags
Using Parallel Mode
Using Specific Parallel Components
Design
Interface Basics
Configuration and Tuning
Implementation Namespaces
Testing
Bibliography
The libstdc++ parallel mode is an experimental parallel +Â Next
ChapterÂ 31.Â Parallel Mode
Table of Contents
Intro
Semantics
Using
Prerequisite Compiler Flags
Using Parallel Mode
Using Specific Parallel Components
Design
Interface Basics
Configuration and Tuning
Implementation Namespaces
Testing
Bibliography
The libstdc++ parallel mode is an experimental parallel implementation of many algorithms the C++ Standard Library.
Several of the standard algorithms, for instance @@ -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/shared_ptr.html b/libstdc++-v3/doc/html/manual/shared_ptr.html index 3538b9e43fba..20ffa4ab8f78 100644 --- a/libstdc++-v3/doc/html/manual/shared_ptr.html +++ b/libstdc++-v3/doc/html/manual/shared_ptr.html @@ -29,7 +29,7 @@ drops to zero. Derived classes override those functions to destroy resources in a context where the correct dynamic type is known. This is an application of the technique known as type erasure. -
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 @@ -71,7 +71,7 @@ be forwarded to Tp's constructor. Unlike the other _Sp_counted_* classes, this one is parameterized on the type of object, not the type of pointer; this is purely a convenience that simplifies the implementation slightly. -
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, @@ -129,7 +129,7 @@ compiler, standard library, platform etc. For the version of shared_ptr in libstdc++ the compiler and library are fixed, which makes things much simpler: we have an atomic CAS or we don't, see Lock Policy below for details. -
Selecting Lock Policy
+
Selecting Lock Policy

There is a single _Sp_counted_base class, which is a template parameterized on the enum @@ -170,7 +170,7 @@ used when libstdc++ is built without --enable-threadsext/atomicity.h, which detect if the program is multi-threaded. If only one thread of execution exists in the program then less expensive non-atomic operations are used. -
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 @@ -181,7 +181,7 @@ The TR1 implementation is considered relatively stable, so is unlikely to change unless bug fixes require it. If the code that is common to both C++0x and TR1 modes needs to diverge further then it might be necessary to duplicate additional classes and only make changes to the C++0x versions. -
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 @@ -214,10 +214,10 @@ is called. Users should not try to use this. As well as the extra constructors, this implementation also needs some members of _Sp_counted_deleter to be protected where they could otherwise be private. -
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 @@ -265,7 +265,7 @@ be private. code to work with, Peter Dimov in particular for his help and invaluable advice on thread safety. Phillip Jordan and Paolo Carlini for the lock policy implementation. -
Bibliography
[ +
Bibliography
[ n2351 ] Improving shared_ptr for C++0x, Revision 2 @@ -274,7 +274,7 @@ be private. . - .
[ + .
[ n2456 ] C++ Standard Library Active Issues List (Revision R52) @@ -283,7 +283,7 @@ be private. . - .
[ + .
[ n2461 ] Working Draft, Standard for Programming Language C++ @@ -292,7 +292,7 @@ be private. . - .
[ + .
[ boostshared_ptr ] Boost C++ Libraries documentation - shared_ptr class template diff --git a/libstdc++-v3/doc/html/manual/spine.html b/libstdc++-v3/doc/html/manual/spine.html index 735521516f16..02bfcf3c5009 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 FSF -
+
License
Table of Contents
I. Introduction @@ -40,7 +40,7 @@
24. Iostream Objects
25. Stream Buffers
Derived streambuf Classes
Buffering
26. Memory Based Streams
Compatibility With strstream
27. File Based Streams
Copying a File
Binary Input and Output
28. Interacting with C
Using FILE* and file descriptors
Performance
XII. Extensions -
29. Compile Time Checks
30. Debug Mode
Intro
Semantics
Using
Using the Debug Mode
Using a Specific Debug Container
Design
Goals
Methods
Other Implementations
31. 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
32. Allocators
mt_allocator
Intro
Design Issues
Implementation
Single Thread Example
Multiple Thread Example
bitmap_allocator
Design
Implementation
33. Containers
Policy Based Data Structures
HP/SGI
Deprecated HP/SGI
34. Utilities
35. Algorithms
36. Numerics
37. Iterators
38. Input and Output
Derived filebufs
39. Demangling
40. Concurrency
Design
Interface to Locks and Mutexes
Interface to Atomic Functions
Implementation
Using Builtin Atomic Functions
Thread Abstraction
Use
A. +
29. Compile Time Checks
30. Debug Mode
Intro
Semantics
Using
Using the Debug Mode
Using a Specific Debug Container
Design
Goals
Methods
Other Implementations
31. 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
32. Allocators
mt_allocator
Intro
Design Issues
Implementation
Single Thread Example
Multiple Thread Example
bitmap_allocator
Design
Implementation
33. Containers
Policy Based Data Structures
HP/SGI
Deprecated HP/SGI
34. Utilities
35. Algorithms
36. Numerics
37. Iterators
38. Input and Output
Derived filebufs
39. Demangling
40. Concurrency
Design
Interface to Locks and Mutexes
Interface to Atomic Functions
Implementation
Using Builtin Atomic Functions
Thread Abstraction
Use
A. Contributing
Contributor Checklist
Reading
Assignment
Getting Sources
Submitting Patches
Directory Layout and Source Conventions
Coding Style
Bad Identifiers
By Example
Documentation Style
Doxygen
Docbook
Design Notes
B. @@ -51,7 +51,7 @@
D. GNU General Public License version 3 -
E. GNU Free Documentation License
Index
List of Tables
1.1. C++ 1998/2003 Implementation Status
1.2. C++ TR1 Implementation Status
1.3. C++ 200x Implementation Status
3.1. C++ 1998 Library Headers
3.2. C++ 1998 Library Headers for C Library Facilities
3.3. C++ 200x Library Headers
3.4. C++ 200x Library Headers for C Library Facilities
3.5. C++ TR1 Library Headers
3.6. C++ TR1 Library Headers for C Library Facilities
3.7. C++ ABI Headers
3.8. Extension Headers
3.9. Extension Debug Headers
3.10. Extension Parallel Headers
30.1. Debugging Containers
30.2. Debugging Containers C++0x
31.1. Parallel Algorithms
32.1. Bitmap Allocator Memory Map
A.1. HTML to Docbook XML markup comparison
A.2. 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
Index
List of Tables
1.1. C++ 1998/2003 Implementation Status
1.2. C++ TR1 Implementation Status
1.3. C++ 200x Implementation Status
3.1. C++ 1998 Library Headers
3.2. C++ 1998 Library Headers for C Library Facilities
3.3. C++ 200x Library Headers
3.4. C++ 200x Library Headers for C Library Facilities
3.5. C++ TR1 Library Headers
3.6. C++ TR1 Library Headers for C Library Facilities
3.7. C++ ABI Headers
3.8. Extension Headers
3.9. Extension Debug Headers
3.10. Extension Parallel Headers
30.1. Debugging Containers
30.2. Debugging Containers C++0x
31.1. Parallel Algorithms
32.1. Bitmap Allocator Memory Map
A.1. HTML to Docbook XML markup comparison
A.2. 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 333652830ff0..a8e94b95c685 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++0x 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 @@ -153,7 +153,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.2.Â 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.2.Â 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. @@ -171,7 +171,7 @@ presence of the required flag.
This page describes the C++0x support in mainline GCC SVN, not in any particular release. -
TableÂ 1.3.Â C++ 200x Implementation Status
Section Description Status Comments
+
TableÂ 1.3.Â C++ 200x Implementation Status
Section Description Status Comments
18 Language support diff --git a/libstdc++-v3/doc/html/manual/strings.html b/libstdc++-v3/doc/html/manual/strings.html index 7ab234dc9243..31995cfd99cc 100644 --- a/libstdc++-v3/doc/html/manual/strings.html +++ b/libstdc++-v3/doc/html/manual/strings.html @@ -5,5 +5,5 @@
PrevÂ The GNU C++ Library Â Next
PartÂ V.Â Strings - +
Table of Contents
13. String Classes
Simple Transformations
Case Sensitivity
Arbitrary Character Types
Tokenizing
Shrink to Fit
CString (MFC)
PrevÂ Up Â Next
shared_ptrÂ Home Â ChapterÂ 13.Â String Classes
diff --git a/libstdc++-v3/doc/html/manual/support.html b/libstdc++-v3/doc/html/manual/support.html index daef85ee3114..2516efbaae72 100644 --- a/libstdc++-v3/doc/html/manual/support.html +++ b/libstdc++-v3/doc/html/manual/support.html @@ -5,5 +5,5 @@
PrevÂ The GNU C++ Library Â Next
PartÂ II.Â Support - +
Table of Contents
4. Types
Fundamental Types
Numeric Properties
NULL
5. Dynamic Memory
6. Termination
Termination Handlers
Verbose Terminate Handler
PrevÂ Up Â Next
Debugging SupportÂ Home Â
diff --git a/libstdc++-v3/doc/html/manual/using_concurrency.html b/libstdc++-v3/doc/html/manual/using_concurrency.html index 8b1a8ec8a591..45a0e7d784dc 100644 --- a/libstdc++-v3/doc/html/manual/using_concurrency.html +++ b/libstdc++-v3/doc/html/manual/using_concurrency.html @@ -57,7 +57,7 @@ gcc version 4.1.2 20070925 (Red Hat 4.1.2-33) Dependent Options.
An implementation of atomicity.h functions - exists for the architecture in question. See the internals documentation for more details. + exists for the architecture in question. See the internals documentation for more details.
The user-code must guard against concurrent method calls which may access any particular library object's state. Typically, the application programmer may infer what object locks must be held @@ -89,19 +89,8 @@ gcc version 4.1.2 20070925 (Red Hat 4.1.2-33) this requirement includes both read and write access to objects; unless otherwise documented as safe, do not assume that two threads may access a shared standard library object at the same time. -
See chapters 17 (library - introduction), 23 - (containers), and 27 (I/O) for - more information.
Atomics
-
IO
I'll assume that you have already read the - general notes on library threads, - and the - notes on threaded container - access (you might not think of an I/O stream as a container, but - the points made there also hold here). If you have not read them, - please do so first. -
This gets a bit tricky. Please read carefully, and bear with me. +
IO
This gets a bit tricky. Please read carefully, and bear with me.
Structure
A wrapper type called __basic_file provides our abstraction layer for the std::filebuf classes. Nearly all decisions dealing @@ -205,15 +194,12 @@ gcc version 4.1.2 20070925 (Red Hat 4.1.2-33) extent, on the underlying container and/or a locking mechanism. Trying to provide a catch-all general template solution would probably be more trouble than it's worth. -
The STL implementation is currently configured to use the - high-speed caching memory allocator. Some people like to - test and/or normally run threaded programs with a different - default. For all details about how to globally override this - at application run-time see here. -
There is a better way (not standardized yet): It is possible to - force the malloc-based allocator on a per-case-basis for some - application code. The library team generally believes that this - is a better way to tune an application for high-speed using this - implementation of the STL. There is - more information on allocators here. +
The library implementation may be configured to use the + high-speed caching memory allocator, which complicates thread + safety issues. For all details about how to globally override + this at application run-time + see here. Also + useful are details + on allocator + options and capabilities.
PrevÂ Up Â Next
MacrosÂ Home Â Exceptions
diff --git a/libstdc++-v3/doc/html/manual/using_headers.html b/libstdc++-v3/doc/html/manual/using_headers.html index 21d2889c2095..1e669224e10b 100644 --- a/libstdc++-v3/doc/html/manual/using_headers.html +++ b/libstdc++-v3/doc/html/manual/using_headers.html @@ -20,16 +20,16 @@ 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.1.Â 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.2.Â 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.1.Â 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.2.Â 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.3.Â C++ 200x Library Headers
algorithm array bitset chrono complex
condition_variable deque exception forward_list fstream
functional 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.4.Â C++ 200x Library Headers for C Library Facilities
cassert ccomplex cctype cerrno cfenv
cfloat cinttypes ciso646 climits clocale
cmath csetjmp csignal cstdarg cstdatomic
cstdbool cstddef cstdint cstdlib cstdio
cstring ctgmath ctime cuchar cwchar
cwctype stdatomic.h Â Â Â

+
TableÂ 3.3.Â C++ 200x Library Headers
algorithm array bitset chrono complex
condition_variable deque exception forward_list fstream
functional 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.4.Â C++ 200x Library Headers for C Library Facilities
cassert ccomplex cctype cerrno cfenv
cfloat cinttypes ciso646 climits clocale
cmath csetjmp csignal cstdarg cstdatomic
cstdbool cstddef cstdint cstdlib cstdio
cstring ctgmath ctime cuchar cwchar
cwctype stdatomic.h Â Â Â

In addition, TR1 includes as: -
TableÂ 3.5.Â C++ TR1 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.6.Â C++ TR1 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

+
TableÂ 3.5.Â C++ TR1 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.6.Â C++ TR1 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

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

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

And a large variety of extensions. -
TableÂ 3.8.Â 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.9.Â 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.10.Â Extension Parallel Headers
parallel/algorithm parallel/numeric

Mixing Headers
A few simple rules. +
TableÂ 3.8.Â 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.9.Â 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.10.Â 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/using_macros.html b/libstdc++-v3/doc/html/manual/using_macros.html index 9250cdb9e616..8067d35d462d 100644 --- a/libstdc++-v3/doc/html/manual/using_macros.html +++ b/libstdc++-v3/doc/html/manual/using_macros.html @@ -15,7 +15,7 @@ information.
__GLIBCXX__
The current version of libstdc++ in compressed ISO date format, form of an unsigned long. For details on the value of this particular macro for a - particular release, please consult this + particular release, please consult this document.
Below are the macros which users may change with #define/#undef or with -D/-U compiler flags. The default state of the symbol is @@ -53,7 +53,7 @@ --enable-concept-checks. When defined, performs compile-time checking on certain template instantiations to detect violations of the requirements of the standard. This - is described in more detail here. + is described in more detail here.
_GLIBCXX_DEBUG
Undefined by default. When defined, compiles user code using the debug mode. diff --git a/libstdc++-v3/doc/html/manual/utilities.html b/libstdc++-v3/doc/html/manual/utilities.html index 77c6866fc8f7..eff9c25ae00b 100644 --- a/libstdc++-v3/doc/html/manual/utilities.html +++ b/libstdc++-v3/doc/html/manual/utilities.html @@ -5,5 +5,5 @@
PrevÂ The GNU C++ Library Â Next
PartÂ IV.Â Utilities - +
Table of Contents
9. Functors
10. Pairs
11. Memory
Allocators
Requirements
Design Issues
Implementation
Using a Specific Allocator
Custom Allocators
Extension Allocators
auto_ptr
Limitations
Use in Containers
shared_ptr
Requirements
Design Issues
Implementation
Use
Acknowledgments
12. Traits
PrevÂ Up Â Next
CancellationÂ Home Â ChapterÂ 9.Â Functors
diff --git a/libstdc++-v3/doc/html/spine.html b/libstdc++-v3/doc/html/spine.html index a7d0f06f8d02..6df1f0173bc0 100644 --- a/libstdc++-v3/doc/html/spine.html +++ b/libstdc++-v3/doc/html/spine.html @@ -38,7 +38,7 @@
24. Iostream Objects
25. Stream Buffers
Derived streambuf Classes
Buffering
26. Memory Based Streams
Compatibility With strstream
27. File Based Streams
Copying a File
Binary Input and Output
28. Interacting with C
Using FILE* and file descriptors
Performance
XII. Extensions -
29. Compile Time Checks
30. Debug Mode
Intro
Semantics
Using
Using the Debug Mode
Using a Specific Debug Container
Design
Goals
Methods
Other Implementations
31. 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
32. Allocators
mt_allocator
Intro
Design Issues
Implementation
Single Thread Example
Multiple Thread Example
bitmap_allocator
Design
Implementation
33. Containers
Policy Based Data Structures
HP/SGI
Deprecated HP/SGI
34. Utilities
35. Algorithms
36. Numerics
37. Iterators
38. Input and Output
Derived filebufs
39. Demangling
40. Concurrency
Design
Interface to Locks and Mutexes
Interface to Atomic Functions
Implementation
Using Builtin Atomic Functions
Thread Abstraction
Use
A. +
29. Compile Time Checks
30. Debug Mode
Intro
Semantics
Using
Using the Debug Mode
Using a Specific Debug Container
Design
Goals
Methods
Other Implementations
31. 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
32. Allocators
mt_allocator
Intro
Design Issues
Implementation
Single Thread Example
Multiple Thread Example
bitmap_allocator
Design
Implementation
33. Containers
Policy Based Data Structures
HP/SGI
Deprecated HP/SGI
34. Utilities
35. Algorithms
36. Numerics
37. Iterators
38. Input and Output
Derived filebufs
39. Demangling
40. Concurrency
Design
Interface to Locks and Mutexes
Interface to Atomic Functions
Implementation
Using Builtin Atomic Functions
Thread Abstraction
Use
A. Contributing
Contributor Checklist
Reading
Assignment
Getting Sources
Submitting Patches
Directory Layout and Source Conventions
Coding Style
Bad Identifiers
By Example
Documentation Style
Doxygen
Docbook
Design Notes
B. diff --git a/libstdc++-v3/doc/xml/manual/abi.xml b/libstdc++-v3/doc/xml/manual/abi.xml index c67e7818ea0a..5bb6a69c7b5d 100644 --- a/libstdc++-v3/doc/xml/manual/abi.xml +++ b/libstdc++-v3/doc/xml/manual/abi.xml @@ -849,8 +849,7 @@ standard includes. - One. Intel ABI checker. More information can be obtained here. + One. Intel ABI checker. @@ -1069,7 +1068,7 @@ gcc test.c -g -O2 -L. -lone -ltwo /usr/lib/libstdc++.so.5 /usr/lib/libstdc++.so. - + @@ -1080,18 +1079,7 @@ gcc test.c -g -O2 -L. -lone -ltwo /usr/lib/libstdc++.so.5 /usr/lib/libstdc++.so. - - - - - - - - IntelÂ® Compilers for Linux* -Compatibility with the GNU Compilers - - - - + @@ -1102,7 +1090,7 @@ gcc test.c -g -O2 -L. -lone -ltwo /usr/lib/libstdc++.so.5 /usr/lib/libstdc++.so. - + @@ -1114,14 +1102,14 @@ gcc test.c -g -O2 -L. -lone -ltwo /usr/lib/libstdc++.so.5 /usr/lib/libstdc++.so. - + - ELF Symbol Versioning + How to Write Shared Libraries @@ -1130,7 +1118,7 @@ gcc test.c -g -O2 -L. -lone -ltwo /usr/lib/libstdc++.so.5 /usr/lib/libstdc++.so. - + @@ -1184,6 +1172,31 @@ gcc test.c -g -O2 -L. -lone -ltwo /usr/lib/libstdc++.so.5 /usr/lib/libstdc++.so. + + + Binary Compatibility of Shared Libraries Implemented in C++ on GNU/Linux Systems + + + +SYRCoSE 2009 + + + + Pavel + Shved + + + + Denis + Silakov + + + + + + + + diff --git a/libstdc++-v3/doc/xml/manual/algorithms.xml b/libstdc++-v3/doc/xml/manual/algorithms.xml index ead0b8bbea7f..3514f4ab6c81 100644 --- a/libstdc++-v3/doc/xml/manual/algorithms.xml +++ b/libstdc++-v3/doc/xml/manual/algorithms.xml @@ -57,16 +57,16 @@ for algorithms, just to keep things simple. The use of N as a size in the examples is to keep things easy to read but probably won't be valid code. You can - use wrappers such as those described in the containers chapter to + use wrappers such as those described in the containers chapter to keep real code readable. The single thing that trips people up the most is the definition of range used with iterators; the famous "past-the-end" rule that everybody loves to hate. The - iterators - chapter of this document has a complete explanation of + iterators + chapter of this document has a complete explanation of this simple rule that seems to cause so much confusion. Once you get range into your head (it's not that hard, honest!), then the algorithms are a cakewalk. diff --git a/libstdc++-v3/doc/xml/manual/auto_ptr.xml b/libstdc++-v3/doc/xml/manual/auto_ptr.xml index d385b6f98032..4175b70c4aab 100644 --- a/libstdc++-v3/doc/xml/manual/auto_ptr.xml +++ b/libstdc++-v3/doc/xml/manual/auto_ptr.xml @@ -86,7 +86,7 @@ - All of the containers + All of the containers described in the standard library require their contained types to have, among other things, a copy constructor like this: @@ -112,7 +112,7 @@ To prevent you from doing this to yourself, the - concept checks built + concept checks built in to this implementation will issue an error if you try to compile code like this: diff --git a/libstdc++-v3/doc/xml/manual/build_hacking.xml b/libstdc++-v3/doc/xml/manual/build_hacking.xml index b9d025465d5e..e5ca0cb2ec7d 100644 --- a/libstdc++-v3/doc/xml/manual/build_hacking.xml +++ b/libstdc++-v3/doc/xml/manual/build_hacking.xml @@ -305,7 +305,7 @@ If you're wondering what that line noise in the last example was, that's how you embed autoconf special characters in output text. They're called quadrigraphs + url="http://ftp.gnu.org/pub/old-gnu/Manuals/autoconf-2.57/html_mono/autoconf.html#SEC95">quadrigraphs and you should use them whenever necessary. diff --git a/libstdc++-v3/doc/xml/manual/debug_mode.xml b/libstdc++-v3/doc/xml/manual/debug_mode.xml index 3ee50bb140ca..f1610c3ef97e 100644 --- a/libstdc++-v3/doc/xml/manual/debug_mode.xml +++ b/libstdc++-v3/doc/xml/manual/debug_mode.xml @@ -325,7 +325,7 @@ containers have additional debug capability. Design - + Goals @@ -440,7 +440,7 @@ containers have additional debug capability. - + Methods @@ -852,7 +852,7 @@ test02() - + Other Implementations diff --git a/libstdc++-v3/doc/xml/manual/diagnostics.xml b/libstdc++-v3/doc/xml/manual/diagnostics.xml index ebdc6c7a2552..d76f6e8e419a 100644 --- a/libstdc++-v3/doc/xml/manual/diagnostics.xml +++ b/libstdc++-v3/doc/xml/manual/diagnostics.xml @@ -44,7 +44,7 @@ Derived from this are several classes that may have a string member: a full hierarchy can be - found in the source documentation. + found in the source documentation. @@ -113,7 +113,7 @@ They are off by default for all versions of GCC. They can be enabled at configure time with - --enable-concept-checks. + --enable-concept-checks. You can enable them on a per-translation-unit basis with -D_GLIBCXX_CONCEPT_CHECKS. diff --git a/libstdc++-v3/doc/xml/manual/evolution.xml b/libstdc++-v3/doc/xml/manual/evolution.xml index f99773752271..3c72823a8ca5 100644 --- a/libstdc++-v3/doc/xml/manual/evolution.xml +++ b/libstdc++-v3/doc/xml/manual/evolution.xml @@ -80,9 +80,9 @@ Removal of ext/tree, moved to For GCC releases from 2.95 through the 3.1 series, defining __USE_MALLOC on the gcc command line would change the default allocation strategy to instead use malloc and - free. See - this note - for details as to why this was something needing improvement. + free. (This same functionality is now spelled _GLIBCXX_FORCE_NEW, see + this page + for details. diff --git a/libstdc++-v3/doc/xml/manual/extensions.xml b/libstdc++-v3/doc/xml/manual/extensions.xml index 611954fc9887..82e910023a48 100644 --- a/libstdc++-v3/doc/xml/manual/extensions.xml +++ b/libstdc++-v3/doc/xml/manual/extensions.xml @@ -48,8 +48,7 @@ extensions, be aware of two things: - You should know how to access - these headers properly. + You should know how to access these headers properly. @@ -89,7 +88,7 @@ extensions, be aware of two things: They are off by default for all versions of GCC from 3.0 to 3.4 (the latest release at the time of writing). They can be enabled at configure time with - --enable-concept-checks. + --enable-concept-checks. You can enable them on a per-translation-unit basis with #define _GLIBCXX_CONCEPT_CHECKS for GCC 3.4 and higher (or with #define _GLIBCPP_CONCEPT_CHECKS for versions @@ -386,7 +385,7 @@ get_temporary_buffer(5, (int*)0); power (x, n); power (x, n, moniod_operation); Returns, in FORTRAN syntax, "x ** n" where n>=0. In the - case of n == 0, returns the identity element for the + case of n == 0, returns the identity element for the monoid operation. The two-argument signature uses multiplication (for a true "power" implementation), but addition is supported as well. The operation functor must be associative. @@ -485,9 +484,8 @@ get_temporary_buffer(5, (int*)0); If you want to access a filebuf's file descriptor to implement file locking (e.g. using the fcntl() system - call) then you might be interested in Henry Suter's - RWLock - class. + call) then you might be interested in Henry Suter's RWLock class. + diff --git a/libstdc++-v3/doc/xml/manual/parallel_mode.xml b/libstdc++-v3/doc/xml/manual/parallel_mode.xml index 22039b7bfbf0..8fa17b765043 100644 --- a/libstdc++-v3/doc/xml/manual/parallel_mode.xml +++ b/libstdc++-v3/doc/xml/manual/parallel_mode.xml @@ -469,7 +469,7 @@ flags for atomic operations.) Design - + Interface Basics @@ -538,7 +538,7 @@ overload is therefore missing. - + Configuration and Tuning @@ -758,7 +758,7 @@ int main() - + Implementation Namespaces One namespace contain versions of code that are always diff --git a/libstdc++-v3/doc/xml/manual/using.xml b/libstdc++-v3/doc/xml/manual/using.xml index 153b7511e05c..1dfeb83cd7c0 100644 --- a/libstdc++-v3/doc/xml/manual/using.xml +++ b/libstdc++-v3/doc/xml/manual/using.xml @@ -702,7 +702,6 @@ g++ -Winvalid-pch -I. -include stdc++.h -H -g -O2 hello.cc -o test.exe Detailed information about creating precompiled header files can be found in the GCC documentation. - @@ -847,8 +846,8 @@ namespace gtk The current version of libstdc++ in compressed ISO date format, form of an unsigned long. For details on the value of this particular macro for a - particular release, please consult this - document. + particular release, please consult this + document. @@ -910,8 +909,8 @@ namespace gtk --enable-concept-checks. When defined, performs compile-time checking on certain template instantiations to detect violations of the requirements of the standard. This - is described in more detail here. + is described in more detail here. @@ -1037,7 +1036,7 @@ gcc version 4.1.2 20070925 (Red Hat 4.1.2-33) An implementation of atomicity.h functions - exists for the architecture in question. See the internals documentation for more details. + exists for the architecture in question. See the internals documentation for more details. @@ -1078,11 +1077,6 @@ gcc version 4.1.2 20070925 (Red Hat 4.1.2-33) unless otherwise documented as safe, do not assume that two threads may access a shared standard library object at the same time. - See chapters 17 (library - introduction), 23 - (containers), and 27 (I/O) for - more information. - @@ -1094,15 +1088,7 @@ gcc version 4.1.2 20070925 (Red Hat 4.1.2-33) IO - I'll assume that you have already read the - general notes on library threads, - and the - notes on threaded container - access (you might not think of an I/O stream as a container, but - the points made there also hold here). If you have not read them, - please do so first. - - This gets a bit tricky. Please read carefully, and bear with me. + This gets a bit tricky. Please read carefully, and bear with me. @@ -1245,19 +1231,15 @@ gcc version 4.1.2 20070925 (Red Hat 4.1.2-33) mechanism. Trying to provide a catch-all general template solution would probably be more trouble than it's worth. - The STL implementation is currently configured to use the - high-speed caching memory allocator. Some people like to - test and/or normally run threaded programs with a different - default. For all details about how to globally override this - at application run-time see here. + The library implementation may be configured to use the + high-speed caching memory allocator, which complicates thread + safety issues. For all details about how to globally override + this at application run-time + see here. Also + useful are details + on allocator + options and capabilities. - There is a better way (not standardized yet): It is possible to - force the malloc-based allocator on a per-case-basis for some - application code. The library team generally believes that this - is a better way to tune an application for high-speed using this - implementation of the STL. There is - more information on allocators here. -

PrevÂ	Up	Â Next
Porting to New Hardware or Operating SystemsÂ	Home	Â API Evolution and Deprecation History

PrevÂ	Up	Â Next
PartÂ XII.Â Extensions diff --git a/libstdc++-v3/doc/html/manual/codecvt.html b/libstdc++-v3/doc/html/manual/codecvt.html index d8cc175028d2..0e8610ec55db 100644 --- a/libstdc++-v3/doc/html/manual/codecvt.html +++ b/libstdc++-v3/doc/html/manual/codecvt.html @@ -337,41 +337,41 @@ codecvt usage. wchar_t/char internal buffers and conversions between internal/external buffers? - 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. System Interface Definitions, Issue 6 (IEEE Std. 1003.1-200x) . Copyright Â© 1999 The Open Group/The Institute of Electrical and Electronics Engineers, Inc.. - . + . The C++ Programming Language, Special Edition . 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. - . + . The Unicode HOWTO . Bruno Haible. - . + . UTF-8 and Unicode FAQ for Unix/Linux . Markus Khun. diff --git a/libstdc++-v3/doc/html/manual/containers.html b/libstdc++-v3/doc/html/manual/containers.html index 7126049d63af..e93823119641 100644 --- a/libstdc++-v3/doc/html/manual/containers.html +++ b/libstdc++-v3/doc/html/manual/containers.html @@ -5,5 +5,5 @@
PrevÂ	The GNU C++ Library	Â Next

PrevÂ	Up	Â Next
Verbose Terminate HandlerÂ	Home	Â ChapterÂ 7.Â Exceptions

PrevÂ	Up	Â Next
CString (MFC)Â	Home	Â ChapterÂ 14.Â Locales

PrevÂ	Up	Â Next
ChapterÂ 20.Â MutatingÂ	Home	Â ChapterÂ 21.Â Complex

Bibliography

Bibliography

PartÂ IX.Â Algorithms - +

3.3

3.4

AppendixÂ A.Â Contributing - +

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

+

TERMS AND CONDITIONS

0. Definitions. @@ -617,7 +617,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

Use in Containers

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

Index

A

Index

A

Design

Goals

Goals

Methods

Methods

The Wrapper Model

Other Implementations

Other Implementations

Design

Interface Basics

Interface Basics

Configuration and Tuning

Setting up the OpenMP Environment

Configuration and Tuning

Setting up the OpenMP Environment

Implementation Namespaces

`3.3`

`3.4`

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)`