* 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.

git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@182453 138bc75d-0d04-0410-961f-82ee72b054a4

diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog
index f050ad9..957d963 100644 (file)
--- a/libstdc++-v3/ChangeLog
+++ b/libstdc++-v3/ChangeLog
@@ -1,3 +1,10 @@
+2011-12-18  Jonathan Wakely  <jwakely.gcc@gmail.com>
+
+       * 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  <paolo.carlini@oracle.com>
            Jonathan Wakely  <jwakely.gcc@gmail.com>
 

diff --git a/libstdc++-v3/doc/html/manual/algorithms.html b/libstdc++-v3/doc/html/manual/algorithms.html
index 0b8c4b3..14098b2 100644 (file)
--- a/libstdc++-v3/doc/html/manual/algorithms.html
+++ b/libstdc++-v3/doc/html/manual/algorithms.html
@@ -9,7 +9,7 @@
   Algorithms
   <a id="id612473" class="indexterm"/>
 </h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="algorithms.html#std.algorithms.mutating">Mutating</a></span></dt><dd><dl><dt><span class="section"><a href="algorithms.html#algorithms.mutating.swap"><code class="function">swap</code></a></span></dt><dd><dl><dt><span class="section"><a href="algorithms.html#algorithms.swap.specializations">Specializations</a></span></dt></dl></dd></dl></dd></dl></div><p>
-  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:
 </p><div class="orderedlist"><ol class="orderedlist"><li class="listitem"><p>
@@ -31,13 +31,13 @@
   <span class="emphasis"><em>N</em></span> 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 <a class="link" href="containers.html" title="Chapter 9.  Containers">containers sect1</a> to keep
+  the <a class="link" href="containers.html" title="Chapter 9.  Containers">containers section</a> to keep
   real code readable.
 </p><p>
   The single thing that trips people up the most is the definition
   of <span class="emphasis"><em>range</em></span> used with iterators; the famous
   "past-the-end" rule that everybody loves to hate.  The
-  <a class="link" href="iterators.html" title="Chapter 10.  Iterators">iterators sect1</a> of this
+  <a class="link" href="iterators.html" title="Chapter 10.  Iterators">iterators section</a> of this
     document has a complete explanation of this simple rule that seems
     to cause so much confusion.  Once you
     get <span class="emphasis"><em>range</em></span> 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 ecf98a1..31f3ec7 100644 (file)
--- a/libstdc++-v3/doc/html/manual/iterators.html
+++ b/libstdc++-v3/doc/html/manual/iterators.html
@@ -23,7 +23,7 @@ classes.
      that <span class="emphasis"><em>pointers</em></span> are
       <span class="emphasis"><em>iterators</em></span>, 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.
    </p><p>
      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 831fe5f..94672ed 100644 (file)
--- a/libstdc++-v3/doc/xml/manual/algorithms.xml
+++ b/libstdc++-v3/doc/xml/manual/algorithms.xml
@@ -22,7 +22,7 @@
 
 
 <para>
-  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:
 </para>
@@ -53,14 +53,14 @@
   <emphasis>N</emphasis> 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 <link linkend="std.containers">containers sect1</link> to keep
+  the <link linkend="std.containers">containers section</link> to keep
   real code readable.
 </para>
 <para>
   The single thing that trips people up the most is the definition
   of <emphasis>range</emphasis> used with iterators; the famous
   "past-the-end" rule that everybody loves to hate.  The
-  <link linkend="std.iterators">iterators sect1</link> of this
+  <link linkend="std.iterators">iterators section</link> of this
     document has a complete explanation of this simple rule that seems
     to cause so much confusion.  Once you
     get <emphasis>range</emphasis> 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 bcfa30c..11dc3ae 100644 (file)
--- a/libstdc++-v3/doc/xml/manual/iterators.xml
+++ b/libstdc++-v3/doc/xml/manual/iterators.xml
@@ -41,7 +41,7 @@ classes.
      that <emphasis>pointers</emphasis> are
       <emphasis>iterators</emphasis>, 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.
    </para>
    <para>