diff options
| author | redi <redi@138bc75d-0d04-0410-961f-82ee72b054a4> | 2011-12-18 01:06:15 +0000 |
|---|---|---|
| committer | redi <redi@138bc75d-0d04-0410-961f-82ee72b054a4> | 2011-12-18 01:06:15 +0000 |
| commit | ee23ac8bb1ca58403495b0db1c29853bd4eb32bc (patch) | |
| tree | 3d725db933f797bf04883d800f3716857e16b2b8 /libstdc++-v3/doc/html | |
| parent | f979c46091006965e456ce1e94d1296b9a5c2875 (diff) | |
| download | ppe42-gcc-ee23ac8bb1ca58403495b0db1c29853bd4eb32bc.tar.gz ppe42-gcc-ee23ac8bb1ca58403495b0db1c29853bd4eb32bc.zip | |
* 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
Diffstat (limited to 'libstdc++-v3/doc/html')
| -rw-r--r-- | libstdc++-v3/doc/html/manual/algorithms.html | 6 | ||||
| -rw-r--r-- | libstdc++-v3/doc/html/manual/iterators.html | 2 |
2 files changed, 4 insertions, 4 deletions
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 <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 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 <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 |
