diff options
author | Veres Lajos <vlajos@gmail.com> | 2013-07-04 21:07:44 +0000 |
---|---|---|
committer | Jonathan Wakely <redi@gcc.gnu.org> | 2013-07-04 22:07:44 +0100 |
commit | 1d77bc548ad22e5a82ab8f885ea045f3fdfabd24 (patch) | |
tree | fc6531c9a6079e2cf11d574aeb567dcff78f6a5a /libstdc++-v3/doc | |
parent | b1eb497f6177da39809f9098133a414e75f2e9e5 (diff) | |
download | gcc-1d77bc548ad22e5a82ab8f885ea045f3fdfabd24.zip gcc-1d77bc548ad22e5a82ab8f885ea045f3fdfabd24.tar.gz gcc-1d77bc548ad22e5a82ab8f885ea045f3fdfabd24.tar.bz2 |
codecvt_members.cc: Fix typo.
2013-07-04 Veres Lajos <vlajos@gmail.com>
Jonathan Wakely <jwakely.gcc@gmail.com>
* config/locale/generic/codecvt_members.cc: Fix typo.
* configure.host: Likewise.
* doc/html/manual/policy_data_structures_design.html: Likewise.
* doc/xml/manual/policy_data_structures.xml: Likewise.
* include/bits/hashtable.h: Likewise.
* include/bits/random.h: Likewise.
* include/profile/impl/profiler_trace.h: Likewise.
* testsuite/23_containers/deque/cons/2.cc: Likewise.
* testsuite/23_containers/deque/debug/shrink_to_fit.cc: Likewise.
* testsuite/ext/pb_ds/example/basic_multimap.cc: Likewise.
* testsuite/performance/23_containers/insert_erase/41975.cc: Likewise.
Co-Authored-By: Jonathan Wakely <jwakely.gcc@gmail.com>
From-SVN: r200681
Diffstat (limited to 'libstdc++-v3/doc')
-rw-r--r-- | libstdc++-v3/doc/html/manual/policy_data_structures_design.html | 2 | ||||
-rw-r--r-- | libstdc++-v3/doc/xml/manual/policy_data_structures.xml | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/libstdc++-v3/doc/html/manual/policy_data_structures_design.html b/libstdc++-v3/doc/html/manual/policy_data_structures_design.html index e31086b..0699838 100644 --- a/libstdc++-v3/doc/html/manual/policy_data_structures_design.html +++ b/libstdc++-v3/doc/html/manual/policy_data_structures_design.html @@ -862,7 +862,7 @@ <code class="classname">reverse_iterator</code> and <code class="classname">rbegin</code>), and different exception and invalidation guarantees.</p></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="container.tree.details"></a>Details</h5></div></div></div><div class="section"><div class="titlepage"><div><div><h6 class="title"><a id="container.tree.node"></a>Node Invariants</h6></div></div></div><p>Consider the two trees in the graphic below, labels A and B. The first is a tree of floats; the second is a tree of pairs, each - signifying a geometric line interval. Each element in a tree is refered to as a node of the tree. Of course, each of + signifying a geometric line interval. Each element in a tree is referred to as a node of the tree. Of course, each of these trees can support the usual queries: the first can easily search for <code class="classname">0.4</code>; the second can easily search for <code class="classname">std::make_pair(10, 41)</code>.</p><p>Each of these trees can efficiently support other queries. diff --git a/libstdc++-v3/doc/xml/manual/policy_data_structures.xml b/libstdc++-v3/doc/xml/manual/policy_data_structures.xml index 09a1db0..4de8236d97 100644 --- a/libstdc++-v3/doc/xml/manual/policy_data_structures.xml +++ b/libstdc++-v3/doc/xml/manual/policy_data_structures.xml @@ -3883,7 +3883,7 @@ <para>Consider the two trees in the graphic below, labels A and B. The first is a tree of floats; the second is a tree of pairs, each - signifying a geometric line interval. Each element in a tree is refered to as a node of the tree. Of course, each of + signifying a geometric line interval. Each element in a tree is referred to as a node of the tree. Of course, each of these trees can support the usual queries: the first can easily search for <classname>0.4</classname>; the second can easily search for <classname>std::make_pair(10, 41)</classname>.</para> |