From 14227713ba760afb48493c66b4e7f425537c24a0 Mon Sep 17 00:00:00 2001 From: Jonathan Wakely Date: Sun, 18 Dec 2011 01:06:15 +0000 Subject: [PATCH] iterators.xml: Replace "sect1" with "section". * doc/xml/manual/iterators.xml: Replace "sect1" with "section". * doc/xml/manual/algorithms.xml: Likewise. * doc/html/manual/iterators.html: Likewise. * doc/html/manual/algorithms.html: Likewise. From-SVN: r182453 --- libstdc++-v3/ChangeLog | 7 +++++++ libstdc++-v3/doc/html/manual/algorithms.html | 6 +++--- libstdc++-v3/doc/html/manual/iterators.html | 2 +- libstdc++-v3/doc/xml/manual/algorithms.xml | 6 +++--- libstdc++-v3/doc/xml/manual/iterators.xml | 2 +- 5 files changed, 15 insertions(+), 8 deletions(-) diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog index f050ad903c0..957d9630cc2 100644 --- a/libstdc++-v3/ChangeLog +++ b/libstdc++-v3/ChangeLog @@ -1,3 +1,10 @@ +2011-12-18 Jonathan Wakely + + * doc/xml/manual/iterators.xml: Replace "sect1" with "section". + * doc/xml/manual/algorithms.xml: Likewise. + * doc/html/manual/iterators.html: Likewise. + * doc/html/manual/algorithms.html: Likewise. + 2011-12-15 Paolo Carlini Jonathan Wakely diff --git a/libstdc++-v3/doc/html/manual/algorithms.html b/libstdc++-v3/doc/html/manual/algorithms.html index 0b8c4b3be42..14098b2afad 100644 --- a/libstdc++-v3/doc/html/manual/algorithms.html +++ b/libstdc++-v3/doc/html/manual/algorithms.html @@ -9,7 +9,7 @@ Algorithms

Table of Contents

Mutating
swap
Specializations

- The neatest accomplishment of the algorithms sect1 is that all the + The neatest accomplishment of the algorithms section is that all the work is done via iterators, not containers directly. This means two important things:

  1. @@ -31,13 +31,13 @@ N as a size in the examples is to keep things easy to read but probably won't be valid code. You can use wrappers such as those described in - the containers sect1 to keep + the containers section to keep real code readable.

    The single thing that trips people up the most is the definition of range used with iterators; the famous "past-the-end" rule that everybody loves to hate. The - iterators sect1 of this + iterators section of this document has a complete explanation of this simple rule that seems to cause so much confusion. Once you get range into your head (it's not that hard, diff --git a/libstdc++-v3/doc/html/manual/iterators.html b/libstdc++-v3/doc/html/manual/iterators.html index ecf98a14df2..31f3ec7cd23 100644 --- a/libstdc++-v3/doc/html/manual/iterators.html +++ b/libstdc++-v3/doc/html/manual/iterators.html @@ -23,7 +23,7 @@ classes. that pointers are iterators, and that pointers can be used whenever an iterator would be. All those functions in the - Algorithms sect1 of the Standard will work just as well on plain + Algorithms section of the Standard will work just as well on plain arrays and their pointers.

    That doesn't mean that when you pass in a pointer, it gets diff --git a/libstdc++-v3/doc/xml/manual/algorithms.xml b/libstdc++-v3/doc/xml/manual/algorithms.xml index 831fe5fe602..94672ed4196 100644 --- a/libstdc++-v3/doc/xml/manual/algorithms.xml +++ b/libstdc++-v3/doc/xml/manual/algorithms.xml @@ -22,7 +22,7 @@ - The neatest accomplishment of the algorithms sect1 is that all the + The neatest accomplishment of the algorithms section is that all the work is done via iterators, not containers directly. This means two important things: @@ -53,14 +53,14 @@ N as a size in the examples is to keep things easy to read but probably won't be valid code. You can use wrappers such as those described in - the containers sect1 to keep + the containers section to keep real code readable. The single thing that trips people up the most is the definition of range used with iterators; the famous "past-the-end" rule that everybody loves to hate. The - iterators sect1 of this + iterators section of this document has a complete explanation of this simple rule that seems to cause so much confusion. Once you get range into your head (it's not that hard, diff --git a/libstdc++-v3/doc/xml/manual/iterators.xml b/libstdc++-v3/doc/xml/manual/iterators.xml index bcfa30cd5f9..11dc3ae8858 100644 --- a/libstdc++-v3/doc/xml/manual/iterators.xml +++ b/libstdc++-v3/doc/xml/manual/iterators.xml @@ -41,7 +41,7 @@ classes. that pointers are iterators, and that pointers can be used whenever an iterator would be. All those functions in the - Algorithms sect1 of the Standard will work just as well on plain + Algorithms section of the Standard will work just as well on plain arrays and their pointers.