{"id":2229599,"url":"http://patchwork.ozlabs.org/api/1.1/patches/2229599/?format=json","web_url":"http://patchwork.ozlabs.org/project/gcc/patch/20260428130313.444088-1-tkaminsk@redhat.com/","project":{"id":17,"url":"http://patchwork.ozlabs.org/api/1.1/projects/17/?format=json","name":"GNU Compiler Collection","link_name":"gcc","list_id":"gcc-patches.gcc.gnu.org","list_email":"gcc-patches@gcc.gnu.org","web_url":null,"scm_url":null,"webscm_url":null},"msgid":"<20260428130313.444088-1-tkaminsk@redhat.com>","date":"2026-04-28T13:02:50","name":"libstdc++/doc: Document std::chrono::tzdb database implementation.","commit_ref":null,"pull_url":null,"state":"new","archived":false,"hash":"90bcbc6044e55b0bfcbed3a270671937bddf419a","submitter":{"id":90409,"url":"http://patchwork.ozlabs.org/api/1.1/people/90409/?format=json","name":"Tomasz Kaminski","email":"tkaminsk@redhat.com"},"delegate":null,"mbox":"http://patchwork.ozlabs.org/project/gcc/patch/20260428130313.444088-1-tkaminsk@redhat.com/mbox/","series":[{"id":501863,"url":"http://patchwork.ozlabs.org/api/1.1/series/501863/?format=json","web_url":"http://patchwork.ozlabs.org/project/gcc/list/?series=501863","date":"2026-04-28T13:02:50","name":"libstdc++/doc: Document std::chrono::tzdb database implementation.","version":1,"mbox":"http://patchwork.ozlabs.org/series/501863/mbox/"}],"comments":"http://patchwork.ozlabs.org/api/patches/2229599/comments/","check":"pending","checks":"http://patchwork.ozlabs.org/api/patches/2229599/checks/","tags":{},"headers":{"Return-Path":"","X-Original-To":["incoming@patchwork.ozlabs.org","gcc-patches@gcc.gnu.org"],"Delivered-To":["patchwork-incoming@legolas.ozlabs.org","gcc-patches@gcc.gnu.org"],"Authentication-Results":["legolas.ozlabs.org;\n\tdkim=pass (1024-bit key;\n unprotected) header.d=redhat.com header.i=@redhat.com header.a=rsa-sha256\n header.s=mimecast20190719 header.b=KlW9CzYf;\n\tdkim-atps=neutral","legolas.ozlabs.org;\n spf=pass (sender SPF authorized) smtp.mailfrom=gcc.gnu.org\n (client-ip=38.145.34.32; helo=vm01.sourceware.org;\n envelope-from=gcc-patches-bounces~incoming=patchwork.ozlabs.org@gcc.gnu.org;\n receiver=patchwork.ozlabs.org)","sourceware.org;\n\tdkim=pass (1024-bit key,\n unprotected) header.d=redhat.com header.i=@redhat.com header.a=rsa-sha256\n header.s=mimecast20190719 header.b=KlW9CzYf","sourceware.org; dmarc=pass (p=quarantine dis=none)\n header.from=redhat.com","sourceware.org; spf=pass smtp.mailfrom=redhat.com","server2.sourceware.org;\n arc=none smtp.remote-ip=170.10.129.124"],"Received":["from vm01.sourceware.org (vm01.sourceware.org [38.145.34.32])\n\t(using TLSv1.3 with cipher TLS_AES_256_GCM_SHA384 (256/256 bits)\n\t key-exchange x25519 server-signature ECDSA (secp384r1) server-digest SHA384)\n\t(No client certificate requested)\n\tby legolas.ozlabs.org (Postfix) with ESMTPS id 4g4hwP4Ww9z1xvV\n\tfor ; Wed, 29 Apr 2026 00:03:00 +1000 (AEST)","from vm01.sourceware.org (localhost [127.0.0.1])\n\tby sourceware.org (Postfix) with ESMTP id 9E9544BA5435\n\tfor ; Tue, 28 Apr 2026 14:02:57 +0000 (GMT)","from us-smtp-delivery-124.mimecast.com\n (us-smtp-delivery-124.mimecast.com [170.10.129.124])\n by sourceware.org (Postfix) with ESMTP id 40E224B920C6\n for ; Tue, 28 Apr 2026 13:03:25 +0000 (GMT)","from mx-prod-mc-06.mail-002.prod.us-west-2.aws.redhat.com\n (ec2-35-165-154-97.us-west-2.compute.amazonaws.com [35.165.154.97]) by\n relay.mimecast.com with ESMTP with STARTTLS (version=TLSv1.3,\n cipher=TLS_AES_256_GCM_SHA384) id us-mta-119-ZXgW5FH-ObqrcwGwWp3NGw-1; Tue,\n 28 Apr 2026 09:03:18 -0400","from mx-prod-int-01.mail-002.prod.us-west-2.aws.redhat.com\n (mx-prod-int-01.mail-002.prod.us-west-2.aws.redhat.com [10.30.177.4])\n (using TLSv1.3 with cipher TLS_AES_256_GCM_SHA384 (256/256 bits)\n key-exchange X25519 server-signature RSA-PSS (2048 bits) server-digest\n SHA256)\n (No client certificate requested)\n by mx-prod-mc-06.mail-002.prod.us-west-2.aws.redhat.com (Postfix) with ESMTPS\n id C2BD21800652; Tue, 28 Apr 2026 13:03:16 +0000 (UTC)","from localhost (unknown [10.44.50.244])\n by mx-prod-int-01.mail-002.prod.us-west-2.aws.redhat.com (Postfix) with ESMTP\n id 391CA3000C22; Tue, 28 Apr 2026 13:03:14 +0000 (UTC)"],"DKIM-Filter":["OpenDKIM Filter v2.11.0 sourceware.org 9E9544BA5435","OpenDKIM Filter v2.11.0 sourceware.org 40E224B920C6"],"DMARC-Filter":"OpenDMARC Filter v1.4.2 sourceware.org 40E224B920C6","ARC-Filter":"OpenARC Filter v1.0.0 sourceware.org 40E224B920C6","ARC-Seal":"i=1; a=rsa-sha256; d=sourceware.org; s=key; t=1777381405; cv=none;\n b=B6xite1vkwNCeekXiNP9oe0A0D7aKvNgtQTW+KO/ljqKWGtQxs8zlL+0sGGVCKHuunZrIq1UrHuu+u/k7OFetNn7GdP5t/TvnVoycebmEHZ0BbK2AnhbB42VNOu2GDJBg01dGZE6erznmyfcVtlMf20WchHq1/DSbE/10GXGBU4=","ARC-Message-Signature":"i=1; a=rsa-sha256; d=sourceware.org; s=key;\n t=1777381405; c=relaxed/simple;\n bh=MOylWvVCx7ixFdKPhMRLYCLf4DoFemcU7CbhBC0bbOU=;\n h=DKIM-Signature:From:To:Subject:Date:Message-ID:MIME-Version;\n b=evJIbXIEHwuMDzEDn+sQnTQN7PdZGuCTX32s+LiVDE79r3j17E9nzwCAA0kcnZ5B9qfLi1G7bxTKHqN6p3+/89oF3c/neBFoHX8NSDpIDYzrwlS6A/VGnh9GCMvqcRC46qui8XuA6W1l6dgC+7EiKaV6LuStTW43EdWWTNY+N3A=","ARC-Authentication-Results":"i=1; server2.sourceware.org","DKIM-Signature":"v=1; a=rsa-sha256; c=relaxed/relaxed; d=redhat.com;\n s=mimecast20190719; t=1777381404;\n h=from:from:reply-to:subject:subject:date:date:message-id:message-id:\n to:to:cc:mime-version:mime-version:content-type:content-type:\n content-transfer-encoding:content-transfer-encoding;\n bh=IMl3KOEnDnCaLBPdwVwLGPzmgiK1tyWQf+WrhjYwKXY=;\n b=KlW9CzYfsQgH6VemVc/5qH/1Dpw6ETLlRiu4tbD/b8kEAkTqgLICwyWsB8gMNotV2RPG//\n uLpuhZ60FBri26rYOthqboP63IKalX7m+Tn4gCvJ007uU2wqw7x/FJQdTHnUQJbShuSkJN\n 5zA72WQ47l9E2CL+p7BAJB03Zz0BDGc=","X-MC-Unique":"ZXgW5FH-ObqrcwGwWp3NGw-1","X-Mimecast-MFC-AGG-ID":"ZXgW5FH-ObqrcwGwWp3NGw_1777381397","From":"=?utf-8?q?Tomasz_Kami=C5=84ski?= ","To":"libstdc++@gcc.gnu.org,\n\tgcc-patches@gcc.gnu.org","Subject":"[PATCH] libstdc++/doc: Document std::chrono::tzdb database\n implementation.","Date":"Tue, 28 Apr 2026 15:02:50 +0200","Message-ID":"<20260428130313.444088-1-tkaminsk@redhat.com>","MIME-Version":"1.0","X-Scanned-By":"MIMEDefang 3.4.1 on 10.30.177.4","X-Mimecast-Spam-Score":"0","X-Mimecast-MFC-PROC-ID":"m-axHWcMAfsosT4tOUWvnjFXc1s0bdImdCBJaOFob-w_1777381397","X-Mimecast-Originator":"redhat.com","Content-Type":"text/plain; charset=UTF-8","Content-Transfer-Encoding":"quoted-printable","X-Mailman-Approved-At":"Tue, 28 Apr 2026 14:00:59 +0000","X-BeenThere":"gcc-patches@gcc.gnu.org","X-Mailman-Version":"2.1.30","Precedence":"list","List-Id":"Gcc-patches mailing list ","List-Unsubscribe":",\n ","List-Archive":"","List-Post":"","List-Help":"","List-Subscribe":",\n ","Errors-To":"gcc-patches-bounces~incoming=patchwork.ozlabs.org@gcc.gnu.org"},"content":"libstdc++-v3/ChangeLog:\n\n\t* doc/Makefile.am: Add time.xml.\n\t* doc/Makefile.in: Regenerate.\n\t* doc/html/*: Regenerate.\n\t* doc/xml/manual/spine.xml: Add time.xml.\n\t* doc/xml/manual/time.xml: New file.\n---\nI think I covered everything we discussed.\nOK for trunk?\n\n libstdc++-v3/doc/Makefile.am | 1 +\n libstdc++-v3/doc/Makefile.in | 1 +\n libstdc++-v3/doc/html/index.html | 15 +-\n libstdc++-v3/doc/html/manual/api.html | 2 +-\n libstdc++-v3/doc/html/manual/atomics.html | 8 +-\n .../doc/html/manual/bitmap_allocator.html | 4 +-\n .../html/manual/bitmap_allocator_impl.html | 6 +-\n libstdc++-v3/doc/html/manual/concurrency.html | 8 +-\n libstdc++-v3/doc/html/manual/debug.html | 6 +-\n libstdc++-v3/doc/html/manual/debug_mode.html | 6 +-\n .../doc/html/manual/debug_mode_design.html | 4 +-\n .../doc/html/manual/debug_mode_semantics.html | 4 +-\n .../doc/html/manual/debug_mode_using.html | 6 +-\n .../doc/html/manual/ext_algorithms.html | 6 +-\n .../doc/html/manual/ext_compile_checks.html | 6 +-\n .../doc/html/manual/ext_concurrency.html | 6 +-\n .../doc/html/manual/ext_concurrency_impl.html | 4 +-\n .../doc/html/manual/ext_concurrency_use.html | 2 +-\n .../doc/html/manual/ext_containers.html | 4 +-\n .../doc/html/manual/ext_demangling.html | 6 +-\n libstdc++-v3/doc/html/manual/ext_io.html | 6 +-\n .../doc/html/manual/ext_iterators.html | 6 +-\n .../doc/html/manual/ext_numerics.html | 6 +-\n libstdc++-v3/doc/html/manual/ext_preface.html | 4 +-\n libstdc++-v3/doc/html/manual/ext_sgi.html | 4 +-\n .../doc/html/manual/ext_utilities.html | 6 +-\n libstdc++-v3/doc/html/manual/extensions.html | 8 +-\n libstdc++-v3/doc/html/manual/fstreams.html | 2 +-\n libstdc++-v3/doc/html/manual/index.html | 31 +--\n libstdc++-v3/doc/html/manual/io.html | 13 +-\n libstdc++-v3/doc/html/manual/io_and_c.html | 6 +-\n libstdc++-v3/doc/html/manual/memory.html | 6 +-\n .../doc/html/manual/mt_allocator.html | 4 +-\n .../doc/html/manual/mt_allocator_design.html | 4 +-\n .../html/manual/mt_allocator_ex_multi.html | 4 +-\n .../html/manual/mt_allocator_ex_single.html | 2 +-\n .../doc/html/manual/mt_allocator_impl.html | 2 +-\n .../doc/html/manual/numerics_and_c.html | 8 +-\n .../doc/html/manual/parallel_mode.html | 4 +-\n .../doc/html/manual/parallel_mode_design.html | 2 +-\n .../html/manual/parallel_mode_semantics.html | 4 +-\n .../doc/html/manual/parallel_mode_test.html | 4 +-\n .../doc/html/manual/parallel_mode_using.html | 4 +-\n .../policy_based_data_structures_test.html | 2 +-\n .../html/manual/policy_data_structures.html | 16 +-\n .../manual/policy_data_structures_ack.html | 4 +-\n .../manual/policy_data_structures_design.html | 70 +++---\n .../manual/policy_data_structures_using.html | 6 +-\n libstdc++-v3/doc/html/manual/status.html | 4 +-\n .../doc/html/manual/std_contents.html | 9 +-\n libstdc++-v3/doc/html/manual/streambufs.html | 4 +-\n .../doc/html/manual/stringstreams.html | 2 +-\n libstdc++-v3/doc/html/manual/test.html | 8 +-\n libstdc++-v3/doc/html/manual/time.html | 145 ++++++++++++\n libstdc++-v3/doc/html/manual/using.html | 2 +-\n .../doc/html/manual/using_macros.html | 10 +-\n libstdc++-v3/doc/xml/manual/spine.xml | 10 +-\n libstdc++-v3/doc/xml/manual/time.xml | 208 ++++++++++++++++++\n 58 files changed, 558 insertions(+), 187 deletions(-)\n create mode 100644 libstdc++-v3/doc/html/manual/time.html\n create mode 100644 libstdc++-v3/doc/xml/manual/time.xml","diff":"diff --git a/libstdc++-v3/doc/Makefile.am b/libstdc++-v3/doc/Makefile.am\nindex 330b07ccf8c..69f5faafc26 100644\n--- a/libstdc++-v3/doc/Makefile.am\n+++ b/libstdc++-v3/doc/Makefile.am\n@@ -357,6 +357,7 @@ xml_sources_manual = \\\n \t${xml_dir}/manual/support.xml \\\n \t${xml_dir}/manual/test.xml \\\n \t${xml_dir}/manual/test_policy_data_structures.xml \\\n+\t${xml_dir}/manual/time.xml \\\n \t${xml_dir}/manual/using.xml \\\n \t${xml_dir}/manual/using_exceptions.xml \\\n \t${xml_dir}/manual/utilities.xml \\\ndiff --git a/libstdc++-v3/doc/Makefile.in b/libstdc++-v3/doc/Makefile.in\nindex 6e7a5a0f908..39a6988d485 100644\n--- a/libstdc++-v3/doc/Makefile.in\n+++ b/libstdc++-v3/doc/Makefile.in\n@@ -509,6 +509,7 @@ xml_sources_manual = \\\n \t${xml_dir}/manual/support.xml \\\n \t${xml_dir}/manual/test.xml \\\n \t${xml_dir}/manual/test_policy_data_structures.xml \\\n+\t${xml_dir}/manual/time.xml \\\n \t${xml_dir}/manual/using.xml \\\n \t${xml_dir}/manual/using_exceptions.xml \\\n \t${xml_dir}/manual/utilities.xml \\\ndiff --git a/libstdc++-v3/doc/html/index.html b/libstdc++-v3/doc/html/index.html\nindex 782f3bbc299..f30560265c7 100644\n--- a/libstdc++-v3/doc/html/index.html\n+++ b/libstdc++-v3/doc/html/index.html\n@@ -52,20 +52,23 @@\n
Mutating
swap
Specializations
12. \n Numerics\n \n-
Complex
complex Processing
Generalized Operations
Interacting with C
Numerics vs. Arrays
C99
13. \n+
Complex
complex Processing
Generalized Operations
Interacting with C
Numerics vs. Arrays
C99
13. \n+ Time\n+ \n+
Time zone database
tzdb uses zic format
current zone
data sources
tzdb_list::const_iterator extents lifetime
14. \n Input and Output\n \n-
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
14. \n+
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
15. \n Atomics\n \n-
API Reference
15. \n+
API Reference
16. \n Concurrency\n \n
API Reference
III. \n Extensions\n \n-
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\n- 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. The mt_allocator
Intro
Design Issues
Overview
Implementation
Tunable Parameters
Initialization
Deallocation Notes
Single Thread Example
Multiple Thread Example
20. 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
21. 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
\n+
17. Compile Time Checks
18. 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\n+ debug-mode components
Alternatives for Coexistence
Other Implementations
19. 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
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
\n \t Configuring via Template Parameters\n \t
\n \t Querying Container Attributes\n@@ -127,7 +130,7 @@\n \t Text modify Up\n \t
\n \t Text modify Down\n-\t
Observations
Associative
Priority_Queue
Acknowledgments
Bibliography
22. HP/SGI Extensions
Backwards Compatibility
Deprecated
23. Utilities
24. Algorithms
25. Numerics
26. Iterators
27. Input and Output
Derived filebufs
28. Demangling
29. Concurrency
Design
Interface to Locks and Mutexes
Interface to Atomic Functions
Implementation
Using Built-in Atomic Functions
Thread Abstraction
Use
IV. \n+\t
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 Built-in Atomic Functions
Thread Abstraction
Use
IV. \n Appendices\n
A. \n Contributing\ndiff --git a/libstdc++-v3/doc/html/manual/api.html b/libstdc++-v3/doc/html/manual/api.html\nindex f004ddc166d..b53d9534ee3 100644\n--- a/libstdc++-v3/doc/html/manual/api.html\n+++ b/libstdc++-v3/doc/html/manual/api.html\n@@ -34,7 +34,7 @@ Removal of <ext/tree>, moved to new anyway,\n but for the optional pooling allocators the functionality is enabled by\n setting GLIBCXX_FORCE_NEW in the environment, see\n- the mt allocator chapter\n+ the mt allocator chapter\n for details.\n

Error handling in iostreams cleaned up, made consistent.

3.3

\n

3.4

\ndiff --git a/libstdc++-v3/doc/html/manual/atomics.html b/libstdc++-v3/doc/html/manual/atomics.html\nindex 416bf0acc6a..ec9b73a2a2c 100644\n--- a/libstdc++-v3/doc/html/manual/atomics.html\n+++ b/libstdc++-v3/doc/html/manual/atomics.html\n@@ -1,12 +1,12 @@\n \n-Chapter 14.  Atomics

Chapter 14. \n+Chapter 15.  Atomics
Chapter 15. \n Atomics\n \n
Prev Part II. \n Standard Contents\n-  Next

Chapter 14. \n+

 Next

Chapter 15. \n Atomics\n- \n+ \n

Table of Contents

API Reference

\n Facilities for atomic operations.\n

API Reference

\n@@ -24,7 +24,7 @@\n atomic<int>.\n

\n Full API details.\n-

Prev Up Next
Interacting with C Home Chapter 15. \n+

Prev Up Next
Interacting with C Home Chapter 16. \n Concurrency\n \n
\n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/bitmap_allocator.html b/libstdc++-v3/doc/html/manual/bitmap_allocator.html\nindex 51f52ea9941..265bba92764 100644\n--- a/libstdc++-v3/doc/html/manual/bitmap_allocator.html\n+++ b/libstdc++-v3/doc/html/manual/bitmap_allocator.html\n@@ -1,8 +1,8 @@\n \n-Chapter 20. The bitmap_allocator
Chapter 20. The bitmap_allocator
Prev Part III. \n+Chapter 21. The bitmap_allocator
Chapter 21. The bitmap_allocator
Prev Part III. \n Extensions\n \n- Next

Chapter 20. 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

\n+

 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

\n

Design

\n As this name suggests, this allocator uses a bit-map to keep track\n of the used and unused memory locations for its book-keeping\ndiff --git a/libstdc++-v3/doc/html/manual/bitmap_allocator_impl.html b/libstdc++-v3/doc/html/manual/bitmap_allocator_impl.html\nindex 0c68eea720f..44b5728e808 100644\n--- a/libstdc++-v3/doc/html/manual/bitmap_allocator_impl.html\n+++ b/libstdc++-v3/doc/html/manual/bitmap_allocator_impl.html\n@@ -1,5 +1,5 @@\n \n-Implementation

Implementation
Prev Chapter 20. The bitmap_allocator Next

Implementation

Free List Store

\n+Implementation

Implementation
Prev Chapter 21. The bitmap_allocator Next

Implementation

Free List Store

\n The Free List Store (referred to as FLS for the remaining part of this\n document) is the Global memory pool that is shared by all instances of\n the bitmapped allocator instantiated for any type. This maintains a\n@@ -75,7 +75,7 @@ else return false.

\n

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

Table 20.1. Bitmap Allocator Memory Map

268042949672954294967295Data -> Space for 64 ints

\n+

Table 21.1. Bitmap Allocator Memory Map

268042949672954294967295Data -> Space for 64 ints

\n The first Column(268) represents the size of the Block in bytes as\n seen by the Bitmap Allocator. Internally, a global free list is\n used to keep track of the free blocks used and given back by the\n@@ -309,4 +309,4 @@ equivalent.

  • And also this would preserve the cac\n sizeof(size_t) x 8 which is the number of bits in an integer,\n which can fit exactly in a CPU register. Hence, the term given is\n exponential growth of the internal pool.\n-

    • Prev Up Next
    Chapter 20. The bitmap_allocator Home Chapter 21. Policy-Based Data Structures
    \n\\ No newline at end of file\n+

    Prev Up Next
    Chapter 21. The bitmap_allocator Home Chapter 22. Policy-Based Data Structures
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/concurrency.html b/libstdc++-v3/doc/html/manual/concurrency.html\nindex e0c83759094..07f6c1350fe 100644\n--- a/libstdc++-v3/doc/html/manual/concurrency.html\n+++ b/libstdc++-v3/doc/html/manual/concurrency.html\n@@ -1,12 +1,12 @@\n \n-Chapter 15.  Concurrency
    Chapter 15. \n+Chapter 16.  Concurrency
    Chapter 16. \n Concurrency\n \n
    Prev Part II. \n Standard Contents\n-  Next

    Chapter 15. \n+

    		 Next

    Chapter 16. \n Concurrency\n- \n+ \n

    Table of Contents

    API Reference

    \n Facilities for concurrent operation, and control thereof.\n

    API Reference

    \n@@ -32,7 +32,7 @@\n and packaged_task.\n

    \n Full API details.\n-

    Prev Up Next
    Chapter 14. \n+

    Prev Up Next
    Chapter 15. \n Atomics\n \n  Home Part III. \ndiff --git a/libstdc++-v3/doc/html/manual/debug.html b/libstdc++-v3/doc/html/manual/debug.html\nindex 1623cd30486..8221df1a7e0 100644\n--- a/libstdc++-v3/doc/html/manual/debug.html\n+++ b/libstdc++-v3/doc/html/manual/debug.html\n@@ -31,7 +31,7 @@\n for Debugging Your Program\" in Using the GNU Compiler\n Collection (GCC) for a complete list.\n

    Debug Mode

    \n- The Debug Mode\n+ The Debug Mode\n has compile and run-time checks for many containers.\n

    \n There are also lightweight assertions for checking function preconditions,\n@@ -125,7 +125,7 @@\n GLIBCXX_FORCE_NEW to keep extraneous pool allocation\n noise from cluttering debug information.\n For more details, see the\n- mt allocator\n+ mt allocator\n documentation and look specifically for GLIBCXX_FORCE_NEW.\n

    Data Race Hunting

    \n All synchronization primitives used in the library internals need to be\n@@ -244,7 +244,7 @@\n A second approach is to use the configuration flags\n 

    \n      make CXXFLAGS='-g3 -fno-inline -O0' all\n-

    Compile Time Checking

    The Compile-Time\n+

    Compile Time Checking

    The Compile-Time\n Checks extension has compile-time checks for many algorithms.\n These checks were designed for C++98 and have not been updated to work\n with C++11 and later standards. They might be removed at a future date.\ndiff --git a/libstdc++-v3/doc/html/manual/debug_mode.html b/libstdc++-v3/doc/html/manual/debug_mode.html\nindex 5e3882b935c..09f6612335d 100644\n--- a/libstdc++-v3/doc/html/manual/debug_mode.html\n+++ b/libstdc++-v3/doc/html/manual/debug_mode.html\n@@ -1,8 +1,8 @@\n \n-Chapter 17. Debug Mode

    Chapter 17. Debug Mode
    Prev Part III. \n+Chapter 18. Debug Mode
    Chapter 18. Debug Mode
    Prev Part III. \n Extensions\n \n- 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\n+
    		 Next

    Chapter 18. 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\n debug-mode components
    Alternatives for Coexistence
    Other Implementations

    Intro

    \n By default, libstdc++ is built with efficiency in mind, and\n therefore performs little or no error checking that is not\n@@ -34,4 +34,4 @@\n the same predicate that was passed\n to set_intersection; the libstdc++ debug mode will\n detect an error if the sequence is not sorted or was sorted by a\n- different predicate.

    Prev Up Next
    Chapter 16. Compile Time Checks Home Semantics
    \n\\ No newline at end of file\n+ different predicate.

    Prev Up Next
    Chapter 17. Compile Time Checks Home Semantics
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/debug_mode_design.html b/libstdc++-v3/doc/html/manual/debug_mode_design.html\nindex 03f72ae96fe..d888660a267 100644\n--- a/libstdc++-v3/doc/html/manual/debug_mode_design.html\n+++ b/libstdc++-v3/doc/html/manual/debug_mode_design.html\n@@ -1,5 +1,5 @@\n \n-Design
    Design
    Prev Chapter 17. Debug Mode Next

    Design

    \n+Design

    Design
    Prev Chapter 18. Debug Mode Next

    Design

    \n

    Goals

    \n

    The libstdc++ debug mode replaces unsafe (but efficient) standard\n containers and iterators with semantically equivalent safe standard\n@@ -402,4 +402,4 @@ test02()\n a full debug-mode implementation (including debugging for\n CodeWarrior extensions) and is easy to use, although it meets only\n the \"Full recompilation\" (1) recompilation\n- guarantee.

    Prev Up Next
    Using Home Chapter 18. Parallel Mode
    \n\\ No newline at end of file\n+ guarantee.

    Prev Up Next
    Using Home Chapter 19. Parallel Mode
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/debug_mode_semantics.html b/libstdc++-v3/doc/html/manual/debug_mode_semantics.html\nindex 35d8aa3ac4b..f65020a863d 100644\n--- a/libstdc++-v3/doc/html/manual/debug_mode_semantics.html\n+++ b/libstdc++-v3/doc/html/manual/debug_mode_semantics.html\n@@ -1,5 +1,5 @@\n \n-Semantics
    Semantics
    Prev Chapter 17. Debug Mode Next

    Semantics

    \n+Semantics

    Semantics
    Prev Chapter 18. Debug Mode Next

    Semantics

    \n

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

    Prev Up Next
    Chapter 17. Debug Mode Home Using
    \n\\ No newline at end of file\n+

    Prev Up Next
    Chapter 18. Debug Mode Home Using
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/debug_mode_using.html b/libstdc++-v3/doc/html/manual/debug_mode_using.html\nindex 70d6692f514..334d07a37e1 100644\n--- a/libstdc++-v3/doc/html/manual/debug_mode_using.html\n+++ b/libstdc++-v3/doc/html/manual/debug_mode_using.html\n@@ -1,5 +1,5 @@\n \n-Using
    Using
    Prev Chapter 17. Debug Mode Next

    Using

    \n+Using

    Using
    Prev Chapter 18. Debug Mode Next

    Using

    \n

    Using the Debug Mode

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

    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>

    When compiling in C++11 mode (or newer), these\n+

    Table 18.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>

    When compiling in C++11 mode (or newer), these\n containers have additional debug capability.\n-

    Table 17.2. Debugging Containers C++11

    ContainerHeaderDebug containerDebug header
    std::forward_listforward_list__gnu_debug::forward_list<debug/forward_list>
    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>

    Prior to GCC 11 a debug version of std::array\n+

    Table 18.2. Debugging Containers C++11

    ContainerHeaderDebug containerDebug header
    std::forward_listforward_list__gnu_debug::forward_list<debug/forward_list>
    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>

    Prior to GCC 11 a debug version of std::array\n was available as __gnu_debug::array in the\n header <debug/array>.\n Because array::iterator is just a pointer,\ndiff --git a/libstdc++-v3/doc/html/manual/ext_algorithms.html b/libstdc++-v3/doc/html/manual/ext_algorithms.html\nindex b7511c49848..805734fefbe 100644\n--- a/libstdc++-v3/doc/html/manual/ext_algorithms.html\n+++ b/libstdc++-v3/doc/html/manual/ext_algorithms.html\n@@ -1,8 +1,8 @@\n \n-Chapter 24. Algorithms

    Chapter 24. Algorithms
    Prev Part III. \n+Chapter 25. Algorithms
    Chapter 25. Algorithms
    Prev Part III. \n Extensions\n \n- Next

    Chapter 24. Algorithms

    25.1.6 (count, count_if) is extended with two more versions of count\n+

    		 Next

    Chapter 25. Algorithms

    25.1.6 (count, count_if) is extended with two more versions of count\n and count_if. The standard versions return their results. The\n additional signatures return void, but take a final parameter by\n reference to which they assign their results, e.g.,\n@@ -19,4 +19,4 @@\n 

    \n    lexicographical_compare_3way(_InputIter1 first1, _InputIter1 last1,\n \t\t\t\t _InputIter2 first2, _InputIter2 last2)

    which does... what?\n-

    Prev Up Next
    Chapter 23. Utilities Home Chapter 25. Numerics
    \n\\ No newline at end of file\n+

    Prev Up Next
    Chapter 24. Utilities Home Chapter 26. Numerics
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/ext_compile_checks.html b/libstdc++-v3/doc/html/manual/ext_compile_checks.html\nindex 240d4e47f66..a235e02ed92 100644\n--- a/libstdc++-v3/doc/html/manual/ext_compile_checks.html\n+++ b/libstdc++-v3/doc/html/manual/ext_compile_checks.html\n@@ -1,8 +1,8 @@\n \n-Chapter 16. Compile Time Checks
    Chapter 16. Compile Time Checks
    Prev Part III. \n+Chapter 17. Compile Time Checks
    Chapter 17. Compile Time Checks
    Prev Part III. \n Extensions\n \n- Next

    Chapter 16. Compile Time Checks

    \n+

    		 Next

    Chapter 17. Compile Time Checks

    \n Also known as concept checking.\n

    In 1999, SGI added concept checkers to their implementation\n of the STL: code which checked the template parameters of\n@@ -44,4 +44,4 @@\n <ranges> header and the new overloads in the\n <algorithm> header for working with ranges.\n The old library-simulated concept checks might be removed at a future date.\n-

    Prev Up Next
     Home Chapter 17. Debug Mode
    \n\\ No newline at end of file\n+

    Prev Up Next
     Home Chapter 18. Debug Mode
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/ext_concurrency.html b/libstdc++-v3/doc/html/manual/ext_concurrency.html\nindex ed7a3ea9f4d..5d9b33204c2 100644\n--- a/libstdc++-v3/doc/html/manual/ext_concurrency.html\n+++ b/libstdc++-v3/doc/html/manual/ext_concurrency.html\n@@ -1,8 +1,8 @@\n \n-Chapter 29. Concurrency
    Chapter 29. Concurrency
    Prev Part III. \n+Chapter 30. Concurrency
    Chapter 30. Concurrency
    Prev Part III. \n Extensions\n \n- Next

    Chapter 29. Concurrency

    Table of Contents

    Design
    Interface to Locks and Mutexes
    Interface to Atomic Functions
    Implementation
    Using Built-in Atomic Functions
    Thread Abstraction
    Use

    Design

    Interface to Locks and Mutexes

    The file <ext/concurrence.h>\n+

    		 Next

    Chapter 30. Concurrency

    Table of Contents

    Design
    Interface to Locks and Mutexes
    Interface to Atomic Functions
    Implementation
    Using Built-in Atomic Functions
    Thread Abstraction
    Use

    Design

    Interface to Locks and Mutexes

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

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

    Prev Up Next
    Chapter 28. Demangling Home Implementation
    \n\\ No newline at end of file\n+

    Prev Up Next
    Chapter 29. Demangling Home Implementation
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/ext_concurrency_impl.html b/libstdc++-v3/doc/html/manual/ext_concurrency_impl.html\nindex 669c07cf291..ca6036e10ef 100644\n--- a/libstdc++-v3/doc/html/manual/ext_concurrency_impl.html\n+++ b/libstdc++-v3/doc/html/manual/ext_concurrency_impl.html\n@@ -1,5 +1,5 @@\n \n-Implementation
    Implementation
    Prev Chapter 29. Concurrency Next

    Implementation

    Using Built-in Atomic Functions

    The functions for atomic operations described above are either\n+Implementation

    Implementation
    Prev Chapter 30. Concurrency Next

    Implementation

    Using Built-in Atomic Functions

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

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

    Prev Up Next
    Chapter 29. Concurrency Home Use
    \n\\ No newline at end of file\n+

    Prev Up Next
    Chapter 30. Concurrency Home Use
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/ext_concurrency_use.html b/libstdc++-v3/doc/html/manual/ext_concurrency_use.html\nindex 6a0d345a910..85c85b4a7b2 100644\n--- a/libstdc++-v3/doc/html/manual/ext_concurrency_use.html\n+++ b/libstdc++-v3/doc/html/manual/ext_concurrency_use.html\n@@ -1,5 +1,5 @@\n \n-Use
    Use
    Prev Chapter 29. Concurrency Next

    Use

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

    Use
    Prev Chapter 30. Concurrency Next

    Use

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

    \n #include <ext/concurrence.h>\n \ndiff --git a/libstdc++-v3/doc/html/manual/ext_containers.html b/libstdc++-v3/doc/html/manual/ext_containers.html\nindex 660910f1042..4f20d16d205 100644\n--- a/libstdc++-v3/doc/html/manual/ext_containers.html\n+++ b/libstdc++-v3/doc/html/manual/ext_containers.html\n@@ -1,8 +1,8 @@\n \n-Chapter 22. HP/SGI Extensions
    Chapter 22. HP/SGI Extensions
    Prev Part III. \n+Chapter 23. HP/SGI Extensions
    Chapter 23. HP/SGI Extensions
    Prev Part III. \n   Extensions\n   \n- Next
    Chapter 22. HP/SGI Extensions
    Table of Contents
    Backwards Compatibility
    Deprecated
    Backwards Compatibility
    A few extensions and nods to backwards-compatibility have\n+
    		 Next
    Chapter 23. HP/SGI Extensions
    Table of Contents
    Backwards Compatibility
    Deprecated
    Backwards Compatibility
    A few extensions and nods to backwards-compatibility have\n     been made with containers.  Those dealing with older SGI-style\n     allocators are dealt with elsewhere.  The remaining ones all deal\n     with bits:\ndiff --git a/libstdc++-v3/doc/html/manual/ext_demangling.html b/libstdc++-v3/doc/html/manual/ext_demangling.html\nindex 0275830f3ba..a2dd3c7f527 100644\n--- a/libstdc++-v3/doc/html/manual/ext_demangling.html\n+++ b/libstdc++-v3/doc/html/manual/ext_demangling.html\n@@ -1,8 +1,8 @@\n \n-Chapter 28. Demangling
    Chapter 28. Demangling
    Prev Part III. \n+Chapter 29. Demangling
    Chapter 29. Demangling
    Prev Part III. \n   Extensions\n   \n- Next
    Chapter 28. Demangling
    \n+
    		 Next
    Chapter 29. Demangling
    \n     Transforming C++ ABI identifiers (like RTTI symbols) into the\n     original C++ source identifiers is called\n     “demangling.”\n@@ -57,4 +57,4 @@ int main()\n      be writing C++ in order to demangle C++.  (That also means we have to\n      use crummy memory management facilities, so don't forget to\n      free() the returned char array.)\n-   
    Prev Up Next
    Chapter 27. Input and Output Home Chapter 29. Concurrency
    \n\\ No newline at end of file\n+   
    Prev Up Next
    Chapter 28. Input and Output Home Chapter 30. Concurrency
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/ext_io.html b/libstdc++-v3/doc/html/manual/ext_io.html\nindex 7bf81dfa860..2959d5d554f 100644\n--- a/libstdc++-v3/doc/html/manual/ext_io.html\n+++ b/libstdc++-v3/doc/html/manual/ext_io.html\n@@ -1,8 +1,8 @@\n \n-Chapter 27. Input and Output
    Chapter 27. Input and Output
    Prev Part III. \n+Chapter 28. Input and Output
    Chapter 28. Input and Output
    Prev Part III. \n   Extensions\n   \n- Next
    Chapter 27. Input and Output
    Table of Contents
    Derived filebufs
    \n+
    		 Next
    Chapter 28. Input and Output
    Table of Contents
    Derived filebufs
    \n     Extensions allowing filebufs to be constructed from\n     \"C\" types like  FILE*s and file descriptors.\n   
    Derived filebufs
    The v2 library included non-standard extensions to construct\n@@ -43,4 +43,4 @@\n \t __gnu_cxx::stdio_filebuf.\n \t This class can be constructed from a C FILE* or a file\n \t descriptor, and provides the fd() function.\n-     
    Prev Up Next
    Chapter 26. Iterators Home Chapter 28. Demangling
    \n\\ No newline at end of file\n+
    Prev Up Next
    Chapter 27. Iterators Home Chapter 29. Demangling
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/ext_iterators.html b/libstdc++-v3/doc/html/manual/ext_iterators.html\nindex 952f1b5bb62..b349aab81ad 100644\n--- a/libstdc++-v3/doc/html/manual/ext_iterators.html\n+++ b/libstdc++-v3/doc/html/manual/ext_iterators.html\n@@ -1,8 +1,8 @@\n \n-Chapter 26. Iterators
    Chapter 26. Iterators
    Prev Part III. \n+Chapter 27. Iterators
    Chapter 27. Iterators
    Prev Part III. \n Extensions\n \n- Next

    Chapter 26. Iterators

    24.3.2 describes struct iterator, which didn't exist in the\n+

    		 Next

    Chapter 27. Iterators

    24.3.2 describes struct iterator, which didn't exist in the\n original HP STL implementation (the language wasn't rich enough at the\n time). For backwards compatibility, base classes are provided which\n declare the same nested typedefs:\n@@ -10,4 +10,4 @@\n two iterators and returns a result. It is extended by another signature\n which takes two iterators and a reference to a result. The result is\n modified, and the function returns nothing.\n-

    Prev Up Next
    Chapter 25. Numerics Home Chapter 27. Input and Output
    \n\\ No newline at end of file\n+

    Prev Up Next
    Chapter 26. Numerics Home Chapter 28. Input and Output
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/ext_numerics.html b/libstdc++-v3/doc/html/manual/ext_numerics.html\nindex c3a5623d175..05602f475b3 100644\n--- a/libstdc++-v3/doc/html/manual/ext_numerics.html\n+++ b/libstdc++-v3/doc/html/manual/ext_numerics.html\n@@ -1,8 +1,8 @@\n \n-Chapter 25. Numerics
    Chapter 25. Numerics
    Prev Part III. \n+Chapter 26. Numerics
    Chapter 26. Numerics
    Prev Part III. \n Extensions\n \n- Next

    Chapter 25. Numerics

    26.4, the generalized numeric operations such as accumulate,\n+

    		 Next

    Chapter 26. Numerics

    26.4, the generalized numeric operations such as accumulate,\n are extended with the following functions:\n 

    \n    power (x, n);\n@@ -20,4 +20,4 @@\n    value + 1 to *(first + 1) and so on.\"\n 
    \n    void iota(_ForwardIter first, _ForwardIter last, _Tp value);
    The iota function is included in the ISO C++ 2011 standard.\n-
    Prev Up Next
    Chapter 24. Algorithms Home Chapter 26. Iterators
    \n\\ No newline at end of file\n+

    Prev Up Next
    Chapter 25. Algorithms Home Chapter 27. Iterators
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/ext_preface.html b/libstdc++-v3/doc/html/manual/ext_preface.html\nindex 0de4378a6c1..c95c37544a2 100644\n--- a/libstdc++-v3/doc/html/manual/ext_preface.html\n+++ b/libstdc++-v3/doc/html/manual/ext_preface.html\n@@ -1,5 +1,5 @@\n \n-
    Prev Part III. \n+
    Prev Part III. \n Extensions\n \n  Next

    \n@@ -23,4 +23,4 @@ extensions, be aware of two things:\n

    Prev Up Next
    Part III. \n Extensions\n \n- Home Chapter 16. Compile Time Checks
    \n\\ No newline at end of file\n+     		Home Chapter 17. Compile Time Checks
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/ext_sgi.html b/libstdc++-v3/doc/html/manual/ext_sgi.html\nindex 5a796e79424..393f6268581 100644\n--- a/libstdc++-v3/doc/html/manual/ext_sgi.html\n+++ b/libstdc++-v3/doc/html/manual/ext_sgi.html\n@@ -1,5 +1,5 @@\n \n-Deprecated
    Deprecated
    Prev Chapter 22. HP/SGI Extensions Next

    Deprecated

    \n+Deprecated

    Deprecated
    Prev Chapter 23. HP/SGI Extensions Next

    Deprecated

    \n The SGI hashing classes hash_set and\n hash_set have been deprecated by the\n unordered_set, unordered_multiset, unordered_map,\n@@ -55,4 +55,4 @@\n associative containers defined in the ISO C++ 2011 standard in the\n headers <unordered_map>\n and <unordered_set>.\n-

    Prev Up Next
    Chapter 22. HP/SGI Extensions Home Chapter 23. Utilities
    \n\\ No newline at end of file\n+

    Prev Up Next
    Chapter 23. HP/SGI Extensions Home Chapter 24. Utilities
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/ext_utilities.html b/libstdc++-v3/doc/html/manual/ext_utilities.html\nindex 9caf65f89eb..6200b01e30c 100644\n--- a/libstdc++-v3/doc/html/manual/ext_utilities.html\n+++ b/libstdc++-v3/doc/html/manual/ext_utilities.html\n@@ -1,8 +1,8 @@\n \n-Chapter 23. Utilities
    Chapter 23. Utilities
    Prev Part III. \n+Chapter 24. Utilities
    Chapter 24. Utilities
    Prev Part III. \n Extensions\n \n- Next

    Chapter 23. Utilities

    \n+

    		 Next

    Chapter 24. Utilities

    \n The <functional> header\n contains many additional functors\n and helper functions, extending section 20.3. They are\n@@ -38,4 +38,4 @@ get_temporary_buffer(5, (int*)0);\n

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

    Prev Up Next
    Deprecated Home Chapter 24. Algorithms
    \n\\ No newline at end of file\n+

    Prev Up Next
    Deprecated Home Chapter 25. Algorithms
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/extensions.html b/libstdc++-v3/doc/html/manual/extensions.html\nindex 1b13d711714..01682ad8d21 100644\n--- a/libstdc++-v3/doc/html/manual/extensions.html\n+++ b/libstdc++-v3/doc/html/manual/extensions.html\n@@ -1,12 +1,12 @@\n \n-Part III.  Extensions
    Part III. \n+Part III.  Extensions
    Part III. \n Extensions\n \n
    Prev The GNU C++ Library Manual Next

    Part III. \n Extensions\n \n-

    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\n- 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. The mt_allocator
    Intro
    Design Issues
    Overview
    Implementation
    Tunable Parameters
    Initialization
    Deallocation Notes
    Single Thread Example
    Multiple Thread Example
    20. 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
    21. 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
    \n+

    Table of Contents

    17. Compile Time Checks
    18. 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\n+ debug-mode components
    Alternatives for Coexistence
    Other Implementations
    19. 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
    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
    \n \t Configuring via Template Parameters\n \t
    \n \t Querying Container Attributes\n@@ -68,7 +68,7 @@\n \t Text modify Up\n \t
    \n \t Text modify Down\n-\t
    Observations
    Associative
    Priority_Queue
    Acknowledgments
    Bibliography
    22. HP/SGI Extensions
    Backwards Compatibility
    Deprecated
    23. Utilities
    24. Algorithms
    25. Numerics
    26. Iterators
    27. Input and Output
    Derived filebufs
    28. Demangling
    29. Concurrency
    Design
    Interface to Locks and Mutexes
    Interface to Atomic Functions
    Implementation
    Using Built-in Atomic Functions
    Thread Abstraction
    Use
    Prev Up Next
    Chapter 15. \n+\t
    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 Built-in Atomic Functions
    Thread Abstraction
    Use
    Prev Up Next
    Chapter 16. \n Concurrency\n \n  Home 
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/fstreams.html b/libstdc++-v3/doc/html/manual/fstreams.html\nindex f3d56e60ed7..05f67e020e2 100644\n--- a/libstdc++-v3/doc/html/manual/fstreams.html\n+++ b/libstdc++-v3/doc/html/manual/fstreams.html\n@@ -1,5 +1,5 @@\n \n-File Based Streams
    File Based Streams
    Prev Chapter 13. \n+File Based Streams
    File Based Streams
    Prev Chapter 14. \n Input and Output\n \n  Next

    File Based Streams

    Copying a File

    \ndiff --git a/libstdc++-v3/doc/html/manual/index.html b/libstdc++-v3/doc/html/manual/index.html\nindex fb61205678f..bb9b37b28ab 100644\n--- a/libstdc++-v3/doc/html/manual/index.html\n+++ b/libstdc++-v3/doc/html/manual/index.html\n@@ -33,20 +33,23 @@\n

    Mutating
    swap
    Specializations
    12. \n Numerics\n \n-
    Complex
    complex Processing
    Generalized Operations
    Interacting with C
    Numerics vs. Arrays
    C99
    13. \n+
    Complex
    complex Processing
    Generalized Operations
    Interacting with C
    Numerics vs. Arrays
    C99
    13. \n+ Time\n+ \n+
    Time zone database
    tzdb uses zic format
    current zone
    data sources
    tzdb_list::const_iterator extents lifetime
    14. \n Input and Output\n \n-
    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
    14. \n+
    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
    15. \n Atomics\n \n-
    API Reference
    15. \n+
    API Reference
    16. \n Concurrency\n \n
    API Reference
    III. \n Extensions\n \n-
    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\n- 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. The mt_allocator
    Intro
    Design Issues
    Overview
    Implementation
    Tunable Parameters
    Initialization
    Deallocation Notes
    Single Thread Example
    Multiple Thread Example
    20. 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
    21. 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
    \n+
    17. Compile Time Checks
    18. 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\n+ debug-mode components
    Alternatives for Coexistence
    Other Implementations
    19. 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
    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
    \n \t Configuring via Template Parameters\n \t
    \n \t Querying Container Attributes\n@@ -108,7 +111,7 @@\n \t Text modify Up\n \t
    \n \t Text modify Down\n-\t
    Observations
    Associative
    Priority_Queue
    Acknowledgments
    Bibliography
    22. HP/SGI Extensions
    Backwards Compatibility
    Deprecated
    23. Utilities
    24. Algorithms
    25. Numerics
    26. Iterators
    27. Input and Output
    Derived filebufs
    28. Demangling
    29. Concurrency
    Design
    Interface to Locks and Mutexes
    Interface to Atomic Functions
    Implementation
    Using Built-in Atomic Functions
    Thread Abstraction
    Use
    IV. \n+\t
    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 Built-in Atomic Functions
    Thread Abstraction
    Use
    IV. \n Appendices\n
    A. \n Contributing\n@@ -139,19 +142,19 @@ Support for C++11 dialect.\n \n
    D. \n GNU General Public License version 3\n-
    E. GNU Free Documentation License

    List of Figures

    21.1. Node Invariants
    21.2. Underlying Associative Data Structures
    21.3. Range Iteration in Different Data Structures
    21.4. Point Iteration in Hash Data Structures
    21.5. Effect of erase in different underlying data structures
    21.6. Underlying Priority Queue Data Structures
    21.7. Exception Hierarchy
    21.8. Non-unique Mapping Standard Containers
    21.9. \n+
    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. \n \t Effect of embedded lists in\n \t std::multimap\n-\t
    21.10. Non-unique Mapping Containers
    21.11. Point Iterator Hierarchy
    21.12. Invalidation Guarantee Tags Hierarchy
    21.13. Container Tag Hierarchy
    21.14. Hash functions, ranged-hash functions, and\n-\t range-hashing functions
    21.15. Insert hash sequence diagram
    21.16. Insert hash sequence diagram with a null policy
    21.17. Hash policy class diagram
    21.18. Balls and bins
    21.19. Insert resize sequence diagram
    21.20. Standard resize policy trigger sequence\n-\t\tdiagram
    21.21. Standard resize policy size sequence\n-\t\tdiagram
    21.22. Tree node invariants
    21.23. Tree node invalidation
    21.24. A tree and its update policy
    21.25. Restoring node invariants
    21.26. Insert update sequence
    21.27. Useless update path
    21.28. A PATRICIA trie
    21.29. A trie and its update policy
    21.30. A simple list
    21.31. The counter algorithm
    21.32. Underlying Priority-Queue Data-Structures.
    21.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++ 2014 Implementation Status
    1.4. C++ Technical Specifications Implementation Status
    1.5. C++ 2017 Library Features
    1.6. C++ 2017 Implementation Status
    1.7. C++ Technical Specifications Implementation Status
    1.8. Support for Extended ABI Tags
    1.9. C++ 2020 Library Features
    1.10. C++ 2020 Implementation Status
    1.11. C++ 2023 Library Features
    1.12. C++ TR1 Implementation Status
    1.13. C++ TR 24733 Implementation Status
    1.14. C++ Special Functions 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++ 1998 Deprecated Library Header
    3.5. C++ 2011 Library Headers
    3.6. C++ 2011 Library Headers for C Library Facilities
    3.7. C++ 2014 Library Header
    3.8. C++ 2017 Library Headers
    3.9. C++ 2020 Library Headers
    3.10. C++ 2020 Obsolete Headers
    3.11. C++ 2023 Library Headers
    3.12. C++ 2026 Library Headers
    3.13. File System TS Header
    3.14. Library Fundamentals TS Headers
    3.15. Networking TS Headers
    3.16. C++ TR 1 Library Headers
    3.17. C++ TR 1 Library Headers for C Library Facilities
    3.18. C++ TR 24733 Decimal Floating-Point Header
    3.19. C++ ABI Headers
    3.20. Extension Headers
    3.21. Extension Debug Headers
    3.22. Extension Parallel Headers
    17.1. Debugging Containers
    17.2. Debugging Containers C++11
    18.1. Parallel Algorithms
    20.1. Bitmap Allocator Memory Map
    B.1. Doxygen Prerequisites
    B.2. HTML to Doxygen Markup Comparison
    B.3. Docbook Prerequisites
    B.4. HTML to Docbook XML Markup Comparison
    B.5. Docbook XML Element Use
    B.6. Extension Allocators
    B.7. Extension Allocators Continued

    List of Equations

    21.1. Ranged Hash Function
    21.2. Range-Hashing, Division Method
    21.3. Division via Prime Modulo
    21.4. Division via Bit Mask
    21.5. \n+\t
    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\n+\t 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\n+\t\tdiagram
    22.21. Standard resize policy size sequence\n+\t\tdiagram
    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++ 2014 Implementation Status
    1.4. C++ Technical Specifications Implementation Status
    1.5. C++ 2017 Library Features
    1.6. C++ 2017 Implementation Status
    1.7. C++ Technical Specifications Implementation Status
    1.8. Support for Extended ABI Tags
    1.9. C++ 2020 Library Features
    1.10. C++ 2020 Implementation Status
    1.11. C++ 2023 Library Features
    1.12. C++ TR1 Implementation Status
    1.13. C++ TR 24733 Implementation Status
    1.14. C++ Special Functions 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++ 1998 Deprecated Library Header
    3.5. C++ 2011 Library Headers
    3.6. C++ 2011 Library Headers for C Library Facilities
    3.7. C++ 2014 Library Header
    3.8. C++ 2017 Library Headers
    3.9. C++ 2020 Library Headers
    3.10. C++ 2020 Obsolete Headers
    3.11. C++ 2023 Library Headers
    3.12. C++ 2026 Library Headers
    3.13. File System TS Header
    3.14. Library Fundamentals TS Headers
    3.15. Networking TS Headers
    3.16. C++ TR 1 Library Headers
    3.17. C++ TR 1 Library Headers for C Library Facilities
    3.18. C++ TR 24733 Decimal Floating-Point Header
    3.19. C++ ABI Headers
    3.20. Extension Headers
    3.21. Extension Debug Headers
    3.22. Extension Parallel Headers
    18.1. Debugging Containers
    18.2. Debugging Containers C++11
    19.1. Parallel Algorithms
    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. \n \t\tA Standard String Hash Function\n-\t
    21.6. \n+\t
    22.6. \n \t\tOnly k String DNA Hash\n-\t
    21.7. \n+\t
    22.7. \n \t\tProbability of Probe Sequence of Length k\n-\t
    21.8. \n+\t
    22.8. \n \t\tProbability Probe Sequence in Some Bin\n \t
    Prev   Next
    The GNU C++ Library Home Part I. \n Introduction\ndiff --git a/libstdc++-v3/doc/html/manual/io.html b/libstdc++-v3/doc/html/manual/io.html\nindex 81c5597c6d4..4a2967608e4 100644\n--- a/libstdc++-v3/doc/html/manual/io.html\n+++ b/libstdc++-v3/doc/html/manual/io.html\n@@ -1,12 +1,12 @@\n \n-Chapter 13.  Input and Output
    Chapter 13. \n+Chapter 14.  Input and Output
    Chapter 14. \n Input and Output\n \n-
    Prev Part II. \n+
    Prev Part II. \n Standard Contents\n-  Next

    Chapter 13. \n+

    		 Next

    Chapter 14. \n Input and Output\n- \n+ \n

    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\n only include the headers you really need. Many people simply include\n <iostream> when they don't\n@@ -143,4 +143,7 @@\n the standard objects in that source file; you'll pay less startup\n time. Only include the header files you need to in general; your\n compile times will go down when there's less parsing work to do.\n-

    Prev Up Next
    Interacting with C Home Stream Buffers
    \n\\ No newline at end of file\n+

    Prev Up Next
    Chapter 13. \n+ Time\n+ \n+ Home Stream Buffers
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/io_and_c.html b/libstdc++-v3/doc/html/manual/io_and_c.html\nindex 753ff1068d6..34f0b961e39 100644\n--- a/libstdc++-v3/doc/html/manual/io_and_c.html\n+++ b/libstdc++-v3/doc/html/manual/io_and_c.html\n@@ -1,9 +1,9 @@\n \n-Interacting with C
    Interacting with C
    Prev Chapter 13. \n+Interacting with C
    Interacting with C
    Prev Chapter 14. \n Input and Output\n \n  Next

    Interacting with C

    Using FILE* and file descriptors

    \n- See the extensions for using\n+ See the extensions for using\n FILE and file descriptors with\n ofstream and\n ifstream.\n@@ -50,7 +50,7 @@\n clog, and their wide-character counterparts). File stream\n objects that you declare yourself have no such requirement and are fully\n buffered.\n-

    Prev Up Next
    File Based Streams Home Chapter 14. \n+

    Prev Up Next
    File Based Streams Home Chapter 15. \n Atomics\n \n
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/memory.html b/libstdc++-v3/doc/html/manual/memory.html\nindex 9dce18db1ea..b2bfda66dcf 100644\n--- a/libstdc++-v3/doc/html/manual/memory.html\n+++ b/libstdc++-v3/doc/html/manual/memory.html\n@@ -268,14 +268,14 @@\n

    \n \t A high-performance fixed-size allocator with\n \t exponentially-increasing allocations. It has its own\n-\t chapter\n+\t chapter\n in the documentation.\n

  • \n bitmap_allocator\n

    \n \t A high-performance allocator that uses a bit-map to keep track\n \t of the used and unused memory locations. It has its own\n-\t chapter\n+\t chapter\n in the documentation.\n

    • Bibliography

    \n ISO/IEC 14882:1998 Programming languages - C++\n@@ -377,7 +377,7 @@\n guaranteed to be messy.\n

    \n To prevent you from doing this to yourself, the\n- concept checks built\n+ concept checks built\n in to this implementation will issue an error if you try to\n compile code like this:\n 

    \ndiff --git a/libstdc++-v3/doc/html/manual/mt_allocator.html b/libstdc++-v3/doc/html/manual/mt_allocator.html\nindex 68e7dccde78..5d6c01f9792 100644\n--- a/libstdc++-v3/doc/html/manual/mt_allocator.html\n+++ b/libstdc++-v3/doc/html/manual/mt_allocator.html\n@@ -1,8 +1,8 @@\n \n-Chapter 19. The mt_allocator
    Chapter 19. The mt_allocator
    Prev Part III. \n+Chapter 20. The mt_allocator
    Chapter 20. The mt_allocator
    Prev Part III. \n   Extensions\n   \n- Next
    Chapter 19. The mt_allocator
    Table of Contents
    Intro
    Design Issues
    Overview
    Implementation
    Tunable Parameters
    Initialization
    Deallocation Notes
    Single Thread Example
    Multiple Thread Example
    \n+
    		 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
    \n 
    Intro
    \n   The mt allocator [hereinafter referred to simply as \"the allocator\"]\n   is a fixed size (power of two) allocator that was initially\ndiff --git a/libstdc++-v3/doc/html/manual/mt_allocator_design.html b/libstdc++-v3/doc/html/manual/mt_allocator_design.html\nindex 7541c3a8f4b..b08c0b7641a 100644\n--- a/libstdc++-v3/doc/html/manual/mt_allocator_design.html\n+++ b/libstdc++-v3/doc/html/manual/mt_allocator_design.html\n@@ -1,5 +1,5 @@\n \n-Design Issues
    Design Issues
    Prev Chapter 19. The mt_allocator Next
    Design Issues
    Overview
     There are three general components to the allocator: a datum\n+Design Issues
    Design Issues
    Prev Chapter 20. The mt_allocator Next
    Design Issues
    Overview
     There are three general components to the allocator: a datum\n describing the characteristics of the memory pool, a policy class\n containing this pool that links instantiation types to common or\n individual pools, and a class inheriting from the policy class that is\n@@ -35,4 +35,4 @@ tuning, for instance.\n

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

    Prev Up Next
    Chapter 19. The mt_allocator Home Implementation
    \n\\ No newline at end of file\n+

    Prev Up Next
    Chapter 20. The mt_allocator Home Implementation
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/mt_allocator_ex_multi.html b/libstdc++-v3/doc/html/manual/mt_allocator_ex_multi.html\nindex 67a1154164b..1cd1749d911 100644\n--- a/libstdc++-v3/doc/html/manual/mt_allocator_ex_multi.html\n+++ b/libstdc++-v3/doc/html/manual/mt_allocator_ex_multi.html\n@@ -1,5 +1,5 @@\n \n-Multiple Thread Example
    Multiple Thread Example
    Prev Chapter 19. The mt_allocator Next

    Multiple Thread Example

    \n+Multiple Thread Example

    Multiple Thread Example
    Prev Chapter 20. The mt_allocator Next

    Multiple Thread Example

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

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

    Prev Up Next
    Single Thread Example Home Chapter 20. The bitmap_allocator
    \n\\ No newline at end of file\n+

    Prev Up Next
    Single Thread Example Home Chapter 21. The bitmap_allocator
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/mt_allocator_ex_single.html b/libstdc++-v3/doc/html/manual/mt_allocator_ex_single.html\nindex 6934ec3aca9..7e30f72b953 100644\n--- a/libstdc++-v3/doc/html/manual/mt_allocator_ex_single.html\n+++ b/libstdc++-v3/doc/html/manual/mt_allocator_ex_single.html\n@@ -1,5 +1,5 @@\n \n-Single Thread Example
    Single Thread Example
    Prev Chapter 19. The mt_allocator Next

    Single Thread Example

    \n+Single Thread Example

    Single Thread Example
    Prev Chapter 20. The mt_allocator Next

    Single Thread Example

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

    \ndiff --git a/libstdc++-v3/doc/html/manual/mt_allocator_impl.html b/libstdc++-v3/doc/html/manual/mt_allocator_impl.html\nindex c69b9c5b55a..c4b128ad7b6 100644\n--- a/libstdc++-v3/doc/html/manual/mt_allocator_impl.html\n+++ b/libstdc++-v3/doc/html/manual/mt_allocator_impl.html\n@@ -1,5 +1,5 @@\n \n-Implementation
    Implementation
    Prev Chapter 19. The mt_allocator Next
    Implementation
    Tunable Parameters
    Certain allocation parameters can be modified, or tuned. There\n+Implementation
    Implementation
    Prev Chapter 20. The mt_allocator Next
    Implementation
    Tunable Parameters
    Certain allocation parameters can be modified, or tuned. There\n exists a nested struct __pool_base::_Tune that contains all\n these parameters, which include settings for\n 
    • 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\ndiff --git a/libstdc++-v3/doc/html/manual/numerics_and_c.html b/libstdc++-v3/doc/html/manual/numerics_and_c.html\nindex 8179dbf0f48..04d721d0855 100644\n--- a/libstdc++-v3/doc/html/manual/numerics_and_c.html\n+++ b/libstdc++-v3/doc/html/manual/numerics_and_c.html\n@@ -1,8 +1,8 @@\n \n-Interacting with C
    Interacting with C
    Prev Chapter 12. \n+Interacting with C
    Interacting with C
    Prev Chapter 12. \n   Numerics\n   \n- Next
    Interacting with C
    Numerics vs. Arrays
    One of the major reasons why FORTRAN can chew through numbers so well\n+
    		 Next
    Interacting with C
    Numerics vs. Arrays
    One of the major reasons why FORTRAN can chew through numbers so well\n       is that it is defined to be free of pointer aliasing, an assumption\n       that C89 is not allowed to make, and neither is C++98.  C99 adds a new\n       keyword, restrict, to apply to individual pointers.  The\n@@ -30,7 +30,7 @@\n       are supported, as is the lldiv_t typedef.  Also supported\n       are the wide character functions using 'long long', like\n       wcstoll.\n-   
    Prev Up Next
    Generalized Operations Home Chapter 13. \n-  Input and Output\n+   
    Prev Up Next
    Generalized Operations Home Chapter 13. \n+  Time\n   \n 
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/parallel_mode.html b/libstdc++-v3/doc/html/manual/parallel_mode.html\nindex 7ffa8bb606b..fbfd94e6843 100644\n--- a/libstdc++-v3/doc/html/manual/parallel_mode.html\n+++ b/libstdc++-v3/doc/html/manual/parallel_mode.html\n@@ -1,8 +1,8 @@\n \n-Chapter 18. Parallel Mode
    Chapter 18. Parallel Mode
    Prev Part III. \n+Chapter 19. Parallel Mode
    Chapter 19. Parallel Mode
    Prev Part III. \n   Extensions\n   \n- 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\n+
    		 Next
    Chapter 19. 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\n implementation of many algorithms of the C++ Standard Library.\n 
    \n Several of the standard algorithms, for instance\ndiff --git a/libstdc++-v3/doc/html/manual/parallel_mode_design.html b/libstdc++-v3/doc/html/manual/parallel_mode_design.html\nindex c2090940d24..bac64b0b468 100644\n--- a/libstdc++-v3/doc/html/manual/parallel_mode_design.html\n+++ b/libstdc++-v3/doc/html/manual/parallel_mode_design.html\n@@ -1,5 +1,5 @@\n \n-Design
    Design
    Prev Chapter 18. Parallel Mode Next
    Design
    \n+Design
    Design
    Prev Chapter 19. Parallel Mode Next
    Design
    \n   
    Interface Basics
    \n All parallel algorithms are intended to have signatures that are\n equivalent to the ISO C++ algorithms replaced. For instance, the\ndiff --git a/libstdc++-v3/doc/html/manual/parallel_mode_semantics.html b/libstdc++-v3/doc/html/manual/parallel_mode_semantics.html\nindex dcc29736de4..e3629a36e00 100644\n--- a/libstdc++-v3/doc/html/manual/parallel_mode_semantics.html\n+++ b/libstdc++-v3/doc/html/manual/parallel_mode_semantics.html\n@@ -1,5 +1,5 @@\n \n-Semantics
    Semantics
    Prev Chapter 18. Parallel Mode Next
    Semantics
     The parallel mode STL algorithms are currently not exception-safe,\n+Semantics
    Semantics
    Prev Chapter 19. Parallel Mode Next
    Semantics
     The parallel mode STL algorithms are currently not exception-safe,\n i.e. user-defined functors must not throw exceptions.\n Also, the order of execution is not guaranteed for some functions, of course.\n Therefore, user-defined functors should not have any concurrent side effects.\n@@ -7,4 +7,4 @@ Therefore, user-defined functors should not have any concurrent side effects.\n OpenMP parallel regions in concurrent threads,\n it is not possible to call parallel STL algorithm in\n concurrent threads, either.\n-It might work with other compilers, though.
    Prev Up Next
    Chapter 18. Parallel Mode Home Using
    \n\\ No newline at end of file\n+It might work with other compilers, though.
    Prev Up Next
    Chapter 19. Parallel Mode Home Using
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/parallel_mode_test.html b/libstdc++-v3/doc/html/manual/parallel_mode_test.html\nindex 912c6ef2e81..59cb0ad2d2a 100644\n--- a/libstdc++-v3/doc/html/manual/parallel_mode_test.html\n+++ b/libstdc++-v3/doc/html/manual/parallel_mode_test.html\n@@ -1,5 +1,5 @@\n \n-Testing
    Testing
    Prev Chapter 18. Parallel Mode Next
    Testing
    \n+Testing
    Testing
    Prev Chapter 19. Parallel Mode Next
    Testing
    \n     Both the normal conformance and regression tests and the\n     supplemental performance tests work.\n   
    \n@@ -22,4 +22,4 @@\n     additional software dependencies than the usual bare-boned text\n     file, and can be generated by using the make\n     doc-performance rule in the testsuite's Makefile.\n-
    Prev Up Next
    Design Home Chapter 19. The mt_allocator
    \n\\ No newline at end of file\n+
    Prev Up Next
    Design Home Chapter 20. The mt_allocator
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/parallel_mode_using.html b/libstdc++-v3/doc/html/manual/parallel_mode_using.html\nindex 38d629fe74f..6b42c1bedd0 100644\n--- a/libstdc++-v3/doc/html/manual/parallel_mode_using.html\n+++ b/libstdc++-v3/doc/html/manual/parallel_mode_using.html\n@@ -1,5 +1,5 @@\n \n-Using
    Using
    Prev Chapter 18. Parallel Mode Next
    Using
    Prerequisite Compiler Flags
    \n+Using
    Using
    Prev Chapter 19. Parallel Mode Next
    Using
    Prerequisite Compiler Flags
    \n   Any use of parallel functionality requires additional compiler\n   and runtime support, in particular support for OpenMP. Adding this support is\n   not difficult: just compile your application with the compiler\n@@ -63,4 +63,4 @@ Then compile this code with the prerequisite compiler flags\n flags for atomic operations.)\n 
     The following table provides the names and headers of all the\n   parallel algorithms that can be used in a similar manner:\n-
    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
    \n\\ No newline at end of file\n+
    Table 19.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
    \n\\ No newline at end of file\ndiff --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\nindex 7585a59e3f4..5ca2baa9604 100644\n--- a/libstdc++-v3/doc/html/manual/policy_based_data_structures_test.html\n+++ b/libstdc++-v3/doc/html/manual/policy_based_data_structures_test.html\n@@ -1,5 +1,5 @@\n \n-Testing
    Testing
    Prev Chapter 21. Policy-Based Data Structures Next
    Testing
    Regression
    The library contains a single comprehensive regression test.\n+Testing
    Testing
    Prev Chapter 22. Policy-Based Data Structures Next
    Testing
    Regression
    The library contains a single comprehensive regression test.\n     For a given container type in this library, the test creates\n     an object of the container type and an object of the\n     corresponding standard type (e.g., std::set). It\ndiff --git a/libstdc++-v3/doc/html/manual/policy_data_structures.html b/libstdc++-v3/doc/html/manual/policy_data_structures.html\nindex ba140809bbe..9dfe9685d53 100644\n--- a/libstdc++-v3/doc/html/manual/policy_data_structures.html\n+++ b/libstdc++-v3/doc/html/manual/policy_data_structures.html\n@@ -1,8 +1,8 @@\n \n-Chapter 21. Policy-Based Data Structures
    Chapter 21. Policy-Based Data Structures
    Prev Part III. \n+Chapter 22. Policy-Based Data Structures
    Chapter 22. Policy-Based Data Structures
    Prev Part III. \n   Extensions\n   \n- Next
    Chapter 21. 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
    \n+
    		 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
    \n \t    Configuring via Template Parameters\n \t  
    \n \t    Querying Container Attributes\n@@ -248,7 +248,7 @@\n \t\tthese invariants, one must supply some policy that is aware\n \t\tof these changes.  Without this, it would be better to use a\n \t\tlinked list (in itself very efficient for these purposes).\n-\t      
    Figure 21.1. Node Invariants
    \"Node

    Underlying Data Structures
    \n+\t      
    Figure 22.1. Node Invariants
    \"Node

    Underlying Data Structures
    \n \t    The standard C++ library contains associative containers based on\n \t    red-black trees and collision-chaining hash tables. These are\n \t    very useful, but they are not ideal for all types of\n@@ -256,7 +256,7 @@\n \t  
    \n \t    The figure below shows the different underlying data structures\n \t    currently supported in this library.\n-\t  
    Figure 21.2. Underlying Associative Data Structures
    \"Underlying

    \n+\t  
    Figure 22.2. Underlying Associative Data Structures
    \"Underlying

    \n \t    A shows a collision-chaining hash-table, B shows a probing\n \t    hash-table, C shows a red-black tree, D shows a splay tree, E shows\n \t    a tree based on an ordered vector(implicit in the order of the\n@@ -372,7 +372,7 @@\n \t      no guarantee that the elements traversed will coincide with the\n \t      logical elements between 1 and 5, as in\n \t      label B.\n-\t    
    Figure 21.3. Range Iteration in Different Data Structures
    \"Node

    \n+\t    
    Figure 22.3. Range Iteration in Different Data Structures
    \"Node

    \n \t      In our opinion, this problem is not caused just because\n \t      red-black trees are order preserving while\n \t      collision-chaining hash tables are (generally) not - it\n@@ -423,7 +423,7 @@\n \t      list, as in the graphic below, label B.  Here the iterators are as\n \t      light as can be, but the hash-table's operations are more\n \t      complicated.\n-\t    
    Figure 21.4. Point Iteration in Hash Data Structures
    \"Point

    \n+\t    
    Figure 22.4. Point Iteration in Hash Data Structures
    \"Point

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

    1. \n+\t    
      Figure 22.5. Effect of erase in different underlying data structures
      \"Effect

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

        \n+\t  
        Figure 22.6. Underlying Priority Queue Data Structures
        \"Underlying

        \n \t    No single implementation can completely replace any of the\n \t    others. Some have better push\n \t    and pop amortized performance, some have\ndiff --git a/libstdc++-v3/doc/html/manual/policy_data_structures_ack.html b/libstdc++-v3/doc/html/manual/policy_data_structures_ack.html\nindex e8a8dceaa7a..55fbb4d2c92 100644\n--- a/libstdc++-v3/doc/html/manual/policy_data_structures_ack.html\n+++ b/libstdc++-v3/doc/html/manual/policy_data_structures_ack.html\n@@ -1,5 +1,5 @@\n \n-Acknowledgments
        Acknowledgments
        Prev Chapter 21. Policy-Based Data Structures Next
        Acknowledgments
        \n+Acknowledgments
        Acknowledgments
        Prev Chapter 22. Policy-Based Data Structures Next
        Acknowledgments
        \n       Written by Ami Tavory and Vladimir Dreizin (IBM Haifa Research\n       Laboratories), and Benjamin Kosnik (Red Hat).\n     
        \n@@ -24,4 +24,4 @@\n       attributing to him any flaws in the design or implementation of the\n       library).\n     
        We would like to thank Matt Austern for the suggestion to\n-    include tries.
        Prev Up Next
        Testing Home Chapter 22. HP/SGI Extensions
        \n\\ No newline at end of file\n+    include tries.
        Prev Up Next
        Testing Home Chapter 23. HP/SGI Extensions
        \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/policy_data_structures_design.html b/libstdc++-v3/doc/html/manual/policy_data_structures_design.html\nindex 4e986f3f701..a84551e38db 100644\n--- a/libstdc++-v3/doc/html/manual/policy_data_structures_design.html\n+++ b/libstdc++-v3/doc/html/manual/policy_data_structures_design.html\n@@ -1,5 +1,5 @@\n \n-Design
        Design
        Prev Chapter 21. Policy-Based Data Structures Next
        Design
        Concepts
        Null Policy Classes
        \n+Design
        Design
        Prev Chapter 22. Policy-Based Data Structures Next
        Design
        Concepts
        Null Policy Classes
        \n \tAssociative containers are typically parametrized by various\n \tpolicies. For example, a hash-based associative container is\n \tparametrized by a hash-functor, transforming each key into an\n@@ -170,7 +170,7 @@\n \t  naturally; collision-chaining hash tables (label B) store\n \t  equivalent-key values in the same bucket, the bucket can be\n \t  arranged so that equivalent-key values are consecutive.\n-\t
        Figure 21.8. Non-unique Mapping Standard Containers
        \"Non-unique

        \n+\t
        Figure 22.8. Non-unique Mapping Standard Containers
        \"Non-unique

        \n \t  Put differently, the standards' non-unique mapping\n \t  associative-containers are associative containers that map\n \t  primary keys to linked lists that are embedded into the\n@@ -178,7 +178,7 @@\n \t  containers from the first graphic above, this time with\n \t  the embedded linked lists of the grayed nodes marked\n \t  explicitly.\n-\t
        Figure 21.9. \n+\t
        Figure 22.9. \n \t    Effect of embedded lists in\n \t    std::multimap\n \t  
        \"Effect

        \n@@ -252,7 +252,7 @@\n \t  first graphic above. Labels A and B, respectively. Each shaded\n \t  box represents some size-type or secondary\n \t  associative-container.\n-\t
        Figure 21.10. Non-unique Mapping Containers
        \"Non-unique

        \n+\t
        Figure 22.10. Non-unique Mapping Containers
        \"Non-unique

        \n \t  In the first example above, then, one would use an associative\n \t  container mapping each user to an associative container which\n \t  maps each application id to a start time (see\n@@ -305,7 +305,7 @@\n \tshows invariants for order-preserving containers: point-type\n \titerators are synonymous with range-type iterators.\n \tOrthogonally,  Cshows invariants for \"set\"\n-\tcontainers: iterators are synonymous with const iterators.
        Figure 21.11. Point Iterator Hierarchy
        \"Point

        Note that point-type iterators in self-organizing containers\n+\tcontainers: iterators are synonymous with const iterators.
        Figure 22.11. Point Iterator Hierarchy
        \"Point

        Note that point-type iterators in self-organizing containers\n \t(hash-based associative containers) lack movement\n \toperators, such as operator++ - in fact, this\n \tis the reason why this library differentiates from the standard C++ librarys\n@@ -344,7 +344,7 @@\n \t  to the question of whether point-type iterators and range-type\n \t  iterators are valid. The graphic below shows tags corresponding to\n \t  different types of invalidation guarantees.\n-\t
        Figure 21.12. Invalidation Guarantee Tags Hierarchy
        \"Invalidation

        • \n+\t
          Figure 22.12. Invalidation Guarantee Tags Hierarchy
          \"Invalidation

          • \n \t      basic_invalidation_guarantee\n \t      corresponds to a basic guarantee that a point-type iterator,\n \t      a found pointer, or a found reference, remains valid as long\n@@ -428,7 +428,7 @@\n \t
            \n \t  This library contains a container tag hierarchy corresponding to the\n \t  diagram below.\n-\t
            Figure 21.13. Container Tag Hierarchy
            \"Container

            \n+\t
            Figure 22.13. Container Tag Hierarchy
            \"Container

            \n \t  Given any container Cntnr, the tag of\n \t  the underlying data structure can be found via typename\n \t  Cntnr::container_category.\n@@ -487,7 +487,7 @@\n \tcollision-chaining container, except for the following.
            1. Comb_Probe_Fn describes how to transform a probe\n \t  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\n \tother parameters, and are explained below.
          Details
          Hash Policies
          General
          Following is an explanation of some functions which hashing\n-\t    involves. The graphic below illustrates the discussion.
          Figure 21.14. Hash functions, ranged-hash functions, and\n+\t    involves. The graphic below illustrates the discussion.
          Figure 22.14. Hash functions, ranged-hash functions, and\n \t      range-hashing functions
          \"Hash

          Let U be a domain (e.g., the integers, or the\n \t    strings of 3 characters). A hash-table algorithm needs to map\n \t    elements of U \"uniformly\" into the range [0,..., m -\n@@ -504,7 +504,7 @@\n \t    Z+,
          which maps a non-negative hash value, and a non-negative\n \t    range upper-bound into a non-negative integral in the range\n \t    between 0 (inclusive) and the range upper bound (exclusive),\n-\t    i.e., for any r in Z+,
          0 ≤ g(r, m) ≤ m - 1
          The resulting ranged-hash function, is
          Equation 21.1. Ranged Hash Function
          \n+\t    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
          \n \t\tf(u , m) = g(h(u), m)\n \t      

          From the above, it is obvious that given g and\n \t    h, f can always be composed (however the converse\n@@ -524,7 +524,7 @@\n \t    transforming the sequence of hash values into a sequence of\n \t    positions.
          Range Hashing
          Some common choices for range-hashing functions are the\n \t    division, multiplication, and middle-square methods ([biblio.knuth98sorting]), defined\n-\t    as
          Equation 21.2. Range-Hashing, Division Method
          \n+\t    as
          Equation 22.2. Range-Hashing, Division Method
          \n \t\tg(r, m) = r mod m\n \t      

          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\n \t    v (typically powers of 2), and some a. Each of\n@@ -535,9 +535,9 @@\n \t    implement using the low\n \t    level % (modulo) operation (for any m), or the\n \t    low level & (bit-mask) operation (for the case where\n-\t    m is a power of 2), i.e.,
          Equation 21.3. Division via Prime Modulo
          \n+\t    m is a power of 2), i.e.,
          Equation 22.3. Division via Prime Modulo
          \n \t\tg(r, m) = r % m\n-\t      

          and
          Equation 21.4. Division via Bit Mask
          \n+\t      

          and
          Equation 22.4. Division via Bit Mask
          \n \t\tg(r, m) = r & m - 1, (with m =\n \t\t2k for some k)\n \t      

          respectively.
          The % (modulo) implementation has the advantage that for\n@@ -563,7 +563,7 @@\n \t      s = [ s0,..., st - 1]\n \t    
          be a string of t characters, each of which is from\n \t    domain S. Consider the following ranged-hash\n-\t    function:
          Equation 21.5. \n+\t    function:
          Equation 22.5. \n \t\tA Standard String Hash Function\n \t      
          \n \t\tf1(s, m) = ∑ i =\n@@ -575,7 +575,7 @@\n \t    of a long DNA sequence (and so S = {'A', 'C', 'G',\n \t    'T'}). In this case, scanning the entire string might be\n \t    prohibitively expensive. A possible alternative might be to use\n-\t    only the first k characters of the string, where
          |S|k ≥ m ,
          i.e., using the hash function
          Equation 21.6. \n+\t    only the first k characters of the string, where
          |S|k ≥ m ,
          i.e., using the hash function
          Equation 22.6. \n \t\tOnly k String DNA Hash\n \t      
          \n \t\tf2(s, m) = ∑ i\n@@ -606,12 +606,12 @@\n \t      the container transforms the key into a non-negative integral\n \t      using the hash functor (points B and C), and transforms the\n \t      result into a position using the combining functor (points D\n-\t      and E).
          Figure 21.15. Insert hash sequence diagram
          \"Insert

          If cc_hash_table's\n+\t      and E).
          Figure 22.15. Insert hash sequence diagram
          \"Insert

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

          \n+\t      (points B and C).
          Figure 22.16. Insert hash sequence diagram with a null policy
          \"Insert

          \n \t\tProbing tables\n \t      
          gp_hash_table is parametrized by\n \t      Hash_Fn, Probe_Fn,\n@@ -634,7 +634,7 @@\n \t\ta linear probe and a quadratic probe function,\n \t\trespectively.
      \n \t\tThe graphic below shows the relationships.\n-\t      
      Figure 21.17. Hash policy class diagram
      \"Hash

    Resize Policies
    General
    Hash-tables, as opposed to trees, do not naturally grow or\n+\t      
    Figure 22.17. Hash policy class diagram
    \"Hash

    Resize Policies
    General
    Hash-tables, as opposed to trees, do not naturally grow or\n \t    shrink. It is necessary to specify policies to determine how\n \t    and when a hash table should change its size. Usually, resize\n \t    policies can be decomposed into orthogonal policies:
    1. A size policy indicating how a hash table\n@@ -669,10 +669,10 @@\n \t    and some load factor be denoted by Α. We would like to\n \t    calculate the minimal length of k, such that if there were Α\n \t    m elements in the hash table, a probe sequence of length k would\n-\t    be found with probability at most 1/m.
      Figure 21.18. Balls and bins
      \"Balls

      Denote the probability that a probe sequence of length\n+\t    be found with probability at most 1/m.
      Figure 22.18. Balls and bins
      \"Balls

      Denote the probability that a probe sequence of length\n \t    k appears in bin i by pi, the\n \t    length of the probe sequence of bin i by\n-\t    li, and assume uniform distribution. Then
      Equation 21.7. \n+\t    li, and assume uniform distribution. Then
      Equation 22.7. \n \t\tProbability of Probe Sequence of Length k\n \t      
      \n \t\tp1 =\n@@ -686,7 +686,7 @@\n \t    li are negatively-dependent\n \t    ([biblio.dubhashi98neg])\n \t    . Let\n-\t    I(.) denote the indicator function. Then
      Equation 21.8. \n+\t    I(.) denote the indicator function. Then
      Equation 22.8. \n \t\tProbability Probe Sequence in Some Bin\n \t      
      \n \t\tP( existsi li ≥ k ) =\n@@ -725,7 +725,7 @@\n \t      a resize is needed, and if so, what is the new size (points D\n \t      to G); following the resize, it notifies the policy that a\n \t      resize has completed (point H); finally, the element is\n-\t      inserted, and the policy notified (point I).
      Figure 21.19. Insert resize sequence diagram
      \"Insert

      In practice, a resize policy can be usually orthogonally\n+\t      inserted, and the policy notified (point I).
      Figure 22.19. Insert resize sequence diagram
      \"Insert

      In practice, a resize policy can be usually orthogonally\n \t      decomposed to a size policy and a trigger policy. Consequently,\n \t      the library contains a single class for instantiating a resize\n \t      policy: hash_standard_resize_policy\n@@ -734,8 +734,8 @@\n \t      both, and acts as a standard delegate ([biblio.gof])\n \t      to these policies.
      The two graphics immediately below show sequence diagrams\n \t      illustrating the interaction between the standard resize policy\n-\t      and its trigger and size policies, respectively.
      Figure 21.20. Standard resize policy trigger sequence\n-\t\tdiagram
      \"Standard

      Figure 21.21. Standard resize policy size sequence\n+\t      and its trigger and size policies, respectively.
      Figure 22.20. Standard resize policy trigger sequence\n+\t\tdiagram
      \"Standard

      Figure 22.21. Standard resize policy size sequence\n \t\tdiagram
      \"Standard

      Predefined Policies
      The library includes the following\n \t      instantiations of size and trigger policies:
      1. hash_load_check_resize_trigger\n \t\timplements a load check trigger policy.
      2. cc_hash_max_collision_check_resize_trigger\n@@ -878,7 +878,7 @@\n \t  each node, and maintains node invariants (see [biblio.clrs2001].) The first stores in\n \t  each node the size of the sub-tree rooted at the node; the\n \t  second stores at each node the maximal endpoint of the\n-\t  intervals at the sub-tree rooted at the node.
        Figure 21.22. Tree node invariants
        \"Tree

        Supporting such trees is difficult for a number of\n+\t  intervals at the sub-tree rooted at the node.
        Figure 22.22. Tree node invariants
        \"Tree

        Supporting such trees is difficult for a number of\n \t  reasons:
        1. There must be a way to specify what a node's metadata\n \t    should be (if any).
        2. Various operations can invalidate node\n \t    invariants.  The graphic below shows how a right rotation,\n@@ -892,7 +892,7 @@\n \t    metadata.
        3. It is not feasible to know in advance which methods trees\n \t    can support. Besides the usual find method, the\n \t    first tree can support a find_by_order method, while\n-\t    the second can support an overlaps method.
        Figure 21.23. Tree node invalidation
        \"Tree

        These problems are solved by a combination of two means:\n+\t    the second can support an overlaps method.
      Figure 22.23. Tree node invalidation
      \"Tree

      These problems are solved by a combination of two means:\n \t  node iterators, and template-template node updater\n \t  parameters.
      Node Iterators
      Each tree-based container defines two additional iterator\n \t    types, const_node_iterator\n@@ -921,7 +921,7 @@\n \t    node_update class, and publicly subclasses\n \t    node_update. The graphic below shows this\n \t    scheme, as well as some predefined policies (which are explained\n-\t    below).
      Figure 21.24. A tree and its update policy
      \"A

      node_update (an instantiation of\n+\t    below).
      Figure 22.24. A tree and its update policy
      \"A

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

      When a tree operation might invalidate some node invariant,\n+\t    nodes should have valid invariants, as in label B.
      Figure 22.25. Restoring node invariants
      \"Restoring

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

      To complete the description of the scheme, three questions\n+\t    .
      Figure 22.26. Insert update sequence
      \"Insert

      To complete the description of the scheme, three questions\n \t    need to be answered:
      1. How can a tree which supports order statistics define a\n \t      method such as find_by_order?
      2. How can the node updater base access methods of the\n \t      tree?
      3. How can the following cyclic dependency be resolved?\n@@ -990,7 +990,7 @@\n \t      node's metadata (this is halting reducible). In the graphic\n \t      below, assume the shaded node is inserted. The tree would have\n \t      to traverse the useless path shown to the root, applying\n-\t      redundant updates all the way.
      Figure 21.27. Useless update path
      \"Useless

      A null policy class, null_node_update\n+\t      redundant updates all the way.
    Figure 22.27. Useless update path
    \"Useless

    A null policy class, null_node_update\n \t    solves both these problems. The tree detects that node\n \t    invariants are irrelevant, and defines all accordingly.
    Split and Join
    Tree-based containers support split and join methods.\n \t  It is possible to split a tree so that it passes\n@@ -1073,7 +1073,7 @@\n \t  sub-tree with leafs \"a\" and \"as\". The maximal common prefix is\n \t  \"a\". The internal node contains, consequently, to const\n \t  iterators, one pointing to 'a', and the other to\n-\t  's'.
    Figure 21.28. A PATRICIA trie
    \"A

    Node Invariants
    Trie-based containers support node invariants, as do\n+\t  's'.
    Figure 22.28. A PATRICIA trie
    \"A

    Node Invariants
    Trie-based containers support node invariants, as do\n \t  tree-based containers. There are two minor\n \t  differences, though, which, unfortunately, thwart sharing them\n \t  sharing the same node-updating policies:
    1. A trie's Node_Update template-template\n@@ -1082,7 +1082,7 @@\n \t    parametrized by Cmp_Fn.
    2. Tree-based containers store values in all nodes, while\n \t    trie-based containers (at least in this implementation) store\n \t    values in leafs.
    The graphic below shows the scheme, as well as some predefined\n-\t  policies (which are explained below).
    Figure 21.29. A trie and its update policy
    \"A

    This library offers the following pre-defined trie node\n+\t  policies (which are explained below).
    Figure 22.29. A trie and its update policy
    \"A

    This library offers the following pre-defined trie node\n \t  updating policies:
    1. \n \t\ttrie_order_statistics_node_update\n \t\tsupports order statistics.\n@@ -1130,7 +1130,7 @@\n \t  simple list of integer keys. If we search for the integer 6, we\n \t  are paying an overhead: the link with key 6 is only the fifth\n \t  link; if it were the first link, it could be accessed\n-\t  faster.
      Figure 21.30. A simple list
      \"A

      List-update algorithms reorder lists as elements are\n+\t  faster.
      Figure 22.30. A simple list
      \"A

      List-update algorithms reorder lists as elements are\n \t  accessed. They try to determine, by the access history, which\n \t  keys to move to the front of the list. Some of these algorithms\n \t  require adding some metadata alongside each entry.
      For example, in the graphic below label A shows the counter\n@@ -1140,7 +1140,7 @@\n \t  predetermined value, say 10, as shown in label C, the count is set\n \t  to 0 and the node is moved to the front of the list, as in label\n \t  D.\n-\t  
      Figure 21.31. The counter algorithm
      \"The

    Policies
    this library allows instantiating lists with policies\n+\t  
    Figure 22.31. The counter algorithm
    \"The

    Policies
    this library allows instantiating lists with policies\n \t  implementing any algorithm moving nodes to the front of the\n \t  list (policies implementing algorithms interchanging nodes are\n \t  unsupported).
    Associative containers based on lists are parametrized by a\n@@ -1312,7 +1312,7 @@\n \t  sequence; the second uses a tree (or forest of trees), which is\n \t  typically less structured than an associative container's tree;\n \t  the third simply uses an associative container. These are\n-\t  shown in the graphic below, in labels A1 and A2, label B, and label C.
    Figure 21.32. Underlying Priority-Queue Data-Structures.
    \"Underlying

    Roughly speaking, any value that is both pushed and popped\n+\t  shown in the graphic below, in labels A1 and A2, label B, and label C.
    Figure 22.32. Underlying Priority-Queue Data-Structures.
    \"Underlying

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

    Additionally, a traits mechanism can be used to query a\n+\t  
    Figure 22.33. Priority-Queue Data-Structure Tags.
    \"Priority-Queue

    Additionally, a traits mechanism can be used to query a\n \t  container type for its attributes. Given any container\n \t  Cntnr, then 
    __gnu_pbds::container_traits<Cntnr>
    \n \t  is a traits class identifying the properties of the\ndiff --git a/libstdc++-v3/doc/html/manual/policy_data_structures_using.html b/libstdc++-v3/doc/html/manual/policy_data_structures_using.html\nindex 10c13bedeac..a8175a71e7a 100644\n--- a/libstdc++-v3/doc/html/manual/policy_data_structures_using.html\n+++ b/libstdc++-v3/doc/html/manual/policy_data_structures_using.html\n@@ -1,5 +1,5 @@\n \n-Using
    Using
    Prev Chapter 21. Policy-Based Data Structures Next
    Using
    Prerequisites
    The library contains only header files, and does not require any\n+Using
    Using
    Prev Chapter 22. Policy-Based Data Structures Next
    Using
    Prerequisites
    The library contains only header files, and does not require any\n       other libraries except the standard C++ library . All classes are\n       defined in namespace __gnu_pbds. The library internally\n       uses macros beginning with PB_DS, but\n@@ -61,7 +61,7 @@\n \tIn addition, there are the following diagnostics classes,\n \tused to report errors specific to this library's data\n \tstructures.\n-      
    Figure 21.7. Exception Hierarchy
    \"Exception

    Tutorial
    Basic Use
    \n+      
    Figure 22.7. Exception Hierarchy
    \"Exception

    Tutorial
    Basic Use
    \n \t  For the most part, the policy-based containers containers in\n \t  namespace __gnu_pbds have the same interface as\n \t  the equivalent containers in the standard C++ library, except for\n@@ -479,4 +479,4 @@\n \t\tvery simple version of Dijkstra's shortest path\n \t\talgorithm:\n \t\tpriority_queue_dijkstra.cc\n-\t      
    Prev Up Next
    Chapter 21. Policy-Based Data Structures Home Design
    \n\\ No newline at end of file\n+\t      
    Prev Up Next
    Chapter 22. Policy-Based Data Structures Home Design
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/status.html b/libstdc++-v3/doc/html/manual/status.html\nindex 64a48408268..df8512b63ca 100644\n--- a/libstdc++-v3/doc/html/manual/status.html\n+++ b/libstdc++-v3/doc/html/manual/status.html\n@@ -93,7 +93,7 @@ mainline GCC, not in any particular release.\n       std::type_info::name() is the mangled type name.\n       You will need to call c++filt and pass the names as\n       command-line parameters to demangle them, or call a\n-      runtime demangler function.\n+      runtime demangler function.\n    
    20.1.5 [lib.allocator.requirements]/5\n       \"Implementors are encouraged to supply libraries that can\n       accept allocators that encapsulate more general memory models and that\n@@ -142,7 +142,7 @@ mainline GCC, not in any particular release.\n    
    27.7.1.3 [lib.stringbuf.virtuals]/16,\n       27.8.1.4 [lib.filebuf.virtuals]/10\n       The effects of pubsetbuf/setbuf are described in the\n-      Input and Output chapter.\n+      Input and Output chapter.\n    
    27.8.1.4 [lib.filebuf.virtuals]/16 Calling\n       fstream::sync when a get area exists will... whatever\n       fflush() does, I think.\ndiff --git a/libstdc++-v3/doc/html/manual/std_contents.html b/libstdc++-v3/doc/html/manual/std_contents.html\nindex 14586e8c75b..317d0f2033d 100644\n--- a/libstdc++-v3/doc/html/manual/std_contents.html\n+++ b/libstdc++-v3/doc/html/manual/std_contents.html\n@@ -30,13 +30,16 @@\n 
    Mutating
    swap
    Specializations
    12. \n   Numerics\n   \n-
    Complex
    complex Processing
    Generalized Operations
    Interacting with C
    Numerics vs. Arrays
    C99
    13. \n+
    Complex
    complex Processing
    Generalized Operations
    Interacting with C
    Numerics vs. Arrays
    C99
    13. \n+  Time\n+  \n+
    Time zone database
    tzdb uses zic format
    current zone
    data sources
    tzdb_list::const_iterator extents lifetime
    14. \n   Input and Output\n   \n-
    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
    14. \n+
    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
    15. \n   Atomics\n   \n-
    API Reference
    15. \n+
    API Reference
    16. \n   Concurrency\n   \n 
    API Reference
    Prev Up Next
    Debugging Support Home Chapter 4. \ndiff --git a/libstdc++-v3/doc/html/manual/streambufs.html b/libstdc++-v3/doc/html/manual/streambufs.html\nindex c175054ceff..8ae046c294d 100644\n--- a/libstdc++-v3/doc/html/manual/streambufs.html\n+++ b/libstdc++-v3/doc/html/manual/streambufs.html\n@@ -1,5 +1,5 @@\n \n-Stream Buffers
    Stream Buffers
    Prev Chapter 13. \n+Stream Buffers
    Stream Buffers
    Prev Chapter 14. \n   Input and Output\n   \n  Next
    Stream Buffers
    Derived streambuf Classes
    \n@@ -131,7 +131,7 @@\n       just those at the language/library level.  Kernel buffers, disk\n       buffers, and the like will also have an effect.  Inspecting and\n       changing those are system-dependent.\n-   
    Prev Up Next
    Chapter 13. \n+   
    Prev Up Next
    Chapter 14. \n   Input and Output\n   \n  Home Memory Based Streams
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/stringstreams.html b/libstdc++-v3/doc/html/manual/stringstreams.html\nindex e12e6543e74..bdfaba6d103 100644\n--- a/libstdc++-v3/doc/html/manual/stringstreams.html\n+++ b/libstdc++-v3/doc/html/manual/stringstreams.html\n@@ -1,5 +1,5 @@\n \n-Memory Based Streams
    Memory Based Streams
    Prev Chapter 13. \n+Memory Based Streams
    Memory Based Streams
    Prev Chapter 14. \n   Input and Output\n   \n  Next
    Memory Based Streams
    Compatibility With strstream
    \ndiff --git a/libstdc++-v3/doc/html/manual/test.html b/libstdc++-v3/doc/html/manual/test.html\nindex 00cb269e2f7..404d7ddbf87 100644\n--- a/libstdc++-v3/doc/html/manual/test.html\n+++ b/libstdc++-v3/doc/html/manual/test.html\n@@ -311,12 +311,12 @@ cat 27_io/objects/char/3_xin.in | a.out
    \n      This rule runs through the test suite under the\n-     debug mode.\n+     debug mode.\n    
    \n    make check-parallel\n    
    \n      This rule runs through the test suite under the\n-     parallel mode.\n+     parallel mode.\n    
    \n       We are interested in any strange failures of the testsuite;\n       please email the main libstdc++ mailing list if you see\n@@ -354,7 +354,7 @@ cat 27_io/objects/char/3_xin.in | a.out
    \n       To run the libstdc++ test suite under the\n-      debug mode, use\n+      debug mode, use\n       make check-debug. Alternatively, edit\n       libbuilddir/scripts/testsuite_flags\n       to add the compile-time flag -D_GLIBCXX_DEBUG to the\n@@ -370,7 +370,7 @@ cat 27_io/objects/char/3_xin.in | a.out
    dg-require-support\n       directives described below.\n     
    \n-      The parallel\n+      The parallel\n       mode can be tested using\n       make check-parallel, or in much the same manner\n       as the debug mode, substituting\ndiff --git a/libstdc++-v3/doc/html/manual/time.html b/libstdc++-v3/doc/html/manual/time.html\nnew file mode 100644\nindex 00000000000..7a5d188052a\n--- /dev/null\n+++ b/libstdc++-v3/doc/html/manual/time.html\n@@ -0,0 +1,145 @@\n+\n+Chapter 13.  Time
    Chapter 13. \n+  Time\n+  \n+
    Prev Part II. \n+    Standard Contents\n+   Next
    Chapter 13. \n+  Time\n+  \n+
    Table of Contents
    Time zone database
    tzdb uses zic format
    current zone
    data sources
    tzdb_list::const_iterator extents lifetime
    Time zone database
    \n+     The Time Zone Database\n+     Parser by Howard E. Hinnant is valuable source of information and\n+     examples of usage for date library, on which standard interface\n+     is based on.\n+   
    tzdb uses zic format
    \n+     When enabled (which is default) time zone database tzdb,\n+     uses a \n+     zic file format, both as the format of the input\n+     files, and for in-memory representation, resulting in reduced memory\n+     footprint.\n+   
    \n+     The transitions are generated and cached on the fly, when information\n+     for given zone is requested. In consequence, initial request for\n+     time_zone object are slower. To mitigate above,\n+     time_zone may be expanded for given time range at the start\n+     of the program (and after each reload), by iterating over\n+     sys_info, as in example below.\n+   
    \n+     void\n+     expand_zone(const std::chrono::time_zone* tz,\n+                 const std::chrono::sys_seconds start,\n+                 const std::chrono::sys_seconds end)\n+     {\n+       std::chrono::sys_seconds time = start;\n+       while (time < end) {\n+         const std::chrono::sys_info& info = tz->get_info(time);\n+         time = info.end + std::chrono::seconds(1);\n+       }\n+     }\n+   
    current zone
    \n+     The time_zone pointer returned from\n+     std::chrono::current_zone, is determined by looking up\n+     (by std::chrono::locate_zone) IANA zone name\n+     determined as follows (for platforms other than AIX and Windows):\n+   
    • \n+       On system supporting readlink, suffix components of the\n+       path of the file linked by /etc/localtime. The suffixes\n+       are matched in the other of increasing lenght, starting from final\n+       component, until the match is found in the time zone database.\n+       Any repeated slashes (//) are eliminated.\n+     
    • \n+       Names stored in the files /etc/timezone (Debian\n+       derivatives) or /var/db/zoneinfo (FreeBSD) in that order.\n+     
    • \n+       Values for TIMEZONE and ZONE keys in\n+       /etc/sysconfig/clock.\n+     
    • UTC.\n+     
    \n+     For AIX, the value of TZ environment value is used, with\n+     fallback to UTC.\n+   
    \n+     On Windows TimeZoneKeyName is mapped to the IANA zone, using\n+     internal mapping hard-coded in library, with fallback to UTC:\n+   
    • \n+       If returned TimeZoneKeyName is empty or DST is disabled,\n+       then value based on Bias is returned: Etc/UTC\n+       for zero, Etc/GMT+/-N for value that is multiply of 60,\n+       and empty string otherwise.\n+     
    • \n+       If mapping contains single entry for TimeZoneKeyName, that\n+       name is used.\n+     
    • \n+       If TimeZoneKeyName correspond to multiple IANA zone,\n+       2-letter country code, retrived by applying GetGeoInfoW\n+       on result of GetUserGeoID(GEOCLASS_NATION) is used.\n+       If determining country code fails, or no entry exits for given code,\n+       first mapping entry (001) is returned.\n+     
    data sources
    \n+      Depending on the build configuration (see\n+      --with-libstdcxx-zoneinfo= documentation in\n+      Configuring).\n+      the content of time zone database can be source from tzdata.zi\n+      and leapseconds files located in\n+      zoneinfo_dir, or static information embeded in the\n+      library.\n+    
    \n+      By default, zoneinfo_dir is set to the\n+      system-specific default directory (if suitable dir is know for target),\n+      usually /usr/share/zoneinfo. In case if no such directory\n+      exits, or does not contain required files in suitable format, embeded\n+      static data is used as fallback.\n+    
    \n+      In addition to --with-libstdcxx-zoneinfo= configure option\n+      (used during GCC build), the path of zoneinfo_dir\n+      can overridden by application by providing the definition of the\n+      __gnu_cxx::zoneinfo_dir_overrride() function. The\n+      returned path should be directory that contains tzdata.zi\n+      and leapseconds files in the\n+      \n+      zicformat.\n+    
    \n+      The embeded timezone information corresponds to the copy of the\n+      IANA database at time of the releases, and its version can be queried\n+      using std::chrono::get_tzdb().version.\n+    
    \n+      Time zone database can be disabled at the GCC configuration time,\n+      in such case a minimal time zone database is embeded as version\n+      ersatz. This database contains leapseconds data,\n+      Etc/UTC, Etc/GMT zones, and their aliases\n+      (Etc/Zulu, Etc/UCT, Etc/Universal,\n+      Etc/Greenwich, Etc/GMT0, Etc/GMT+0,\n+      Etc/GMT-0). Above information are sufficient to support\n+      conversion between utc_clock and sys_clock,\n+      as well as UTC fallback for current_zone\n+      (current zone).\n+    
    tzdb_list::const_iterator extents lifetime
    \n+      The std::chrono::reload_tzdb function may be used to load\n+      updated content of the tzdata.zi and leapseconds\n+      files from zoneinfo_dir (if\n+      data sources). In case if different\n+      version (std::chrono::remove_version() is different than\n+      std:chrono::get_tzdb().version, a new element is added at\n+      the front of the tzdb_list. This new database is used for\n+      any succeeding call to current_zone and\n+      locate_zone.\n+    
    \n+      The above process is thread-safe, and does not invalidate nor change any\n+      pre-existing pointers to time_zone. However, for long-running\n+      application it may leads to accumulation of time zone data, and thus\n+      increased memory usage. In most cases, this is acceptable even for long\n+      running applications, due infrequent updates to IANA database, and reduced\n+      footprint of libstdc++ implementation (see\n+      tzdb uses zic format).\n+    
    \n+      In case if above is not acceptable (e.g. due memory constrains), entries\n+      may be removed from tzdb_list using erase_after.\n+      In the case, it's up to user to guarantee that application no longer uses\n+      any time_zone* to removed database. To facilitate with above,\n+      libstdc++ provides an extension, and guarantees that\n+      that tzdb object erased from the list is not destroyed, until\n+      there is an tzdb_list::const_iterator pointing to it.\n+    
    Prev Up Next
    Interacting with C Home Chapter 14. \n+  Input and Output\n+  \n+
    \n\\ No newline at end of file\ndiff --git a/libstdc++-v3/doc/html/manual/using.html b/libstdc++-v3/doc/html/manual/using.html\nindex 27f503ecacc..387f509e41f 100644\n--- a/libstdc++-v3/doc/html/manual/using.html\n+++ b/libstdc++-v3/doc/html/manual/using.html\n@@ -46,7 +46,7 @@\n         header.\n         The libstdc++exp.a library\n         also provides all the symbols contained in this library.\n-      
    -fopenmpFor parallel mode.
    -ltbbLinking to tbb (Thread Building Blocks) is required for use of the\n+      
    -fopenmpFor parallel mode.
    -ltbbLinking to tbb (Thread Building Blocks) is required for use of the\n         Parallel Standard Algorithms and execution policies in\n         <execution>.\n       
    -ffreestanding\ndiff --git a/libstdc++-v3/doc/html/manual/using_macros.html b/libstdc++-v3/doc/html/manual/using_macros.html\nindex f1d8492fb9e..13438c47439 100644\n--- a/libstdc++-v3/doc/html/manual/using_macros.html\n+++ b/libstdc++-v3/doc/html/manual/using_macros.html\n@@ -80,7 +80,7 @@\n \tdetect violations of the requirements of the standard.  This\n \tmacro has no effect for freestanding implementations.\n \tThis is described in more detail in\n-\tCompile Time Checks.\n+\tCompile Time Checks.\n       
    _GLIBCXX_ASSERTIONS
    \n \tDefined by default when compiling with no optimization, undefined\n \tby default when compiling with optimization.\n@@ -93,22 +93,22 @@\n \twith no optimization.\n       
    _GLIBCXX_DEBUG
    \n \tUndefined by default. When defined, compiles user code using\n-\tthe debug mode.\n+\tthe debug mode.\n         When defined, _GLIBCXX_ASSERTIONS is defined\n         automatically, so all the assertions enabled by that macro are also\n         enabled in debug mode.\n       
    _GLIBCXX_DEBUG_PEDANTIC
    \n \tUndefined by default. When defined while compiling with\n-\tthe debug mode, makes\n+\tthe debug mode, makes\n \tthe debug mode extremely picky by making the use of libstdc++\n \textensions and libstdc++-specific behavior into errors.\n       
    _GLIBCXX_DEBUG_BACKTRACE
    \n \tUndefined by default. Considered only if libstdc++ has been configured with\n \t--enable-libstdcxx-backtrace=yes and if _GLIBCXX_DEBUG\n \tis defined. When defined display backtraces on\n-\tdebug mode assertions.\n+\tdebug mode assertions.\n       
    _GLIBCXX_PARALLEL
    Undefined by default. When defined, compiles user code\n-\tusing the parallel\n+\tusing the parallel\n \tmode.\n       
    _GLIBCXX_PARALLEL_ASSERTIONS
    Undefined by default, but when any parallel mode header is included\n       this macro will be defined to a non-zero value if\ndiff --git a/libstdc++-v3/doc/xml/manual/spine.xml b/libstdc++-v3/doc/xml/manual/spine.xml\nindex eff72bc13d7..47536f00077 100644\n--- a/libstdc++-v3/doc/xml/manual/spine.xml\n+++ b/libstdc++-v3/doc/xml/manual/spine.xml\n@@ -197,15 +197,19 @@\n \n \n \n-\n+\n+\n+\n+\n+\n \n \n \n-\n+\n \n \n \n-\n+\n \n \n \ndiff --git a/libstdc++-v3/doc/xml/manual/time.xml b/libstdc++-v3/doc/xml/manual/time.xml\nnew file mode 100644\nindex 00000000000..3b58cf514fa\n--- /dev/null\n+++ b/libstdc++-v3/doc/xml/manual/time.xml\n@@ -0,0 +1,208 @@\n+\n+\n+\n+\n+  Time\n+  <indexterm><primary>Time</primary></indexterm>\n+\n+  \n+    ISO C++\n+    library\n+  \n+\n+\n+\n+
    Time zone database\n+\n+\n+   \n+     The Time Zone Database\n+     Parser by Howard E. Hinnant is valuable source of information and\n+     examples of usage for date library, on which standard interface\n+     is based on.\n+   \n+\n+   
    tzdb uses zic format\n+\n+   \n+     When enabled (which is default) time zone database tzdb,\n+     uses a \n+     zic file format, both as the format of the input\n+     files, and for in-memory representation, resulting in reduced memory\n+     footprint.\n+   \n+   \n+     The transitions are generated and cached on the fly, when information\n+     for given zone is requested. In consequence, initial request for\n+     time_zone object are slower. To mitigate above,\n+     time_zone may be expanded for given time range at the start\n+     of the program (and after each reload), by iterating over\n+     sys_info, as in example below.\n+   \n+   \n+     void\n+     expand_zone(const std::chrono::time_zone* tz,\n+                 const std::chrono::sys_seconds start,\n+                 const std::chrono::sys_seconds end)\n+     {\n+       std::chrono::sys_seconds time = start;\n+       while (time < end) {\n+         const std::chrono::sys_info& info = tz->get_info(time);\n+         time = info.end + std::chrono::seconds(1);\n+       }\n+     }\n+   \n+  
    \n+\n+  
    current zone\n+\n+   \n+     The time_zone pointer returned from\n+     std::chrono::current_zone, is determined by looking up\n+     (by std::chrono::locate_zone) IANA zone name\n+     determined as follows (for platforms other than AIX and Windows):\n+   \n+   \n+     \n+       On system supporting readlink, suffix components of the\n+       path of the file linked by /etc/localtime. The suffixes\n+       are matched in the other of increasing lenght, starting from final\n+       component, until the match is found in the time zone database.\n+       Any repeated slashes (//) are eliminated.\n+     \n+     \n+       Names stored in the files /etc/timezone (Debian\n+       derivatives) or /var/db/zoneinfo (FreeBSD) in that order.\n+     \n+     \n+       Values for TIMEZONE and ZONE keys in\n+       /etc/sysconfig/clock.\n+     \n+     \n+       UTC.\n+     \n+   \n+\n+   \n+     For AIX, the value of TZ environment value is used, with\n+     fallback to UTC.\n+   \n+\n+   \n+     On Windows TimeZoneKeyName is mapped to the IANA zone, using\n+     internal mapping hard-coded in library, with fallback to UTC:\n+   \n+   \n+     \n+       If returned TimeZoneKeyName is empty or DST is disabled,\n+       then value based on Bias is returned: Etc/UTC\n+       for zero, Etc/GMT+/-N for value that is multiply of 60,\n+       and empty string otherwise.\n+     \n+     \n+       If mapping contains single entry for TimeZoneKeyName, that\n+       name is used.\n+     \n+     \n+       If TimeZoneKeyName correspond to multiple IANA zone,\n+       2-letter country code, retrived by applying GetGeoInfoW\n+       on result of GetUserGeoID(GEOCLASS_NATION) is used.\n+       If determining country code fails, or no entry exits for given code,\n+       first mapping entry (001) is returned.\n+     \n+   \n+  
    \n+\n+  
    data sources\n+    \n+      Depending on the build configuration (see\n+      --with-libstdcxx-zoneinfo= documentation in\n+      Configure section).\n+      the content of time zone database can be source from tzdata.zi\n+      and leapseconds files located in\n+      zoneinfo_dir, or static information embeded in the\n+      library.\n+    \n+\n+    \n+      By default, zoneinfo_dir is set to the\n+      system-specific default directory (if suitable dir is know for target),\n+      usually /usr/share/zoneinfo. In case if no such directory\n+      exits, or does not contain required files in suitable format, embeded\n+      static data is used as fallback.\n+    \n+\n+    \n+      In addition to --with-libstdcxx-zoneinfo= configure option\n+      (used during GCC build), the path of zoneinfo_dir\n+      can overridden by application by providing the definition of the\n+      __gnu_cxx::zoneinfo_dir_overrride() function. The\n+      returned path should be directory that contains tzdata.zi\n+      and leapseconds files in the\n+      \n+      zicformat.\n+    \n+\n+    \n+      The embeded timezone information corresponds to the copy of the\n+      IANA database at time of the releases, and its version can be queried\n+      using std::chrono::get_tzdb().version.\n+    \n+\n+    \n+      Time zone database can be disabled at the GCC configuration time,\n+      in such case a minimal time zone database is embeded as version\n+      ersatz. This database contains leapseconds data,\n+      Etc/UTC, Etc/GMT zones, and their aliases\n+      (Etc/Zulu, Etc/UCT, Etc/Universal,\n+      Etc/Greenwich, Etc/GMT0, Etc/GMT+0,\n+      Etc/GMT-0). Above information are sufficient to support\n+      conversion between utc_clock and sys_clock,\n+      as well as UTC fallback for current_zone\n+      (link).\n+    \n+  
    \n+\n+  
    \n+    tzdb_list::const_iterator extents lifetime\n+\n+    \n+      The std::chrono::reload_tzdb function may be used to load\n+      updated content of the tzdata.zi and leapseconds\n+      files from zoneinfo_dir (if\n+      enabled). In case if different\n+      version (std::chrono::remove_version() is different than\n+      std:chrono::get_tzdb().version, a new element is added at\n+      the front of the tzdb_list. This new database is used for\n+      any succeeding call to current_zone and\n+      locate_zone.\n+    \n+\n+    \n+      The above process is thread-safe, and does not invalidate nor change any\n+      pre-existing pointers to time_zone. However, for long-running\n+      application it may leads to accumulation of time zone data, and thus\n+      increased memory usage. In most cases, this is acceptable even for long\n+      running applications, due infrequent updates to IANA database, and reduced\n+      footprint of libstdc++ implementation (see\n+      link).\n+    \n+\n+    \n+      In case if above is not acceptable (e.g. due memory constrains), entries\n+      may be removed from tzdb_list using erase_after.\n+      In the case, it's up to user to guarantee that application no longer uses\n+      any time_zone* to removed database. To facilitate with above,\n+      libstdc++ provides an extension, and guarantees that\n+      that tzdb object erased from the list is not destroyed, until\n+      there is an tzdb_list::const_iterator pointing to it.\n+    \n+  
    \n+\n+
    \n+\n+\n","prefixes":[]}