From 898be2f38dd5832034f726feab95661f589ec007 Mon Sep 17 00:00:00 2001 From: Jonathan Wakely Date: Tue, 18 Dec 2012 11:08:33 +0000 Subject: [PATCH] abi.xml: Update URLs for C++ ABI. * doc/xml/manual/abi.xml: Update URLs for C++ ABI. * doc/xml/manual/policy_data_structures_biblio.xml: Add xmlns attribute. * doc/xml/manual/debug_mode.xml: Give filenames to chunks. * doc/xml/manual/diagnostics.xml: Likewise. * doc/xml/manual/extensions.xml: Likewise. * doc/xml/manual/bitmap_allocator.xml: Likewise. * doc/xml/manual/mt_allocator.xml: Likewise. * doc/xml/manual/policy_data_structures.xml: Likewise. * doc/xml/manual/parallel_mode.xml: Likewise. * doc/xml/manual/profile_mode.xml: Likewise. * doc/xml/manual/spine.xml: Likewise. Update copyright years. * doc/html/*: Regenerate. From-SVN: r194576 --- libstdc++-v3/ChangeLog | 16 +++ libstdc++-v3/doc/html/api.html | 4 +- libstdc++-v3/doc/html/bk02.html | 2 +- libstdc++-v3/doc/html/bk03.html | 2 +- libstdc++-v3/doc/html/faq.html | 6 +- libstdc++-v3/doc/html/index.html | 20 ++- libstdc++-v3/doc/html/manual/abi.html | 24 ++-- libstdc++-v3/doc/html/manual/algorithms.html | 6 +- libstdc++-v3/doc/html/manual/api.html | 6 +- .../manual/{bk01pt04.html => appendix.html} | 8 +- .../html/manual/appendix_contributing.html | 8 +- .../doc/html/manual/appendix_free.html | 6 +- .../doc/html/manual/appendix_gfdl.html | 4 +- .../doc/html/manual/appendix_gpl.html | 8 +- .../doc/html/manual/appendix_porting.html | 26 ++-- libstdc++-v3/doc/html/manual/associative.html | 2 +- libstdc++-v3/doc/html/manual/atomics.html | 6 +- libstdc++-v3/doc/html/manual/backwards.html | 8 +- .../doc/html/manual/bitmap_allocator.html | 6 +- ...h21s02.html => bitmap_allocator_impl.html} | 4 +- .../doc/html/manual/bk01pt03ch18s02.html | 11 -- .../doc/html/manual/bk01pt03ch18s05.html | 26 ---- .../doc/html/manual/bk01pt03ch19s03.html | 10 -- .../doc/html/manual/bk01pt03ch19s04.html | 18 --- .../doc/html/manual/bk01pt03ch30s03.html | 36 ------ libstdc++-v3/doc/html/manual/bugs.html | 2 +- ...pt02ch05s02.html => concept_checking.html} | 2 +- libstdc++-v3/doc/html/manual/concurrency.html | 6 +- libstdc++-v3/doc/html/manual/configure.html | 4 +- libstdc++-v3/doc/html/manual/containers.html | 6 +- .../doc/html/manual/containers_and_c.html | 2 +- libstdc++-v3/doc/html/manual/debug.html | 4 +- libstdc++-v3/doc/html/manual/debug_mode.html | 8 +- ...t03ch17s04.html => debug_mode_design.html} | 8 +- ...ch17s02.html => debug_mode_semantics.html} | 4 +- ...pt03ch17s03.html => debug_mode_using.html} | 6 +- libstdc++-v3/doc/html/manual/diagnostics.html | 10 +- .../html/manual/documentation_hacking.html | 118 ++++++++++++++++-- .../doc/html/manual/dynamic_memory.html | 2 +- .../doc/html/manual/ext_algorithms.html | 2 +- .../doc/html/manual/ext_compile_checks.html | 4 +- .../doc/html/manual/ext_concurrency.html | 6 +- ...ch30s02.html => ext_concurrency_impl.html} | 4 +- .../doc/html/manual/ext_concurrency_use.html | 36 ++++++ .../doc/html/manual/ext_containers.html | 6 +- .../doc/html/manual/ext_demangling.html | 2 +- libstdc++-v3/doc/html/manual/ext_io.html | 2 +- .../doc/html/manual/ext_iterators.html | 2 +- .../doc/html/manual/ext_numerics.html | 2 +- .../{bk01pt03pr01.html => ext_preface.html} | 4 +- .../{bk01pt03ch23s02.html => ext_sgi.html} | 2 +- .../doc/html/manual/ext_utilities.html | 4 +- libstdc++-v3/doc/html/manual/extensions.html | 14 +-- libstdc++-v3/doc/html/manual/facets.html | 56 ++++----- libstdc++-v3/doc/html/manual/fstreams.html | 2 +- .../generalized_numeric_operations.html | 2 +- libstdc++-v3/doc/html/manual/index.html | 36 +++--- libstdc++-v3/doc/html/manual/internals.html | 2 +- libstdc++-v3/doc/html/manual/intro.html | 4 +- libstdc++-v3/doc/html/manual/io.html | 6 +- libstdc++-v3/doc/html/manual/io_and_c.html | 2 +- libstdc++-v3/doc/html/manual/iterators.html | 6 +- libstdc++-v3/doc/html/manual/license.html | 2 +- .../doc/html/manual/localization.html | 22 ++-- libstdc++-v3/doc/html/manual/make.html | 2 +- libstdc++-v3/doc/html/manual/memory.html | 42 +++---- .../doc/html/manual/mt_allocator.html | 6 +- ...3ch20s02.html => mt_allocator_design.html} | 4 +- ...h20s05.html => mt_allocator_ex_multi.html} | 4 +- ...20s04.html => mt_allocator_ex_single.html} | 4 +- ...t03ch20s03.html => mt_allocator_impl.html} | 4 +- libstdc++-v3/doc/html/manual/numerics.html | 6 +- .../doc/html/manual/numerics_and_c.html | 2 +- libstdc++-v3/doc/html/manual/pairs.html | 2 +- .../doc/html/manual/parallel_mode.html | 10 +- ...ch18s04.html => parallel_mode_design.html} | 4 +- .../html/manual/parallel_mode_semantics.html | 11 ++ .../doc/html/manual/parallel_mode_test.html | 26 ++++ ...3ch18s03.html => parallel_mode_using.html} | 4 +- .../policy_based_data_structures_test.html | 111 +++++----------- .../html/manual/policy_data_structures.html | 26 ++-- ...o.html => policy_data_structures_ack.html} | 2 +- .../manual/policy_data_structures_design.html | 68 +++++----- .../manual/policy_data_structures_using.html | 4 +- .../doc/html/manual/profile_mode.html | 8 +- .../doc/html/manual/profile_mode_api.html | 10 ++ .../html/manual/profile_mode_cost_model.html | 18 +++ ...3ch19s02.html => profile_mode_design.html} | 6 +- ...03ch19s06.html => profile_mode_devel.html} | 4 +- ...s07.html => profile_mode_diagnostics.html} | 38 +++--- ...t03ch19s05.html => profile_mode_impl.html} | 4 +- libstdc++-v3/doc/html/manual/setup.html | 2 +- .../doc/html/manual/source_code_style.html | 2 +- .../doc/html/manual/source_design_notes.html | 2 +- .../doc/html/manual/source_organization.html | 2 +- libstdc++-v3/doc/html/manual/status.html | 12 +- .../{bk01pt02.html => std_contents.html} | 8 +- libstdc++-v3/doc/html/manual/streambufs.html | 2 +- libstdc++-v3/doc/html/manual/strings.html | 6 +- .../doc/html/manual/stringstreams.html | 2 +- libstdc++-v3/doc/html/manual/support.html | 8 +- libstdc++-v3/doc/html/manual/termination.html | 2 +- libstdc++-v3/doc/html/manual/test.html | 4 +- libstdc++-v3/doc/html/manual/traits.html | 2 +- libstdc++-v3/doc/html/manual/using.html | 4 +- .../doc/html/manual/using_concurrency.html | 2 +- .../html/manual/using_dynamic_or_shared.html | 2 +- .../doc/html/manual/using_exceptions.html | 18 +-- .../doc/html/manual/using_headers.html | 14 +-- .../doc/html/manual/using_macros.html | 2 +- .../doc/html/manual/using_namespaces.html | 2 +- libstdc++-v3/doc/html/manual/utilities.html | 10 +- libstdc++-v3/doc/xml/manual/abi.xml | 6 +- .../doc/xml/manual/bitmap_allocator.xml | 1 + .../doc/xml/manual/concurrency_extensions.xml | 3 +- libstdc++-v3/doc/xml/manual/debug_mode.xml | 3 + libstdc++-v3/doc/xml/manual/diagnostics.xml | 1 + libstdc++-v3/doc/xml/manual/extensions.xml | 2 + libstdc++-v3/doc/xml/manual/mt_allocator.xml | 4 + libstdc++-v3/doc/xml/manual/parallel_mode.xml | 4 + .../doc/xml/manual/policy_data_structures.xml | 1 + .../manual/policy_data_structures_biblio.xml | 12 +- libstdc++-v3/doc/xml/manual/profile_mode.xml | 6 + libstdc++-v3/doc/xml/manual/spine.xml | 3 + 124 files changed, 669 insertions(+), 600 deletions(-) rename libstdc++-v3/doc/html/manual/{bk01pt04.html => appendix.html} (73%) rename libstdc++-v3/doc/html/manual/{bk01pt03ch21s02.html => bitmap_allocator_impl.html} (93%) delete mode 100644 libstdc++-v3/doc/html/manual/bk01pt03ch18s02.html delete mode 100644 libstdc++-v3/doc/html/manual/bk01pt03ch18s05.html delete mode 100644 libstdc++-v3/doc/html/manual/bk01pt03ch19s03.html delete mode 100644 libstdc++-v3/doc/html/manual/bk01pt03ch19s04.html delete mode 100644 libstdc++-v3/doc/html/manual/bk01pt03ch30s03.html rename libstdc++-v3/doc/html/manual/{bk01pt02ch05s02.html => concept_checking.html} (81%) rename libstdc++-v3/doc/html/manual/{bk01pt03ch17s04.html => debug_mode_design.html} (93%) rename libstdc++-v3/doc/html/manual/{bk01pt03ch17s02.html => debug_mode_semantics.html} (77%) rename libstdc++-v3/doc/html/manual/{bk01pt03ch17s03.html => debug_mode_using.html} (80%) rename libstdc++-v3/doc/html/manual/{bk01pt03ch30s02.html => ext_concurrency_impl.html} (70%) create mode 100644 libstdc++-v3/doc/html/manual/ext_concurrency_use.html rename libstdc++-v3/doc/html/manual/{bk01pt03pr01.html => ext_preface.html} (71%) rename libstdc++-v3/doc/html/manual/{bk01pt03ch23s02.html => ext_sgi.html} (78%) rename libstdc++-v3/doc/html/manual/{bk01pt03ch20s02.html => mt_allocator_design.html} (60%) rename libstdc++-v3/doc/html/manual/{bk01pt03ch20s05.html => mt_allocator_ex_multi.html} (77%) rename libstdc++-v3/doc/html/manual/{bk01pt03ch20s04.html => mt_allocator_ex_single.html} (66%) rename libstdc++-v3/doc/html/manual/{bk01pt03ch20s03.html => mt_allocator_impl.html} (83%) rename libstdc++-v3/doc/html/manual/{bk01pt03ch18s04.html => parallel_mode_design.html} (87%) create mode 100644 libstdc++-v3/doc/html/manual/parallel_mode_semantics.html create mode 100644 libstdc++-v3/doc/html/manual/parallel_mode_test.html rename libstdc++-v3/doc/html/manual/{bk01pt03ch18s03.html => parallel_mode_using.html} (88%) rename libstdc++-v3/doc/html/manual/{policy_data_structures_biblio.html => policy_data_structures_ack.html} (61%) create mode 100644 libstdc++-v3/doc/html/manual/profile_mode_api.html create mode 100644 libstdc++-v3/doc/html/manual/profile_mode_cost_model.html rename libstdc++-v3/doc/html/manual/{bk01pt03ch19s02.html => profile_mode_design.html} (85%) rename libstdc++-v3/doc/html/manual/{bk01pt03ch19s06.html => profile_mode_devel.html} (71%) rename libstdc++-v3/doc/html/manual/{bk01pt03ch19s07.html => profile_mode_diagnostics.html} (91%) rename libstdc++-v3/doc/html/manual/{bk01pt03ch19s05.html => profile_mode_impl.html} (68%) rename libstdc++-v3/doc/html/manual/{bk01pt02.html => std_contents.html} (91%) diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog index 1f30031fd78..ec648dff906 100644 --- a/libstdc++-v3/ChangeLog +++ b/libstdc++-v3/ChangeLog @@ -1,3 +1,19 @@ +2012-12-18 Jonathan Wakely + + * doc/xml/manual/abi.xml: Update URLs for C++ ABI. + * doc/xml/manual/policy_data_structures_biblio.xml: Add xmlns + attribute. + * doc/xml/manual/debug_mode.xml: Give filenames to chunks. + * doc/xml/manual/diagnostics.xml: Likewise. + * doc/xml/manual/extensions.xml: Likewise. + * doc/xml/manual/bitmap_allocator.xml: Likewise. + * doc/xml/manual/mt_allocator.xml: Likewise. + * doc/xml/manual/policy_data_structures.xml: Likewise. + * doc/xml/manual/parallel_mode.xml: Likewise. + * doc/xml/manual/profile_mode.xml: Likewise. + * doc/xml/manual/spine.xml: Likewise. Update copyright years. + * doc/html/*: Regenerate. + 2012-12-17 Jonathan Wakely * include/std/future (__async_sfinae_helper): Remove. diff --git a/libstdc++-v3/doc/html/api.html b/libstdc++-v3/doc/html/api.html index 56db3471d53..19aebd0e067 100644 --- a/libstdc++-v3/doc/html/api.html +++ b/libstdc++-v3/doc/html/api.html @@ -1,13 +1,13 @@ -The GNU C++ Library API Reference
The GNU C++ Library API Reference
Prev  Next

The GNU C++ Library API Reference

Copyright © +The GNU C++ Library API Reference

The GNU C++ Library API Reference
Prev  Next

The GNU C++ Library API Reference

Copyright © 2008 , 2010 FSF -

diff --git a/libstdc++-v3/doc/html/bk02.html b/libstdc++-v3/doc/html/bk02.html index 3863d067ae3..b81c3cb7b78 100644 --- a/libstdc++-v3/doc/html/bk02.html +++ b/libstdc++-v3/doc/html/bk02.html @@ -1,3 +1,3 @@ -

Prev   Next

Table of Contents

The GNU C++ Library API Reference
Prev   Next
Backwards Compatibility Home The GNU C++ Library API Reference
+
Prev   Next

Table of Contents

The GNU C++ Library API Reference
Prev   Next
Backwards Compatibility Home The GNU C++ Library API Reference
diff --git a/libstdc++-v3/doc/html/bk03.html b/libstdc++-v3/doc/html/bk03.html index a00ca967b51..ff9d2d59c33 100644 --- a/libstdc++-v3/doc/html/bk03.html +++ b/libstdc++-v3/doc/html/bk03.html @@ -1,3 +1,3 @@ -
Prev   Next

Table of Contents

Frequently Asked Questions
Prev   Next
The GNU C++ Library API Reference Home Frequently Asked Questions
+
Prev   Next

Table of Contents

Frequently Asked Questions
Prev   Next
The GNU C++ Library API Reference Home Frequently Asked Questions
diff --git a/libstdc++-v3/doc/html/faq.html b/libstdc++-v3/doc/html/faq.html index ed35ee6cd8b..67f6110f491 100644 --- a/libstdc++-v3/doc/html/faq.html +++ b/libstdc++-v3/doc/html/faq.html @@ -1,10 +1,10 @@ -Frequently Asked Questions
Frequently Asked Questions
Prev  

Frequently Asked Questions

Copyright © +Frequently Asked Questions

Frequently Asked Questions
Prev  

Frequently Asked Questions

Copyright © 2008, 2010 FSF -

1.1. +

1.1. What is libstdc++?
1.2. Why should I use libstdc++? @@ -644,7 +644,7 @@

More information, including how to optionally enable/disable the checks, is available in the - Diagnostics. + Diagnostics. chapter of the manual.

6.6.

Program crashes when using library code in a diff --git a/libstdc++-v3/doc/html/index.html b/libstdc++-v3/doc/html/index.html index 4ac0e0ef35f..260ae73db79 100644 --- a/libstdc++-v3/doc/html/index.html +++ b/libstdc++-v3/doc/html/index.html @@ -1,6 +1,6 @@ -The GNU C++ Library

The GNU C++ Library
   Next

The GNU C++ Library

Short Contents

+The GNU C++ Library

The GNU C++ Library
   Next

The GNU C++ Library

Short Contents

Copyright 2008, 2009, 2011 FSF @@ -24,7 +24,7 @@

Table of Contents

The GNU C++ Library Manual
I. Introduction -
1. Status
Implementation Status
C++ 1998/2003
Implementation Status
Implementation Specific Behavior
C++ 2011
Implementation Specific Behavior
C++ TR1
Implementation Specific Behavior
C++ TR 24733
License
The Code: GPL
The Documentation: GPL, FDL
Bugs
Implementation Bugs
Standard Bugs
2. Setup
Prerequisites
Configure
Make
3. Using
Command Options
Headers
Header Files
Mixing Headers
The C Headers and namespace std
Precompiled Headers
Macros
Namespaces
Available Namespaces
namespace std
Using Namespace Composition
Linking
Almost Nothing
Finding Dynamic or Shared Libraries
Concurrency
Prerequisites
Thread Safety
Atomics
IO
Structure
Defaults
Future
Alternatives
Containers
Exceptions
Exception Safety
Exception Neutrality
Doing without
Compatibility
With C
With POSIX thread cancellation
Debugging Support
Using g++
Debug Versions of Library Binary Files
Memory Leak Hunting
Data Race Hunting
Using gdb
Tracking uncaught exceptions
Debug Mode
Compile Time Checking
Profile-based Performance Analysis
II. +
1. Status
Implementation Status
C++ 1998/2003
Implementation Status
Implementation Specific Behavior
C++ 2011
Implementation Specific Behavior
C++ TR1
Implementation Specific Behavior
C++ TR 24733
License
The Code: GPL
The Documentation: GPL, FDL
Bugs
Implementation Bugs
Standard Bugs
2. Setup
Prerequisites
Configure
Make
3. Using
Command Options
Headers
Header Files
Mixing Headers
The C Headers and namespace std
Precompiled Headers
Macros
Namespaces
Available Namespaces
namespace std
Using Namespace Composition
Linking
Almost Nothing
Finding Dynamic or Shared Libraries
Concurrency
Prerequisites
Thread Safety
Atomics
IO
Structure
Defaults
Future
Alternatives
Containers
Exceptions
Exception Safety
Exception Neutrality
Doing without
Compatibility
With C
With POSIX thread cancellation
Debugging Support
Using g++
Debug Versions of Library Binary Files
Memory Leak Hunting
Data Race Hunting
Using gdb
Tracking uncaught exceptions
Debug Mode
Compile Time Checking
Profile-based Performance Analysis
II. Standard Contents
4. Support @@ -32,16 +32,16 @@
Types
Fundamental Types
Numeric Properties
NULL
Dynamic Memory
Termination
Termination Handlers
Verbose Terminate Handler
5. Diagnostics -
Exceptions
API Reference
Adding Data to exception
Concept Checking
6. +
Exceptions
API Reference
Adding Data to exception
Concept Checking
6. Utilities -
Functors
Pairs
Memory
Allocators
Requirements
Design Issues
Implementation
Interface Design
Selecting Default Allocation Policy
Disabling Memory Caching
Using a Specific Allocator
Custom Allocators
Extension Allocators
auto_ptr
Limitations
Use in Containers
shared_ptr
Requirements
Design Issues
Implementation
Class Hierarchy
Thread Safety
Selecting Lock Policy
Related functions and classes
Use
Examples
Unresolved Issues
Acknowledgments
Traits
7. +
Functors
Pairs
Memory
Allocators
Requirements
Design Issues
Implementation
Interface Design
Selecting Default Allocation Policy
Disabling Memory Caching
Using a Specific Allocator
Custom Allocators
Extension Allocators
auto_ptr
Limitations
Use in Containers
shared_ptr
Requirements
Design Issues
Implementation
Class Hierarchy
Thread Safety
Selecting Lock Policy
Related functions and classes
Use
Examples
Unresolved Issues
Acknowledgments
Traits
7. Strings
String Classes
Simple Transformations
Case Sensitivity
Arbitrary Character Types
Tokenizing
Shrink to Fit
CString (MFC)
8. Localization -
Locales
locale
Requirements
Design
Implementation
Interacting with "C" locales
Future
Facets
ctype
Implementation
Specializations
Future
codecvt
Requirements
Design
wchar_t Size
Support for Unicode
Other Issues
Implementation
Use
Future
messages
Requirements
Design
Implementation
Models
The GNU Model
Use
Future
9. +
Locales
locale
Requirements
Design
Implementation
Interacting with "C" locales
Future
Facets
ctype
Implementation
Specializations
Future
codecvt
Requirements
Design
wchar_t Size
Support for Unicode
Other Issues
Implementation
Use
Future
messages
Requirements
Design
Implementation
Models
The GNU Model
Use
Future
9. Containers
Sequences
list
list::size() is O(n)
vector
Space Overhead Management
Associative
Insertion Hints
bitset
Size Variable
Type String
Interacting with C
Containers vs. Arrays
10. @@ -65,8 +65,8 @@
API Reference
III. Extensions -
16. Compile Time Checks
17. Debug Mode
Intro
Semantics
Using
Using the Debug Mode
Using a Specific Debug Container
Design
Goals
Methods
The Wrapper Model
Safe Iterators
Safe Sequences (Containers)
Precondition Checking
Release- and debug-mode coexistence
Compile-time coexistence of release- and debug-mode components
Link- and run-time coexistence of release- and - debug-mode components
Alternatives for Coexistence
Other Implementations
18. Parallel Mode
Intro
Semantics
Using
Prerequisite Compiler Flags
Using Parallel Mode
Using Specific Parallel Components
Design
Interface Basics
Configuration and Tuning
Setting up the OpenMP Environment
Compile Time Switches
Run Time Settings and Defaults
Implementation Namespaces
Testing
Bibliography
19. Profile Mode
Intro
Using the Profile Mode
Tuning the Profile Mode
Design
Wrapper Model
Instrumentation
Run Time Behavior
Analysis and Diagnostics
Cost Model
Reports
Testing
Extensions for Custom Containers
Empirical Cost Model
Implementation Issues
Stack Traces
Symbolization of Instruction Addresses
Concurrency
Using the Standard Library in the Instrumentation Implementation
Malloc Hooks
Construction and Destruction of Global Objects
Developer Information
Big Picture
How To Add A Diagnostic
Diagnostics
Diagnostic Template
Containers
Hashtable Too Small
Hashtable Too Large
Inefficient Hash
Vector Too Small
Vector Too Large
Vector to Hashtable
Hashtable to Vector
Vector to List
List to Vector
List to Forward List (Slist)
Ordered to Unordered Associative Container
Algorithms
Sort Algorithm Performance
Data Locality
Need Software Prefetch
Linked Structure Locality
Multithreaded Data Access
Data Dependence Violations at Container Level
False Sharing
Statistics
Bibliography
20. The mt_allocator
Intro
Design Issues
Overview
Implementation
Tunable Parameters
Initialization
Deallocation Notes
Single Thread Example
Multiple Thread Example
21. The bitmap_allocator
Design
Implementation
Free List Store
Super Block
Super Block Data Layout
Maximum Wasted Percentage
allocate
deallocate
Questions
1
2
3
Locality
Overhead and Grow Policy
22. Policy-Based Data Structures
Intro
Performance Issues
Associative
Priority Que
Goals
Associative
Policy Choices
Underlying Data Structures
Iterators
Functional
Priority Queues
Policy Choices
Underlying Data Structures
Binary Heaps
Using
Prerequisites
Organization
Tutorial
Basic Use
+
16. Compile Time Checks
17. Debug Mode
Intro
Semantics
Using
Using the Debug Mode
Using a Specific Debug Container
Design
Goals
Methods
The Wrapper Model
Safe Iterators
Safe Sequences (Containers)
Precondition Checking
Release- and debug-mode coexistence
Compile-time coexistence of release- and debug-mode components
Link- and run-time coexistence of release- and + debug-mode components
Alternatives for Coexistence
Other Implementations
18. Parallel Mode
Intro
Semantics
Using
Prerequisite Compiler Flags
Using Parallel Mode
Using Specific Parallel Components
Design
Interface Basics
Configuration and Tuning
Setting up the OpenMP Environment
Compile Time Switches
Run Time Settings and Defaults
Implementation Namespaces
Testing
Bibliography
19. Profile Mode
Intro
Using the Profile Mode
Tuning the Profile Mode
Design
Wrapper Model
Instrumentation
Run Time Behavior
Analysis and Diagnostics
Cost Model
Reports
Testing
Extensions for Custom Containers
Empirical Cost Model
Implementation Issues
Stack Traces
Symbolization of Instruction Addresses
Concurrency
Using the Standard Library in the Instrumentation Implementation
Malloc Hooks
Construction and Destruction of Global Objects
Developer Information
Big Picture
How To Add A Diagnostic
Diagnostics
Diagnostic Template
Containers
Hashtable Too Small
Hashtable Too Large
Inefficient Hash
Vector Too Small
Vector Too Large
Vector to Hashtable
Hashtable to Vector
Vector to List
List to Vector
List to Forward List (Slist)
Ordered to Unordered Associative Container
Algorithms
Sort Algorithm Performance
Data Locality
Need Software Prefetch
Linked Structure Locality
Multithreaded Data Access
Data Dependence Violations at Container Level
False Sharing
Statistics
Bibliography
20. The mt_allocator
Intro
Design Issues
Overview
Implementation
Tunable Parameters
Initialization
Deallocation Notes
Single Thread Example
Multiple Thread Example
21. The bitmap_allocator
Design
Implementation
Free List Store
Super Block
Super Block Data Layout
Maximum Wasted Percentage
allocate
deallocate
Questions
1
2
3
Locality
Overhead and Grow Policy
22. Policy-Based Data Structures
Intro
Performance Issues
Associative
Priority Que
Goals
Associative
Policy Choices
Underlying Data Structures
Iterators
Functional
Priority Queues
Policy Choices
Underlying Data Structures
Binary Heaps
Using
Prerequisites
Organization
Tutorial
Basic Use
Configuring via Template Parameters
Querying Container Attributes @@ -128,9 +128,7 @@ Text modify Up
Text modify Down -
Observations
Associative
Priority_Queue
Acknowledgments
- Bibliography -
23. HP/SGI Extensions
Backwards Compatibility
Deprecated
24. Utilities
25. Algorithms
26. Numerics
27. Iterators
28. Input and Output
Derived filebufs
29. Demangling
30. Concurrency
Design
Interface to Locks and Mutexes
Interface to Atomic Functions
Implementation
Using Builtin Atomic Functions
Thread Abstraction
Use
IV. +
Observations
Associative
Priority_Queue
Acknowledgments
Bibliography
23. HP/SGI Extensions
Backwards Compatibility
Deprecated
24. Utilities
25. Algorithms
26. Numerics
27. Iterators
28. Input and Output
Derived filebufs
29. Demangling
30. Concurrency
Design
Interface to Locks and Mutexes
Interface to Atomic Functions
Implementation
Using Builtin Atomic Functions
Thread Abstraction
Use
IV. Appendices
A. Contributing @@ -138,7 +136,7 @@
Contributor Checklist
Reading
Assignment
Getting Sources
Submitting Patches
Directory Layout and Source Conventions
Coding Style
Bad Identifiers
By Example
Design Notes
B. Porting and Maintenance -
Configure and Build Hacking
Prerequisites
Overview
General Process
What Comes from Where
Configure
Storing Information in non-AC files (like configure.host)
Coding and Commenting Conventions
The acinclude.m4 layout
GLIBCXX_ENABLE, the --enable maker
Make
Writing and Generating Documentation
Introduction
Generating Documentation
Doxygen
Prerequisites
Generating the Doxygen Files
Markup
Docbook
Prerequisites
Generating the DocBook Files
Editing and Validation
File Organization and Basics
Markup By Example
Porting to New Hardware or Operating Systems
Operating System
CPU
Character Types
Thread Safety
Numeric Limits
Libtool
Test
Organization
Directory Layout
Naming Conventions
Running the Testsuite
Basic
Variations
Permutations
Writing a new test case
Test Harness and Utilities
Dejagnu Harness Details
Utilities
Special Topics
+
Configure and Build Hacking
Prerequisites
Overview
General Process
What Comes from Where
Configure
Storing Information in non-AC files (like configure.host)
Coding and Commenting Conventions
The acinclude.m4 layout
GLIBCXX_ENABLE, the --enable maker
Make
Writing and Generating Documentation
Introduction
Generating Documentation
Doxygen
Prerequisites
Generating the Doxygen Files
Debugging Generation
Markup
Docbook
Prerequisites
Generating the DocBook Files
Debugging Generation
Editing and Validation
File Organization and Basics
Markup By Example
Porting to New Hardware or Operating Systems
Operating System
CPU
Character Types
Thread Safety
Numeric Limits
Libtool
Test
Organization
Directory Layout
Naming Conventions
Running the Testsuite
Basic
Variations
Permutations
Writing a new test case
Test Harness and Utilities
Dejagnu Harness Details
Utilities
Special Topics
Qualifying Exception Safety Guarantees
Overview
diff --git a/libstdc++-v3/doc/html/manual/abi.html b/libstdc++-v3/doc/html/manual/abi.html index 48446db267c..9e56e3d2d01 100644 --- a/libstdc++-v3/doc/html/manual/abi.html +++ b/libstdc++-v3/doc/html/manual/abi.html @@ -1,6 +1,6 @@ -ABI Policy and Guidelines
ABI Policy and Guidelines
Prev Appendix B.  +ABI Policy and Guidelines
ABI Policy and Guidelines
Prev Appendix B.  Porting and Maintenance  Next

ABI Policy and Guidelines

@@ -21,7 +21,7 @@ virtual functions, etc. These details are defined as the compiler Application Binary Interface, or ABI. The GNU C++ compiler uses an industry-standard C++ ABI starting with version 3. Details can be - found in the ABI + found in the ABI specification.

The GNU C++ compiler, g++, has a compiler command line option to @@ -293,7 +293,7 @@ class that would otherwise have implicit versions. This will change the way the compiler deals with this class in by-value return statements or parameters: instead of passing instances of this class in registers, the compiler will be forced to use memory. See the -section on Function +section on Function Calling Conventions and APIs of the C++ ABI documentation for further details.

Implementation

  1. @@ -491,42 +491,42 @@ gcc test.c -g -O2 -L. -lone -ltwo /usr/lib/libstdc++.so.5 /usr/lib/libstdc++.so. ABIcheck .

[biblio.cxxabi] - + C++ ABI Summary - .

+ .

Intel Compilers for Linux Compatibility with the GNU Compilers - .

+ .

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

+ .

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

+ .

How to Write Shared Libraries - . Ulrich Drepper.

+ . Ulrich Drepper.

C++ ABI for the ARM Architecture - .

+ .

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

+ . Benjamin Kosnik.

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

+ . Benjamin Kosnik.

Binary Compatibility of Shared Libraries Implemented in C++ on GNU/Linux Systems diff --git a/libstdc++-v3/doc/html/manual/algorithms.html b/libstdc++-v3/doc/html/manual/algorithms.html index 29ca6cdb2c8..b688d07542b 100644 --- a/libstdc++-v3/doc/html/manual/algorithms.html +++ b/libstdc++-v3/doc/html/manual/algorithms.html @@ -1,13 +1,13 @@ -Chapter 11.  Algorithms

Chapter 11.  +Chapter 11.  Algorithms
Chapter 11.  Algorithms
Prev Part II.  Standard Contents  Next

Chapter 11.  Algorithms - +

Table of Contents

Mutating
swap
Specializations

The neatest accomplishment of the algorithms section is that all the work is done via iterators, not containers directly. This means two @@ -52,7 +52,7 @@ fact use constant-time swaps.) This should not be surprising, since for two containers of the same type to swap contents, only some internal pointers to storage need to be exchanged. -

Prev Up Next
Chapter 10.  +

Prev Up Next
Chapter 10.  Iterators  Home Chapter 12.  diff --git a/libstdc++-v3/doc/html/manual/api.html b/libstdc++-v3/doc/html/manual/api.html index 250ba6ee090..3cb593443b1 100644 --- a/libstdc++-v3/doc/html/manual/api.html +++ b/libstdc++-v3/doc/html/manual/api.html @@ -1,6 +1,6 @@ -API Evolution and Deprecation History
API Evolution and Deprecation History
Prev Appendix B.  +API Evolution and Deprecation History
API Evolution and Deprecation History
Prev Appendix B.  Porting and Maintenance  Next

API Evolution and Deprecation History

@@ -78,11 +78,11 @@ _Alloc_traits have been removed. __alloc to select an underlying allocator that satisfied memory allocation requests. The selection of this underlying allocator was not user-configurable. -

Table B.6. Extension Allocators

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

Releases after gcc-3.4 have continued to add to the collection +

Table B.6. Extension Allocators

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

Releases after gcc-3.4 have continued to add to the collection of available allocators. All of these new allocators are standard-style. The following table includes details, along with the first released version of GCC that included the extension allocator. -

Table B.7. Extension Allocators Continued

AllocatorIncludeVersion
__gnu_cxx::array_allocator<T>ext/array_allocator.h4.0.0
__gnu_cxx::throw_allocator<T>ext/throw_allocator.h4.2.0

+

Table B.7. Extension Allocators Continued

AllocatorIncludeVersion
__gnu_cxx::array_allocator<T>ext/array_allocator.h4.0.0
__gnu_cxx::throw_allocator<T>ext/throw_allocator.h4.2.0

Debug mode first appears.

Precompiled header support PCH support. diff --git a/libstdc++-v3/doc/html/manual/bk01pt04.html b/libstdc++-v3/doc/html/manual/appendix.html similarity index 73% rename from libstdc++-v3/doc/html/manual/bk01pt04.html rename to libstdc++-v3/doc/html/manual/appendix.html index c9b70a160c8..64f7d8d05f7 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt04.html +++ b/libstdc++-v3/doc/html/manual/appendix.html @@ -1,8 +1,8 @@ -Part IV.  Appendices

Part IV.  +Part IV.  Appendices
Part IV.  Appendices -
Prev The GNU C++ Library Manual Next

Part IV.  +

Prev The GNU C++ Library Manual Next

Part IV.  Appendices

Table of Contents

A. Contributing @@ -10,7 +10,7 @@
Contributor Checklist
Reading
Assignment
Getting Sources
Submitting Patches
Directory Layout and Source Conventions
Coding Style
Bad Identifiers
By Example
Design Notes
B. Porting and Maintenance -
Configure and Build Hacking
Prerequisites
Overview
General Process
What Comes from Where
Configure
Storing Information in non-AC files (like configure.host)
Coding and Commenting Conventions
The acinclude.m4 layout
GLIBCXX_ENABLE, the --enable maker
Make
Writing and Generating Documentation
Introduction
Generating Documentation
Doxygen
Prerequisites
Generating the Doxygen Files
Markup
Docbook
Prerequisites
Generating the DocBook Files
Editing and Validation
File Organization and Basics
Markup By Example
Porting to New Hardware or Operating Systems
Operating System
CPU
Character Types
Thread Safety
Numeric Limits
Libtool
Test
Organization
Directory Layout
Naming Conventions
Running the Testsuite
Basic
Variations
Permutations
Writing a new test case
Test Harness and Utilities
Dejagnu Harness Details
Utilities
Special Topics
+
Configure and Build Hacking
Prerequisites
Overview
General Process
What Comes from Where
Configure
Storing Information in non-AC files (like configure.host)
Coding and Commenting Conventions
The acinclude.m4 layout
GLIBCXX_ENABLE, the --enable maker
Make
Writing and Generating Documentation
Introduction
Generating Documentation
Doxygen
Prerequisites
Generating the Doxygen Files
Debugging Generation
Markup
Docbook
Prerequisites
Generating the DocBook Files
Debugging Generation
Editing and Validation
File Organization and Basics
Markup By Example
Porting to New Hardware or Operating Systems
Operating System
CPU
Character Types
Thread Safety
Numeric Limits
Libtool
Test
Organization
Directory Layout
Naming Conventions
Running the Testsuite
Basic
Variations
Permutations
Writing a new test case
Test Harness and Utilities
Dejagnu Harness Details
Utilities
Special Topics
Qualifying Exception Safety Guarantees
Overview
@@ -37,7 +37,7 @@ Support for C++11 dialect.
D. GNU General Public License version 3 -
E. GNU Free Documentation License
Prev Up Next
Use Home Appendix A.  +
E. GNU Free Documentation License
Prev Up Next
Use Home Appendix A.  Contributing
diff --git a/libstdc++-v3/doc/html/manual/appendix_contributing.html b/libstdc++-v3/doc/html/manual/appendix_contributing.html index 1db71765521..6571fb4398c 100644 --- a/libstdc++-v3/doc/html/manual/appendix_contributing.html +++ b/libstdc++-v3/doc/html/manual/appendix_contributing.html @@ -1,13 +1,13 @@ -Appendix A.  Contributing
Appendix A.  +Appendix A.  Contributing
Appendix A.  Contributing -
Prev Part IV.  +
Prev Part IV.  Appendices  Next

Contributing - +

Table of Contents

Contributor Checklist
Reading
Assignment
Getting Sources
Submitting Patches
Directory Layout and Source Conventions
Coding Style
Bad Identifiers
By Example
Design Notes

The GNU C++ Library follows an open development model. Active contributors are assigned maintainer-ship responsibility, and given @@ -111,6 +111,6 @@ mail message and send it to libstdc++@gcc.gnu.org. All patches and related discussion should be sent to the libstdc++ mailing list. -

Prev Up Next
Part IV.  +

Prev Up Next
Part IV.  Appendices  Home Directory Layout and Source Conventions
diff --git a/libstdc++-v3/doc/html/manual/appendix_free.html b/libstdc++-v3/doc/html/manual/appendix_free.html index aaaa8062a71..6c2398c4a8c 100644 --- a/libstdc++-v3/doc/html/manual/appendix_free.html +++ b/libstdc++-v3/doc/html/manual/appendix_free.html @@ -1,13 +1,13 @@ -Appendix C.  Free Software Needs Free Documentation
Appendix C.  +Appendix C.  Free Software Needs Free Documentation
Appendix C.  Free Software Needs Free Documentation
Prev Part IV.  Appendices  Next

Free Software Needs Free Documentation - +

The biggest deficiency in free operating systems is not in the software--it is the lack of good free manuals that we can include in @@ -121,6 +121,6 @@ prefer copylefted manuals to non-copylefted ones. that lists free books available from other publishers].

Copyright © 2004, 2005, 2006, 2007 Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA

Verbatim copying and distribution of this entire article are permitted worldwide, without royalty, in any medium, provided this -notice is preserved.

Report any problems or suggestions to .

Prev Up Next
Backwards Compatibility Home Appendix D.  +notice is preserved.

Report any problems or suggestions to .

Prev Up Next
Backwards Compatibility Home Appendix D.  GNU General Public License version 3
diff --git a/libstdc++-v3/doc/html/manual/appendix_gfdl.html b/libstdc++-v3/doc/html/manual/appendix_gfdl.html index 89632971f42..8e1d4e80374 100644 --- a/libstdc++-v3/doc/html/manual/appendix_gfdl.html +++ b/libstdc++-v3/doc/html/manual/appendix_gfdl.html @@ -1,6 +1,6 @@ -Appendix E. GNU Free Documentation License
Appendix E. GNU Free Documentation License
Prev Part IV.  +Appendix E. GNU Free Documentation License
Appendix E. GNU Free Documentation License
Prev Part IV.  Appendices  Next

GNU Free Documentation License

Version 1.3, 3 November 2008

Copyright © 2000, 2001, 2002, 2007, 2008 @@ -444,6 +444,6 @@ being LIST, and with the Back-Cover Texts being LIST.

recommend releasing these examples in parallel under your choice of free software license, such as the GNU General Public License, to permit their use in free software. -

Prev Up Next
Appendix D.  +

Prev Up Next
Appendix D.  GNU General Public License version 3  Home 
diff --git a/libstdc++-v3/doc/html/manual/appendix_gpl.html b/libstdc++-v3/doc/html/manual/appendix_gpl.html index 3ea6fdc6097..f7960519d77 100644 --- a/libstdc++-v3/doc/html/manual/appendix_gpl.html +++ b/libstdc++-v3/doc/html/manual/appendix_gpl.html @@ -1,6 +1,6 @@ -Appendix D.  GNU General Public License version 3
Appendix D.  +Appendix D.  GNU General Public License version 3
Appendix D.  GNU General Public License version 3
Prev Part IV.  Appendices @@ -78,7 +78,7 @@

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

+

TERMS AND CONDITIONS

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

+

END OF TERMS AND CONDITIONS

How to Apply These Terms to Your New Programs @@ -677,7 +677,7 @@ under certain conditions; type ‘show c’ for det proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. But first, please read http://www.gnu.org/philosophy/why-not-lgpl.html. -

Prev Up Next
Appendix C.  +

Prev Up Next
Appendix C.  Free Software Needs Free Documentation  Home Appendix E. GNU Free Documentation License
diff --git a/libstdc++-v3/doc/html/manual/appendix_porting.html b/libstdc++-v3/doc/html/manual/appendix_porting.html index e14a7c480e0..42e945cb112 100644 --- a/libstdc++-v3/doc/html/manual/appendix_porting.html +++ b/libstdc++-v3/doc/html/manual/appendix_porting.html @@ -1,14 +1,14 @@ -Appendix B.  Porting and Maintenance
Appendix B.  +Appendix B.  Porting and Maintenance
Appendix B.  Porting and Maintenance
Prev Part IV.  Appendices  Next

Porting and Maintenance - -

Table of Contents

Configure and Build Hacking
Prerequisites
Overview
General Process
What Comes from Where
Configure
Storing Information in non-AC files (like configure.host)
Coding and Commenting Conventions
The acinclude.m4 layout
GLIBCXX_ENABLE, the --enable maker
Make
Writing and Generating Documentation
Introduction
Generating Documentation
Doxygen
Prerequisites
Generating the Doxygen Files
Markup
Docbook
Prerequisites
Generating the DocBook Files
Editing and Validation
File Organization and Basics
Markup By Example
Porting to New Hardware or Operating Systems
Operating System
CPU
Character Types
Thread Safety
Numeric Limits
Libtool
Test
Organization
Directory Layout
Naming Conventions
Running the Testsuite
Basic
Variations
Permutations
Writing a new test case
Test Harness and Utilities
Dejagnu Harness Details
Utilities
Special Topics
+ +

Table of Contents

Configure and Build Hacking
Prerequisites
Overview
General Process
What Comes from Where
Configure
Storing Information in non-AC files (like configure.host)
Coding and Commenting Conventions
The acinclude.m4 layout
GLIBCXX_ENABLE, the --enable maker
Make
Writing and Generating Documentation
Introduction
Generating Documentation
Doxygen
Prerequisites
Generating the Doxygen Files
Debugging Generation
Markup
Docbook
Prerequisites
Generating the DocBook Files
Debugging Generation
Editing and Validation
File Organization and Basics
Markup By Example
Porting to New Hardware or Operating Systems
Operating System
CPU
Character Types
Thread Safety
Numeric Limits
Libtool
Test
Organization
Directory Layout
Naming Conventions
Running the Testsuite
Basic
Variations
Permutations
Writing a new test case
Test Harness and Utilities
Dejagnu Harness Details
Utilities
Special Topics
Qualifying Exception Safety Guarantees
Overview
@@ -62,7 +62,7 @@ make all in the build directory starts the build process. The all target comes from the Makefile file, which is generated via configure from the Makefile.in file, which is in turn generated (via automake) from the file Makefile.am. -

What Comes from Where

Figure B.1. Configure and Build File Dependencies

Dependency Graph for Configure and Build Files

+

What Comes from Where

Figure B.1. Configure and Build File Dependencies

Dependency Graph for Configure and Build Files

Regenerate all generated files by using the command autoreconf at the top level of the libstdc++ source directory. @@ -177,16 +177,16 @@ in the build directory starts the build process. The all

GLIBCXX_ENABLE, the --enable maker

- All the GLIBCXX_ENABLE_FOO macros use a common helper, - GLIBCXX_ENABLE. (You don't have to use it, but it's easy.) The - helper does two things for us: + All the GLIBCXX_ENABLE_FOO macros use a common + helper, GLIBCXX_ENABLE. (You don't have to use + it, but it's easy.) The helper does two things for us:

  1. - Builds the call to the AC_ARG_ENABLE macro, with --help text + Builds the call to the AC_ARG_ENABLE macro, with --help text properly quoted and aligned. (Death to changequote!)

  2. Checks the result against a list of allowed possibilities, and signals a fatal error if there's no match. This means that the - rest of the GLIBCXX_ENABLE_FOO macro doesn't need to test for + rest of the GLIBCXX_ENABLE_FOO macro doesn't need to test for strange arguments, nor do we need to protect against empty/whitespace strings with the "x$foo" = "xbar" idiom. @@ -216,12 +216,12 @@ in the build directory starts the build process. The all[yes], or [bar], or [$1] (which passes the - argument given to the GLIBCXX_ENABLE_FOO macro as the - default). + argument given to the GLIBCXX_ENABLE_FOO macro + as the default).

    For cases where we need to probe for particular models of things, it is useful to have an undocumented "auto" value here (see - GLIBCXX_ENABLE_CLOCALE for an example). + GLIBCXX_ENABLE_CLOCALE for an example).

  3. HELP-ARG is any text to append to the option string itself in the --help output. Examples: [] (i.e., an empty string, @@ -307,4 +307,4 @@ in the build directory starts the build process. The alllibstdc++.so and libstdc++.a. -

Prev Up Next
Design Notes Home Writing and Generating Documentation
+

Prev Up Next
Design Notes Home Writing and Generating Documentation
diff --git a/libstdc++-v3/doc/html/manual/associative.html b/libstdc++-v3/doc/html/manual/associative.html index 2425b9960c9..7bd4c6982b0 100644 --- a/libstdc++-v3/doc/html/manual/associative.html +++ b/libstdc++-v3/doc/html/manual/associative.html @@ -1,6 +1,6 @@ -Associative
Associative
Prev Chapter 9.  +Associative
Associative
Prev Chapter 9.  Containers  Next

Associative

Insertion Hints

diff --git a/libstdc++-v3/doc/html/manual/atomics.html b/libstdc++-v3/doc/html/manual/atomics.html index 93483c30e71..fe3a1f0b4bc 100644 --- a/libstdc++-v3/doc/html/manual/atomics.html +++ b/libstdc++-v3/doc/html/manual/atomics.html @@ -1,13 +1,13 @@ -Chapter 14.  Atomics

Chapter 14.  +Chapter 14.  Atomics
Chapter 14.  Atomics
Prev Part II.  Standard Contents  Next

Chapter 14.  Atomics - +

Table of Contents

API Reference

Facilities for atomic operations.

API Reference

@@ -25,7 +25,7 @@ atomic<int>.

Full API details. -

Prev Up Next
Interacting with C Home Chapter 15.  +

Prev Up Next
Interacting with C Home Chapter 15.  Concurrency
diff --git a/libstdc++-v3/doc/html/manual/backwards.html b/libstdc++-v3/doc/html/manual/backwards.html index 5cef82c015a..ad893074a8b 100644 --- a/libstdc++-v3/doc/html/manual/backwards.html +++ b/libstdc++-v3/doc/html/manual/backwards.html @@ -1,6 +1,6 @@ -Backwards Compatibility
Backwards Compatibility
Prev Appendix B.  +Backwards Compatibility
Backwards Compatibility
Prev Appendix B.  Porting and Maintenance  Next

Backwards Compatibility

First

The first generation GNU C++ library was called libg++. It was a @@ -941,15 +941,15 @@ AC_DEFUN([AC_HEADER_UNORDERED_SET], [ This is a change in behavior from older versions. Now, most iterator_type typedefs in container classes are POD objects, not value_type pointers. -

Bibliography

+

Bibliography

Migrating to GCC 4.1 - . Dan Kegel.

+ . Dan Kegel.

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

+ . Martin Michlmayr.

Migration guide for GCC-3.2 diff --git a/libstdc++-v3/doc/html/manual/bitmap_allocator.html b/libstdc++-v3/doc/html/manual/bitmap_allocator.html index cb928833293..1e78458d49c 100644 --- a/libstdc++-v3/doc/html/manual/bitmap_allocator.html +++ b/libstdc++-v3/doc/html/manual/bitmap_allocator.html @@ -1,9 +1,9 @@ -Chapter 21. The bitmap_allocator

Chapter 21. The bitmap_allocator
Prev Part III.  +Chapter 21. The bitmap_allocator
Chapter 21. The bitmap_allocator
Prev Part III.  Extensions - Next

Chapter 21. The bitmap_allocator

Table of Contents

Design
Implementation
Free List Store
Super Block
Super Block Data Layout
Maximum Wasted Percentage
allocate
deallocate
Questions
1
2
3
Locality
Overhead and Grow Policy

+

 Next

Chapter 21. The bitmap_allocator

Table of Contents

Design
Implementation
Free List Store
Super Block
Super Block Data Layout
Maximum Wasted Percentage
allocate
deallocate
Questions
1
2
3
Locality
Overhead and Grow Policy

Design

As this name suggests, this allocator uses a bit-map to keep track of the used and unused memory locations for its book-keeping @@ -30,4 +30,4 @@ Mutex Protection around every allocation/deallocation. The state of the macro is picked up automatically from the gthr abstraction layer. -

Prev Up Next
Multiple Thread Example Home Implementation
+

Prev Up Next
Multiple Thread Example Home Implementation
diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch21s02.html b/libstdc++-v3/doc/html/manual/bitmap_allocator_impl.html similarity index 93% rename from libstdc++-v3/doc/html/manual/bk01pt03ch21s02.html rename to libstdc++-v3/doc/html/manual/bitmap_allocator_impl.html index be63b2d9fb3..04d42de0692 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch21s02.html +++ b/libstdc++-v3/doc/html/manual/bitmap_allocator_impl.html @@ -1,6 +1,6 @@ -Implementation
Implementation
Prev Chapter 21. The bitmap_allocator Next

Implementation

Free List Store

+Implementation

Implementation
Prev Chapter 21. The bitmap_allocator Next

Implementation

Free List Store

The Free List Store (referred to as FLS for the remaining part of this document) is the Global memory pool that is shared by all instances of the bitmapped allocator instantiated for any type. This maintains a @@ -76,7 +76,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 21.1. Bitmap Allocator Memory Map

268042949672954294967295Data -> Space for 64 ints

+

Table 21.1. Bitmap Allocator Memory Map

268042949672954294967295Data -> 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/bk01pt03ch18s02.html b/libstdc++-v3/doc/html/manual/bk01pt03ch18s02.html deleted file mode 100644 index 82a9183168a..00000000000 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch18s02.html +++ /dev/null @@ -1,11 +0,0 @@ - - -Semantics

Semantics
Prev Chapter 18. Parallel Mode Next

Semantics

The parallel mode STL algorithms are currently not exception-safe, -i.e. user-defined functors must not throw exceptions. -Also, the order of execution is not guaranteed for some functions, of course. -Therefore, user-defined functors should not have any concurrent side effects. -

Since the current GCC OpenMP implementation does not support -OpenMP parallel regions in concurrent threads, -it is not possible to call parallel STL algorithm in -concurrent threads, either. -It might work with other compilers, though.

Prev Up Next
Chapter 18. Parallel Mode Home Using
diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch18s05.html b/libstdc++-v3/doc/html/manual/bk01pt03ch18s05.html deleted file mode 100644 index d0c5c24f591..00000000000 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch18s05.html +++ /dev/null @@ -1,26 +0,0 @@ - - -Testing
Testing
Prev Chapter 18. Parallel Mode Next

Testing

- Both the normal conformance and regression tests and the - supplemental performance tests work. -

- To run the conformance and regression tests with the parallel mode - active, - 

-  make check-parallel
-

- The log and summary files for conformance testing are in the - testsuite/parallel directory. -

- To run the performance tests with the parallel mode active, - 

-  make check-performance-parallel
-

- The result file for performance testing are in the - testsuite directory, in the file - libstdc++_performance.sum. In addition, the - policy-based containers have their own visualizations, which have - additional software dependencies than the usual bare-boned text - file, and can be generated by using the make - doc-performance rule in the testsuite's Makefile. -

Prev Up Next
Design Home Chapter 19. Profile Mode
diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch19s03.html b/libstdc++-v3/doc/html/manual/bk01pt03ch19s03.html deleted file mode 100644 index 39318952a1c..00000000000 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch19s03.html +++ /dev/null @@ -1,10 +0,0 @@ - - -Extensions for Custom Containers
Extensions for Custom Containers
Prev Chapter 19. Profile Mode Next

Extensions for Custom Containers

- Many large projects use their own data structures instead of the ones in the - standard library. If these data structures are similar in functionality - to the standard library, they can be instrumented with the same hooks - that are used to instrument the standard library. - The instrumentation API is exposed in file - profiler.h (look for "Instrumentation hooks"). -

Prev Up Next
Design Home Empirical Cost Model
diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch19s04.html b/libstdc++-v3/doc/html/manual/bk01pt03ch19s04.html deleted file mode 100644 index 36c252008a5..00000000000 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch19s04.html +++ /dev/null @@ -1,18 +0,0 @@ - - -Empirical Cost Model
Empirical Cost Model
Prev Chapter 19. Profile Mode Next

Empirical Cost Model

- Currently, the cost model uses formulas with predefined relative weights - for alternative containers or container implementations. For instance, - iterating through a vector is X times faster than iterating through a list. -

- (Under development.) - We are working on customizing this to a particular machine by providing - an automated way to compute the actual relative weights for operations - on the given machine. -

- (Under development.) - We plan to provide a performance parameter database format that can be - filled in either by hand or by an automated training mechanism. - The analysis module will then use this database instead of the built in. - generic parameters. -

Prev Up Next
Extensions for Custom Containers Home Implementation Issues
diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch30s03.html b/libstdc++-v3/doc/html/manual/bk01pt03ch30s03.html deleted file mode 100644 index 913d564823c..00000000000 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch30s03.html +++ /dev/null @@ -1,36 +0,0 @@ - - -Use
Use
Prev Chapter 30. Concurrency Next

Use

Typical usage of the last two constructs is demonstrated as follows: -

-#include <ext/concurrence.h>
-
-namespace
-{
-  __gnu_cxx::__mutex safe_base_mutex;
-} // anonymous namespace
-
-namespace other
-{
-  void
-  foo()
-  {
-    __gnu_cxx::__scoped_lock sentry(safe_base_mutex);
-    for (int i = 0; i < max;  ++i)
-      {
-	_Safe_iterator_base* __old = __iter;
-	__iter = __iter-<_M_next;
-	__old-<_M_detach_single();
-      }
-}
-

In this sample code, an anonymous namespace is used to keep -the __mutex private to the compilation unit, -and __scoped_lock is used to guard access to the critical -section within the for loop, locking the mutex on creation and freeing -the mutex as control moves out of this block. -

Several exception classes are used to keep track of -concurrence-related errors. These classes -are: __concurrence_lock_error, __concurrence_unlock_error, __concurrence_wait_error, -and __concurrence_broadcast_error. -

Prev Up Next
Implementation Home Part IV.  - Appendices -
diff --git a/libstdc++-v3/doc/html/manual/bugs.html b/libstdc++-v3/doc/html/manual/bugs.html index 0464e8567da..ab4804c38e7 100644 --- a/libstdc++-v3/doc/html/manual/bugs.html +++ b/libstdc++-v3/doc/html/manual/bugs.html @@ -1,6 +1,6 @@ -Bugs
Bugs
Prev Chapter 1. Status Next

Bugs

Implementation Bugs

+Bugs

Bugs
Prev Chapter 1. Status Next

Bugs

Implementation Bugs

Information on known bugs, details on efforts to fix them, and fixed bugs are all available as part of the GCC bug tracking system, with the category set to libstdc++. diff --git a/libstdc++-v3/doc/html/manual/bk01pt02ch05s02.html b/libstdc++-v3/doc/html/manual/concept_checking.html similarity index 81% rename from libstdc++-v3/doc/html/manual/bk01pt02ch05s02.html rename to libstdc++-v3/doc/html/manual/concept_checking.html index f4aa1c8bbbc..a31d4a399b1 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt02ch05s02.html +++ b/libstdc++-v3/doc/html/manual/concept_checking.html @@ -1,6 +1,6 @@ -Concept Checking

Concept Checking
Prev Chapter 5.  +Concept Checking
Concept Checking
Prev Chapter 5.  Diagnostics  Next

Concept Checking

diff --git a/libstdc++-v3/doc/html/manual/concurrency.html b/libstdc++-v3/doc/html/manual/concurrency.html index f4ee067c1f3..07a3228f5d9 100644 --- a/libstdc++-v3/doc/html/manual/concurrency.html +++ b/libstdc++-v3/doc/html/manual/concurrency.html @@ -1,13 +1,13 @@ -Chapter 15.  Concurrency

Chapter 15.  +Chapter 15.  Concurrency
Chapter 15.  Concurrency
Prev Part II.  Standard Contents  Next

Chapter 15.  Concurrency - +

Table of Contents

API Reference

Facilities for concurrent operation, and control thereof.

API Reference

@@ -33,7 +33,7 @@ and packaged_task.

Full API details. -

Prev Up Next
Chapter 14.  +

Prev Up Next
Chapter 14.  Atomics  Home Part III.  diff --git a/libstdc++-v3/doc/html/manual/configure.html b/libstdc++-v3/doc/html/manual/configure.html index e3419612aed..b3cd59eb91f 100644 --- a/libstdc++-v3/doc/html/manual/configure.html +++ b/libstdc++-v3/doc/html/manual/configure.html @@ -1,6 +1,6 @@ -Configure
Configure
Prev Chapter 2. Setup Next

Configure

+Configure

Configure
Prev Chapter 2. Setup Next

Configure

When configuring libstdc++, you'll have to configure the entire gccsrcdir directory. Consider using the toplevel gcc configuration option @@ -176,7 +176,7 @@ libstdc++/16612 for details.

--enable-concept-checks

This turns on additional compile-time checks for instantiated library templates, in the form of specialized templates, - described here. They + described here. They can help users discover when they break the rules of the STL, before their programs run.

--enable-symvers[=style]

In 3.1 and later, tries to turn on symbol versioning in the diff --git a/libstdc++-v3/doc/html/manual/containers.html b/libstdc++-v3/doc/html/manual/containers.html index f6c5e634208..56567807157 100644 --- a/libstdc++-v3/doc/html/manual/containers.html +++ b/libstdc++-v3/doc/html/manual/containers.html @@ -1,13 +1,13 @@ -Chapter 9.  Containers

Chapter 9.  +Chapter 9.  Containers
Chapter 9.  Containers
Prev Part II.  Standard Contents  Next

Chapter 9.  Containers - +

Table of Contents

Sequences
list
list::size() is O(n)
vector
Space Overhead Management
Associative
Insertion Hints
bitset
Size Variable
Type String
Interacting with C
Containers vs. Arrays

Sequences

list

list::size() is O(n)

Yes it is, and that's okay. This is a decision that we preserved when we imported SGI's STL implementation. The following is @@ -52,4 +52,4 @@

The first two alpha releases were announced here and here. -

Prev Up Next
Facets Home Associative
+

Prev Up Next
Facets Home Associative
diff --git a/libstdc++-v3/doc/html/manual/containers_and_c.html b/libstdc++-v3/doc/html/manual/containers_and_c.html index 13b1c9c654b..1e0f8f82e55 100644 --- a/libstdc++-v3/doc/html/manual/containers_and_c.html +++ b/libstdc++-v3/doc/html/manual/containers_and_c.html @@ -1,6 +1,6 @@ -Interacting with C
Interacting with C
Prev Chapter 9.  +Interacting with C
Interacting with C
Prev Chapter 9.  Containers  Next

Interacting with C

Containers vs. Arrays

diff --git a/libstdc++-v3/doc/html/manual/debug.html b/libstdc++-v3/doc/html/manual/debug.html index bebede12443..677e624cb71 100644 --- a/libstdc++-v3/doc/html/manual/debug.html +++ b/libstdc++-v3/doc/html/manual/debug.html @@ -1,6 +1,6 @@ -Debugging Support

Debugging Support
Prev Chapter 3. Using Next

Debugging Support

+Debugging Support

Debugging Support
Prev Chapter 3. Using Next

Debugging Support

There are numerous things that can be done to improve the ease with which C++ binaries are debugged when using the GNU tool chain. Here are some of them. @@ -237,6 +237,6 @@

Profile-based Performance Analysis

The Profile-based Performance Analysis Extension has performance checks for many algorithms. -

Prev Up Next
Exceptions Home Part II.  +

Prev Up Next
Exceptions Home Part II.  Standard Contents
diff --git a/libstdc++-v3/doc/html/manual/debug_mode.html b/libstdc++-v3/doc/html/manual/debug_mode.html index 4dc445189ea..0f13fdc1fcb 100644 --- a/libstdc++-v3/doc/html/manual/debug_mode.html +++ b/libstdc++-v3/doc/html/manual/debug_mode.html @@ -1,10 +1,10 @@ -Chapter 17. Debug Mode
Chapter 17. Debug Mode
Prev Part III.  +Chapter 17. Debug Mode
Chapter 17. Debug Mode
Prev Part III.  Extensions - Next

Chapter 17. Debug Mode

Table of Contents

Intro
Semantics
Using
Using the Debug Mode
Using a Specific Debug Container
Design
Goals
Methods
The Wrapper Model
Safe Iterators
Safe Sequences (Containers)
Precondition Checking
Release- and debug-mode coexistence
Compile-time coexistence of release- and debug-mode components
Link- and run-time coexistence of release- and - debug-mode components
Alternatives for Coexistence
Other Implementations

Intro

+

 Next

Chapter 17. Debug Mode

Table of Contents

Intro
Semantics
Using
Using the Debug Mode
Using a Specific Debug Container
Design
Goals
Methods
The Wrapper Model
Safe Iterators
Safe Sequences (Containers)
Precondition Checking
Release- and debug-mode coexistence
Compile-time coexistence of release- and debug-mode components
Link- and run-time coexistence of release- and + debug-mode components
Alternatives for Coexistence
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 @@ -35,4 +35,4 @@ the same predicate that was passed to set_intersection; the libstdc++ debug mode will detect an error if the sequence is not sorted or was sorted by a - different predicate.

Prev Up Next
Chapter 16. Compile Time Checks Home Semantics
+ different predicate.

Prev Up Next
Chapter 16. Compile Time Checks Home Semantics
diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch17s04.html b/libstdc++-v3/doc/html/manual/debug_mode_design.html similarity index 93% rename from libstdc++-v3/doc/html/manual/bk01pt03ch17s04.html rename to libstdc++-v3/doc/html/manual/debug_mode_design.html index 5222bdb7867..282eb1d99b4 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch17s04.html +++ b/libstdc++-v3/doc/html/manual/debug_mode_design.html @@ -1,6 +1,6 @@ -Design
Design
Prev Chapter 17. Debug Mode Next

Design

+Design

Design
Prev Chapter 17. Debug Mode Next

Design

Goals

The libstdc++ debug mode replaces unsafe (but efficient) standard containers and iterators with semantically equivalent safe standard @@ -101,7 +101,7 @@ container that will perform the actual work. This design decision ensures that we cannot regress release-mode performance (because the release-mode containers are left untouched) and partially - enables mixing debug and + enables mixing debug and release code at link time, although that will not be discussed at this time.

Two types of wrappers are used in the implementation of the debug mode: container wrappers and iterator wrappers. The two types of @@ -134,7 +134,7 @@ the class template __gnu_debug::_Safe_sequence, instantiated with the type of the safe container itself (an instance of the curiously recurring template pattern).

The iterators of a container wrapper will be - safe + safe iterators that reference sequences of this type and wrap the iterators provided by the release-mode base class. The debugging container will use only the safe iterators within its own interface @@ -409,4 +409,4 @@ test02() a full debug-mode implementation (including debugging for CodeWarrior extensions) and is easy to use, although it meets only the "Full recompilation" (1) recompilation - guarantee.

Prev Up Next
Using Home Chapter 18. Parallel Mode
+ guarantee.

Prev Up Next
Using Home Chapter 18. Parallel Mode
diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch17s02.html b/libstdc++-v3/doc/html/manual/debug_mode_semantics.html similarity index 77% rename from libstdc++-v3/doc/html/manual/bk01pt03ch17s02.html rename to libstdc++-v3/doc/html/manual/debug_mode_semantics.html index 7abfa972b1e..33b116501d7 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch17s02.html +++ b/libstdc++-v3/doc/html/manual/debug_mode_semantics.html @@ -1,6 +1,6 @@ -Semantics
Semantics
Prev Chapter 17. Debug Mode Next

Semantics

+Semantics

Semantics
Prev Chapter 17. Debug Mode Next

Semantics

A program that uses the C++ standard library correctly will maintain the same semantics under debug mode as it had with the normal (release) library. All functional and exception-handling @@ -52,4 +52,4 @@ with the debug-mode checks included, but this is unsupported and not guaranteed to work. For full debug-mode support you can use the __gnu_debug::basic_string debugging container directly, which always works correctly. -

Prev Up Next
Chapter 17. Debug Mode Home Using
+

Prev Up Next
Chapter 17. Debug Mode Home Using
diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch17s03.html b/libstdc++-v3/doc/html/manual/debug_mode_using.html similarity index 80% rename from libstdc++-v3/doc/html/manual/bk01pt03ch17s03.html rename to libstdc++-v3/doc/html/manual/debug_mode_using.html index 62990b26dce..00acb0c497d 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch17s03.html +++ b/libstdc++-v3/doc/html/manual/debug_mode_using.html @@ -1,6 +1,6 @@ -Using
Using
Prev Chapter 17. Debug Mode Next

Using

+Using

Using
Prev Chapter 17. Debug Mode Next

Using

Using the Debug Mode

To use the libstdc++ debug mode, compile your application with the compiler flag -D_GLIBCXX_DEBUG. Note that this flag changes the sizes and behavior of standard class templates such @@ -19,6 +19,6 @@ mode or with debug mode. The following table provides the names and headers of the debugging containers: -

Table 17.1. Debugging Containers

ContainerHeaderDebug containerDebug header
std::bitsetbitset__gnu_debug::bitset<debug/bitset>
std::dequedeque__gnu_debug::deque<debug/deque>
std::listlist__gnu_debug::list<debug/list>
std::mapmap__gnu_debug::map<debug/map>
std::multimapmap__gnu_debug::multimap<debug/map>
std::multisetset__gnu_debug::multiset<debug/set>
std::setset__gnu_debug::set<debug/set>
std::stringstring__gnu_debug::string<debug/string>
std::wstringstring__gnu_debug::wstring<debug/string>
std::basic_stringstring__gnu_debug::basic_string<debug/string>
std::vectorvector__gnu_debug::vector<debug/vector>

In addition, when compiling in C++11 mode, these additional +

Table 17.1. Debugging Containers

ContainerHeaderDebug containerDebug header
std::bitsetbitset__gnu_debug::bitset<debug/bitset>
std::dequedeque__gnu_debug::deque<debug/deque>
std::listlist__gnu_debug::list<debug/list>
std::mapmap__gnu_debug::map<debug/map>
std::multimapmap__gnu_debug::multimap<debug/map>
std::multisetset__gnu_debug::multiset<debug/set>
std::setset__gnu_debug::set<debug/set>
std::stringstring__gnu_debug::string<debug/string>
std::wstringstring__gnu_debug::wstring<debug/string>
std::basic_stringstring__gnu_debug::basic_string<debug/string>
std::vectorvector__gnu_debug::vector<debug/vector>

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

Table 17.2. Debugging Containers C++11

ContainerHeaderDebug containerDebug header
std::unordered_mapunordered_map__gnu_debug::unordered_map<debug/unordered_map>
std::unordered_multimapunordered_map__gnu_debug::unordered_multimap<debug/unordered_map>
std::unordered_setunordered_set__gnu_debug::unordered_set<debug/unordered_set>
std::unordered_multisetunordered_set__gnu_debug::unordered_multiset<debug/unordered_set>

Prev Up Next
Semantics Home Design
+

Table 17.2. Debugging Containers C++11

ContainerHeaderDebug containerDebug header
std::unordered_mapunordered_map__gnu_debug::unordered_map<debug/unordered_map>
std::unordered_multimapunordered_map__gnu_debug::unordered_multimap<debug/unordered_map>
std::unordered_setunordered_set__gnu_debug::unordered_set<debug/unordered_set>
std::unordered_multisetunordered_set__gnu_debug::unordered_multiset<debug/unordered_set>

Prev Up Next
Semantics Home Design
diff --git a/libstdc++-v3/doc/html/manual/diagnostics.html b/libstdc++-v3/doc/html/manual/diagnostics.html index d55beb7fc7f..57ce05bbf6a 100644 --- a/libstdc++-v3/doc/html/manual/diagnostics.html +++ b/libstdc++-v3/doc/html/manual/diagnostics.html @@ -1,14 +1,14 @@ -Chapter 5.  Diagnostics
Chapter 5.  +Chapter 5.  Diagnostics
Chapter 5.  Diagnostics
Prev Part II.  Standard Contents -  Next

Chapter 5.  +

 Next

Chapter 5.  Diagnostics - -

Table of Contents

Exceptions
API Reference
Adding Data to exception
Concept Checking

Exceptions

API Reference

+ +

Table of Contents

Exceptions
API Reference
Adding Data to exception
Concept Checking

Exceptions

API Reference

All exception objects are defined in one of the standard header files: exception, stdexcept, new, and @@ -40,4 +40,4 @@ int e; DBID id; // some user-defined type }; -

Prev Up Next
Termination Home Concept Checking
+
Prev Up Next
Termination Home Concept Checking
diff --git a/libstdc++-v3/doc/html/manual/documentation_hacking.html b/libstdc++-v3/doc/html/manual/documentation_hacking.html index 95ae5255c18..51b77f796c0 100644 --- a/libstdc++-v3/doc/html/manual/documentation_hacking.html +++ b/libstdc++-v3/doc/html/manual/documentation_hacking.html @@ -1,6 +1,6 @@ -Writing and Generating Documentation
Writing and Generating Documentation
Prev Appendix B.  +Writing and Generating Documentation
Writing and Generating Documentation
Prev Appendix B.  Porting and Maintenance  Next

Writing and Generating Documentation

Introduction

@@ -61,13 +61,9 @@ Generates multi-page HTML documentation, and installs it in the following directories:

- - doc/libstdc++/libstdc++-api.html - + doc/libstdc++/libstdc++-api.html

- - doc/libstdc++/libstdc++-manual.html - + doc/libstdc++/libstdc++-manual.html

make pdf , @@ -117,7 +113,7 @@ supported, and are always aliased to dummy rules. These unsupported formats are: info, ps, and dvi. -

Doxygen

Prerequisites

Table B.1. Doxygen Prerequisites

ToolVersionRequired By
coreutils8.5all
bash4.1all
doxygen1.7.6.1all
graphviz2.26graphical hierarchies
pdflatex2007-59pdf output

+

Doxygen

Prerequisites

Table B.1. Doxygen Prerequisites

ToolVersionRequired By
coreutils8.5all
bash4.1all
doxygen1.7.6.1all
graphviz2.26graphical hierarchies
pdflatex2007-59pdf output

Prerequisite tools are Bash 2.0 or later, Doxygen, and the GNU @@ -171,7 +167,51 @@ If you wish to tweak the Doxygen settings, do so by editing doc/doxygen/user.cfg.in. Notes to fellow library hackers are written in triple-# comments. -

Markup

+

Debugging Generation

+ Sometimes, mis-configuration of the pre-requisite tools can + lead to errors when attempting to build the + documentation. Here are some of the obvious errors, and ways + to fix some common issues that may appear quite cryptic. +

+ First, if using a rule like make pdf, try to + narrow down the scope of the error to either docbook + (make doc-pdf-docbook) or doxygen (make + doc-pdf-doxygen). +

+ Working on the doxygen path only, closely examine the + contents of the following build directory: + build/target/libstdc++-v3/doc/doxygen/latex. + Pay attention to three files enclosed within, annotated as follows. +

  • + refman.tex +

    + The actual latex file, or partial latex file. This is generated + via doxygen, and is the LaTeX version of the + Doxygen XML file libstdc++-api.xml. Go to a specific + line, and look at the genrated LaTeX, and try to deduce what + markup in libstdc++-api.xml is causing it. +

  • + refman.out +

    + A log of the compilation of the converted LaTeX form to pdf. This + is a linear list, from the beginning of the + refman.tex file: the last entry of this file + should be the end of the LaTeX file. If it is truncated, then you + know that the last entry is the last part of the generated LaTeX + source file that is valid. Often this file contains an error with + a specific line number of refman.tex that is + incorrect, or will have clues at the end of the file with the dump + of the memory usage of LaTeX. +

+ If the error at hand is not obvious after examination, a + fall-back strategy is to start commenting out the doxygen + input sources, which can be found in + doc/doxygen/user.cfg.in, look for the + INPUT tag. Start by commenting out whole + directories of header files, until the offending header is + identified. Then, read the latex log files to try and find + surround text, and look for that in the offending header. +

Markup

In general, libstdc++ files should be formatted according to the rules found in the Coding Standard. Before @@ -271,7 +311,7 @@ writing Doxygen comments. Single and double quotes, and separators in filenames are two common trouble spots. When in doubt, consult the following table. -

Table B.2. HTML to Doxygen Markup Comparison

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

Docbook

Prerequisites

Table B.3. Docbook Prerequisites

ToolVersionRequired By
docbook5-style-xsl1.76.1all
xsltproc1.1.26all
xmllint2.7.7validation
dblatex0.3pdf output
pdflatex2007-59pdf output
docbook2X0.8.8info output
epub3 stylesheetsb3epub output

+

Table B.2. HTML to Doxygen Markup Comparison

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

Docbook

Prerequisites

Table B.3. Docbook Prerequisites

ToolVersionRequired By
docbook5-style-xsl1.76.1all
xsltproc1.1.26all
xmllint2.7.7validation
dblatex0.3pdf output
pdflatex2007-59pdf output
docbook2X0.8.8info output
epub3 stylesheetsb3epub output

Editing the DocBook sources requires an XML editor. Many exist: some notable options include emacs, Kate, @@ -343,7 +383,59 @@ make XSL_STYLE_DIR="/usr/share/xml/docbook/stylesheet/nwalsh" doc-html-docbook -

Editing and Validation

+

Debugging Generation

+ Sometimes, mis-configuration of the pre-requisite tools can + lead to errors when attempting to build the + documentation. Here are some of the obvious errors, and ways + to fix some common issues that may appear quite cryptic. +

+ First, if using a rule like make pdf, try to + narrow down the scope of the error to either docbook + (make doc-pdf-docbook) or doxygen (make + doc-pdf-doxygen). +

+ Working on the docbook path only, closely examine the + contents of the following build directory: + build/target/libstdc++-v3/doc/docbook/latex. + Pay attention to three files enclosed within, annotated as follows. +

  • + spine.tex +

    + The actual latex file, or partial latex file. This is generated + via dblatex, and is the LaTeX version of the + DocBook XML file spine.xml. Go to a specific + line, and look at the genrated LaTeX, and try to deduce what + markup in spine.xml is causing it. +

  • + spine.out +

    + A log of the conversion from the XML form to the LaTeX form. This + is a linear list, from the beginning of the + spine.xml file: the last entry of this file + should be the end of the DocBook file. If it is truncated, then + you know that the last entry is the last part of the XML source + file that is valid. The error is after this point. +

  • + spine.log +

    + A log of the compilation of the converted LaTeX form to pdf. This + is a linear list, from the beginning of the + spine.tex file: the last entry of this file + should be the end of the LaTeX file. If it is truncated, then you + know that the last entry is the last part of the generated LaTeX + source file that is valid. Often this file contains an error with + a specific line number of spine.tex that is + incorrect. +

+ If the error at hand is not obvious after examination, or if one + encounters the inscruitable “Incomplete + \ifmmode” error, a fall-back strategy is to start + commenting out parts of the XML document (regardless of what + this does to over-all document validity). Start by + commenting out each of the largest parts of the + spine.xml file, section by section, + until the offending section is identified. +

Editing and Validation

After editing the xml sources, please make sure that the XML documentation and markup is still valid. This can be done easily, with the following validation rule: @@ -429,11 +521,11 @@ make XSL_STYLE_DIR="/usr/share/xml/docbook/stylesheet/nwal online. An incomplete reference for HTML to Docbook conversion is detailed in the table below. -

Table B.4. HTML to Docbook XML Markup Comparison

HTMLDocbook
<p><para>
<pre><computeroutput>, <programlisting>, +

Table B.4. HTML to Docbook XML Markup Comparison

HTMLDocbook
<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 B.5. Docbook XML Element Use

ElementUse
<structname><structname>char_traits</structname>
<classname><classname>string</classname>
<function> +

Table B.5. Docbook XML Element Use

ElementUse
<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/dynamic_memory.html b/libstdc++-v3/doc/html/manual/dynamic_memory.html index 93c460fed67..240b4d02cad 100644 --- a/libstdc++-v3/doc/html/manual/dynamic_memory.html +++ b/libstdc++-v3/doc/html/manual/dynamic_memory.html @@ -1,6 +1,6 @@ -Dynamic Memory
Dynamic Memory
Prev Chapter 4.  +Dynamic Memory
Dynamic Memory
Prev Chapter 4.  Support  Next

Dynamic Memory

diff --git a/libstdc++-v3/doc/html/manual/ext_algorithms.html b/libstdc++-v3/doc/html/manual/ext_algorithms.html index e6a9d8c50a7..209e0126071 100644 --- a/libstdc++-v3/doc/html/manual/ext_algorithms.html +++ b/libstdc++-v3/doc/html/manual/ext_algorithms.html @@ -1,6 +1,6 @@ -Chapter 25. Algorithms

Chapter 25. Algorithms
Prev Part III.  +Chapter 25. Algorithms
Chapter 25. Algorithms
Prev Part III.  Extensions  Next

Chapter 25. Algorithms

25.1.6 (count, count_if) is extended with two more versions of count diff --git a/libstdc++-v3/doc/html/manual/ext_compile_checks.html b/libstdc++-v3/doc/html/manual/ext_compile_checks.html index 306ca1a4b6e..25a1b8ef722 100644 --- a/libstdc++-v3/doc/html/manual/ext_compile_checks.html +++ b/libstdc++-v3/doc/html/manual/ext_compile_checks.html @@ -1,6 +1,6 @@ -Chapter 16. Compile Time Checks

Chapter 16. Compile Time Checks
Prev Part III.  +Chapter 16. Compile Time Checks
Chapter 16. Compile Time Checks
Prev Part III.  Extensions  Next

Chapter 16. Compile Time Checks

@@ -37,4 +37,4 @@ support for template parameter constraints based on concepts in the core language. This will obviate the need for the library-simulated concept checking described above. -

Prev Up Next
 Home Chapter 17. Debug Mode
+

Prev Up Next
 Home Chapter 17. Debug Mode
diff --git a/libstdc++-v3/doc/html/manual/ext_concurrency.html b/libstdc++-v3/doc/html/manual/ext_concurrency.html index 8a096fff36c..2543db0c21f 100644 --- a/libstdc++-v3/doc/html/manual/ext_concurrency.html +++ b/libstdc++-v3/doc/html/manual/ext_concurrency.html @@ -1,9 +1,9 @@ -Chapter 30. Concurrency
Chapter 30. Concurrency
Prev Part III.  +Chapter 30. Concurrency
Chapter 30. Concurrency
Prev Part III.  Extensions - Next

Chapter 30. Concurrency

Table of Contents

Design
Interface to Locks and Mutexes
Interface to Atomic Functions
Implementation
Using Builtin Atomic Functions
Thread Abstraction
Use

Design

Interface to Locks and Mutexes

The file <ext/concurrence.h> +

 Next

Chapter 30. Concurrency

Table of Contents

Design
Interface to Locks and Mutexes
Interface to Atomic Functions
Implementation
Using Builtin Atomic Functions
Thread Abstraction
Use

Design

Interface to Locks and Mutexes

The file <ext/concurrence.h> contains all the higher-level constructs for playing with threads. In contrast to the atomics layer, the concurrence layer consists largely of types. All types are defined within namespace __gnu_cxx. @@ -91,4 +91,4 @@ _GLIBCXX_WRITE_MEM_BARRIER

Which expand to the appropriate write and read barrier required by the host hardware and operating system. -

Prev Up Next
Chapter 29. Demangling Home Implementation
+

Prev Up Next
Chapter 29. Demangling Home Implementation
diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch30s02.html b/libstdc++-v3/doc/html/manual/ext_concurrency_impl.html similarity index 70% rename from libstdc++-v3/doc/html/manual/bk01pt03ch30s02.html rename to libstdc++-v3/doc/html/manual/ext_concurrency_impl.html index f7abf820fac..b0b4e7db1ec 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch30s02.html +++ b/libstdc++-v3/doc/html/manual/ext_concurrency_impl.html @@ -1,6 +1,6 @@ -Implementation
Implementation
Prev Chapter 30. Concurrency Next

Implementation

Using Builtin Atomic Functions

The functions for atomic operations described above are either +Implementation

Implementation
Prev Chapter 30. Concurrency Next

Implementation

Using Builtin Atomic Functions

The functions for atomic operations described above are either implemented via compiler intrinsics (if the underlying host is capable) or by library fallbacks.

Compiler intrinsics (builtins) are always preferred. However, as the compiler builtins for atomics are not universally implemented, @@ -42,4 +42,4 @@ use this layer. More detail as to the specific interface can be found in the sou functions, and usage found in the usual <pthread.h> file, including pthread_t, pthread_once_t, pthread_create, etc. -

Prev Up Next
Chapter 30. Concurrency Home Use
+

Prev Up Next
Chapter 30. Concurrency Home Use
diff --git a/libstdc++-v3/doc/html/manual/ext_concurrency_use.html b/libstdc++-v3/doc/html/manual/ext_concurrency_use.html new file mode 100644 index 00000000000..4e2596a92a0 --- /dev/null +++ b/libstdc++-v3/doc/html/manual/ext_concurrency_use.html @@ -0,0 +1,36 @@ + + +Use
Use
Prev Chapter 30. Concurrency Next

Use

Typical usage of the last two constructs is demonstrated as follows: +

+#include <ext/concurrence.h>
+
+namespace
+{
+  __gnu_cxx::__mutex safe_base_mutex;
+} // anonymous namespace
+
+namespace other
+{
+  void
+  foo()
+  {
+    __gnu_cxx::__scoped_lock sentry(safe_base_mutex);
+    for (int i = 0; i < max;  ++i)
+      {
+	_Safe_iterator_base* __old = __iter;
+	__iter = __iter-<_M_next;
+	__old-<_M_detach_single();
+      }
+}
+

In this sample code, an anonymous namespace is used to keep +the __mutex private to the compilation unit, +and __scoped_lock is used to guard access to the critical +section within the for loop, locking the mutex on creation and freeing +the mutex as control moves out of this block. +

Several exception classes are used to keep track of +concurrence-related errors. These classes +are: __concurrence_lock_error, __concurrence_unlock_error, __concurrence_wait_error, +and __concurrence_broadcast_error. +

Prev Up Next
Implementation Home Part IV.  + Appendices +
diff --git a/libstdc++-v3/doc/html/manual/ext_containers.html b/libstdc++-v3/doc/html/manual/ext_containers.html index 6f236b7da20..b7aaf245482 100644 --- a/libstdc++-v3/doc/html/manual/ext_containers.html +++ b/libstdc++-v3/doc/html/manual/ext_containers.html @@ -1,9 +1,9 @@ -Chapter 23. HP/SGI Extensions
Chapter 23. HP/SGI Extensions
Prev Part III.  +Chapter 23. HP/SGI Extensions
Chapter 23. HP/SGI Extensions
Prev Part III.  Extensions - Next

Chapter 23. HP/SGI Extensions

Table of Contents

Backwards Compatibility
Deprecated

Backwards Compatibility

A few extensions and nods to backwards-compatibility have +

 Next

Chapter 23. HP/SGI Extensions

Table of Contents

Backwards Compatibility
Deprecated

Backwards Compatibility

A few extensions and nods to backwards-compatibility have been made with containers. Those dealing with older SGI-style allocators are dealt with elsewhere. The remaining ones all deal with bits: @@ -39,4 +39,4 @@ 

    size_t _Find_first() const;
    size_t _Find_next (size_t prev) const;

The same caveat given for the _Unchecked_* functions applies here also. -

Prev Up Next
Acknowledgments Home Deprecated
+

Prev Up Next
Acknowledgments Home Deprecated
diff --git a/libstdc++-v3/doc/html/manual/ext_demangling.html b/libstdc++-v3/doc/html/manual/ext_demangling.html index 79d9452c13e..dbbcc34b212 100644 --- a/libstdc++-v3/doc/html/manual/ext_demangling.html +++ b/libstdc++-v3/doc/html/manual/ext_demangling.html @@ -1,6 +1,6 @@ -Chapter 29. Demangling
Chapter 29. Demangling
Prev Part III.  +Chapter 29. Demangling
Chapter 29. Demangling
Prev Part III.  Extensions  Next

Chapter 29. Demangling

diff --git a/libstdc++-v3/doc/html/manual/ext_io.html b/libstdc++-v3/doc/html/manual/ext_io.html index 664103f4b82..0c4db7f44aa 100644 --- a/libstdc++-v3/doc/html/manual/ext_io.html +++ b/libstdc++-v3/doc/html/manual/ext_io.html @@ -1,6 +1,6 @@ -Chapter 28. Input and Output

Chapter 28. Input and Output
Prev Part III.  +Chapter 28. Input and Output
Chapter 28. Input and Output
Prev Part III.  Extensions  Next

Chapter 28. Input and Output

Table of Contents

Derived filebufs

diff --git a/libstdc++-v3/doc/html/manual/ext_iterators.html b/libstdc++-v3/doc/html/manual/ext_iterators.html index 16893716971..d3a6c9ca798 100644 --- a/libstdc++-v3/doc/html/manual/ext_iterators.html +++ b/libstdc++-v3/doc/html/manual/ext_iterators.html @@ -1,6 +1,6 @@ -Chapter 27. Iterators

Chapter 27. Iterators
Prev Part III.  +Chapter 27. Iterators
Chapter 27. Iterators
Prev Part III.  Extensions  Next

Chapter 27. Iterators

24.3.2 describes struct iterator, which didn't exist in the diff --git a/libstdc++-v3/doc/html/manual/ext_numerics.html b/libstdc++-v3/doc/html/manual/ext_numerics.html index f38ca1497c4..2816ea8092b 100644 --- a/libstdc++-v3/doc/html/manual/ext_numerics.html +++ b/libstdc++-v3/doc/html/manual/ext_numerics.html @@ -1,6 +1,6 @@ -Chapter 26. Numerics

Chapter 26. Numerics
Prev Part III.  +Chapter 26. Numerics
Chapter 26. Numerics
Prev Part III.  Extensions  Next

Chapter 26. Numerics

26.4, the generalized numeric operations such as accumulate, diff --git a/libstdc++-v3/doc/html/manual/bk01pt03pr01.html b/libstdc++-v3/doc/html/manual/ext_preface.html similarity index 71% rename from libstdc++-v3/doc/html/manual/bk01pt03pr01.html rename to libstdc++-v3/doc/html/manual/ext_preface.html index 227a17b766a..e7d73aa9fdd 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03pr01.html +++ b/libstdc++-v3/doc/html/manual/ext_preface.html @@ -1,9 +1,9 @@ -

Prev Part III.  +
Prev Part III.  Extensions - Next

+

 Next

Here we will make an attempt at describing the non-Standard extensions to the library. Some of these are from older versions of standard library components, namely SGI's STL, and some of these are diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch23s02.html b/libstdc++-v3/doc/html/manual/ext_sgi.html similarity index 78% rename from libstdc++-v3/doc/html/manual/bk01pt03ch23s02.html rename to libstdc++-v3/doc/html/manual/ext_sgi.html index d37a538f5eb..c7bb482ba63 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch23s02.html +++ b/libstdc++-v3/doc/html/manual/ext_sgi.html @@ -1,6 +1,6 @@ -Deprecated

Deprecated
Prev Chapter 23. HP/SGI Extensions Next

Deprecated

+Deprecated

Deprecated
Prev Chapter 23. HP/SGI Extensions Next

Deprecated

The SGI hashing classes hash_set and hash_set have been deprecated by the unordered_set, unordered_multiset, unordered_map, diff --git a/libstdc++-v3/doc/html/manual/ext_utilities.html b/libstdc++-v3/doc/html/manual/ext_utilities.html index 071ce4bcc20..e3ecb7cdf78 100644 --- a/libstdc++-v3/doc/html/manual/ext_utilities.html +++ b/libstdc++-v3/doc/html/manual/ext_utilities.html @@ -1,6 +1,6 @@ -Chapter 24. Utilities

Chapter 24. Utilities
Prev Part III.  +Chapter 24. Utilities
Chapter 24. Utilities
Prev Part III.  Extensions  Next

Chapter 24. Utilities

@@ -39,4 +39,4 @@ get_temporary_buffer(5, (int*)0);

The specialized algorithms of section 20.4.4 are extended with uninitialized_copy_n. -

Prev Up Next
Deprecated Home Chapter 25. Algorithms
+

Prev Up Next
Deprecated Home Chapter 25. Algorithms
diff --git a/libstdc++-v3/doc/html/manual/extensions.html b/libstdc++-v3/doc/html/manual/extensions.html index 78f9e7d967f..9cbf1fefea0 100644 --- a/libstdc++-v3/doc/html/manual/extensions.html +++ b/libstdc++-v3/doc/html/manual/extensions.html @@ -1,13 +1,13 @@ -Part III.  Extensions
Part III.  +Part III.  Extensions
Part III.  Extensions -
Prev The GNU C++ Library Manual Next

Part III.  +

Prev The GNU C++ Library Manual Next

Part III.  Extensions - -

Table of Contents

16. Compile Time Checks
17. Debug Mode
Intro
Semantics
Using
Using the Debug Mode
Using a Specific Debug Container
Design
Goals
Methods
The Wrapper Model
Safe Iterators
Safe Sequences (Containers)
Precondition Checking
Release- and debug-mode coexistence
Compile-time coexistence of release- and debug-mode components
Link- and run-time coexistence of release- and - debug-mode components
Alternatives for Coexistence
Other Implementations
18. Parallel Mode
Intro
Semantics
Using
Prerequisite Compiler Flags
Using Parallel Mode
Using Specific Parallel Components
Design
Interface Basics
Configuration and Tuning
Setting up the OpenMP Environment
Compile Time Switches
Run Time Settings and Defaults
Implementation Namespaces
Testing
Bibliography
19. Profile Mode
Intro
Using the Profile Mode
Tuning the Profile Mode
Design
Wrapper Model
Instrumentation
Run Time Behavior
Analysis and Diagnostics
Cost Model
Reports
Testing
Extensions for Custom Containers
Empirical Cost Model
Implementation Issues
Stack Traces
Symbolization of Instruction Addresses
Concurrency
Using the Standard Library in the Instrumentation Implementation
Malloc Hooks
Construction and Destruction of Global Objects
Developer Information
Big Picture
How To Add A Diagnostic
Diagnostics
Diagnostic Template
Containers
Hashtable Too Small
Hashtable Too Large
Inefficient Hash
Vector Too Small
Vector Too Large
Vector to Hashtable
Hashtable to Vector
Vector to List
List to Vector
List to Forward List (Slist)
Ordered to Unordered Associative Container
Algorithms
Sort Algorithm Performance
Data Locality
Need Software Prefetch
Linked Structure Locality
Multithreaded Data Access
Data Dependence Violations at Container Level
False Sharing
Statistics
Bibliography
20. The mt_allocator
Intro
Design Issues
Overview
Implementation
Tunable Parameters
Initialization
Deallocation Notes
Single Thread Example
Multiple Thread Example
21. The bitmap_allocator
Design
Implementation
Free List Store
Super Block
Super Block Data Layout
Maximum Wasted Percentage
allocate
deallocate
Questions
1
2
3
Locality
Overhead and Grow Policy
22. Policy-Based Data Structures
Intro
Performance Issues
Associative
Priority Que
Goals
Associative
Policy Choices
Underlying Data Structures
Iterators
Functional
Priority Queues
Policy Choices
Underlying Data Structures
Binary Heaps
Using
Prerequisites
Organization
Tutorial
Basic Use
+ +

Table of Contents

16. Compile Time Checks
17. Debug Mode
Intro
Semantics
Using
Using the Debug Mode
Using a Specific Debug Container
Design
Goals
Methods
The Wrapper Model
Safe Iterators
Safe Sequences (Containers)
Precondition Checking
Release- and debug-mode coexistence
Compile-time coexistence of release- and debug-mode components
Link- and run-time coexistence of release- and + debug-mode components
Alternatives for Coexistence
Other Implementations
18. Parallel Mode
Intro
Semantics
Using
Prerequisite Compiler Flags
Using Parallel Mode
Using Specific Parallel Components
Design
Interface Basics
Configuration and Tuning
Setting up the OpenMP Environment
Compile Time Switches
Run Time Settings and Defaults
Implementation Namespaces
Testing
Bibliography
19. Profile Mode
Intro
Using the Profile Mode
Tuning the Profile Mode
Design
Wrapper Model
Instrumentation
Run Time Behavior
Analysis and Diagnostics
Cost Model
Reports
Testing
Extensions for Custom Containers
Empirical Cost Model
Implementation Issues
Stack Traces
Symbolization of Instruction Addresses
Concurrency
Using the Standard Library in the Instrumentation Implementation
Malloc Hooks
Construction and Destruction of Global Objects
Developer Information
Big Picture
How To Add A Diagnostic
Diagnostics
Diagnostic Template
Containers
Hashtable Too Small
Hashtable Too Large
Inefficient Hash
Vector Too Small
Vector Too Large
Vector to Hashtable
Hashtable to Vector
Vector to List
List to Vector
List to Forward List (Slist)
Ordered to Unordered Associative Container
Algorithms
Sort Algorithm Performance
Data Locality
Need Software Prefetch
Linked Structure Locality
Multithreaded Data Access
Data Dependence Violations at Container Level
False Sharing
Statistics
Bibliography
20. The mt_allocator
Intro
Design Issues
Overview
Implementation
Tunable Parameters
Initialization
Deallocation Notes
Single Thread Example
Multiple Thread Example
21. The bitmap_allocator
Design
Implementation
Free List Store
Super Block
Super Block Data Layout
Maximum Wasted Percentage
allocate
deallocate
Questions
1
2
3
Locality
Overhead and Grow Policy
22. Policy-Based Data Structures
Intro
Performance Issues
Associative
Priority Que
Goals
Associative
Policy Choices
Underlying Data Structures
Iterators
Functional
Priority Queues
Policy Choices
Underlying Data Structures
Binary Heaps
Using
Prerequisites
Organization
Tutorial
Basic Use
Configuring via Template Parameters
Querying Container Attributes @@ -69,6 +69,4 @@ Text modify Up
Text modify Down -
Observations
Associative
Priority_Queue
Acknowledgments
- Bibliography -
23. HP/SGI Extensions
Backwards Compatibility
Deprecated
24. Utilities
25. Algorithms
26. Numerics
27. Iterators
28. Input and Output
Derived filebufs
29. Demangling
30. Concurrency
Design
Interface to Locks and Mutexes
Interface to Atomic Functions
Implementation
Using Builtin Atomic Functions
Thread Abstraction
Use
Prev Up Next
Interacting with C Home 
+
Observations
Associative
Priority_Queue
Acknowledgments
Bibliography
23. HP/SGI Extensions
Backwards Compatibility
Deprecated
24. Utilities
25. Algorithms
26. Numerics
27. Iterators
28. Input and Output
Derived filebufs
29. Demangling
30. Concurrency
Design
Interface to Locks and Mutexes
Interface to Atomic Functions
Implementation
Using Builtin Atomic Functions
Thread Abstraction
Use
Prev Up Next
Interacting with C Home 
diff --git a/libstdc++-v3/doc/html/manual/facets.html b/libstdc++-v3/doc/html/manual/facets.html index 45242d2b57d..40405c86ae4 100644 --- a/libstdc++-v3/doc/html/manual/facets.html +++ b/libstdc++-v3/doc/html/manual/facets.html @@ -1,9 +1,9 @@ -Facets
Facets
Prev Chapter 8.  +Facets
Facets
Prev Chapter 8.  Localization - Next

Facets

ctype

Implementation

Specializations

+

 Next

Facets

ctype

Implementation

Specializations

For the required specialization codecvt<wchar_t, char, mbstate_t> , conversions are made between the internal character set (always UCS4 on GNU/Linux) and whatever the currently selected locale for the @@ -50,24 +50,24 @@ characters.

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

    • Bibliography

    +

    Bibliography

    The GNU C Library - . Roland McGrath. Ulrich Drepper. Copyright © 2007 FSF. Chapters 6 Character Set Handling and 7 Locales and Internationalization.

    + . Roland McGrath. Ulrich Drepper. Copyright © 2007 FSF. Chapters 6 Character Set Handling and 7 Locales and Internationalization.

    Correspondence - . Ulrich Drepper. Copyright © 2002 .

    + . Ulrich Drepper. Copyright © 2002 .

    ISO/IEC 14882:1998 Programming languages - C++ - . Copyright © 1998 ISO.

    + . Copyright © 1998 ISO.

    ISO/IEC 9899:1999 Programming languages - C - . Copyright © 1999 ISO.

    + . Copyright © 1999 ISO.

    The Open Group Base Specifications, Issue 6 (IEEE Std. 1003.1-2004) . Copyright © 1999 - The Open Group/The Institute of Electrical and Electronics Engineers, Inc..

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

    The C++ Programming Language, Special Edition . Bjarne Stroustrup. Copyright © 2000 Addison Wesley, Inc.. Appendix D. Addison Wesley - .

    + .

    Standard C++ IOStreams and Locales . Advanced Programmer's Guide and Reference @@ -410,42 +410,42 @@ codecvt usage.

  • wchar_t/char internal buffers and conversions between internal/external buffers? -

    • Bibliography

    +

    Bibliography

    The GNU C Library . Roland McGrath. Ulrich Drepper. Copyright © 2007 FSF. Chapters 6 Character Set Handling and 7 Locales and Internationalization - .

    + .

    Correspondence - . Ulrich Drepper. Copyright © 2002 .

    + . Ulrich Drepper. Copyright © 2002 .

    ISO/IEC 14882:1998 Programming languages - C++ - . Copyright © 1998 ISO.

    + . Copyright © 1998 ISO.

    ISO/IEC 9899:1999 Programming languages - C - . Copyright © 1999 ISO.

    + . Copyright © 1999 ISO.

    System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008) . Copyright © 2008 The Open Group/The Institute of Electrical and Electronics Engineers, Inc. - .

    + .

    The C++ Programming Language, Special Edition . Bjarne Stroustrup. Copyright © 2000 Addison Wesley, Inc.. Appendix D. Addison Wesley - .

    + .

    Standard C++ IOStreams and Locales . Advanced Programmer's Guide and Reference . Angelika Langer. Klaus Kreft. Copyright © 2000 Addison Wesley Longman, Inc.. Addison Wesley Longman - .

    + .

    A brief description of Normative Addendum 1 - . Clive Feather. Extended Character Sets.

    + . Clive Feather. Extended Character Sets.

    The Unicode HOWTO - . Bruno Haible.

    + . Bruno Haible.

    UTF-8 and Unicode FAQ for Unix/Linux @@ -691,39 +691,39 @@ void test01() model. As of this writing, it is unknown how to query to see if a specified message catalog exists using the gettext package. -

    Bibliography

    +

    Bibliography

    The GNU C Library . Roland McGrath. Ulrich Drepper. Copyright © 2007 FSF. Chapters 6 Character Set Handling, and 7 Locales and Internationalization - .

    + .

    Correspondence - . Ulrich Drepper. Copyright © 2002 .

    + . Ulrich Drepper. Copyright © 2002 .

    ISO/IEC 14882:1998 Programming languages - C++ - . Copyright © 1998 ISO.

    + . Copyright © 1998 ISO.

    ISO/IEC 9899:1999 Programming languages - C - . Copyright © 1999 ISO.

    + . Copyright © 1999 ISO.

    System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008) . Copyright © 2008 The Open Group/The Institute of Electrical and Electronics Engineers, Inc. - .

    + .

    The C++ Programming Language, Special Edition . Bjarne Stroustrup. Copyright © 2000 Addison Wesley, Inc.. Appendix D. Addison Wesley - .

    + .

    Standard C++ IOStreams and Locales . Advanced Programmer's Guide and Reference . Angelika Langer. Klaus Kreft. Copyright © 2000 Addison Wesley Longman, Inc.. Addison Wesley Longman - .

    + .

    API Specifications, Java Platform . 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/fstreams.html b/libstdc++-v3/doc/html/manual/fstreams.html index b68e366356c..7379ea0fb38 100644 --- a/libstdc++-v3/doc/html/manual/fstreams.html +++ b/libstdc++-v3/doc/html/manual/fstreams.html @@ -1,6 +1,6 @@ -File Based Streams

    File Based Streams
    Prev Chapter 13.  +File Based Streams
    File Based Streams
    Prev Chapter 13.  Input and Output  Next

    File Based Streams

    Copying a File

    diff --git a/libstdc++-v3/doc/html/manual/generalized_numeric_operations.html b/libstdc++-v3/doc/html/manual/generalized_numeric_operations.html index 2bb9a0b6783..ba954120ff5 100644 --- a/libstdc++-v3/doc/html/manual/generalized_numeric_operations.html +++ b/libstdc++-v3/doc/html/manual/generalized_numeric_operations.html @@ -1,6 +1,6 @@ -Generalized Operations

    Generalized Operations
    Prev Chapter 12.  +Generalized Operations
    Generalized Operations
    Prev Chapter 12.  Numerics  Next

    Generalized Operations

    diff --git a/libstdc++-v3/doc/html/manual/index.html b/libstdc++-v3/doc/html/manual/index.html index d89469e7c20..f80586669ba 100644 --- a/libstdc++-v3/doc/html/manual/index.html +++ b/libstdc++-v3/doc/html/manual/index.html @@ -1,11 +1,11 @@ -The GNU C++ Library Manual

    The GNU C++ Library Manual
    Prev   Next

    The GNU C++ Library Manual

    Paolo Carlini

    Phil Edwards

    Doug Gregor

    Benjamin Kosnik

    Dhruv Matani

    Jason Merrill

    Mark Mitchell

    Nathan Myers

    Felix Natter

    Stefan Olsson

    Silvius Rus

    Johannes Singler

    Ami Tavory

    Jonathan Wakely

    Copyright © 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 +The GNU C++ Library Manual

    The GNU C++ Library Manual
    Prev   Next

    The GNU C++ Library Manual

    Paolo Carlini

    Phil Edwards

    Doug Gregor

    Benjamin Kosnik

    Dhruv Matani

    Jason Merrill

    Mark Mitchell

    Nathan Myers

    Felix Natter

    Stefan Olsson

    Silvius Rus

    Johannes Singler

    Ami Tavory

    Jonathan Wakely

    Copyright © 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 FSF

    Table of Contents

    I. Introduction -
    1. Status
    Implementation Status
    C++ 1998/2003
    Implementation Status
    Implementation Specific Behavior
    C++ 2011
    Implementation Specific Behavior
    C++ TR1
    Implementation Specific Behavior
    C++ TR 24733
    License
    The Code: GPL
    The Documentation: GPL, FDL
    Bugs
    Implementation Bugs
    Standard Bugs
    2. Setup
    Prerequisites
    Configure
    Make
    3. Using
    Command Options
    Headers
    Header Files
    Mixing Headers
    The C Headers and namespace std
    Precompiled Headers
    Macros
    Namespaces
    Available Namespaces
    namespace std
    Using Namespace Composition
    Linking
    Almost Nothing
    Finding Dynamic or Shared Libraries
    Concurrency
    Prerequisites
    Thread Safety
    Atomics
    IO
    Structure
    Defaults
    Future
    Alternatives
    Containers
    Exceptions
    Exception Safety
    Exception Neutrality
    Doing without
    Compatibility
    With C
    With POSIX thread cancellation
    Debugging Support
    Using g++
    Debug Versions of Library Binary Files
    Memory Leak Hunting
    Data Race Hunting
    Using gdb
    Tracking uncaught exceptions
    Debug Mode
    Compile Time Checking
    Profile-based Performance Analysis
    II. +
    1. Status
    Implementation Status
    C++ 1998/2003
    Implementation Status
    Implementation Specific Behavior
    C++ 2011
    Implementation Specific Behavior
    C++ TR1
    Implementation Specific Behavior
    C++ TR 24733
    License
    The Code: GPL
    The Documentation: GPL, FDL
    Bugs
    Implementation Bugs
    Standard Bugs
    2. Setup
    Prerequisites
    Configure
    Make
    3. Using
    Command Options
    Headers
    Header Files
    Mixing Headers
    The C Headers and namespace std
    Precompiled Headers
    Macros
    Namespaces
    Available Namespaces
    namespace std
    Using Namespace Composition
    Linking
    Almost Nothing
    Finding Dynamic or Shared Libraries
    Concurrency
    Prerequisites
    Thread Safety
    Atomics
    IO
    Structure
    Defaults
    Future
    Alternatives
    Containers
    Exceptions
    Exception Safety
    Exception Neutrality
    Doing without
    Compatibility
    With C
    With POSIX thread cancellation
    Debugging Support
    Using g++
    Debug Versions of Library Binary Files
    Memory Leak Hunting
    Data Race Hunting
    Using gdb
    Tracking uncaught exceptions
    Debug Mode
    Compile Time Checking
    Profile-based Performance Analysis
    II. Standard Contents
    4. Support @@ -13,16 +13,16 @@
    Types
    Fundamental Types
    Numeric Properties
    NULL
    Dynamic Memory
    Termination
    Termination Handlers
    Verbose Terminate Handler
    5. Diagnostics -
    Exceptions
    API Reference
    Adding Data to exception
    Concept Checking
    6. +
    Exceptions
    API Reference
    Adding Data to exception
    Concept Checking
    6. Utilities -
    Functors
    Pairs
    Memory
    Allocators
    Requirements
    Design Issues
    Implementation
    Interface Design
    Selecting Default Allocation Policy
    Disabling Memory Caching
    Using a Specific Allocator
    Custom Allocators
    Extension Allocators
    auto_ptr
    Limitations
    Use in Containers
    shared_ptr
    Requirements
    Design Issues
    Implementation
    Class Hierarchy
    Thread Safety
    Selecting Lock Policy
    Related functions and classes
    Use
    Examples
    Unresolved Issues
    Acknowledgments
    Traits
    7. +
    Functors
    Pairs
    Memory
    Allocators
    Requirements
    Design Issues
    Implementation
    Interface Design
    Selecting Default Allocation Policy
    Disabling Memory Caching
    Using a Specific Allocator
    Custom Allocators
    Extension Allocators
    auto_ptr
    Limitations
    Use in Containers
    shared_ptr
    Requirements
    Design Issues
    Implementation
    Class Hierarchy
    Thread Safety
    Selecting Lock Policy
    Related functions and classes
    Use
    Examples
    Unresolved Issues
    Acknowledgments
    Traits
    7. Strings
    String Classes
    Simple Transformations
    Case Sensitivity
    Arbitrary Character Types
    Tokenizing
    Shrink to Fit
    CString (MFC)
    8. Localization -
    Locales
    locale
    Requirements
    Design
    Implementation
    Interacting with "C" locales
    Future
    Facets
    ctype
    Implementation
    Specializations
    Future
    codecvt
    Requirements
    Design
    wchar_t Size
    Support for Unicode
    Other Issues
    Implementation
    Use
    Future
    messages
    Requirements
    Design
    Implementation
    Models
    The GNU Model
    Use
    Future
    9. +
    Locales
    locale
    Requirements
    Design
    Implementation
    Interacting with "C" locales
    Future
    Facets
    ctype
    Implementation
    Specializations
    Future
    codecvt
    Requirements
    Design
    wchar_t Size
    Support for Unicode
    Other Issues
    Implementation
    Use
    Future
    messages
    Requirements
    Design
    Implementation
    Models
    The GNU Model
    Use
    Future
    9. Containers
    Sequences
    list
    list::size() is O(n)
    vector
    Space Overhead Management
    Associative
    Insertion Hints
    bitset
    Size Variable
    Type String
    Interacting with C
    Containers vs. Arrays
    10. @@ -46,8 +46,8 @@
    API Reference
    III. Extensions -
    16. Compile Time Checks
    17. Debug Mode
    Intro
    Semantics
    Using
    Using the Debug Mode
    Using a Specific Debug Container
    Design
    Goals
    Methods
    The Wrapper Model
    Safe Iterators
    Safe Sequences (Containers)
    Precondition Checking
    Release- and debug-mode coexistence
    Compile-time coexistence of release- and debug-mode components
    Link- and run-time coexistence of release- and - debug-mode components
    Alternatives for Coexistence
    Other Implementations
    18. Parallel Mode
    Intro
    Semantics
    Using
    Prerequisite Compiler Flags
    Using Parallel Mode
    Using Specific Parallel Components
    Design
    Interface Basics
    Configuration and Tuning
    Setting up the OpenMP Environment
    Compile Time Switches
    Run Time Settings and Defaults
    Implementation Namespaces
    Testing
    Bibliography
    19. Profile Mode
    Intro
    Using the Profile Mode
    Tuning the Profile Mode
    Design
    Wrapper Model
    Instrumentation
    Run Time Behavior
    Analysis and Diagnostics
    Cost Model
    Reports
    Testing
    Extensions for Custom Containers
    Empirical Cost Model
    Implementation Issues
    Stack Traces
    Symbolization of Instruction Addresses
    Concurrency
    Using the Standard Library in the Instrumentation Implementation
    Malloc Hooks
    Construction and Destruction of Global Objects
    Developer Information
    Big Picture
    How To Add A Diagnostic
    Diagnostics
    Diagnostic Template
    Containers
    Hashtable Too Small
    Hashtable Too Large
    Inefficient Hash
    Vector Too Small
    Vector Too Large
    Vector to Hashtable
    Hashtable to Vector
    Vector to List
    List to Vector
    List to Forward List (Slist)
    Ordered to Unordered Associative Container
    Algorithms
    Sort Algorithm Performance
    Data Locality
    Need Software Prefetch
    Linked Structure Locality
    Multithreaded Data Access
    Data Dependence Violations at Container Level
    False Sharing
    Statistics
    Bibliography
    20. The mt_allocator
    Intro
    Design Issues
    Overview
    Implementation
    Tunable Parameters
    Initialization
    Deallocation Notes
    Single Thread Example
    Multiple Thread Example
    21. The bitmap_allocator
    Design
    Implementation
    Free List Store
    Super Block
    Super Block Data Layout
    Maximum Wasted Percentage
    allocate
    deallocate
    Questions
    1
    2
    3
    Locality
    Overhead and Grow Policy
    22. Policy-Based Data Structures
    Intro
    Performance Issues
    Associative
    Priority Que
    Goals
    Associative
    Policy Choices
    Underlying Data Structures
    Iterators
    Functional
    Priority Queues
    Policy Choices
    Underlying Data Structures
    Binary Heaps
    Using
    Prerequisites
    Organization
    Tutorial
    Basic Use
    +
    16. Compile Time Checks
    17. Debug Mode
    Intro
    Semantics
    Using
    Using the Debug Mode
    Using a Specific Debug Container
    Design
    Goals
    Methods
    The Wrapper Model
    Safe Iterators
    Safe Sequences (Containers)
    Precondition Checking
    Release- and debug-mode coexistence
    Compile-time coexistence of release- and debug-mode components
    Link- and run-time coexistence of release- and + debug-mode components
    Alternatives for Coexistence
    Other Implementations
    18. Parallel Mode
    Intro
    Semantics
    Using
    Prerequisite Compiler Flags
    Using Parallel Mode
    Using Specific Parallel Components
    Design
    Interface Basics
    Configuration and Tuning
    Setting up the OpenMP Environment
    Compile Time Switches
    Run Time Settings and Defaults
    Implementation Namespaces
    Testing
    Bibliography
    19. Profile Mode
    Intro
    Using the Profile Mode
    Tuning the Profile Mode
    Design
    Wrapper Model
    Instrumentation
    Run Time Behavior
    Analysis and Diagnostics
    Cost Model
    Reports
    Testing
    Extensions for Custom Containers
    Empirical Cost Model
    Implementation Issues
    Stack Traces
    Symbolization of Instruction Addresses
    Concurrency
    Using the Standard Library in the Instrumentation Implementation
    Malloc Hooks
    Construction and Destruction of Global Objects
    Developer Information
    Big Picture
    How To Add A Diagnostic
    Diagnostics
    Diagnostic Template
    Containers
    Hashtable Too Small
    Hashtable Too Large
    Inefficient Hash
    Vector Too Small
    Vector Too Large
    Vector to Hashtable
    Hashtable to Vector
    Vector to List
    List to Vector
    List to Forward List (Slist)
    Ordered to Unordered Associative Container
    Algorithms
    Sort Algorithm Performance
    Data Locality
    Need Software Prefetch
    Linked Structure Locality
    Multithreaded Data Access
    Data Dependence Violations at Container Level
    False Sharing
    Statistics
    Bibliography
    20. The mt_allocator
    Intro
    Design Issues
    Overview
    Implementation
    Tunable Parameters
    Initialization
    Deallocation Notes
    Single Thread Example
    Multiple Thread Example
    21. The bitmap_allocator
    Design
    Implementation
    Free List Store
    Super Block
    Super Block Data Layout
    Maximum Wasted Percentage
    allocate
    deallocate
    Questions
    1
    2
    3
    Locality
    Overhead and Grow Policy
    22. Policy-Based Data Structures
    Intro
    Performance Issues
    Associative
    Priority Que
    Goals
    Associative
    Policy Choices
    Underlying Data Structures
    Iterators
    Functional
    Priority Queues
    Policy Choices
    Underlying Data Structures
    Binary Heaps
    Using
    Prerequisites
    Organization
    Tutorial
    Basic Use
    Configuring via Template Parameters
    Querying Container Attributes @@ -109,9 +109,7 @@ Text modify Up
    Text modify Down -
    Observations
    Associative
    Priority_Queue
    Acknowledgments
    - Bibliography -
    23. HP/SGI Extensions
    Backwards Compatibility
    Deprecated
    24. Utilities
    25. Algorithms
    26. Numerics
    27. Iterators
    28. Input and Output
    Derived filebufs
    29. Demangling
    30. Concurrency
    Design
    Interface to Locks and Mutexes
    Interface to Atomic Functions
    Implementation
    Using Builtin Atomic Functions
    Thread Abstraction
    Use
    IV. +
    Observations
    Associative
    Priority_Queue
    Acknowledgments
    Bibliography
    23. HP/SGI Extensions
    Backwards Compatibility
    Deprecated
    24. Utilities
    25. Algorithms
    26. Numerics
    27. Iterators
    28. Input and Output
    Derived filebufs
    29. Demangling
    30. Concurrency
    Design
    Interface to Locks and Mutexes
    Interface to Atomic Functions
    Implementation
    Using Builtin Atomic Functions
    Thread Abstraction
    Use
    IV. Appendices
    A. Contributing @@ -119,7 +117,7 @@
    Contributor Checklist
    Reading
    Assignment
    Getting Sources
    Submitting Patches
    Directory Layout and Source Conventions
    Coding Style
    Bad Identifiers
    By Example
    Design Notes
    B. Porting and Maintenance -
    Configure and Build Hacking
    Prerequisites
    Overview
    General Process
    What Comes from Where
    Configure
    Storing Information in non-AC files (like configure.host)
    Coding and Commenting Conventions
    The acinclude.m4 layout
    GLIBCXX_ENABLE, the --enable maker
    Make
    Writing and Generating Documentation
    Introduction
    Generating Documentation
    Doxygen
    Prerequisites
    Generating the Doxygen Files
    Markup
    Docbook
    Prerequisites
    Generating the DocBook Files
    Editing and Validation
    File Organization and Basics
    Markup By Example
    Porting to New Hardware or Operating Systems
    Operating System
    CPU
    Character Types
    Thread Safety
    Numeric Limits
    Libtool
    Test
    Organization
    Directory Layout
    Naming Conventions
    Running the Testsuite
    Basic
    Variations
    Permutations
    Writing a new test case
    Test Harness and Utilities
    Dejagnu Harness Details
    Utilities
    Special Topics
    +
    Configure and Build Hacking
    Prerequisites
    Overview
    General Process
    What Comes from Where
    Configure
    Storing Information in non-AC files (like configure.host)
    Coding and Commenting Conventions
    The acinclude.m4 layout
    GLIBCXX_ENABLE, the --enable maker
    Make
    Writing and Generating Documentation
    Introduction
    Generating Documentation
    Doxygen
    Prerequisites
    Generating the Doxygen Files
    Debugging Generation
    Markup
    Docbook
    Prerequisites
    Generating the DocBook Files
    Debugging Generation
    Editing and Validation
    File Organization and Basics
    Markup By Example
    Porting to New Hardware or Operating Systems
    Operating System
    CPU
    Character Types
    Thread Safety
    Numeric Limits
    Libtool
    Test
    Organization
    Directory Layout
    Naming Conventions
    Running the Testsuite
    Basic
    Variations
    Permutations
    Writing a new test case
    Test Harness and Utilities
    Dejagnu Harness Details
    Utilities
    Special Topics
    Qualifying Exception Safety Guarantees
    Overview
    @@ -146,19 +144,19 @@ Support for C++11 dialect.
    D. GNU General Public License version 3 -
    E. GNU Free Documentation License

    List of Figures

    22.1. Node Invariants
    22.2. Underlying Associative Data Structures
    22.3. Range Iteration in Different Data Structures
    22.4. Point Iteration in Hash Data Structures
    22.5. Effect of erase in different underlying data structures
    22.6. Underlying Priority Queue Data Structures
    22.7. Exception Hierarchy
    22.8. Non-unique Mapping Standard Containers
    22.9. +
    E. GNU Free Documentation License

    List of Figures

    22.1. Node Invariants
    22.2. Underlying Associative Data Structures
    22.3. Range Iteration in Different Data Structures
    22.4. Point Iteration in Hash Data Structures
    22.5. Effect of erase in different underlying data structures
    22.6. Underlying Priority Queue Data Structures
    22.7. Exception Hierarchy
    22.8. Non-unique Mapping Standard Containers
    22.9. Effect of embedded lists in std::multimap -
    22.10. Non-unique Mapping Containers
    22.11. Point Iterator Hierarchy
    22.12. Invalidation Guarantee Tags Hierarchy
    22.13. Container Tag Hierarchy
    22.14. Hash functions, ranged-hash functions, and - range-hashing functions
    22.15. Insert hash sequence diagram
    22.16. Insert hash sequence diagram with a null policy
    22.17. Hash policy class diagram
    22.18. Balls and bins
    22.19. Insert resize sequence diagram
    22.20. Standard resize policy trigger sequence - diagram
    22.21. Standard resize policy size sequence - diagram
    22.22. Tree node invariants
    22.23. Tree node invalidation
    22.24. A tree and its update policy
    22.25. Restoring node invariants
    22.26. Insert update sequence
    22.27. Useless update path
    22.28. A PATRICIA trie
    22.29. A trie and its update policy
    22.30. A simple list
    22.31. The counter algorithm
    22.32. Underlying Priority-Queue Data-Structures.
    22.33. Priority-Queue Data-Structure Tags.
    B.1. Configure and Build File Dependencies

    List of Tables

    1.1. C++ 1998/2003 Implementation Status
    1.2. C++ 2011 Implementation Status
    1.3. C++ TR1 Implementation Status
    1.4. C++ TR 24733 Implementation Status
    3.1. C++ Command Options
    3.2. C++ 1998 Library Headers
    3.3. C++ 1998 Library Headers for C Library Facilities
    3.4. C++ 2011 Library Headers
    3.5. C++ 2011 Library Headers for C Library Facilities
    3.6. C++ TR 1 Library Headers
    3.7. C++ TR 1 Library Headers for C Library Facilities
    3.8. C++ TR 24733 Decimal Floating-Point Header
    3.9. C++ ABI Headers
    3.10. Extension Headers
    3.11. Extension Debug Headers
    3.12. Extension Profile Headers
    3.13. Extension Parallel Headers
    17.1. Debugging Containers
    17.2. Debugging Containers C++11
    18.1. Parallel Algorithms
    19.1. Profile Code Location
    19.2. Profile Diagnostics
    21.1. Bitmap Allocator Memory Map
    B.1. Doxygen Prerequisites
    B.2. HTML to Doxygen Markup Comparison
    B.3. Docbook Prerequisites
    B.4. HTML to Docbook XML Markup Comparison
    B.5. Docbook XML Element Use
    B.6. Extension Allocators
    B.7. Extension Allocators Continued

    List of Equations

    22.1. Ranged Hash Function
    22.2. Range-Hashing, Division Method
    22.3. Division via Prime Modulo
    22.4. Division via Bit Mask
    22.5. +
    22.10. Non-unique Mapping Containers
    22.11. Point Iterator Hierarchy
    22.12. Invalidation Guarantee Tags Hierarchy
    22.13. Container Tag Hierarchy
    22.14. Hash functions, ranged-hash functions, and + range-hashing functions
    22.15. Insert hash sequence diagram
    22.16. Insert hash sequence diagram with a null policy
    22.17. Hash policy class diagram
    22.18. Balls and bins
    22.19. Insert resize sequence diagram
    22.20. Standard resize policy trigger sequence + diagram
    22.21. Standard resize policy size sequence + diagram
    22.22. Tree node invariants
    22.23. Tree node invalidation
    22.24. A tree and its update policy
    22.25. Restoring node invariants
    22.26. Insert update sequence
    22.27. Useless update path
    22.28. A PATRICIA trie
    22.29. A trie and its update policy
    22.30. A simple list
    22.31. The counter algorithm
    22.32. Underlying Priority-Queue Data-Structures.
    22.33. Priority-Queue Data-Structure Tags.
    B.1. Configure and Build File Dependencies

    List of Tables

    1.1. C++ 1998/2003 Implementation Status
    1.2. C++ 2011 Implementation Status
    1.3. C++ TR1 Implementation Status
    1.4. C++ TR 24733 Implementation Status
    3.1. C++ Command Options
    3.2. C++ 1998 Library Headers
    3.3. C++ 1998 Library Headers for C Library Facilities
    3.4. C++ 2011 Library Headers
    3.5. C++ 2011 Library Headers for C Library Facilities
    3.6. C++ TR 1 Library Headers
    3.7. C++ TR 1 Library Headers for C Library Facilities
    3.8. C++ TR 24733 Decimal Floating-Point Header
    3.9. C++ ABI Headers
    3.10. Extension Headers
    3.11. Extension Debug Headers
    3.12. Extension Profile Headers
    3.13. Extension Parallel Headers
    17.1. Debugging Containers
    17.2. Debugging Containers C++11
    18.1. Parallel Algorithms
    19.1. Profile Code Location
    19.2. Profile Diagnostics
    21.1. Bitmap Allocator Memory Map
    B.1. Doxygen Prerequisites
    B.2. HTML to Doxygen Markup Comparison
    B.3. Docbook Prerequisites
    B.4. HTML to Docbook XML Markup Comparison
    B.5. Docbook XML Element Use
    B.6. Extension Allocators
    B.7. Extension Allocators Continued

    List of Equations

    22.1. Ranged Hash Function
    22.2. Range-Hashing, Division Method
    22.3. Division via Prime Modulo
    22.4. Division via Bit Mask
    22.5. A Standard String Hash Function -
    22.6. +
    22.6. Only k String DNA Hash -
    22.7. +
    22.7. Probability of Probe Sequence of Length k -
    22.8. +
    22.8. Probability Probe Sequence in Some Bin
    Prev   Next
    The GNU C++ Library Home Part I.  Introduction diff --git a/libstdc++-v3/doc/html/manual/internals.html b/libstdc++-v3/doc/html/manual/internals.html index 8d3c02add25..62a42c1be09 100644 --- a/libstdc++-v3/doc/html/manual/internals.html +++ b/libstdc++-v3/doc/html/manual/internals.html @@ -1,6 +1,6 @@ -Porting to New Hardware or Operating Systems
    Porting to New Hardware or Operating Systems
    Prev Appendix B.  +Porting to New Hardware or Operating Systems
    Porting to New Hardware or Operating Systems
    Prev Appendix B.  Porting and Maintenance  Next

    Porting to New Hardware or Operating Systems

    diff --git a/libstdc++-v3/doc/html/manual/intro.html b/libstdc++-v3/doc/html/manual/intro.html index 3edcce891df..d9a8d2f7e6a 100644 --- a/libstdc++-v3/doc/html/manual/intro.html +++ b/libstdc++-v3/doc/html/manual/intro.html @@ -1,9 +1,9 @@ -Part I.  Introduction

    Part I.  +Part I.  Introduction
    Part I.  Introduction
    Prev The GNU C++ Library Manual Next

    Part I.  Introduction - +

    Table of Contents

    1. Status
    Implementation Status
    C++ 1998/2003
    Implementation Status
    Implementation Specific Behavior
    C++ 2011
    Implementation Specific Behavior
    C++ TR1
    Implementation Specific Behavior
    C++ TR 24733
    License
    The Code: GPL
    The Documentation: GPL, FDL
    Bugs
    Implementation Bugs
    Standard Bugs
    2. Setup
    Prerequisites
    Configure
    Make
    3. Using
    Command Options
    Headers
    Header Files
    Mixing Headers
    The C Headers and namespace std
    Precompiled Headers
    Macros
    Namespaces
    Available Namespaces
    namespace std
    Using Namespace Composition
    Linking
    Almost Nothing
    Finding Dynamic or Shared Libraries
    Concurrency
    Prerequisites
    Thread Safety
    Atomics
    IO
    Structure
    Defaults
    Future
    Alternatives
    Containers
    Exceptions
    Exception Safety
    Exception Neutrality
    Doing without
    Compatibility
    With C
    With POSIX thread cancellation
    Debugging Support
    Using g++
    Debug Versions of Library Binary Files
    Memory Leak Hunting
    Data Race Hunting
    Using gdb
    Tracking uncaught exceptions
    Debug Mode
    Compile Time Checking
    Profile-based Performance Analysis
    Prev Up Next
    The GNU C++ Library Manual Home Chapter 1. Status
    diff --git a/libstdc++-v3/doc/html/manual/io.html b/libstdc++-v3/doc/html/manual/io.html index b9c22dc6378..0dfe7b95e15 100644 --- a/libstdc++-v3/doc/html/manual/io.html +++ b/libstdc++-v3/doc/html/manual/io.html @@ -1,13 +1,13 @@ -Chapter 13.  Input and Output
    Chapter 13.  +Chapter 13.  Input and Output
    Chapter 13.  Input and Output
    Prev Part II.  Standard Contents  Next

    Chapter 13.  Input and Output - +

    Table of Contents

    Iostream Objects
    Stream Buffers
    Derived streambuf Classes
    Buffering
    Memory Based Streams
    Compatibility With strstream
    File Based Streams
    Copying a File
    Binary Input and Output
    Interacting with C
    Using FILE* and file descriptors
    Performance

    Iostream Objects

    To minimize the time you have to wait on the compiler, it's good to only include the headers you really need. Many people simply include <iostream> when they don't need to -- and that can penalize @@ -118,4 +118,4 @@ the standard objects in that source file; you'll pay less startup time. Only include the header files you need to in general; your compile times will go down when there's less parsing work to do. -

    Prev Up Next
    Interacting with C Home Stream Buffers
    +

    Prev Up Next
    Interacting with C Home Stream Buffers
    diff --git a/libstdc++-v3/doc/html/manual/io_and_c.html b/libstdc++-v3/doc/html/manual/io_and_c.html index 155a2f6a0cc..9582feed95e 100644 --- a/libstdc++-v3/doc/html/manual/io_and_c.html +++ b/libstdc++-v3/doc/html/manual/io_and_c.html @@ -1,6 +1,6 @@ -Interacting with C
    Interacting with C
    Prev Chapter 13.  +Interacting with C
    Interacting with C
    Prev Chapter 13.  Input and Output  Next

    Interacting with C

    Using FILE* and file descriptors

    diff --git a/libstdc++-v3/doc/html/manual/iterators.html b/libstdc++-v3/doc/html/manual/iterators.html index d535e4ba77a..504d7ded514 100644 --- a/libstdc++-v3/doc/html/manual/iterators.html +++ b/libstdc++-v3/doc/html/manual/iterators.html @@ -1,13 +1,13 @@ -Chapter 10.  Iterators

    Chapter 10.  +Chapter 10.  Iterators
    Chapter 10.  Iterators
    Prev Part II.  Standard Contents  Next

    Chapter 10.  Iterators - +

    Table of Contents

    Predefined
    Iterators vs. Pointers
    One Past the End

    Predefined

    Iterators vs. Pointers

    The following FAQ entry points out that @@ -124,7 +124,7 @@ classes. sequences very simple to recognize: if the two endpoints compare equal, then the {array, sequence, container, whatever} is empty.

    Just don't dereference end(). -

    Prev Up Next
    Interacting with C Home Chapter 11.  +

    Prev Up Next
    Interacting with C Home Chapter 11.  Algorithms
    diff --git a/libstdc++-v3/doc/html/manual/license.html b/libstdc++-v3/doc/html/manual/license.html index a87ae4da415..1d8fb3e9cef 100644 --- a/libstdc++-v3/doc/html/manual/license.html +++ b/libstdc++-v3/doc/html/manual/license.html @@ -1,6 +1,6 @@ -License
    License
    Prev Chapter 1. Status Next

    License

    +License

    License
    Prev Chapter 1. Status Next

    License

    There are two licenses affecting GNU libstdc++: one for the code, and one for the documentation.

    diff --git a/libstdc++-v3/doc/html/manual/localization.html b/libstdc++-v3/doc/html/manual/localization.html index 9b85445d9c1..64360342f78 100644 --- a/libstdc++-v3/doc/html/manual/localization.html +++ b/libstdc++-v3/doc/html/manual/localization.html @@ -1,14 +1,14 @@ -Chapter 8.  Localization

    Chapter 8.  +Chapter 8.  Localization
    Chapter 8.  Localization
    Prev Part II.  Standard Contents  Next

    Chapter 8.  Localization - -

    Table of Contents

    Locales
    locale
    Requirements
    Design
    Implementation
    Interacting with "C" locales
    Future
    Facets
    ctype
    Implementation
    Specializations
    Future
    codecvt
    Requirements
    Design
    wchar_t Size
    Support for Unicode
    Other Issues
    Implementation
    Use
    Future
    messages
    Requirements
    Design
    Implementation
    Models
    The GNU Model
    Use
    Future

    Locales

    locale

    + +

    Table of Contents

    Locales
    locale
    Requirements
    Design
    Implementation
    Interacting with "C" locales
    Future
    Facets
    ctype
    Implementation
    Specializations
    Future
    codecvt
    Requirements
    Design
    wchar_t Size
    Support for Unicode
    Other Issues
    Implementation
    Use
    Future
    messages
    Requirements
    Design
    Implementation
    Models
    The GNU Model
    Use
    Future

    Locales

    locale

    Describes the basic locale object, including nested classes id, facet, and the reference-counted implementation object, class _Impl. @@ -403,35 +403,35 @@ global locale" (emphasis Paolo), that is: What should non-required facet instantiations do? If the generic implementation is provided, then how to end-users provide specializations? -

    Bibliography

    +

    Bibliography

    The GNU C Library . Roland McGrath. Ulrich Drepper. Copyright © 2007 FSF. Chapters 6 Character Set Handling and 7 Locales and Internationalization - .

    + .

    Correspondence - . Ulrich Drepper. Copyright © 2002 .

    + . Ulrich Drepper. Copyright © 2002 .

    ISO/IEC 14882:1998 Programming languages - C++ - . Copyright © 1998 ISO.

    + . Copyright © 1998 ISO.

    ISO/IEC 9899:1999 Programming languages - C - . Copyright © 1999 ISO.

    + . Copyright © 1999 ISO.

    System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008) . Copyright © 2008 The Open Group/The Institute of Electrical and Electronics Engineers, Inc. - .

    + .

    The C++ Programming Language, Special Edition . Bjarne Stroustrup. Copyright © 2000 Addison Wesley, Inc.. Appendix D. Addison Wesley - .

    + .

    Standard C++ IOStreams and Locales . Advanced Programmer's Guide and Reference . Angelika Langer. Klaus Kreft. Copyright © 2000 Addison Wesley Longman, Inc.. Addison Wesley Longman - .

    Prev Up Next
    Chapter 7.  + .

    Prev Up Next
    Chapter 7.  Strings  Home Facets
    diff --git a/libstdc++-v3/doc/html/manual/make.html b/libstdc++-v3/doc/html/manual/make.html index 1fbbf8f9f1f..e7643ac3b8d 100644 --- a/libstdc++-v3/doc/html/manual/make.html +++ b/libstdc++-v3/doc/html/manual/make.html @@ -1,6 +1,6 @@ -Make
    Make
    Prev Chapter 2. Setup Next

    Make

    If you have never done this before, you should read the basic +Make

    Make
    Prev Chapter 2. Setup Next

    Make

    If you have never done this before, you should read the basic GCC Installation Instructions first. Read all of them. Twice. diff --git a/libstdc++-v3/doc/html/manual/memory.html b/libstdc++-v3/doc/html/manual/memory.html index 7a726ec7cdc..cd488689654 100644 --- a/libstdc++-v3/doc/html/manual/memory.html +++ b/libstdc++-v3/doc/html/manual/memory.html @@ -1,6 +1,6 @@ -Memory

    Memory
    Prev Chapter 6.  +Memory
    Memory
    Prev Chapter 6.  Utilities  Next

    Memory

    @@ -93,7 +93,7 @@ or loading and unloading shared objects in memory. As such, using caching allocators on systems that do not support abi::__cxa_atexit is not recommended. -

    Implementation

    Interface Design

    +

    Implementation

    Interface Design

    The only allocator interface that is supported is the standard C++ interface. As such, all STL containers have been adjusted, and all external allocators have @@ -106,7 +106,7 @@

    The base class that allocator is derived from may not be user-configurable. -

    Selecting Default Allocation Policy

    +

    Selecting Default Allocation Policy

    It's difficult to pick an allocation strategy that will provide maximum utility, without excessively penalizing some behavior. In fact, it's difficult just deciding which typical actions to measure @@ -143,7 +143,7 @@ The current default choice for allocator is __gnu_cxx::new_allocator. -

    Disabling Memory Caching

    +

    Disabling Memory Caching

    In use, allocator may allocate and deallocate using implementation-specific strategies and heuristics. Because of this, a given call to an allocator object's @@ -310,33 +310,33 @@ of the used and unused memory locations. It has its own chapter in the documentation. -

    Bibliography

    +

    Bibliography

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

    + 20.4 Memory.

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

    + .

    The Hoard Memory Allocator - . Emery Berger.

    + . Emery Berger.

    Reconsidering Custom Memory Allocation - . Emery Berger. Ben Zorn. Kathryn McKinley. Copyright © 2002 OOPSLA.

    + . Emery Berger. Ben Zorn. Kathryn McKinley. Copyright © 2002 OOPSLA.

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

    The C++ Programming Language. Bjarne Stroustrup. Copyright © 2000 . 19.4 Allocators. + .

    The C++ Programming Language. Bjarne Stroustrup. Copyright © 2000 . 19.4 Allocators. Addison Wesley - .

    Yalloc: A Recycling C++ Allocator. Felix Yen.

    auto_ptr

    Limitations

    Explaining all of the fun and delicious things that can + .

    Yalloc: A Recycling C++ Allocator. Felix Yen.

    auto_ptr

    Limitations

    Explaining all of the fun and delicious things that can happen with misuse of the auto_ptr class template (called AP here) would take some time. Suffice it to say that the use of AP @@ -446,7 +446,7 @@ drops to zero. Derived classes override those functions to destroy resources in a context where the correct dynamic type is known. This is an application of the technique known as type erasure. -

    Implementation

    Class Hierarchy

    +

    Implementation

    Class Hierarchy

    A shared_ptr<T> contains a pointer of type T* and an object of type __shared_count. The shared_count contains a @@ -493,7 +493,7 @@ C++11-only features are: rvalue-ref/move support, allocator support, aliasing constructor, make_shared & allocate_shared. Additionally, the constructors taking auto_ptr parameters are deprecated in C++11 mode. -

    Thread Safety

    +

    Thread Safety

    The Thread Safety section of the Boost shared_ptr documentation says "shared_ptr @@ -538,7 +538,7 @@ compiler, standard library, platform etc. For the version of shared_ptr in libstdc++ the compiler and library are fixed, which makes things much simpler: we have an atomic CAS or we don't, see Lock Policy below for details. -

    Selecting Lock Policy

    +

    Selecting Lock Policy

    There is a single _Sp_counted_base class, which is a template parameterized on the enum @@ -579,7 +579,7 @@ used when libstdc++ is built without --enable-threadsext/atomicity.h, which detect if the program is multi-threaded. If only one thread of execution exists in the program then less expensive non-atomic operations are used. -

    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 @@ -612,13 +612,13 @@ is called. Users should not try to use this. As well as the extra constructors, this implementation also needs some members of _Sp_counted_deleter to be protected where they could otherwise be private. -

    Use

    Examples

    +

    Use

    Examples

    Examples of use can be found in the testsuite, under testsuite/tr1/2_general_utilities/shared_ptr, testsuite/20_util/shared_ptr and testsuite/20_util/weak_ptr. -

    Unresolved Issues

    +

    Unresolved Issues

    The shared_ptr atomic access clause in the C++11 standard is not implemented in GCC.

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

    Bibliography

    +

    Bibliography

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

    + .

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

    + .

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

    + .

    Boost C++ Libraries documentation, shared_ptr diff --git a/libstdc++-v3/doc/html/manual/mt_allocator.html b/libstdc++-v3/doc/html/manual/mt_allocator.html index 5efda940418..a0c1f58c854 100644 --- a/libstdc++-v3/doc/html/manual/mt_allocator.html +++ b/libstdc++-v3/doc/html/manual/mt_allocator.html @@ -1,9 +1,9 @@ -Chapter 20. The mt_allocator

    Chapter 20. The mt_allocator
    Prev Part III.  +Chapter 20. The mt_allocator
    Chapter 20. The mt_allocator
    Prev Part III.  Extensions - Next

    Chapter 20. The mt_allocator

    Table of Contents

    Intro
    Design Issues
    Overview
    Implementation
    Tunable Parameters
    Initialization
    Deallocation Notes
    Single Thread Example
    Multiple Thread Example

    +

    		 Next

    Chapter 20. The mt_allocator

    Table of Contents

    Intro
    Design Issues
    Overview
    Implementation
    Tunable Parameters
    Initialization
    Deallocation Notes
    Single Thread Example
    Multiple Thread Example

    Intro

    The mt allocator [hereinafter referred to simply as "the allocator"] is a fixed size (power of two) allocator that was initially @@ -20,4 +20,4 @@

    The aim of this document is to describe - from an application point of view - the "inner workings" of the allocator. -

    Prev Up Next
    Diagnostics Home Design Issues
    +

    Prev Up Next
    Diagnostics Home Design Issues
    diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch20s02.html b/libstdc++-v3/doc/html/manual/mt_allocator_design.html similarity index 60% rename from libstdc++-v3/doc/html/manual/bk01pt03ch20s02.html rename to libstdc++-v3/doc/html/manual/mt_allocator_design.html index db0141c9281..9cb6e231cb2 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch20s02.html +++ b/libstdc++-v3/doc/html/manual/mt_allocator_design.html @@ -1,6 +1,6 @@ -Design Issues
    Design Issues
    Prev Chapter 20. The mt_allocator Next

    Design Issues

    Overview

    There are three general components to the allocator: a datum +Design Issues

    Design Issues
    Prev Chapter 20. The mt_allocator Next

    Design Issues

    Overview

    There are three general components to the allocator: a datum describing the characteristics of the memory pool, a policy class containing this pool that links instantiation types to common or individual pools, and a class inheriting from the policy class that is @@ -36,4 +36,4 @@ tuning, for instance.

    This class has the interface required for standard library allocator classes, namely member functions allocate and deallocate, plus others. -

    Prev Up Next
    Chapter 20. The mt_allocator Home Implementation
    +

    Prev Up Next
    Chapter 20. The mt_allocator Home Implementation
    diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch20s05.html b/libstdc++-v3/doc/html/manual/mt_allocator_ex_multi.html similarity index 77% rename from libstdc++-v3/doc/html/manual/bk01pt03ch20s05.html rename to libstdc++-v3/doc/html/manual/mt_allocator_ex_multi.html index 778b86c9a07..2aa8f1a9dd4 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch20s05.html +++ b/libstdc++-v3/doc/html/manual/mt_allocator_ex_multi.html @@ -1,6 +1,6 @@ -Multiple Thread Example
    Multiple Thread Example
    Prev Chapter 20. The mt_allocator Next

    Multiple Thread Example

    +Multiple Thread Example

    Multiple Thread Example
    Prev Chapter 20. The mt_allocator Next

    Multiple Thread Example

    In the ST example we never used the thread_id variable present in each block. Let's start by explaining the purpose of this in a MT application.

    @@ -104,4 +104,4 @@ mutex to be locked) this operation is also made in chunks of blocks a threads freelist mentioned above). The "formula" used can probably be improved to further reduce the risk of blocks being "bounced back and forth" between freelists. -

    Prev Up Next
    Single Thread Example Home Chapter 21. The bitmap_allocator
    +

    Prev Up Next
    Single Thread Example Home Chapter 21. The bitmap_allocator
    diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch20s04.html b/libstdc++-v3/doc/html/manual/mt_allocator_ex_single.html similarity index 66% rename from libstdc++-v3/doc/html/manual/bk01pt03ch20s04.html rename to libstdc++-v3/doc/html/manual/mt_allocator_ex_single.html index a094e221856..4957db990ce 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch20s04.html +++ b/libstdc++-v3/doc/html/manual/mt_allocator_ex_single.html @@ -1,6 +1,6 @@ -Single Thread Example
    Single Thread Example
    Prev Chapter 20. The mt_allocator Next

    Single Thread Example

    +Single Thread Example

    Single Thread Example
    Prev Chapter 20. The mt_allocator Next

    Single Thread Example

    Let's start by describing how the data on a freelist is laid out in memory. This is the first two blocks in freelist for thread id 3 in bin 3 (8 bytes): 

    @@ -76,4 +76,4 @@ of the global freelist and update the pointer as needed
 The decision to add deallocated blocks to the front of the freelist was made
 after a set of performance measurements that showed that this is roughly 10%
 faster than maintaining a set of "last pointers" as well.
-
    Prev Up Next
    Implementation Home Multiple Thread Example
    +

    Prev Up Next
    Implementation Home Multiple Thread Example
    diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch20s03.html b/libstdc++-v3/doc/html/manual/mt_allocator_impl.html similarity index 83% rename from libstdc++-v3/doc/html/manual/bk01pt03ch20s03.html rename to libstdc++-v3/doc/html/manual/mt_allocator_impl.html index 89066482cc8..4b27c48d6ea 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch20s03.html +++ b/libstdc++-v3/doc/html/manual/mt_allocator_impl.html @@ -1,6 +1,6 @@ -Implementation
    Implementation
    Prev Chapter 20. The mt_allocator Next

    Implementation

    Tunable Parameters

    Certain allocation parameters can be modified, or tuned. There +Implementation

    Implementation
    Prev Chapter 20. The mt_allocator Next

    Implementation

    Tunable Parameters

    Certain allocation parameters can be modified, or tuned. There exists a nested struct __pool_base::_Tune that contains all these parameters, which include settings for

    • Alignment

    • Maximum bytes before calling ::operator new directly

    • Minimum bytes

    • Size of underlying global allocations

    • Maximum number of supported threads

    • Migration of deallocations to the global free list

    • Shunt for global new and delete

    Adjusting parameters for a given instance of an allocator can only @@ -158,4 +158,4 @@ implementation-specific, and subject to change. For an example of a pool that frees memory, see the following example. -

    Prev Up Next
    Design Issues Home Single Thread Example
    +

    Prev Up Next
    Design Issues Home Single Thread Example
    diff --git a/libstdc++-v3/doc/html/manual/numerics.html b/libstdc++-v3/doc/html/manual/numerics.html index 0a51776df4d..9bd9952dce7 100644 --- a/libstdc++-v3/doc/html/manual/numerics.html +++ b/libstdc++-v3/doc/html/manual/numerics.html @@ -1,13 +1,13 @@ -Chapter 12.  Numerics
    Chapter 12.  +Chapter 12.  Numerics
    Chapter 12.  Numerics
    Prev Part II.  Standard Contents  Next

    Chapter 12.  Numerics - +

    Table of Contents

    Complex
    complex Processing
    Generalized Operations
    Interacting with C
    Numerics vs. Arrays
    C99

    Complex

    complex Processing

    Using complex<> becomes even more comple- er, sorry, @@ -28,7 +28,7 @@ <complex.h> includes both <complex> and the C99 <complex.h> (if the C library provides it). -

    Prev Up Next
    Chapter 11.  +

    Prev Up Next
    Chapter 11.  Algorithms  Home Generalized Operations
    diff --git a/libstdc++-v3/doc/html/manual/numerics_and_c.html b/libstdc++-v3/doc/html/manual/numerics_and_c.html index 0897edbaf97..e1ddbe9e971 100644 --- a/libstdc++-v3/doc/html/manual/numerics_and_c.html +++ b/libstdc++-v3/doc/html/manual/numerics_and_c.html @@ -1,6 +1,6 @@ -Interacting with C
    Interacting with C
    Prev Chapter 12.  +Interacting with C
    Interacting with C
    Prev Chapter 12.  Numerics  Next

    Interacting with C

    Numerics vs. Arrays

    One of the major reasons why FORTRAN can chew through numbers so well diff --git a/libstdc++-v3/doc/html/manual/pairs.html b/libstdc++-v3/doc/html/manual/pairs.html index 130c63254f0..a02f349f87c 100644 --- a/libstdc++-v3/doc/html/manual/pairs.html +++ b/libstdc++-v3/doc/html/manual/pairs.html @@ -1,6 +1,6 @@ -Pairs

    Pairs
    Prev Chapter 6.  +Pairs
    Pairs
    Prev Chapter 6.  Utilities  Next

    Pairs

    The pair<T1,T2> is a simple and handy way to diff --git a/libstdc++-v3/doc/html/manual/parallel_mode.html b/libstdc++-v3/doc/html/manual/parallel_mode.html index c9f9d905b6f..fec97e53c5d 100644 --- a/libstdc++-v3/doc/html/manual/parallel_mode.html +++ b/libstdc++-v3/doc/html/manual/parallel_mode.html @@ -1,9 +1,9 @@ -Chapter 18. Parallel Mode

    Chapter 18. Parallel Mode
    Prev Part III.  +Chapter 18. Parallel Mode
    Chapter 18. Parallel Mode
    Prev Part III.  Extensions - Next

    Chapter 18. Parallel Mode

    Table of Contents

    Intro
    Semantics
    Using
    Prerequisite Compiler Flags
    Using Parallel Mode
    Using Specific Parallel Components
    Design
    Interface Basics
    Configuration and Tuning
    Setting up the OpenMP Environment
    Compile Time Switches
    Run Time Settings and Defaults
    Implementation Namespaces
    Testing
    Bibliography

    The libstdc++ parallel mode is an experimental parallel +

    		 Next

    Chapter 18. Parallel Mode

    Table of Contents

    Intro
    Semantics
    Using
    Prerequisite Compiler Flags
    Using Parallel Mode
    Using Specific Parallel Components
    Design
    Interface Basics
    Configuration and Tuning
    Setting up the OpenMP Environment
    Compile Time Switches
    Run Time Settings and Defaults
    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,12 +13,12 @@ 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) - .

    Prev Up Next
    Design Home Semantics
    + .

    Prev Up Next
    Design Home Semantics
    diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch18s04.html b/libstdc++-v3/doc/html/manual/parallel_mode_design.html similarity index 87% rename from libstdc++-v3/doc/html/manual/bk01pt03ch18s04.html rename to libstdc++-v3/doc/html/manual/parallel_mode_design.html index baf2230d5a2..e0c197039fb 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch18s04.html +++ b/libstdc++-v3/doc/html/manual/parallel_mode_design.html @@ -1,6 +1,6 @@ -Design
    Design
    Prev Chapter 18. Parallel Mode Next

    Design

    +Design

    Design
    Prev Chapter 18. Parallel Mode Next

    Design

    Interface Basics

    All parallel algorithms are intended to have signatures that are equivalent to the ISO C++ algorithms replaced. For instance, the @@ -210,4 +210,4 @@ __gnu_parallel.

    More information, and an organized index of types and functions related to the parallel mode on a per-namespace basis, can be found in the generated source documentation. -

    Prev Up Next
    Using Home Testing
    +

    Prev Up Next
    Using Home Testing
    diff --git a/libstdc++-v3/doc/html/manual/parallel_mode_semantics.html b/libstdc++-v3/doc/html/manual/parallel_mode_semantics.html new file mode 100644 index 00000000000..03595f4ad71 --- /dev/null +++ b/libstdc++-v3/doc/html/manual/parallel_mode_semantics.html @@ -0,0 +1,11 @@ + + +Semantics
    Semantics
    Prev Chapter 18. Parallel Mode Next

    Semantics

    The parallel mode STL algorithms are currently not exception-safe, +i.e. user-defined functors must not throw exceptions. +Also, the order of execution is not guaranteed for some functions, of course. +Therefore, user-defined functors should not have any concurrent side effects. +

    Since the current GCC OpenMP implementation does not support +OpenMP parallel regions in concurrent threads, +it is not possible to call parallel STL algorithm in +concurrent threads, either. +It might work with other compilers, though.

    Prev Up Next
    Chapter 18. Parallel Mode Home Using
    diff --git a/libstdc++-v3/doc/html/manual/parallel_mode_test.html b/libstdc++-v3/doc/html/manual/parallel_mode_test.html new file mode 100644 index 00000000000..7e928e84128 --- /dev/null +++ b/libstdc++-v3/doc/html/manual/parallel_mode_test.html @@ -0,0 +1,26 @@ + + +Testing
    Testing
    Prev Chapter 18. Parallel Mode Next

    Testing

    + Both the normal conformance and regression tests and the + supplemental performance tests work. +

    + To run the conformance and regression tests with the parallel mode + active, + 

    +  make check-parallel
+

    + The log and summary files for conformance testing are in the + testsuite/parallel directory. +

    + To run the performance tests with the parallel mode active, + 

    +  make check-performance-parallel
+

    + The result file for performance testing are in the + testsuite directory, in the file + libstdc++_performance.sum. In addition, the + policy-based containers have their own visualizations, which have + additional software dependencies than the usual bare-boned text + file, and can be generated by using the make + doc-performance rule in the testsuite's Makefile. +

    Prev Up Next
    Design Home Chapter 19. Profile Mode
    diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch18s03.html b/libstdc++-v3/doc/html/manual/parallel_mode_using.html similarity index 88% rename from libstdc++-v3/doc/html/manual/bk01pt03ch18s03.html rename to libstdc++-v3/doc/html/manual/parallel_mode_using.html index 34c54edc70b..0b2a784454e 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch18s03.html +++ b/libstdc++-v3/doc/html/manual/parallel_mode_using.html @@ -1,6 +1,6 @@ -Using
    Using
    Prev Chapter 18. Parallel Mode Next

    Using

    Prerequisite Compiler Flags

    +Using

    Using
    Prev Chapter 18. Parallel Mode Next

    Using

    Prerequisite Compiler Flags

    Any use of parallel functionality requires additional compiler and runtime support, in particular support for OpenMP. Adding this support is not difficult: just compile your application with the compiler @@ -63,4 +63,4 @@ Then compile this code with the prerequisite compiler flags flags for atomic operations.)

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

    Table 18.1. Parallel Algorithms

    AlgorithmHeaderParallel algorithmParallel header
    std::accumulatenumeric__gnu_parallel::accumulateparallel/numeric
    std::adjacent_differencenumeric__gnu_parallel::adjacent_differenceparallel/numeric
    std::inner_productnumeric__gnu_parallel::inner_productparallel/numeric
    std::partial_sumnumeric__gnu_parallel::partial_sumparallel/numeric
    std::adjacent_findalgorithm__gnu_parallel::adjacent_findparallel/algorithm
    std::countalgorithm__gnu_parallel::countparallel/algorithm
    std::count_ifalgorithm__gnu_parallel::count_ifparallel/algorithm
    std::equalalgorithm__gnu_parallel::equalparallel/algorithm
    std::findalgorithm__gnu_parallel::findparallel/algorithm
    std::find_ifalgorithm__gnu_parallel::find_ifparallel/algorithm
    std::find_first_ofalgorithm__gnu_parallel::find_first_ofparallel/algorithm
    std::for_eachalgorithm__gnu_parallel::for_eachparallel/algorithm
    std::generatealgorithm__gnu_parallel::generateparallel/algorithm
    std::generate_nalgorithm__gnu_parallel::generate_nparallel/algorithm
    std::lexicographical_comparealgorithm__gnu_parallel::lexicographical_compareparallel/algorithm
    std::mismatchalgorithm__gnu_parallel::mismatchparallel/algorithm
    std::searchalgorithm__gnu_parallel::searchparallel/algorithm
    std::search_nalgorithm__gnu_parallel::search_nparallel/algorithm
    std::transformalgorithm__gnu_parallel::transformparallel/algorithm
    std::replacealgorithm__gnu_parallel::replaceparallel/algorithm
    std::replace_ifalgorithm__gnu_parallel::replace_ifparallel/algorithm
    std::max_elementalgorithm__gnu_parallel::max_elementparallel/algorithm
    std::mergealgorithm__gnu_parallel::mergeparallel/algorithm
    std::min_elementalgorithm__gnu_parallel::min_elementparallel/algorithm
    std::nth_elementalgorithm__gnu_parallel::nth_elementparallel/algorithm
    std::partial_sortalgorithm__gnu_parallel::partial_sortparallel/algorithm
    std::partitionalgorithm__gnu_parallel::partitionparallel/algorithm
    std::random_shufflealgorithm__gnu_parallel::random_shuffleparallel/algorithm
    std::set_unionalgorithm__gnu_parallel::set_unionparallel/algorithm
    std::set_intersectionalgorithm__gnu_parallel::set_intersectionparallel/algorithm
    std::set_symmetric_differencealgorithm__gnu_parallel::set_symmetric_differenceparallel/algorithm
    std::set_differencealgorithm__gnu_parallel::set_differenceparallel/algorithm
    std::sortalgorithm__gnu_parallel::sortparallel/algorithm
    std::stable_sortalgorithm__gnu_parallel::stable_sortparallel/algorithm
    std::unique_copyalgorithm__gnu_parallel::unique_copyparallel/algorithm

    Prev Up Next
    Semantics Home Design
    +

    Table 18.1. Parallel Algorithms

    AlgorithmHeaderParallel algorithmParallel header
    std::accumulatenumeric__gnu_parallel::accumulateparallel/numeric
    std::adjacent_differencenumeric__gnu_parallel::adjacent_differenceparallel/numeric
    std::inner_productnumeric__gnu_parallel::inner_productparallel/numeric
    std::partial_sumnumeric__gnu_parallel::partial_sumparallel/numeric
    std::adjacent_findalgorithm__gnu_parallel::adjacent_findparallel/algorithm
    std::countalgorithm__gnu_parallel::countparallel/algorithm
    std::count_ifalgorithm__gnu_parallel::count_ifparallel/algorithm
    std::equalalgorithm__gnu_parallel::equalparallel/algorithm
    std::findalgorithm__gnu_parallel::findparallel/algorithm
    std::find_ifalgorithm__gnu_parallel::find_ifparallel/algorithm
    std::find_first_ofalgorithm__gnu_parallel::find_first_ofparallel/algorithm
    std::for_eachalgorithm__gnu_parallel::for_eachparallel/algorithm
    std::generatealgorithm__gnu_parallel::generateparallel/algorithm
    std::generate_nalgorithm__gnu_parallel::generate_nparallel/algorithm
    std::lexicographical_comparealgorithm__gnu_parallel::lexicographical_compareparallel/algorithm
    std::mismatchalgorithm__gnu_parallel::mismatchparallel/algorithm
    std::searchalgorithm__gnu_parallel::searchparallel/algorithm
    std::search_nalgorithm__gnu_parallel::search_nparallel/algorithm
    std::transformalgorithm__gnu_parallel::transformparallel/algorithm
    std::replacealgorithm__gnu_parallel::replaceparallel/algorithm
    std::replace_ifalgorithm__gnu_parallel::replace_ifparallel/algorithm
    std::max_elementalgorithm__gnu_parallel::max_elementparallel/algorithm
    std::mergealgorithm__gnu_parallel::mergeparallel/algorithm
    std::min_elementalgorithm__gnu_parallel::min_elementparallel/algorithm
    std::nth_elementalgorithm__gnu_parallel::nth_elementparallel/algorithm
    std::partial_sortalgorithm__gnu_parallel::partial_sortparallel/algorithm
    std::partitionalgorithm__gnu_parallel::partitionparallel/algorithm
    std::random_shufflealgorithm__gnu_parallel::random_shuffleparallel/algorithm
    std::set_unionalgorithm__gnu_parallel::set_unionparallel/algorithm
    std::set_intersectionalgorithm__gnu_parallel::set_intersectionparallel/algorithm
    std::set_symmetric_differencealgorithm__gnu_parallel::set_symmetric_differenceparallel/algorithm
    std::set_differencealgorithm__gnu_parallel::set_differenceparallel/algorithm
    std::sortalgorithm__gnu_parallel::sortparallel/algorithm
    std::stable_sortalgorithm__gnu_parallel::stable_sortparallel/algorithm
    std::unique_copyalgorithm__gnu_parallel::unique_copyparallel/algorithm

    Prev Up Next
    Semantics Home Design
    diff --git a/libstdc++-v3/doc/html/manual/policy_based_data_structures_test.html b/libstdc++-v3/doc/html/manual/policy_based_data_structures_test.html index f5e51a90671..88e459b8082 100644 --- a/libstdc++-v3/doc/html/manual/policy_based_data_structures_test.html +++ b/libstdc++-v3/doc/html/manual/policy_based_data_structures_test.html @@ -1,6 +1,6 @@ -Testing
    Testing
    Prev Chapter 22. Policy-Based Data Structures Next

    Testing

    Regression

    The library contains a single comprehensive regression test. +Testing

    Testing
    Prev Chapter 22. Policy-Based Data Structures Next

    Testing

    Regression

    The library contains a single comprehensive regression test. For a given container type in this library, the test creates an object of the container type and an object of the corresponding standard type (e.g., std::set). It @@ -22,7 +22,8 @@ this library's containers and the containers' value-types are configured to use this allocator.

    For granularity, the test is split into the several sources, each checking only some containers.

    For more details, consult the files in - testsuite/ext/pb_ds/regression.

    Performance

    Hash-Based

    + testsuite/ext/pb_ds/regression. +

    Performance

    Hash-Based

    Text find

    Description @@ -34,14 +35,10 @@ time for find as a function of the number of values inserted.

    It uses the test file: - - performance/ext/pb_ds/text_find_timing_test.cc - + performance/ext/pb_ds/text_find_timing_test.cc

    And uses the data file: - - filethirty_years_among_the_dead_preproc.txt - + filethirty_years_among_the_dead_preproc.txt

    The test checks the effect of different range-hashing functions, trigger policies, and cache-hashing policies.

    @@ -172,9 +169,7 @@ for find as a function of the number of values inserted.

    It uses the test file: - - performance/ext/pb_ds/random_int_find_timing.cc - + performance/ext/pb_ds/random_int_find_timing.cc

    The test checks the effect of different underlying hash-tables, range-hashing functions, and trigger policies.

    @@ -376,9 +371,7 @@ for operator[] as a function of the number of values inserted.

    It uses the test file: - - performance/ext/pb_ds/random_int_subscript_find_timing.cc - + performance/ext/pb_ds/random_int_subscript_find_timing.cc

    The test checks the effect of different underlying hash-tables, range-hashing functions, and trigger policies.

    Results @@ -565,9 +558,7 @@ operator[] as a function of the number of values inserted.

    It uses the test file: - - performance/ext/pb_ds/random_int_subscript_insert_timing.cc - + performance/ext/pb_ds/random_int_subscript_insert_timing.cc

    The test checks the effect of different underlying hash-tables.

    Results @@ -781,9 +772,7 @@ the containers. The keys are generated as follows. First, a uniform integer is created. Then it is then shifted left 8 bits.

    It uses the test file: - - performance/ext/pb_ds/hash_zlob_random_int_find_timing.cc - + performance/ext/pb_ds/hash_zlob_random_int_find_timing.cc

    The test checks the effect of different range-hashing functions and trigger policies.

    Results @@ -903,9 +892,7 @@ into a container, then erases all keys except one. It measures the final size of the container.

    It uses the test file: - - performance/ext/pb_ds/hash_random_int_erase_mem_usage.cc - + performance/ext/pb_ds/hash_random_int_erase_mem_usage.cc

    The test checks how containers adjust internally as their logical size decreases.

    Results @@ -1009,9 +996,7 @@ values inserted.

    The test checks the effect of different underlying data structures.

    It uses the test file: - - performance/ext/pb_ds/tree_text_insert_timing.cc - + performance/ext/pb_ds/tree_text_insert_timing.cc

    Results

    The three graphics below show the results for the native @@ -1124,9 +1109,7 @@ for find as a function of the number of values inserted.

    It uses the test file: - - performance/ext/pb_ds/text_find_timing.cc - + performance/ext/pb_ds/text_find_timing.cc

    The test checks the effect of different underlying data structures.

    Results @@ -1234,9 +1217,7 @@ key. It measures the average time for find as a function of the number of values inserted.

    It uses the test file: - - performance/ext/pb_ds/tree_text_lor_find_timing.cc - + performance/ext/pb_ds/tree_text_lor_find_timing.cc

    The test checks the effect of different underlying data structures in a locality-of-reference setting.

    Results @@ -1320,9 +1301,7 @@ and joining the containers as a function of the number of values inserted.

    It uses the test file: - - performance/ext/pb_ds/tree_split_join_timing.cc - + performance/ext/pb_ds/tree_split_join_timing.cc

    The test checks the performance difference of join as opposed to a sequence of insert operations; by implication, this test checks the most efficient way to erase a @@ -1429,9 +1408,7 @@ time for such queries as a function of the number of values inserted.

    It uses the test file: - - performance/ext/pb_ds/tree_order_statistics_timing.cc - + performance/ext/pb_ds/tree_order_statistics_timing.cc

    The test checks the performance difference of policies based on node-invariant as opposed to a external functions.

    Results @@ -1504,9 +1481,7 @@ a primary key. For the native multimaps, it searches a range obtained using std::equal_range on a primary key.

    It uses the test file: - - performance/ext/pb_ds/multimap_text_find_timing_small.cc - + performance/ext/pb_ds/multimap_text_find_timing_small.cc

    The test checks the find-time scalability of different "multimap" designs.

    Results @@ -1677,9 +1652,7 @@ a primary key. For the native multimaps, it searches a range obtained using std::equal_range on a primary key.

    It uses the test file: - - performance/ext/pb_ds/multimap_text_find_timing_large.cc - + performance/ext/pb_ds/multimap_text_find_timing_large.cc

    The test checks the find-time scalability of different "multimap" designs.

    Results @@ -1853,9 +1826,7 @@ std::equal_range, and inserts a value only if it was not contained already.

    It uses the test file: - - performance/ext/pb_ds/multimap_text_insert_timing_small.cc - + performance/ext/pb_ds/multimap_text_insert_timing_small.cc

    The test checks the insert-time scalability of different "multimap" designs.

    Results @@ -2029,9 +2000,7 @@ std::equal_range, and inserts a value only if it was not contained already.

    It uses the test file: - - performance/ext/pb_ds/multimap_text_insert_timing_large.cc - + performance/ext/pb_ds/multimap_text_insert_timing_large.cc

    The test checks the insert-time scalability of different "multimap" designs.

    Results @@ -2200,9 +2169,7 @@ to primary keys ranges to about 20.

    The test measures the memory use as a function of the number of values inserted.

    It uses the test file: - - performance/ext/pb_ds/multimap_text_insert_mem_usage_small.cc - + performance/ext/pb_ds/multimap_text_insert_mem_usage_small.cc

    The test checks the memory scalability of different "multimap" designs.

    Results @@ -2371,9 +2338,7 @@ to primary keys ranges to about 20.

    The test measures the memory use as a function of the number of values inserted.

    It uses the test file: - - performance/ext/pb_ds/multimap_text_insert_mem_usage_large.cc - + performance/ext/pb_ds/multimap_text_insert_mem_usage_large.cc

    The test checks the memory scalability of different "multimap" designs.

    Results @@ -2536,9 +2501,7 @@ for push as a function of the number of values pushed.

    It uses the test file: - - performance/ext/pb_ds/priority_queue_text_push_timing.cc - + performance/ext/pb_ds/priority_queue_text_push_timing.cc

    The test checks the effect of different underlying data structures.

    @@ -2674,9 +2637,7 @@ pop . It measures the average time for push as a function of the number of values.

    It uses the test file: - - performance/ext/pb_ds/priority_queue_text_push_pop_timing.cc - + performance/ext/pb_ds/priority_queue_text_push_pop_timing.cc

    The test checks the effect of different underlying data structures.

    @@ -2805,9 +2766,7 @@ measures the average time for push as a function of the number of values.

    It uses the test file: - - performance/ext/pb_ds/priority_queue_random_int_push_timing.cc - + performance/ext/pb_ds/priority_queue_random_int_push_timing.cc

    The test checks the effect of different underlying data structures.

    @@ -2926,9 +2885,7 @@ push and pop as a function of the number of values.

    It uses the test file: - - performance/ext/pb_ds/priority_queue_random_int_push_pop_timing.cc - + performance/ext/pb_ds/priority_queue_random_int_push_pop_timing.cc

    The test checks the effect of different underlying data structures.

    @@ -3028,9 +2985,7 @@ container. It measures the memory use as a function of the number of values pushed to the container.

    It uses the test file: - - performance/ext/pb_ds/priority_queue_text_pop_mem_usage.cc - + performance/ext/pb_ds/priority_queue_text_pop_mem_usage.cc

    The test checks the effect of different underlying data structures.

    @@ -3123,9 +3078,7 @@ one container and pushes them into the other. The test measures the average time as a function of the number of values.

    It uses the test file: - - performance/ext/pb_ds/priority_queue_text_join_timing.cc - + performance/ext/pb_ds/priority_queue_text_join_timing.cc

    The test checks the effect of different underlying data structures.

    @@ -3219,9 +3172,7 @@ time for modify as a function of the number of values.

    It uses the test file: - - performance/ext/pb_ds/priority_queue_text_modify_up_timing.cc - + performance/ext/pb_ds/priority_queue_text_modify_up_timing.cc

    The test checks the effect of different underlying data structures for graph algorithms settings. Note that making an arbitrary value larger (in the sense of the priority queue's @@ -3358,9 +3309,7 @@ time for modify as a function of the number of values.

    It uses the test file: - - performance/ext/pb_ds/priority_queue_text_modify_down_timing.cc - + performance/ext/pb_ds/priority_queue_text_modify_down_timing.cc

    The main purpose of this test is to contrast Priority Queue Text modify Up Timing Test.

    Results @@ -3810,4 +3759,4 @@ as well. It is difficult to find an a-priori characterization of graphs in which the actual number of modify operations will dwarf the number of push and - pop operations.

    Prev Up Next
    Design Home Acknowledgments
    + pop operations.

    Prev Up Next
    Design Home Acknowledgments
    diff --git a/libstdc++-v3/doc/html/manual/policy_data_structures.html b/libstdc++-v3/doc/html/manual/policy_data_structures.html index 8db0377059a..fe17aa6517c 100644 --- a/libstdc++-v3/doc/html/manual/policy_data_structures.html +++ b/libstdc++-v3/doc/html/manual/policy_data_structures.html @@ -1,6 +1,6 @@ -Chapter 22. Policy-Based Data Structures
    Chapter 22. Policy-Based Data Structures
    Prev Part III.  +Chapter 22. Policy-Based Data Structures
    Chapter 22. Policy-Based Data Structures
    Prev Part III.  Extensions  Next

    Chapter 22. Policy-Based Data Structures

    Table of Contents

    Intro
    Performance Issues
    Associative
    Priority Que
    Goals
    Associative
    Policy Choices
    Underlying Data Structures
    Iterators
    Functional
    Priority Queues
    Policy Choices
    Underlying Data Structures
    Binary Heaps
    Using
    Prerequisites
    Organization
    Tutorial
    Basic Use
    @@ -65,9 +65,7 @@ Text modify Up
    Text modify Down -
    Observations
    Associative
    Priority_Queue
    Acknowledgments
    - Bibliography -

    Intro

    +

    Observations
    Associative
    Priority_Queue
    Acknowledgments
    Bibliography

    Intro

    This is a library of policy-based elementary data structures: associative containers and priority queues. It is designed for high-performance, flexibility, semantic safety, and conformance to @@ -251,7 +249,7 @@ these invariants, one must supply some policy that is aware of these changes. Without this, it would be better to use a linked list (in itself very efficient for these purposes). -

    Figure 22.1. Node Invariants

    Node Invariants

    Underlying Data Structures

    +

    Figure 22.1. Node Invariants

    Node Invariants

    Underlying Data Structures

    The standard C++ library contains associative containers based on red-black trees and collision-chaining hash tables. These are very useful, but they are not ideal for all types of @@ -259,7 +257,7 @@

    The figure below shows the different underlying data structures currently supported in this library. -

    Figure 22.2. Underlying Associative Data Structures

    Underlying Associative Data Structures

    +

    Figure 22.2. Underlying Associative Data Structures

    Underlying Associative Data Structures

    A shows a collision-chaining hash-table, B shows a probing hash-table, C shows a red-black tree, D shows a splay tree, E shows a tree based on an ordered vector(implicit in the order of the @@ -378,7 +376,7 @@ no guarantee that the elements traversed will coincide with the logical elements between 1 and 5, as in label B. -

    Figure 22.3. Range Iteration in Different Data Structures

    Node Invariants

    +

    Figure 22.3. Range Iteration in Different Data Structures

    Node Invariants

    In our opinion, this problem is not caused just because red-black trees are order preserving while collision-chaining hash tables are (generally) not - it @@ -429,7 +427,7 @@ list, as in the graphic below, label B. Here the iterators are as light as can be, but the hash-table's operations are more complicated. -

    Figure 22.4. Point Iteration in Hash Data Structures

    Point Iteration in Hash Data Structures

    +

    Figure 22.4. Point Iteration in Hash Data Structures

    Point Iteration in Hash Data Structures

    It should be noted that containers based on collision-chaining hash-tables are not the only ones with this type of behavior; many other self-organizing data structures display it as well. @@ -445,7 +443,7 @@ container. The graphic below shows three cases: A1 and A2 show a red-black tree; B1 and B2 show a probing hash-table; C1 and C2 show a collision-chaining hash table. -

    Figure 22.5. Effect of erase in different underlying data structures

    Effect of erase in different underlying data structures

    1. +

      Figure 22.5. Effect of erase in different underlying data structures

      Effect of erase in different underlying data structures

      1. Erasing 5 from A1 yields A2. Clearly, an iterator to 3 can be de-referenced and incremented. The sequence of iterators changed, but in a way that is well-defined by the interface. @@ -681,7 +679,7 @@ typically less structured than an associative container's tree; the third simply uses an associative container. These are shown in the figure below with labels A1 and A2, B, and C. -

        Figure 22.6. Underlying Priority Queue Data Structures

        Underlying Priority Queue Data Structures

        +

        Figure 22.6. Underlying Priority Queue Data Structures

        Underlying Priority Queue Data Structures

        No single implementation can completely replace any of the others. Some have better push and pop amortized performance, some have @@ -773,9 +771,7 @@ std::priority_queue, however, this will generally change the order of growth of the entire sequence of operations. -

    - Bibliography -

    [biblio.abrahams97exception] +

    Bibliography

    [biblio.abrahams97exception] STL Exception Handling Contract @@ -1230,7 +1226,7 @@ . SGI .

    [biblio.select_man] - + select .

    [biblio.sleator84amortized] @@ -1309,4 +1305,4 @@ Wickland . National Psychological Institute - .

    Prev Up Next
    Implementation Home Using
    + .

    Prev Up Next
    Implementation Home Using
    diff --git a/libstdc++-v3/doc/html/manual/policy_data_structures_biblio.html b/libstdc++-v3/doc/html/manual/policy_data_structures_ack.html similarity index 61% rename from libstdc++-v3/doc/html/manual/policy_data_structures_biblio.html rename to libstdc++-v3/doc/html/manual/policy_data_structures_ack.html index 9676af805b0..b2cea711052 100644 --- a/libstdc++-v3/doc/html/manual/policy_data_structures_biblio.html +++ b/libstdc++-v3/doc/html/manual/policy_data_structures_ack.html @@ -1,6 +1,6 @@ -Acknowledgments
    Acknowledgments
    Prev Chapter 22. Policy-Based Data Structures Next

    Acknowledgments

    +Acknowledgments

    Acknowledgments
    Prev Chapter 22. Policy-Based Data Structures Next

    Acknowledgments

    Written by Ami Tavory and Vladimir Dreizin (IBM Haifa Research Laboratories), and Benjamin Kosnik (Red Hat).

    diff --git a/libstdc++-v3/doc/html/manual/policy_data_structures_design.html b/libstdc++-v3/doc/html/manual/policy_data_structures_design.html index 8247bf90038..e9329c92573 100644 --- a/libstdc++-v3/doc/html/manual/policy_data_structures_design.html +++ b/libstdc++-v3/doc/html/manual/policy_data_structures_design.html @@ -1,6 +1,6 @@ -Design

    Design
    Prev Chapter 22. Policy-Based Data Structures Next

    Design

    Concepts

    Null Policy Classes

    +Design

    Design
    Prev Chapter 22. Policy-Based Data Structures Next

    Design

    Concepts

    Null Policy Classes

    Associative containers are typically parametrized by various policies. For example, a hash-based associative container is parametrized by a hash-functor, transforming each key into an @@ -171,7 +171,7 @@ naturally; collision-chaining hash tables (label B) store equivalent-key values in the same bucket, the bucket can be arranged so that equivalent-key values are consecutive. -

    Figure 22.8. Non-unique Mapping Standard Containers

    Non-unique Mapping Standard Containers

    +

    Figure 22.8. Non-unique Mapping Standard Containers

    Non-unique Mapping Standard Containers

    Put differently, the standards' non-unique mapping associative-containers are associative containers that map primary keys to linked lists that are embedded into the @@ -253,7 +253,7 @@ first graphic above. Labels A and B, respectively. Each shaded box represents some size-type or secondary associative-container. -

    Figure 22.10. Non-unique Mapping Containers

    Non-unique Mapping Containers

    +

    Figure 22.10. Non-unique Mapping Containers

    Non-unique Mapping Containers

    In the first example above, then, one would use an associative container mapping each user to an associative container which maps each application id to a start time (see @@ -306,7 +306,7 @@ shows invariants for order-preserving containers: point-type iterators are synonymous with range-type iterators. Orthogonally, Cshows invariants for "set" - containers: iterators are synonymous with const iterators.

    Figure 22.11. Point Iterator Hierarchy

    Point Iterator Hierarchy

    Note that point-type iterators in self-organizing containers + containers: iterators are synonymous with const iterators.

    Figure 22.11. Point Iterator Hierarchy

    Point Iterator Hierarchy

    Note that point-type iterators in self-organizing containers (hash-based associative containers) lack movement operators, such as operator++ - in fact, this is the reason why this library differentiates from the standard C++ librarys @@ -345,7 +345,7 @@ to the question of whether point-type iterators and range-type iterators are valid. The graphic below shows tags corresponding to different types of invalidation guarantees. -

    Figure 22.12. Invalidation Guarantee Tags Hierarchy

    Invalidation Guarantee Tags Hierarchy

    • +

      Figure 22.12. Invalidation Guarantee Tags Hierarchy

      Invalidation Guarantee Tags Hierarchy

      • basic_invalidation_guarantee corresponds to a basic guarantee that a point-type iterator, a found pointer, or a found reference, remains valid as long @@ -429,7 +429,7 @@

        This library contains a container tag hierarchy corresponding to the diagram below. -

        Figure 22.13. Container Tag Hierarchy

        Container Tag Hierarchy

        +

        Figure 22.13. Container Tag Hierarchy

        Container Tag Hierarchy

        Given any container Cntnr, the tag of the underlying data structure can be found via typename Cntnr::container_category. @@ -488,7 +488,7 @@ collision-chaining container, except for the following.

        1. Comb_Probe_Fn describes how to transform a probe sequence into a sequence of positions within the table.

        2. Probe_Fn describes a probe sequence policy.

        Some of the default template values depend on the values of other parameters, and are explained below.

      Details
      Hash Policies
      General

      Following is an explanation of some functions which hashing - involves. The graphic below illustrates the discussion.

      Figure 22.14. Hash functions, ranged-hash functions, and + involves. The graphic below illustrates the discussion.

      Figure 22.14. Hash functions, ranged-hash functions, and range-hashing functions

      Hash functions, ranged-hash functions, and range-hashing functions

      Let U be a domain (e.g., the integers, or the strings of 3 characters). A hash-table algorithm needs to map elements of U "uniformly" into the range [0,..., m - @@ -505,7 +505,7 @@ Z+,

      which maps a non-negative hash value, and a non-negative range upper-bound into a non-negative integral in the range between 0 (inclusive) and the range upper bound (exclusive), - i.e., for any r in Z+,

      0 ≤ g(r, m) ≤ m - 1

      The resulting ranged-hash function, is

      Equation 22.1. Ranged Hash Function

      + i.e., for any r in Z+,

      0 ≤ g(r, m) ≤ m - 1

      The resulting ranged-hash function, is

      Equation 22.1. Ranged Hash Function

      f(u , m) = g(h(u), m)

      From the above, it is obvious that given g and h, f can always be composed (however the converse @@ -525,7 +525,7 @@ transforming the sequence of hash values into a sequence of positions.

      Range Hashing

      Some common choices for range-hashing functions are the division, multiplication, and middle-square methods ([biblio.knuth98sorting]), defined - as

      Equation 22.2. Range-Hashing, Division Method

      + as

      Equation 22.2. Range-Hashing, Division Method

      g(r, m) = r mod m

      g(r, m) = ⌈ u/v ( a r mod v ) ⌉

      and

      g(r, m) = ⌈ u/v ( r2 mod v ) ⌉

      respectively, for some positive integrals u and v (typically powers of 2), and some a. Each of @@ -536,9 +536,9 @@ implement using the low level % (modulo) operation (for any m), or the low level & (bit-mask) operation (for the case where - m is a power of 2), i.e.,

      Equation 22.3. Division via Prime Modulo

      + m is a power of 2), i.e.,

      Equation 22.3. Division via Prime Modulo

      g(r, m) = r % m -

      and

      Equation 22.4. Division via Bit Mask

      +

      and

      Equation 22.4. Division via Bit Mask

      g(r, m) = r & m - 1, (with m = 2k for some k)

      respectively.

      The % (modulo) implementation has the advantage that for @@ -564,7 +564,7 @@ s = [ s0,..., st - 1]

      be a string of t characters, each of which is from domain S. Consider the following ranged-hash - function:

      Equation 22.5.  + function:

      Equation 22.5.  A Standard String Hash Function

      f1(s, m) = ∑ i = @@ -576,7 +576,7 @@ of a long DNA sequence (and so S = {'A', 'C', 'G', 'T'}). In this case, scanning the entire string might be prohibitively expensive. A possible alternative might be to use - only the first k characters of the string, where

      |S|k ≥ m ,

      i.e., using the hash function

      Equation 22.6.  + only the first k characters of the string, where

      |S|k ≥ m ,

      i.e., using the hash function

      Equation 22.6.  Only k String DNA Hash

      f2(s, m) = ∑ i @@ -607,12 +607,12 @@ the container transforms the key into a non-negative integral using the hash functor (points B and C), and transforms the result into a position using the combining functor (points D - and E).

      Figure 22.15. Insert hash sequence diagram

      Insert hash sequence diagram

      If cc_hash_table's + and E).

      Figure 22.15. Insert hash sequence diagram

      Insert hash sequence diagram

      If cc_hash_table's hash-functor, Hash_Fn is instantiated by null_type , then Comb_Hash_Fn is taken to be a ranged-hash function. The graphic below shows an insert sequence diagram. The user inserts an element (point A), the container transforms the key into a position using the combining functor - (points B and C).

      Figure 22.16. Insert hash sequence diagram with a null policy

      Insert hash sequence diagram with a null policy

      + (points B and C).

      Figure 22.16. Insert hash sequence diagram with a null policy

      Insert hash sequence diagram with a null policy

      Probing tables

      gp_hash_table is parametrized by Hash_Fn, Probe_Fn, @@ -635,7 +635,7 @@ a linear probe and a quadratic probe function, respectively.

    The graphic below shows the relationships. -

    Figure 22.17. Hash policy class diagram

    Hash policy class diagram

    Resize Policies
    General

    Hash-tables, as opposed to trees, do not naturally grow or +

    Figure 22.17. Hash policy class diagram

    Hash policy class diagram

    Resize Policies
    General

    Hash-tables, as opposed to trees, do not naturally grow or shrink. It is necessary to specify policies to determine how and when a hash table should change its size. Usually, resize policies can be decomposed into orthogonal policies:

    1. A size policy indicating how a hash table @@ -668,10 +668,10 @@ and some load factor be denoted by Α. We would like to calculate the minimal length of k, such that if there were Α m elements in the hash table, a probe sequence of length k would - be found with probability at most 1/m.

      Figure 22.18. Balls and bins

      Balls and bins

      Denote the probability that a probe sequence of length + be found with probability at most 1/m.

      Figure 22.18. Balls and bins

      Balls and bins

      Denote the probability that a probe sequence of length k appears in bin i by pi, the length of the probe sequence of bin i by - li, and assume uniform distribution. Then

      Equation 22.7.  + li, and assume uniform distribution. Then

      Equation 22.7.  Probability of Probe Sequence of Length k

      p1 = @@ -685,7 +685,7 @@ li are negatively-dependent ([biblio.dubhashi98neg]) . Let - I(.) denote the indicator function. Then

      Equation 22.8.  + I(.) denote the indicator function. Then

      Equation 22.8.  Probability Probe Sequence in Some Bin

      P( existsi li ≥ k ) = @@ -724,7 +724,7 @@ a resize is needed, and if so, what is the new size (points D to G); following the resize, it notifies the policy that a resize has completed (point H); finally, the element is - inserted, and the policy notified (point I).

      Figure 22.19. Insert resize sequence diagram

      Insert resize sequence diagram

      In practice, a resize policy can be usually orthogonally + inserted, and the policy notified (point I).

      Figure 22.19. Insert resize sequence diagram

      Insert resize sequence diagram

      In practice, a resize policy can be usually orthogonally decomposed to a size policy and a trigger policy. Consequently, the library contains a single class for instantiating a resize policy: hash_standard_resize_policy @@ -733,8 +733,8 @@ both, and acts as a standard delegate ([biblio.gof]) to these policies.

      The two graphics immediately below show sequence diagrams illustrating the interaction between the standard resize policy - and its trigger and size policies, respectively.

      Figure 22.20. Standard resize policy trigger sequence - diagram

      Standard resize policy trigger sequence diagram

      Figure 22.21. Standard resize policy size sequence + and its trigger and size policies, respectively.

      Figure 22.20. Standard resize policy trigger sequence + diagram

      Standard resize policy trigger sequence diagram

      Figure 22.21. Standard resize policy size sequence diagram

      Standard resize policy size sequence diagram

      Predefined Policies

      The library includes the following instantiations of size and trigger policies:

      1. hash_load_check_resize_trigger implements a load check trigger policy.

      2. cc_hash_max_collision_check_resize_trigger @@ -877,7 +877,7 @@ each node, and maintains node invariants (see [biblio.clrs2001].) The first stores in each node the size of the sub-tree rooted at the node; the second stores at each node the maximal endpoint of the - intervals at the sub-tree rooted at the node.

        Figure 22.22. Tree node invariants

        Tree node invariants

        Supporting such trees is difficult for a number of + intervals at the sub-tree rooted at the node.

        Figure 22.22. Tree node invariants

        Tree node invariants

        Supporting such trees is difficult for a number of reasons:

        1. There must be a way to specify what a node's metadata should be (if any).

        2. Various operations can invalidate node invariants. The graphic below shows how a right rotation, @@ -891,7 +891,7 @@ metadata.

        3. It is not feasible to know in advance which methods trees can support. Besides the usual find method, the first tree can support a find_by_order method, while - the second can support an overlaps method.

        Figure 22.23. Tree node invalidation

        Tree node invalidation

        These problems are solved by a combination of two means: + the second can support an overlaps method.

      Figure 22.23. Tree node invalidation

      Tree node invalidation

      These problems are solved by a combination of two means: node iterators, and template-template node updater parameters.

      Node Iterators

      Each tree-based container defines two additional iterator types, const_node_iterator @@ -920,7 +920,7 @@ node_update class, and publicly subclasses node_update. The graphic below shows this scheme, as well as some predefined policies (which are explained - below).

      Figure 22.24. A tree and its update policy

      A tree and its update policy

      node_update (an instantiation of + below).

      Figure 22.24. A tree and its update policy

      A tree and its update policy

      node_update (an instantiation of Node_Update) must define metadata_type as the type of metadata it requires. For order statistics, e.g., metadata_type might be size_t. @@ -939,7 +939,7 @@ nd_it. For example, say node x in the graphic below label A has an invalid invariant, but its' children, y and z have valid invariants. After the invocation, all three - nodes should have valid invariants, as in label B.

      Figure 22.25. Restoring node invariants

      Restoring node invariants

      When a tree operation might invalidate some node invariant, + nodes should have valid invariants, as in label B.

      Figure 22.25. Restoring node invariants

      Restoring node invariants

      When a tree operation might invalidate some node invariant, it invokes this method in its node_update base to restore the invariant. For example, the graphic below shows an insert operation (point A); the tree performs some @@ -947,7 +947,7 @@ C, and D). (It is well known that any insert, erase, split or join, can restore all node invariants by a small number of node invariant updates ([biblio.clrs2001]) - .

      Figure 22.26. Insert update sequence

      Insert update sequence

      To complete the description of the scheme, three questions + .

      Figure 22.26. Insert update sequence

      Insert update sequence

      To complete the description of the scheme, three questions need to be answered:

      1. How can a tree which supports order statistics define a method such as find_by_order?

      2. How can the node updater base access methods of the tree?

      3. How can the following cyclic dependency be resolved? @@ -989,7 +989,7 @@ node's metadata (this is halting reducible). In the graphic below, assume the shaded node is inserted. The tree would have to traverse the useless path shown to the root, applying - redundant updates all the way.

      Figure 22.27. Useless update path

      Useless update path

      A null policy class, null_node_update + redundant updates all the way.

    Figure 22.27. Useless update path

    Useless update path

    A null policy class, null_node_update solves both these problems. The tree detects that node invariants are irrelevant, and defines all accordingly.

    Split and Join

    Tree-based containers support split and join methods. It is possible to split a tree so that it passes @@ -1072,7 +1072,7 @@ sub-tree with leafs "a" and "as". The maximal common prefix is "a". The internal node contains, consequently, to const iterators, one pointing to 'a', and the other to - 's'.

    Figure 22.28. A PATRICIA trie

    A PATRICIA trie

    Node Invariants

    Trie-based containers support node invariants, as do + 's'.

    Figure 22.28. A PATRICIA trie

    A PATRICIA trie

    Node Invariants

    Trie-based containers support node invariants, as do tree-based containers. There are two minor differences, though, which, unfortunately, thwart sharing them sharing the same node-updating policies:

    1. A trie's Node_Update template-template @@ -1081,7 +1081,7 @@ parametrized by Cmp_Fn.

    2. Tree-based containers store values in all nodes, while trie-based containers (at least in this implementation) store values in leafs.

    The graphic below shows the scheme, as well as some predefined - policies (which are explained below).

    Figure 22.29. A trie and its update policy

    A trie and its update policy

    This library offers the following pre-defined trie node + policies (which are explained below).

    Figure 22.29. A trie and its update policy

    A trie and its update policy

    This library offers the following pre-defined trie node updating policies:

    1. trie_order_statistics_node_update supports order statistics. @@ -1129,7 +1129,7 @@ simple list of integer keys. If we search for the integer 6, we are paying an overhead: the link with key 6 is only the fifth link; if it were the first link, it could be accessed - faster.

      Figure 22.30. A simple list

      A simple list

      List-update algorithms reorder lists as elements are + faster.

      Figure 22.30. A simple list

      A simple list

      List-update algorithms reorder lists as elements are accessed. They try to determine, by the access history, which keys to move to the front of the list. Some of these algorithms require adding some metadata alongside each entry.

      For example, in the graphic below label A shows the counter @@ -1139,7 +1139,7 @@ predetermined value, say 10, as shown in label C, the count is set to 0 and the node is moved to the front of the list, as in label D. -

      Figure 22.31. The counter algorithm

      The counter algorithm

    Policies

    this library allows instantiating lists with policies +

    Figure 22.31. The counter algorithm

    The counter algorithm

    Policies

    this library allows instantiating lists with policies implementing any algorithm moving nodes to the front of the list (policies implementing algorithms interchanging nodes are unsupported).

    Associative containers based on lists are parametrized by a @@ -1311,7 +1311,7 @@ sequence; the second uses a tree (or forest of trees), which is typically less structured than an associative container's tree; the third simply uses an associative container. These are - shown in the graphic below, in labels A1 and A2, label B, and label C.

    Figure 22.32. Underlying Priority-Queue Data-Structures.

    Underlying Priority-Queue Data-Structures.

    Roughly speaking, any value that is both pushed and popped + shown in the graphic below, in labels A1 and A2, label B, and label C.

    Figure 22.32. Underlying Priority-Queue Data-Structures.

    Underlying Priority-Queue Data-Structures.

    Roughly speaking, any value that is both pushed and popped from a priority queue must incur a logarithmic expense (in the amortized sense). Any priority queue implementation that would avoid this, would violate known bounds on comparison-based @@ -1391,7 +1391,7 @@ container Cntnr, the tag of the underlying data structure can be found via typename Cntnr::container_category; this is one of the possible tags shown in the graphic below. -

    Figure 22.33. Priority-Queue Data-Structure Tags.

    Priority-Queue Data-Structure Tags.

    Additionally, a traits mechanism can be used to query a +

    Figure 22.33. Priority-Queue Data-Structure Tags.

    Priority-Queue Data-Structure Tags.

    Additionally, a traits mechanism can be used to query a container type for its attributes. Given any container Cntnr, then 

    __gnu_pbds::container_traits<Cntnr>

    is a traits class identifying the properties of the diff --git a/libstdc++-v3/doc/html/manual/policy_data_structures_using.html b/libstdc++-v3/doc/html/manual/policy_data_structures_using.html index 7ddc83203a3..becda67400f 100644 --- a/libstdc++-v3/doc/html/manual/policy_data_structures_using.html +++ b/libstdc++-v3/doc/html/manual/policy_data_structures_using.html @@ -1,6 +1,6 @@ -Using

    Using
    Prev Chapter 22. Policy-Based Data Structures Next

    Using

    Prerequisites

    The library contains only header files, and does not require any +Using

    Using
    Prev Chapter 22. Policy-Based Data Structures Next

    Using

    Prerequisites

    The library contains only header files, and does not require any other libraries except the standard C++ library . All classes are defined in namespace __gnu_pbds. The library internally uses macros beginning with PB_DS, but @@ -62,7 +62,7 @@ In addition, there are the following diagnostics classes, used to report errors specific to this library's data structures. -

    Figure 22.7. Exception Hierarchy

    Exception Hierarchy

    Tutorial

    Basic Use

    +

    Figure 22.7. Exception Hierarchy

    Exception Hierarchy

    Tutorial

    Basic Use

    For the most part, the policy-based containers containers in namespace __gnu_pbds have the same interface as the equivalent containers in the standard C++ library, except for diff --git a/libstdc++-v3/doc/html/manual/profile_mode.html b/libstdc++-v3/doc/html/manual/profile_mode.html index c05d86de05c..bcfbc952dfd 100644 --- a/libstdc++-v3/doc/html/manual/profile_mode.html +++ b/libstdc++-v3/doc/html/manual/profile_mode.html @@ -1,9 +1,9 @@ -Chapter 19. Profile Mode

    Chapter 19. Profile Mode
    Prev Part III.  +Chapter 19. Profile Mode
    Chapter 19. Profile Mode
    Prev Part III.  Extensions - Next

    Chapter 19. Profile Mode

    Table of Contents

    Intro
    Using the Profile Mode
    Tuning the Profile Mode
    Design
    Wrapper Model
    Instrumentation
    Run Time Behavior
    Analysis and Diagnostics
    Cost Model
    Reports
    Testing
    Extensions for Custom Containers
    Empirical Cost Model
    Implementation Issues
    Stack Traces
    Symbolization of Instruction Addresses
    Concurrency
    Using the Standard Library in the Instrumentation Implementation
    Malloc Hooks
    Construction and Destruction of Global Objects
    Developer Information
    Big Picture
    How To Add A Diagnostic
    Diagnostics
    Diagnostic Template
    Containers
    Hashtable Too Small
    Hashtable Too Large
    Inefficient Hash
    Vector Too Small
    Vector Too Large
    Vector to Hashtable
    Hashtable to Vector
    Vector to List
    List to Vector
    List to Forward List (Slist)
    Ordered to Unordered Associative Container
    Algorithms
    Sort Algorithm Performance
    Data Locality
    Need Software Prefetch
    Linked Structure Locality
    Multithreaded Data Access
    Data Dependence Violations at Container Level
    False Sharing
    Statistics
    Bibliography

    Intro

    +

    		 Next

    Chapter 19. Profile Mode

    Table of Contents

    Intro
    Using the Profile Mode
    Tuning the Profile Mode
    Design
    Wrapper Model
    Instrumentation
    Run Time Behavior
    Analysis and Diagnostics
    Cost Model
    Reports
    Testing
    Extensions for Custom Containers
    Empirical Cost Model
    Implementation Issues
    Stack Traces
    Symbolization of Instruction Addresses
    Concurrency
    Using the Standard Library in the Instrumentation Implementation
    Malloc Hooks
    Construction and Destruction of Global Objects
    Developer Information
    Big Picture
    How To Add A Diagnostic
    Diagnostics
    Diagnostic Template
    Containers
    Hashtable Too Small
    Hashtable Too Large
    Inefficient Hash
    Vector Too Small
    Vector Too Large
    Vector to Hashtable
    Hashtable to Vector
    Vector to List
    List to Vector
    List to Forward List (Slist)
    Ordered to Unordered Associative Container
    Algorithms
    Sort Algorithm Performance
    Data Locality
    Need Software Prefetch
    Linked Structure Locality
    Multithreaded Data Access
    Data Dependence Violations at Container Level
    False Sharing
    Statistics
    Bibliography

    Intro

    Goal: Give performance improvement advice based on recognition of suboptimal usage patterns of the standard library.

    @@ -138,9 +138,9 @@ vector-size: improvement = 3: call stack = 0x804842c ... call context. (Environment variable not supported.)

    -

    Bibliography

    +

    Bibliography

    Perflint: A Context Sensitive Performance Advisor for C++ Programs . Lixia Liu. Silvius Rus. Copyright © 2009 . Proceedings of the 2009 International Symposium on Code Generation and Optimization - .

    Prev Up Next
    Testing Home Design
    + .

    Prev Up Next
    Testing Home Design
    diff --git a/libstdc++-v3/doc/html/manual/profile_mode_api.html b/libstdc++-v3/doc/html/manual/profile_mode_api.html new file mode 100644 index 00000000000..27cb681adbe --- /dev/null +++ b/libstdc++-v3/doc/html/manual/profile_mode_api.html @@ -0,0 +1,10 @@ + + +Extensions for Custom Containers
    Extensions for Custom Containers
    Prev Chapter 19. Profile Mode Next

    Extensions for Custom Containers

    + Many large projects use their own data structures instead of the ones in the + standard library. If these data structures are similar in functionality + to the standard library, they can be instrumented with the same hooks + that are used to instrument the standard library. + The instrumentation API is exposed in file + profiler.h (look for "Instrumentation hooks"). +

    Prev Up Next
    Design Home Empirical Cost Model
    diff --git a/libstdc++-v3/doc/html/manual/profile_mode_cost_model.html b/libstdc++-v3/doc/html/manual/profile_mode_cost_model.html new file mode 100644 index 00000000000..5392a27f72d --- /dev/null +++ b/libstdc++-v3/doc/html/manual/profile_mode_cost_model.html @@ -0,0 +1,18 @@ + + +Empirical Cost Model
    Empirical Cost Model
    Prev Chapter 19. Profile Mode Next

    Empirical Cost Model

    + Currently, the cost model uses formulas with predefined relative weights + for alternative containers or container implementations. For instance, + iterating through a vector is X times faster than iterating through a list. +

    + (Under development.) + We are working on customizing this to a particular machine by providing + an automated way to compute the actual relative weights for operations + on the given machine. +

    + (Under development.) + We plan to provide a performance parameter database format that can be + filled in either by hand or by an automated training mechanism. + The analysis module will then use this database instead of the built in. + generic parameters. +

    Prev Up Next
    Extensions for Custom Containers Home Implementation Issues
    diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch19s02.html b/libstdc++-v3/doc/html/manual/profile_mode_design.html similarity index 85% rename from libstdc++-v3/doc/html/manual/bk01pt03ch19s02.html rename to libstdc++-v3/doc/html/manual/profile_mode_design.html index 32a456f9a6b..8fee44a08ed 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch19s02.html +++ b/libstdc++-v3/doc/html/manual/profile_mode_design.html @@ -1,7 +1,7 @@ -Design
    Design
    Prev Chapter 19. Profile Mode Next

    Design

    -

    Table 19.1. Profile Code Location

    Code LocationUse
    libstdc++-v3/include/std/*Preprocessor code to redirect to profile extension headers.
    libstdc++-v3/include/profile/*Profile extension public headers (map, vector, ...).
    libstdc++-v3/include/profile/impl/*Profile extension internals. Implementation files are +Design
    Design
    Prev Chapter 19. Profile Mode Next

    Design

    +

    Table 19.1. Profile Code Location

    Code LocationUse
    libstdc++-v3/include/std/*Preprocessor code to redirect to profile extension headers.
    libstdc++-v3/include/profile/*Profile extension public headers (map, vector, ...).
    libstdc++-v3/include/profile/impl/*Profile extension internals. Implementation files are only included from impl/profiler.h, which is the only file included from the public headers.

    Wrapper Model

    @@ -119,4 +119,4 @@ it helps the user focus on the key problems and ignore the uninteresting ones. We created a profile directory in the test suite. Each diagnostic must come with at least two tests, one for false positives and one for false negatives. -

    Prev Up Next
    Chapter 19. Profile Mode Home Extensions for Custom Containers
    +

    Prev Up Next
    Chapter 19. Profile Mode Home Extensions for Custom Containers
    diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch19s06.html b/libstdc++-v3/doc/html/manual/profile_mode_devel.html similarity index 71% rename from libstdc++-v3/doc/html/manual/bk01pt03ch19s06.html rename to libstdc++-v3/doc/html/manual/profile_mode_devel.html index 2d7d63cbf35..2b6218c9b30 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch19s06.html +++ b/libstdc++-v3/doc/html/manual/profile_mode_devel.html @@ -1,6 +1,6 @@ -Developer Information
    Developer Information
    Prev Chapter 19. Profile Mode Next

    Developer Information

    Big Picture

    The profile mode headers are included with +Developer Information

    Developer Information
    Prev Chapter 19. Profile Mode Next

    Developer Information

    Big Picture

    The profile mode headers are included with -D_GLIBCXX_PROFILE through preprocessor directives in include/std/*.

    Instrumented implementations are provided in @@ -65,4 +65,4 @@ include/profile/impl/profiler_trace.h. Use __trace_vector_to_list as an example.

    Add documentation in file doc/xml/manual/profile_mode.xml. -

    Prev Up Next
    Implementation Issues Home Diagnostics
    +

    Prev Up Next
    Implementation Issues Home Diagnostics
    diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch19s07.html b/libstdc++-v3/doc/html/manual/profile_mode_diagnostics.html similarity index 91% rename from libstdc++-v3/doc/html/manual/bk01pt03ch19s07.html rename to libstdc++-v3/doc/html/manual/profile_mode_diagnostics.html index a456facf27e..ff3d5f943a4 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch19s07.html +++ b/libstdc++-v3/doc/html/manual/profile_mode_diagnostics.html @@ -1,6 +1,6 @@ -Diagnostics
    Diagnostics
    Prev Chapter 19. Profile Mode Next

    Diagnostics

    +Diagnostics

    Diagnostics
    Prev Chapter 19. Profile Mode Next

    Diagnostics

    The table below presents all the diagnostics we intend to implement. Each diagnostic has a corresponding compile time switch -D_GLIBCXX_PROFILE_<diagnostic>. @@ -18,23 +18,23 @@ A high accuracy means that the diagnostic is unlikely to be wrong. These grades are not perfect. They are just meant to guide users with specific needs or time budgets. -

    Table 19.2. Profile Diagnostics

    GroupFlagBenefitCostFreq.Implemented 
    - CONTAINERS - HASHTABLE_TOO_SMALL101 10yes
      - HASHTABLE_TOO_LARGE51 10yes
      - INEFFICIENT_HASH73 10yes
      - VECTOR_TOO_SMALL81 10yes
      - VECTOR_TOO_LARGE51 10yes
      - VECTOR_TO_HASHTABLE77 10no
      - HASHTABLE_TO_VECTOR77 10no
      - VECTOR_TO_LIST85 10yes
      - LIST_TO_VECTOR105 10no
      - ORDERED_TO_UNORDERED105 10only map/unordered_map
    - ALGORITHMS - SORT78 7no
    - LOCALITY - SOFTWARE_PREFETCH88 5no
      - RBTREE_LOCALITY48 5no
      +

    Table 19.2. Profile Diagnostics

    GroupFlagBenefitCostFreq.Implemented 
    + CONTAINERS + HASHTABLE_TOO_SMALL101 10yes
      + HASHTABLE_TOO_LARGE51 10yes
      + INEFFICIENT_HASH73 10yes
      + VECTOR_TOO_SMALL81 10yes
      + VECTOR_TOO_LARGE51 10yes
      + VECTOR_TO_HASHTABLE77 10no
      + HASHTABLE_TO_VECTOR77 10no
      + VECTOR_TO_LIST85 10yes
      + LIST_TO_VECTOR105 10no
      + ORDERED_TO_UNORDERED105 10only map/unordered_map
    + ALGORITHMS + SORT78 7no
    + LOCALITY + SOFTWARE_PREFETCH88 5no
      + RBTREE_LOCALITY48 5no
      FALSE_SHARING810 10no

    Diagnostic Template

    • Switch: _GLIBCXX_PROFILE_<diagnostic>.

    • Goal: What problem will it diagnose? @@ -555,4 +555,4 @@ sharing in multithreaded access at foo.cc:4. Detected N shared cache lines. This diagnostic will not issue any advice, but it will print statistics for each container construction site. The statistics will contain the cost of each operation actually performed on the container. -

    Prev Up Next
    Developer Information Home Chapter 20. The mt_allocator
    +

    Prev Up Next
    Developer Information Home Chapter 20. The mt_allocator
    diff --git a/libstdc++-v3/doc/html/manual/bk01pt03ch19s05.html b/libstdc++-v3/doc/html/manual/profile_mode_impl.html similarity index 68% rename from libstdc++-v3/doc/html/manual/bk01pt03ch19s05.html rename to libstdc++-v3/doc/html/manual/profile_mode_impl.html index 5b323918a5a..97912e617b3 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt03ch19s05.html +++ b/libstdc++-v3/doc/html/manual/profile_mode_impl.html @@ -1,6 +1,6 @@ -Implementation Issues
    Implementation Issues
    Prev Chapter 19. Profile Mode Next

    Implementation Issues

    Stack Traces

    +Implementation Issues

    Implementation Issues
    Prev Chapter 19. Profile Mode Next

    Implementation Issues

    Stack Traces

    Accurate stack traces are needed during profiling since we group events by call context and dynamic instance. Without accurate traces, diagnostics may be hard to interpret. For instance, when giving advice to the user @@ -48,4 +48,4 @@ However, we cannot do the same at destruction time. The trace is written by a function registered by atexit, thus invoked by exit. -

    Prev Up Next
    Empirical Cost Model Home Developer Information
    +

    Prev Up Next
    Empirical Cost Model Home Developer Information
    diff --git a/libstdc++-v3/doc/html/manual/setup.html b/libstdc++-v3/doc/html/manual/setup.html index bb537097df9..07756453972 100644 --- a/libstdc++-v3/doc/html/manual/setup.html +++ b/libstdc++-v3/doc/html/manual/setup.html @@ -1,6 +1,6 @@ -Chapter 2. Setup
    Chapter 2. Setup
    Prev Part I.  +Chapter 2. Setup
    Chapter 2. Setup
    Prev Part I.  Introduction  Next

    Chapter 2. Setup

    Table of Contents

    Prerequisites
    Configure
    Make

    To transform libstdc++ sources into installed include files diff --git a/libstdc++-v3/doc/html/manual/source_code_style.html b/libstdc++-v3/doc/html/manual/source_code_style.html index 0927ece403c..180e6387dd7 100644 --- a/libstdc++-v3/doc/html/manual/source_code_style.html +++ b/libstdc++-v3/doc/html/manual/source_code_style.html @@ -1,6 +1,6 @@ -Coding Style

    Coding Style
    Prev Appendix A.  +Coding Style
    Coding Style
    Prev Appendix A.  Contributing  Next

    Coding Style

    diff --git a/libstdc++-v3/doc/html/manual/source_design_notes.html b/libstdc++-v3/doc/html/manual/source_design_notes.html index 5f5bb50f065..5d738bc236e 100644 --- a/libstdc++-v3/doc/html/manual/source_design_notes.html +++ b/libstdc++-v3/doc/html/manual/source_design_notes.html @@ -1,6 +1,6 @@ -Design Notes

    Design Notes
    Prev Appendix A.  +Design Notes
    Design Notes
    Prev Appendix A.  Contributing  Next

    Design Notes

    diff --git a/libstdc++-v3/doc/html/manual/source_organization.html b/libstdc++-v3/doc/html/manual/source_organization.html index c47baa24918..65457f13f96 100644 --- a/libstdc++-v3/doc/html/manual/source_organization.html +++ b/libstdc++-v3/doc/html/manual/source_organization.html @@ -1,6 +1,6 @@ -Directory Layout and Source Conventions

    Directory Layout and Source Conventions
    Prev Appendix A.  +Directory Layout and Source Conventions
    Directory Layout and Source Conventions
    Prev Appendix A.  Contributing  Next

    Directory Layout and Source Conventions

    diff --git a/libstdc++-v3/doc/html/manual/status.html b/libstdc++-v3/doc/html/manual/status.html index 20589f6722b..b8c96b5c412 100644 --- a/libstdc++-v3/doc/html/manual/status.html +++ b/libstdc++-v3/doc/html/manual/status.html @@ -1,6 +1,6 @@ -Chapter 1. Status

    Chapter 1. Status
    Prev Part I.  +Chapter 1. Status
    Chapter 1. Status
    Prev Part I.  Introduction  Next

    Chapter 1. Status

    Table of Contents

    Implementation Status
    C++ 1998/2003
    Implementation Status
    Implementation Specific Behavior
    C++ 2011
    Implementation Specific Behavior
    C++ TR1
    Implementation Specific Behavior
    C++ TR 24733
    License
    The Code: GPL
    The Documentation: GPL, FDL
    Bugs
    Implementation Bugs
    Standard Bugs

    Implementation Status

    C++ 1998/2003

    Implementation Status

    @@ -8,7 +8,7 @@ This status table is based on the table of contents of ISO/IEC 14882:2003.

    This page describes the C++ support in mainline GCC SVN, not in any particular release. -

    Table 1.1. C++ 1998/2003 Implementation Status

    SectionDescriptionStatusComments
    +

    Table 1.1. C++ 1998/2003 Implementation Status

    SectionDescriptionStatusComments
    18 Language support @@ -158,7 +158,7 @@ presence of the required flag.

    This page describes the C++11 support in mainline GCC SVN, not in any particular release. -

    Table 1.2. C++ 2011 Implementation Status

    SectionDescriptionStatusComments
    +

    Table 1.2. C++ 2011 Implementation Status

    SectionDescriptionStatusComments
    18 Language support @@ -175,7 +175,7 @@ particular release. Uses code from boost::shared_ptr.

    -
    20.7.2.3Class template weak_ptrY 
    20.7.2.4Class template emable_shared_from_thisY 
    20.7.2.5shared_ptr atomic accessPartial 
    20.7.2.6Smart pointer hash supportY 
    20.8Function objects  
    20.8.1Definitions  
    20.8.2Requirements  
    20.8.3Class template reference_wrapperY 
    20.8.4Arithmetic operationY 
    20.8.5ComparisonsY 
    20.8.6Logical operationsY 
    20.8.7Bitwise operationsY 
    20.8.8NegatorsY 
    20.8.9Function template bindY 
    20.8.10Function template mem_fnPartialMissing overloads for reference-qualified member functions
    20.8.11Polymorphic function wrappers  
    20.8.11.1Class bad_function_callY 
    20.8.11.2Class template functionPartialMissing allocator support
    20.8.12Class template hashY 
    20.9Metaprogramming and type traits  
    20.9.1RequirementsY 
    20.9.2Header <type_traits> synopsis  
    20.9.3Helper classesY 
    20.9.4Unary Type TraitsY 
    20.9.4.1Primary type categoriesY 
    20.9.4.2Composite type traitsY 
    20.9.4.3Type propertiesPartialMissing is_trivially_copyable, +
    20.7.2.3Class template weak_ptrY 
    20.7.2.4Class template emable_shared_from_thisY 
    20.7.2.5shared_ptr atomic accessPartial 
    20.7.2.6Smart pointer hash supportY 
    20.8Function objects  
    20.8.1Definitions  
    20.8.2Requirements  
    20.8.3Class template reference_wrapperY 
    20.8.4Arithmetic operationY 
    20.8.5ComparisonsY 
    20.8.6Logical operationsY 
    20.8.7Bitwise operationsY 
    20.8.8NegatorsY 
    20.8.9Function template bindY 
    20.8.10Function template mem_fnY 
    20.8.11Polymorphic function wrappers  
    20.8.11.1Class bad_function_callY 
    20.8.11.2Class template functionPartialMissing allocator support
    20.8.12Class template hashY 
    20.9Metaprogramming and type traits  
    20.9.1RequirementsY 
    20.9.2Header <type_traits> synopsis  
    20.9.3Helper classesY 
    20.9.4Unary Type TraitsY 
    20.9.4.1Primary type categoriesY 
    20.9.4.2Composite type traitsY 
    20.9.4.3Type propertiesPartialMissing is_trivially_copyable, is_trivially_constructible, is_trivially_default_constructible, is_trivially_copy_constructible, is_trivially_move_constructible, is_trivially_assignable, is_trivially_default_assignable, @@ -290,7 +290,7 @@ In this implementation the header names are prefixed by

    This page describes the TR1 support in mainline GCC SVN, not in any particular release. -

    Table 1.3. C++ TR1 Implementation Status

    SectionDescriptionStatusComments
    2General Utilities
    2.1Reference wrappers  
    2.1.1Additions to header <functional> synopsisY 
    2.1.2Class template reference_wrapper  
    2.1.2.1reference_wrapper construct/copy/destroyY 
    2.1.2.2reference_wrapper assignmentY 
    2.1.2.3reference_wrapper accessY 
    2.1.2.4reference_wrapper invocationY 
    2.1.2.5reference_wrapper helper functionsY 
    2.2Smart pointers  
    2.2.1Additions to header <memory> synopsisY 
    2.2.2Class bad_weak_ptrY 
    2.2.3Class template shared_ptr  +

    Table 1.3. C++ TR1 Implementation Status

    SectionDescriptionStatusComments
    2General Utilities
    2.1Reference wrappers  
    2.1.1Additions to header <functional> synopsisY 
    2.1.2Class template reference_wrapper  
    2.1.2.1reference_wrapper construct/copy/destroyY 
    2.1.2.2reference_wrapper assignmentY 
    2.1.2.3reference_wrapper accessY 
    2.1.2.4reference_wrapper invocationY 
    2.1.2.5reference_wrapper helper functionsY 
    2.2Smart pointers  
    2.2.1Additions to header <memory> synopsisY 
    2.2.2Class bad_weak_ptrY 
    2.2.3Class template shared_ptr 

    Uses code from boost::shared_ptr. @@ -311,7 +311,7 @@ decimal floating-point arithmetic

    This page describes the TR 24733 support in mainline GCC SVN, not in any particular release. -

    Table 1.4. C++ TR 24733 Implementation Status

    SectionDescriptionStatusComments
    +

    Table 1.4. C++ TR 24733 Implementation Status

    SectionDescriptionStatusComments
    0 Introduction diff --git a/libstdc++-v3/doc/html/manual/bk01pt02.html b/libstdc++-v3/doc/html/manual/std_contents.html similarity index 91% rename from libstdc++-v3/doc/html/manual/bk01pt02.html rename to libstdc++-v3/doc/html/manual/std_contents.html index 54309d482e6..f62bf9998e4 100644 --- a/libstdc++-v3/doc/html/manual/bk01pt02.html +++ b/libstdc++-v3/doc/html/manual/std_contents.html @@ -1,6 +1,6 @@ -Part II.  Standard Contents
    Part II.  +Part II.  Standard Contents
    Part II.  Standard Contents
    Prev The GNU C++ Library Manual Next

    Part II.  Standard Contents @@ -10,16 +10,16 @@
    Types
    Fundamental Types
    Numeric Properties
    NULL
    Dynamic Memory
    Termination
    Termination Handlers
    Verbose Terminate Handler
    5. Diagnostics -
    Exceptions
    API Reference
    Adding Data to exception
    Concept Checking
    6. +
    Exceptions
    API Reference
    Adding Data to exception
    Concept Checking
    6. Utilities -
    Functors
    Pairs
    Memory
    Allocators
    Requirements
    Design Issues
    Implementation
    Interface Design
    Selecting Default Allocation Policy
    Disabling Memory Caching
    Using a Specific Allocator
    Custom Allocators
    Extension Allocators
    auto_ptr
    Limitations
    Use in Containers
    shared_ptr
    Requirements
    Design Issues
    Implementation
    Class Hierarchy
    Thread Safety
    Selecting Lock Policy
    Related functions and classes
    Use
    Examples
    Unresolved Issues
    Acknowledgments
    Traits
    7. +
    Functors
    Pairs
    Memory
    Allocators
    Requirements
    Design Issues
    Implementation
    Interface Design
    Selecting Default Allocation Policy
    Disabling Memory Caching
    Using a Specific Allocator
    Custom Allocators
    Extension Allocators
    auto_ptr
    Limitations
    Use in Containers
    shared_ptr
    Requirements
    Design Issues
    Implementation
    Class Hierarchy
    Thread Safety
    Selecting Lock Policy
    Related functions and classes
    Use
    Examples
    Unresolved Issues
    Acknowledgments
    Traits
    7. Strings
    String Classes
    Simple Transformations
    Case Sensitivity
    Arbitrary Character Types
    Tokenizing
    Shrink to Fit
    CString (MFC)
    8. Localization -
    Locales
    locale
    Requirements
    Design
    Implementation
    Interacting with "C" locales
    Future
    Facets
    ctype
    Implementation
    Specializations
    Future
    codecvt
    Requirements
    Design
    wchar_t Size
    Support for Unicode
    Other Issues
    Implementation
    Use
    Future
    messages
    Requirements
    Design
    Implementation
    Models
    The GNU Model
    Use
    Future
    9. +
    Locales
    locale
    Requirements
    Design
    Implementation
    Interacting with "C" locales
    Future
    Facets
    ctype
    Implementation
    Specializations
    Future
    codecvt
    Requirements
    Design
    wchar_t Size
    Support for Unicode
    Other Issues
    Implementation
    Use
    Future
    messages
    Requirements
    Design
    Implementation
    Models
    The GNU Model
    Use
    Future
    9. Containers
    Sequences
    list
    list::size() is O(n)
    vector
    Space Overhead Management
    Associative
    Insertion Hints
    bitset
    Size Variable
    Type String
    Interacting with C
    Containers vs. Arrays
    10. diff --git a/libstdc++-v3/doc/html/manual/streambufs.html b/libstdc++-v3/doc/html/manual/streambufs.html index 4030501dadd..81e098c0f78 100644 --- a/libstdc++-v3/doc/html/manual/streambufs.html +++ b/libstdc++-v3/doc/html/manual/streambufs.html @@ -1,6 +1,6 @@ -Stream Buffers
    Stream Buffers
    Prev Chapter 13.  +Stream Buffers
    Stream Buffers
    Prev Chapter 13.  Input and Output  Next

    Stream Buffers

    Derived streambuf Classes

    diff --git a/libstdc++-v3/doc/html/manual/strings.html b/libstdc++-v3/doc/html/manual/strings.html index 70e3250d1b3..9fe4192058b 100644 --- a/libstdc++-v3/doc/html/manual/strings.html +++ b/libstdc++-v3/doc/html/manual/strings.html @@ -1,13 +1,13 @@ -Chapter 7.  Strings

    Chapter 7.  +Chapter 7.  Strings
    Chapter 7.  Strings
    Prev Part II.  Standard Contents  Next

    Chapter 7.  Strings - +

    Table of Contents

    String Classes
    Simple Transformations
    Case Sensitivity
    Arbitrary Character Types
    Tokenizing
    Shrink to Fit
    CString (MFC)

    String Classes

    Simple Transformations

    Here are Standard, simple, and portable ways to perform common transformations on a string instance, such as @@ -360,7 +360,7 @@ stringtok(Container &container, string const &in, libstdc++ string, the SGI string, and the SGI rope, and this is all before any allocator or traits customizations! (More choices than you can shake a stick at -- want fries with that?) -

    Prev Up Next
    Traits Home Chapter 8.  +

    Prev Up Next
    Traits Home Chapter 8.  Localization
    diff --git a/libstdc++-v3/doc/html/manual/stringstreams.html b/libstdc++-v3/doc/html/manual/stringstreams.html index e501e19444a..62382307565 100644 --- a/libstdc++-v3/doc/html/manual/stringstreams.html +++ b/libstdc++-v3/doc/html/manual/stringstreams.html @@ -1,6 +1,6 @@ -Memory Based Streams
    Memory Based Streams
    Prev Chapter 13.  +Memory Based Streams
    Memory Based Streams
    Prev Chapter 13.  Input and Output  Next

    Memory Based Streams

    Compatibility With strstream

    diff --git a/libstdc++-v3/doc/html/manual/support.html b/libstdc++-v3/doc/html/manual/support.html index 99fd48cd163..b9e8f657679 100644 --- a/libstdc++-v3/doc/html/manual/support.html +++ b/libstdc++-v3/doc/html/manual/support.html @@ -1,13 +1,13 @@ -Chapter 4.  Support

    Chapter 4.  +Chapter 4.  Support
    Chapter 4.  Support -
    Prev Part II.  +
    Prev Part II.  Standard Contents  Next

    Chapter 4.  Support - +

    Table of Contents

    Types
    Fundamental Types
    Numeric Properties
    NULL
    Dynamic Memory
    Termination
    Termination Handlers
    Verbose Terminate Handler

    This part deals with the functions called and objects created automatically during the course of a program's existence. @@ -125,6 +125,6 @@

    See the Effective C++ CD example -

    Prev Up Next
    Part II.  +

    Prev Up Next
    Part II.  Standard Contents  Home Dynamic Memory
    diff --git a/libstdc++-v3/doc/html/manual/termination.html b/libstdc++-v3/doc/html/manual/termination.html index fc7389f100a..6c863b0d365 100644 --- a/libstdc++-v3/doc/html/manual/termination.html +++ b/libstdc++-v3/doc/html/manual/termination.html @@ -1,6 +1,6 @@ -Termination
    Termination
    Prev Chapter 4.  +Termination
    Termination
    Prev Chapter 4.  Support  Next

    Termination

    Termination Handlers

    diff --git a/libstdc++-v3/doc/html/manual/test.html b/libstdc++-v3/doc/html/manual/test.html index 93df8b6f6a3..48345b4c05a 100644 --- a/libstdc++-v3/doc/html/manual/test.html +++ b/libstdc++-v3/doc/html/manual/test.html @@ -1,6 +1,6 @@ -Test

    Test
    Prev Appendix B.  +Test
    Test
    Prev Appendix B.  Porting and Maintenance  Next

    Test

    @@ -493,7 +493,7 @@ only default variables. reporting functions including:

    • time_counter

    • resource_counter

    • report_performance

    Special Topics

    Qualifying Exception Safety Guarantees - +

    Overview

    Testing is composed of running a particular test sequence, and looking at what happens to the surrounding code when diff --git a/libstdc++-v3/doc/html/manual/traits.html b/libstdc++-v3/doc/html/manual/traits.html index 9c3c83f6b3c..6c2eaf487a7 100644 --- a/libstdc++-v3/doc/html/manual/traits.html +++ b/libstdc++-v3/doc/html/manual/traits.html @@ -1,6 +1,6 @@ -Traits

    Traits
    Prev Chapter 6.  +Traits
    Traits
    Prev Chapter 6.  Utilities  Next

    Traits

    diff --git a/libstdc++-v3/doc/html/manual/using.html b/libstdc++-v3/doc/html/manual/using.html index 3b5129bdc80..2a0406b5c16 100644 --- a/libstdc++-v3/doc/html/manual/using.html +++ b/libstdc++-v3/doc/html/manual/using.html @@ -1,6 +1,6 @@ -Chapter 3. Using

    Chapter 3. Using
    Prev Part I.  +Chapter 3. Using
    Chapter 3. Using
    Prev Part I.  Introduction  Next

    Chapter 3. Using

    Table of Contents

    Command Options
    Headers
    Header Files
    Mixing Headers
    The C Headers and namespace std
    Precompiled Headers
    Macros
    Namespaces
    Available Namespaces
    namespace std
    Using Namespace Composition
    Linking
    Almost Nothing
    Finding Dynamic or Shared Libraries
    Concurrency
    Prerequisites
    Thread Safety
    Atomics
    IO
    Structure
    Defaults
    Future
    Alternatives
    Containers
    Exceptions
    Exception Safety
    Exception Neutrality
    Doing without
    Compatibility
    With C
    With POSIX thread cancellation
    Debugging Support
    Using g++
    Debug Versions of Library Binary Files
    Memory Leak Hunting
    Data Race Hunting
    Using gdb
    Tracking uncaught exceptions
    Debug Mode
    Compile Time Checking
    Profile-based Performance Analysis

    Command Options

    @@ -11,5 +11,5 @@ enumerated and detailed in the table below.

    By default, g++ is equivalent to g++ -std=gnu++98. The standard library also defaults to this dialect. -

    Table 3.1. C++ Command Options

    Option FlagsDescription
    -std=c++98Use the 1998 ISO C++ standard plus amendments.
    -std=gnu++98As directly above, with GNU extensions.
    -std=c++11Use the 2011 ISO C++ standard.
    -std=gnu++11As directly above, with GNU extensions.
    -fexceptionsSee exception-free dialect
    -frttiAs above, but RTTI-free dialect.
    -pthread or -pthreadsFor ISO C++11 <thread>, <future>, +

    Table 3.1. C++ Command Options

    Option FlagsDescription
    -std=c++98Use the 1998 ISO C++ standard plus amendments.
    -std=gnu++98As directly above, with GNU extensions.
    -std=c++11Use the 2011 ISO C++ standard.
    -std=gnu++11As directly above, with GNU extensions.
    -fexceptionsSee exception-free dialect
    -frttiAs above, but RTTI-free dialect.
    -pthread or -pthreadsFor ISO C++11 <thread>, <future>, <mutex>, or <condition_variable>.
    -fopenmpFor parallel mode.

    Prev Up Next
    Make Home Headers
    diff --git a/libstdc++-v3/doc/html/manual/using_concurrency.html b/libstdc++-v3/doc/html/manual/using_concurrency.html index ba47c950291..bd62da3ad9b 100644 --- a/libstdc++-v3/doc/html/manual/using_concurrency.html +++ b/libstdc++-v3/doc/html/manual/using_concurrency.html @@ -1,6 +1,6 @@ -Concurrency
    Concurrency
    Prev Chapter 3. Using Next

    Concurrency

    This section discusses issues surrounding the proper compilation +Concurrency

    Concurrency
    Prev Chapter 3. Using Next

    Concurrency

    This section discusses issues surrounding the proper compilation of multithreaded applications which use the Standard C++ library. This information is GCC-specific since the C++ standard does not address matters of multithreaded applications. diff --git a/libstdc++-v3/doc/html/manual/using_dynamic_or_shared.html b/libstdc++-v3/doc/html/manual/using_dynamic_or_shared.html index c4277785e4e..c5f97d48f80 100644 --- a/libstdc++-v3/doc/html/manual/using_dynamic_or_shared.html +++ b/libstdc++-v3/doc/html/manual/using_dynamic_or_shared.html @@ -1,6 +1,6 @@ -Linking

    Linking
    Prev Chapter 3. Using Next

    Linking

    Almost Nothing

    +Linking

    Linking
    Prev Chapter 3. Using Next

    Linking

    Almost Nothing

    Or as close as it gets: freestanding. This is a minimal configuration, with only partial support for the standard library. Assume only the following header files can be used: diff --git a/libstdc++-v3/doc/html/manual/using_exceptions.html b/libstdc++-v3/doc/html/manual/using_exceptions.html index 13d62afb3fc..9b525922d9d 100644 --- a/libstdc++-v3/doc/html/manual/using_exceptions.html +++ b/libstdc++-v3/doc/html/manual/using_exceptions.html @@ -1,6 +1,6 @@ -Exceptions

    Exceptions
    Prev Chapter 3. Using Next

    Exceptions

    +Exceptions

    Exceptions
    Prev Chapter 3. Using Next

    Exceptions

    The C++ language provides language support for stack unwinding with try and catch blocks and the throw keyword. @@ -266,7 +266,7 @@ is called. } catch(...) { this->_M_setstate(ios_base::badbit); } -

    Bibliography

    +

    Bibliography

    System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008) @@ -275,39 +275,39 @@ is called. . Copyright © 2008 The Open Group/The Institute of Electrical and Electronics Engineers, Inc. - .

    + .

    Error and Exception Handling . David Abrahams . Boost - .

    + .

    Exception-Safety in Generic Components . David Abrahams. Boost - .

    + .

    Standard Library Exception Policy . Matt Austern. WG21 N1077 - .

    + .

    ia64 c++ abi exception handling . Richard Henderson. GNU - .

    + .

    Appendix E: Standard-Library Exception Safety - . Bjarne Stroustrup.

    + . Bjarne Stroustrup.

    Exceptional C++ . Exception-Safety Issues and Techniques - . Herb Sutter.

    + . Herb Sutter.

    GCC Bug 25191: exception_defines.h #defines try/catch diff --git a/libstdc++-v3/doc/html/manual/using_headers.html b/libstdc++-v3/doc/html/manual/using_headers.html index 1172cb0ae0f..771af7dde00 100644 --- a/libstdc++-v3/doc/html/manual/using_headers.html +++ b/libstdc++-v3/doc/html/manual/using_headers.html @@ -1,6 +1,6 @@ -Headers

    Headers
    Prev Chapter 3. Using Next

    Headers

    Header Files

    +Headers

    Headers
    Prev Chapter 3. Using Next

    Headers

    Header Files

    The C++ standard specifies the entire set of header files that must be available to all hosted implementations. Actually, the word "files" is a misnomer, since the contents of the @@ -19,19 +19,19 @@ the 1998 standard as updated for 2003, and the current 2011 standard.

    C++98/03 include files. These are available in the default compilation mode, i.e. -std=c++98 or -std=gnu++98. -

    Table 3.2. C++ 1998 Library Headers

    algorithmbitsetcomplexdequeexception
    fstreamfunctionaliomanipiosiosfwd
    iostreamistreamiteratorlimitslist
    localemapmemorynewnumeric
    ostreamqueuesetsstreamstack
    stdexceptstreambufstringutilitytypeinfo
    valarrayvector   

    Table 3.3. C++ 1998 Library Headers for C Library Facilities

    cassertcerrnocctypecfloatciso646
    climitsclocalecmathcsetjmpcsignal
    cstdargcstddefcstdiocstdlibcstring
    ctimecwcharcwctype  

    +

    Table 3.2. C++ 1998 Library Headers

    algorithmbitsetcomplexdequeexception
    fstreamfunctionaliomanipiosiosfwd
    iostreamistreamiteratorlimitslist
    localemapmemorynewnumeric
    ostreamqueuesetsstreamstack
    stdexceptstreambufstringutilitytypeinfo
    valarrayvector   

    Table 3.3. C++ 1998 Library Headers for C Library Facilities

    cassertcerrnocctypecfloatciso646
    climitsclocalecmathcsetjmpcsignal
    cstdargcstddefcstdiocstdlibcstring
    ctimecwcharcwctype  

    C++11 include files. These are only available in C++11 compilation mode, i.e. -std=c++11 or -std=gnu++11. -

    Table 3.4. C++ 2011 Library Headers

    algorithmarraybitsetchronocomplex
    condition_variabledequeexceptionforward_listfstream
    functionalfutureinitalizer_listiomanipios
    iosfwdiostreamistreamiteratorlimits
    listlocalemapmemorymutex
    newnumericostreamqueuerandom
    ratioregexsetsstreamstack
    stdexceptstreambufstringsystem_errorthread
    tupletype_traitstypeinfounordered_mapunordered_set
    utilityvalarrayvector  

    Table 3.5. C++ 2011 Library Headers for C Library Facilities

    cassertccomplexcctypecerrnocfenv
    cfloatcinttypesciso646climitsclocale
    cmathcsetjmpcsignalcstdargcstdbool
    cstddefcstdintcstdlibcstdiocstring
    ctgmathctimecucharcwcharcwctype

    +

    Table 3.4. C++ 2011 Library Headers

    algorithmarraybitsetchronocomplex
    condition_variabledequeexceptionforward_listfstream
    functionalfutureinitalizer_listiomanipios
    iosfwdiostreamistreamiteratorlimits
    listlocalemapmemorymutex
    newnumericostreamqueuerandom
    ratioregexsetsstreamstack
    stdexceptstreambufstringsystem_errorthread
    tupletype_traitstypeinfounordered_mapunordered_set
    utilityvalarrayvector  

    Table 3.5. C++ 2011 Library Headers for C Library Facilities

    cassertccomplexcctypecerrnocfenv
    cfloatcinttypesciso646climitsclocale
    cmathcsetjmpcsignalcstdargcstdbool
    cstddefcstdintcstdlibcstdiocstring
    ctgmathctimecucharcwcharcwctype

    In addition, TR1 includes as: -

    Table 3.6. C++ TR 1 Library Headers

    tr1/arraytr1/complextr1/memorytr1/functionaltr1/random
    tr1/regextr1/tupletr1/type_traitstr1/unordered_maptr1/unordered_set
    tr1/utility    

    Table 3.7. C++ TR 1 Library Headers for C Library Facilities

    tr1/ccomplextr1/cfenvtr1/cfloattr1/cmathtr1/cinttypes
    tr1/climitstr1/cstdargtr1/cstdbooltr1/cstdinttr1/cstdio
    tr1/cstdlibtr1/ctgmathtr1/ctimetr1/cwchartr1/cwctype

    Decimal floating-point arithmetic is available if the C++ +

    Table 3.6. C++ TR 1 Library Headers

    tr1/arraytr1/complextr1/memorytr1/functionaltr1/random
    tr1/regextr1/tupletr1/type_traitstr1/unordered_maptr1/unordered_set
    tr1/utility    

    Table 3.7. C++ TR 1 Library Headers for C Library Facilities

    tr1/ccomplextr1/cfenvtr1/cfloattr1/cmathtr1/cinttypes
    tr1/climitstr1/cstdargtr1/cstdbooltr1/cstdinttr1/cstdio
    tr1/cstdlibtr1/ctgmathtr1/ctimetr1/cwchartr1/cwctype

    Decimal floating-point arithmetic is available if the C++ compiler supports scalar decimal floating-point types defined via __attribute__((mode(SD|DD|LD))). -

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

    decimal/decimal

    +

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

    decimal/decimal

    Also included are files for the C++ ABI interface: -

    Table 3.9. C++ ABI Headers

    cxxabi.hcxxabi_forced.h

    +

    Table 3.9. C++ ABI Headers

    cxxabi.hcxxabi_forced.h

    And a large variety of extensions. -

    Table 3.10. Extension Headers

    ext/algorithmext/atomicity.hext/array_allocator.hext/bitmap_allocator.hext/cast.h
    ext/codecvt_specializations.hext/concurrence.hext/debug_allocator.hext/enc_filebuf.hext/extptr_allocator.h
    ext/functionalext/iteratorext/malloc_allocator.hext/memoryext/mt_allocator.h
    ext/new_allocator.hext/numericext/numeric_traits.hext/pb_ds/assoc_container.hext/pb_ds/priority_queue.h
    ext/pod_char_traits.hext/pool_allocator.hext/rb_treeext/ropeext/slist
    ext/stdio_filebuf.hext/stdio_sync_filebuf.hext/throw_allocator.hext/typelist.hext/type_traits.h
    ext/vstring.h    

    Table 3.11. Extension Debug Headers

    debug/bitsetdebug/dequedebug/listdebug/mapdebug/set
    debug/stringdebug/unordered_mapdebug/unordered_setdebug/vector 

    Table 3.12. Extension Profile Headers

    profile/bitsetprofile/dequeprofile/listprofile/map
    profile/setprofile/unordered_mapprofile/unordered_setprofile/vector

    Table 3.13. Extension Parallel Headers

    parallel/algorithmparallel/numeric

    Mixing Headers

    A few simple rules. +

    Table 3.10. Extension Headers

    ext/algorithmext/atomicity.hext/array_allocator.hext/bitmap_allocator.hext/cast.h
    ext/codecvt_specializations.hext/concurrence.hext/debug_allocator.hext/enc_filebuf.hext/extptr_allocator.h
    ext/functionalext/iteratorext/malloc_allocator.hext/memoryext/mt_allocator.h
    ext/new_allocator.hext/numericext/numeric_traits.hext/pb_ds/assoc_container.hext/pb_ds/priority_queue.h
    ext/pod_char_traits.hext/pool_allocator.hext/rb_treeext/ropeext/slist
    ext/stdio_filebuf.hext/stdio_sync_filebuf.hext/throw_allocator.hext/typelist.hext/type_traits.h
    ext/vstring.h    

    Table 3.11. Extension Debug Headers

    debug/bitsetdebug/dequedebug/listdebug/mapdebug/set
    debug/stringdebug/unordered_mapdebug/unordered_setdebug/vector 

    Table 3.12. Extension Profile Headers

    profile/bitsetprofile/dequeprofile/listprofile/map
    profile/setprofile/unordered_mapprofile/unordered_setprofile/vector

    Table 3.13. Extension Parallel Headers

    parallel/algorithmparallel/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 cd4408a9516..a7338a96824 100644
--- a/libstdc++-v3/doc/html/manual/using_macros.html
+++ b/libstdc++-v3/doc/html/manual/using_macros.html
@@ -1,6 +1,6 @@
 
 
-Macros
    Macros
    Prev Chapter 3. Using Next
    Macros
    
+Macros
    Macros
    Prev Chapter 3. Using Next
    Macros
    
      All library macros begin with _GLIBCXX_.
    
    
      Furthermore, all pre-processor macros, switches, and
diff --git a/libstdc++-v3/doc/html/manual/using_namespaces.html b/libstdc++-v3/doc/html/manual/using_namespaces.html
index e85b99c1459..8a2c1be08f6 100644
--- a/libstdc++-v3/doc/html/manual/using_namespaces.html
+++ b/libstdc++-v3/doc/html/manual/using_namespaces.html
@@ -1,6 +1,6 @@
 
 
-Namespaces
    Namespaces
    Prev Chapter 3. Using Next
    Namespaces
    Available Namespaces
     There are three main namespaces.
+Namespaces
    Namespaces
    Prev Chapter 3. Using Next
    Namespaces
    Available Namespaces
     There are three main namespaces.
 
    • std
      The ISO C++ standards specify that "all library entities are defined
 within namespace std." This includes namespaces nested
 within namespace std, such as namespace
diff --git a/libstdc++-v3/doc/html/manual/utilities.html b/libstdc++-v3/doc/html/manual/utilities.html
index 49aa9a06c6e..e27b7cd7bca 100644
--- a/libstdc++-v3/doc/html/manual/utilities.html
+++ b/libstdc++-v3/doc/html/manual/utilities.html
@@ -1,17 +1,17 @@
 
 
-Chapter 6.  Utilities
      Chapter 6. 
+Chapter 6.  Utilities
      Chapter 6. 
   Utilities
   
-
      Prev Part II. 
+
      Prev Part II. 
     Standard Contents
    Next
      Chapter 6. 
   Utilities
-  
-
      Table of Contents
      Functors
      Pairs
      Memory
      Allocators
      Requirements
      Design Issues
      Implementation
      Interface Design
      Selecting Default Allocation Policy
      Disabling Memory Caching
      Using a Specific Allocator
      Custom Allocators
      Extension Allocators
      auto_ptr
      Limitations
      Use in Containers
      shared_ptr
      Requirements
      Design Issues
      Implementation
      Class Hierarchy
      Thread Safety
      Selecting Lock Policy
      Related functions and classes
      Use
      Examples
      Unresolved Issues
      Acknowledgments
      Traits
      Functors
      If you don't know what functors are, you're not alone.  Many people
+  
+
      Table of Contents
      Functors
      Pairs
      Memory
      Allocators
      Requirements
      Design Issues
      Implementation
      Interface Design
      Selecting Default Allocation Policy
      Disabling Memory Caching
      Using a Specific Allocator
      Custom Allocators
      Extension Allocators
      auto_ptr
      Limitations
      Use in Containers
      shared_ptr
      Requirements
      Design Issues
      Implementation
      Class Hierarchy
      Thread Safety
      Selecting Lock Policy
      Related functions and classes
      Use
      Examples
      Unresolved Issues
      Acknowledgments
      Traits
      Functors
      If you don't know what functors are, you're not alone.  Many people
       get slightly the wrong idea.  In the interest of not reinventing
       the wheel, we will refer you to the introduction to the functor
       concept written by SGI as part of their STL, in
       their
       http://www.sgi.com/tech/stl/functors.html.
-   
      Prev Up Next
      Concept Checking Home Pairs
      
+   
      Prev Up Next
      Concept Checking Home Pairs
      
diff --git a/libstdc++-v3/doc/xml/manual/abi.xml b/libstdc++-v3/doc/xml/manual/abi.xml
index 23c635543a8..9d7395edea5 100644
--- a/libstdc++-v3/doc/xml/manual/abi.xml
+++ b/libstdc++-v3/doc/xml/manual/abi.xml
@@ -42,7 +42,7 @@
   virtual functions, etc. These details are defined as the compiler
   Application Binary Interface, or ABI. The GNU C++ compiler uses an
   industry-standard C++ ABI starting with version 3. Details can be
-  found in the ABI
+  found in the ABI
   specification.
 
 
@@ -717,7 +717,7 @@ class that would otherwise have implicit versions. This will change
 the way the compiler deals with this class in by-value return
 statements or parameters: instead of passing instances of this
 class in registers, the compiler will be forced to use memory. See the
-section on Function
+section on Function
 Calling Conventions and APIs
  of the C++ ABI documentation for further details.
 
@@ -1075,7 +1075,7 @@ gcc test.c -g -O2 -L. -lone -ltwo /usr/lib/libstdc++.so.5 /usr/lib/libstdc++.so.
     
       
 	<link xmlns:xlink="http://www.w3.org/1999/xlink"
-	      xlink:href="http://www.codesourcery.com/public/cxx-abi">
+	      xlink:href="http://www.codesourcery.com/cxx-abi/">
 	  C++ ABI Summary
 	</link>
       
diff --git a/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml b/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml
index 3bc489a02cd..1450162673b 100644
--- a/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml
+++ b/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml
@@ -53,6 +53,7 @@
 
 
 
      Implementation
+
 
 
 
      Free List Store
diff --git a/libstdc++-v3/doc/xml/manual/concurrency_extensions.xml b/libstdc++-v3/doc/xml/manual/concurrency_extensions.xml
index 0d0e1b951eb..aef588d2caf 100644
--- a/libstdc++-v3/doc/xml/manual/concurrency_extensions.xml
+++ b/libstdc++-v3/doc/xml/manual/concurrency_extensions.xml
@@ -185,6 +185,7 @@ host hardware and operating system.
 
 
 
      Implementation
+  
   
   
      Using Builtin Atomic Functions
     
@@ -290,8 +291,8 @@ etc.
 
      
 
 
      Use
+
 
-  
 
 Typical usage of the last two constructs is demonstrated as follows:
 
diff --git a/libstdc++-v3/doc/xml/manual/debug_mode.xml b/libstdc++-v3/doc/xml/manual/debug_mode.xml
index 389f9bdfb4a..e7d309b8895 100644
--- a/libstdc++-v3/doc/xml/manual/debug_mode.xml
+++ b/libstdc++-v3/doc/xml/manual/debug_mode.xml
@@ -58,6 +58,7 @@
 
      
 
 
      Semantics
+  
   
   
   
@@ -139,6 +140,7 @@ which always works correctly.
 
      
 
 
      Using
+  
   
   
   
@@ -314,6 +316,7 @@ containers have additional debug capability.
 
      
 
 
      Design
+  
   
   
   
diff --git a/libstdc++-v3/doc/xml/manual/diagnostics.xml b/libstdc++-v3/doc/xml/manual/diagnostics.xml
index 9b642b1a7f1..99206e9fde9 100644
--- a/libstdc++-v3/doc/xml/manual/diagnostics.xml
+++ b/libstdc++-v3/doc/xml/manual/diagnostics.xml
@@ -72,6 +72,7 @@
 
      
 
 
      Concept Checking
+  
   
   
     In 1999, SGI added concept checkers to their
diff --git a/libstdc++-v3/doc/xml/manual/extensions.xml b/libstdc++-v3/doc/xml/manual/extensions.xml
index 522f562e629..1f3da2fd9d6 100644
--- a/libstdc++-v3/doc/xml/manual/extensions.xml
+++ b/libstdc++-v3/doc/xml/manual/extensions.xml
@@ -14,6 +14,7 @@
 
 
 </info>
+<?dbhtml filename="ext_preface.html"?>
 <para>
   Here we will make an attempt at describing the non-Standard
   extensions to the library.  Some of these are from older versions of
@@ -187,6 +188,7 @@ extensions, be aware of two things:
 
 
   <section xml:id="manual.ext.containers.deprecated_sgi" xreflabel="SGI ext dep"><info><title>Deprecated
+    
 
 
    
diff --git a/libstdc++-v3/doc/xml/manual/mt_allocator.xml b/libstdc++-v3/doc/xml/manual/mt_allocator.xml
index 3e3a864eb00..12fe2ee3b64 100644
--- a/libstdc++-v3/doc/xml/manual/mt_allocator.xml
+++ b/libstdc++-v3/doc/xml/manual/mt_allocator.xml
@@ -41,6 +41,7 @@
 
 
 
      Design Issues
+
 
 
 
      Overview
@@ -105,6 +106,7 @@ classes, namely member functions allocate and
 
      
 
 
      Implementation
+
 
 
 
@@ -314,6 +316,7 @@ pool that frees memory, see the following
 
      
 
 
      Single Thread Example
+
 
 
 
@@ -408,6 +411,7 @@ faster than maintaining a set of "last pointers" as well.
 
      
 
 
      Multiple Thread Example
+
 
 
 
diff --git a/libstdc++-v3/doc/xml/manual/parallel_mode.xml b/libstdc++-v3/doc/xml/manual/parallel_mode.xml
index 0ab59d56ca0..6dc81c9fcb6 100644
--- a/libstdc++-v3/doc/xml/manual/parallel_mode.xml
+++ b/libstdc++-v3/doc/xml/manual/parallel_mode.xml
@@ -76,6 +76,7 @@ specific compiler flag.
 
      
 
 
      Semantics
+
   
 
  The parallel mode STL algorithms are currently not exception-safe,
@@ -93,6 +94,7 @@ It might work with other compilers, though.
 
      
 
 
      Using
+
   
 
 
      Prerequisite Compiler Flags
@@ -457,6 +459,7 @@ flags for atomic operations.)
 
      
 
 
      Design
+
   
   
   
@@ -783,6 +786,7 @@ the generated source documentation.
 
      
 
 
      Testing
+
   
 
   
diff --git a/libstdc++-v3/doc/xml/manual/policy_data_structures.xml b/libstdc++-v3/doc/xml/manual/policy_data_structures.xml
index 9e6bb59d57e..cf8af1805c2 100644
--- a/libstdc++-v3/doc/xml/manual/policy_data_structures.xml
+++ b/libstdc++-v3/doc/xml/manual/policy_data_structures.xml
@@ -5053,6 +5053,7 @@
   
   
      
     Acknowledgments
+    
 
     
       Written by Ami Tavory and Vladimir Dreizin (IBM Haifa Research
diff --git a/libstdc++-v3/doc/xml/manual/policy_data_structures_biblio.xml b/libstdc++-v3/doc/xml/manual/policy_data_structures_biblio.xml
index ec8854aaa80..11f798fd232 100644
--- a/libstdc++-v3/doc/xml/manual/policy_data_structures_biblio.xml
+++ b/libstdc++-v3/doc/xml/manual/policy_data_structures_biblio.xml
@@ -1,12 +1,8 @@
 
- 
- 
-    
-      
-	Bibliography
-      
-    
-    
+
+
+    Bibliography
 
     
     
diff --git a/libstdc++-v3/doc/xml/manual/profile_mode.xml b/libstdc++-v3/doc/xml/manual/profile_mode.xml
index adb3c8718db..59af2db6689 100644
--- a/libstdc++-v3/doc/xml/manual/profile_mode.xml
+++ b/libstdc++-v3/doc/xml/manual/profile_mode.xml
@@ -210,6 +210,7 @@ vector-size: improvement = 3: call stack = 0x804842c ...
 
 
 
      Design
+
   
 
 
@@ -425,6 +426,7 @@ it helps the user focus on the key problems and ignore the uninteresting ones.
 
      
 
 
      Extensions for Custom Containers
+
 
 
   
@@ -440,6 +442,7 @@ it helps the user focus on the key problems and ignore the uninteresting ones.
 
 
 
      Empirical Cost Model
+
 
 
   
@@ -465,6 +468,7 @@ it helps the user focus on the key problems and ignore the uninteresting ones.
 
 
 
      Implementation Issues
+
 
 
 
@@ -557,6 +561,7 @@ it helps the user focus on the key problems and ignore the uninteresting ones.
 
 
 
      Developer Information
+
 
 
 
      Big Picture
@@ -660,6 +665,7 @@ it helps the user focus on the key problems and ignore the uninteresting ones.
 
      
 
 
      Diagnostics
+
 
 
   
diff --git a/libstdc++-v3/doc/xml/manual/spine.xml b/libstdc++-v3/doc/xml/manual/spine.xml
index 806f4ec118d..614e8869a90 100644
--- a/libstdc++-v3/doc/xml/manual/spine.xml
+++ b/libstdc++-v3/doc/xml/manual/spine.xml
@@ -19,6 +19,7 @@
     2009
     2010
     2011
+    2012
     
       FSF
     
@@ -158,6 +159,7 @@
     Standard Contents
   
 
+
 
 
 
@@ -220,6 +222,7 @@
 
   Appendices
 
+