diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog
index 613c734ba0eff93a19edd3e9bb006c57dd2678a9..8d864d927f218f4f52d908e1ccc8b28aa03680a0 100644
--- a/libstdc++-v3/ChangeLog
+++ b/libstdc++-v3/ChangeLog
@@ -1,3 +1,18 @@
+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.
+
2013-07-04 Ray Chason <chasonr@newsguy.com>
Paolo Carlini <paolo.carlini@oracle.com>
diff --git a/libstdc++-v3/config/locale/generic/codecvt_members.cc b/libstdc++-v3/config/locale/generic/codecvt_members.cc
index d94cb1de3d907ba39481e313c2861baaa3a85b02..75929a8821afa58fac85457bf0b26764066e720c 100644
--- a/libstdc++-v3/config/locale/generic/codecvt_members.cc
+++ b/libstdc++-v3/config/locale/generic/codecvt_members.cc
@@ -112,7 +112,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
intern_type*& __to_next) const
{
result __ret = ok;
- // This temporary state object is neccessary so __state won't be modified
+ // This temporary state object is necessary so __state won't be modified
// if [__from, __from_end) is a partial multibyte character.
state_type __tmp_state(__state);
diff --git a/libstdc++-v3/configure.host b/libstdc++-v3/configure.host
index 23b3f523bcf61d7c8fea0718ec3ad2b0add0a48b..c1684543ca9fabb2ec4bafc96defd0c765af0d09 100644
--- a/libstdc++-v3/configure.host
+++ b/libstdc++-v3/configure.host
@@ -66,7 +66,7 @@
# (defaults to empty in acinclude.m4)
#
# port_specific_symbol_files
-# whitespace-seperated list of files containing
+# whitespace-separated list of files containing
# additional symbols to export from the shared
# library, when symbol versioning is in use
#
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 e31086bebd3a245e010110369b30c8f8c9e84062..0699838a370ebace47407d943ad15a00de6ad1a7 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 09a1db02830aef3c00f6f24fea86da35cbad1ae1..4de8236d97fc905c9c8bca8cdb92ccb4d4e49bff 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>
diff --git a/libstdc++-v3/include/bits/hashtable.h b/libstdc++-v3/include/bits/hashtable.h
index 9b586b01e2404a4541addf1d8bb6ca82b205b8ea..4c553ef683a71fc145b883fe41c3c62a14b78ef3 100644
--- a/libstdc++-v3/include/bits/hashtable.h
+++ b/libstdc++-v3/include/bits/hashtable.h
@@ -1713,7 +1713,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
this->_M_store_code(__node, __code);
- // Always insert at the begining of the bucket.
+ // Always insert at the beginning of the bucket.
_M_insert_bucket_begin(__bkt, __node);
++_M_element_count;
return iterator(__node);
diff --git a/libstdc++-v3/include/bits/random.h b/libstdc++-v3/include/bits/random.h
index caabe906058b68588c6564ebbfdb08d0ca8ce1e3..74ef144300042eb1212c0c6d056779a68f002ffd 100644
--- a/libstdc++-v3/include/bits/random.h
+++ b/libstdc++-v3/include/bits/random.h
@@ -3333,7 +3333,7 @@ _GLIBCXX_BEGIN_NAMESPACE_VERSION
};
/**
- * @brief Return true if two Fisher f distributions are diferent.
+ * @brief Return true if two Fisher f distributions are different.
*/
template<typename _RealType>
inline bool
diff --git a/libstdc++-v3/include/profile/impl/profiler_trace.h b/libstdc++-v3/include/profile/impl/profiler_trace.h
index c5907f849e66254c51908e8968139d1b444a7caa..f7f2216ebb1d1e9d79ad0c0564df0e961ca053d1 100644
--- a/libstdc++-v3/include/profile/impl/profiler_trace.h
+++ b/libstdc++-v3/include/profile/impl/profiler_trace.h
@@ -283,7 +283,7 @@ namespace __gnu_profile
if (__stack_it == __stack_table.end())
{
- // First occurence of this call context.
+ // First occurrence of this call context.
if (__max_mem() == 0 || __stack_table_byte_size < __max_mem())
{
__stack_table_byte_size
diff --git a/libstdc++-v3/testsuite/23_containers/deque/cons/2.cc b/libstdc++-v3/testsuite/23_containers/deque/cons/2.cc
index 908fcb291d8a12618b8cc4749921bb277c6c6a59..e90d7b37e88bd41a89c292a8f1e62fc658844dc1 100644
--- a/libstdc++-v3/testsuite/23_containers/deque/cons/2.cc
+++ b/libstdc++-v3/testsuite/23_containers/deque/cons/2.cc
@@ -195,7 +195,7 @@ copyConstructorCheck()
// @fn fillConstructorCheck()
// This test explicitly verifies the basic fill constructor. Like the default
// constructor, later tests depend on the fill constructor working correctly.
-// That means this explicit test should preceed the later tests so the error
+// That means this explicit test should precede the later tests so the error
// message given on assertion failure can be more helpful n tracking the
// problem.
//
diff --git a/libstdc++-v3/testsuite/23_containers/deque/debug/shrink_to_fit.cc b/libstdc++-v3/testsuite/23_containers/deque/debug/shrink_to_fit.cc
index 6b069c78d1dd87b6beed9d60ae9df5c85ccef92c..6c097d657dfb9251e82d3e51988b7271a7ee4d89 100644
--- a/libstdc++-v3/testsuite/23_containers/deque/debug/shrink_to_fit.cc
+++ b/libstdc++-v3/testsuite/23_containers/deque/debug/shrink_to_fit.cc
@@ -25,7 +25,7 @@ void test01()
{
using std::deque;
deque<int> d;
- // Lets generate a hole at the begining of the deque:
+ // Let's generate a hole at the beginning of the deque:
d.push_back(0);
d.push_back(1);
d.pop_front();
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/basic_multimap.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/basic_multimap.cc
index 6f8b2dd480e06a692870c4566d5185160c6e27e1..b0e8ce409f737a29fb35bd9ae5fba50ccfa2ebdc 100644
--- a/libstdc++-v3/testsuite/ext/pb_ds/example/basic_multimap.cc
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/basic_multimap.cc
@@ -127,7 +127,7 @@ int main()
assert(it != acc.end());
assert(it->second.size() == 2);
- // The begining of the month has arrived. We need to give a 3%
+ // The beginning of the month has arrived. We need to give a 3%
// interest to all accounts with a positive balance.
// First we loop over all customers.
diff --git a/libstdc++-v3/testsuite/performance/23_containers/insert_erase/41975.cc b/libstdc++-v3/testsuite/performance/23_containers/insert_erase/41975.cc
index 9b59e803c4a8af24b32e94995fb56fb8de5cd790..eb786dba289a33e9f7bbb5fe582666d5fa7b906a 100644
--- a/libstdc++-v3/testsuite/performance/23_containers/insert_erase/41975.cc
+++ b/libstdc++-v3/testsuite/performance/23_containers/insert_erase/41975.cc
@@ -69,7 +69,7 @@ namespace
start_counters(time, resource);
// This is a worst insertion use case for the current implementation as
- // we insert an element at the begining of the hashtable and then we
+ // we insert an element at the beginning of the hashtable and then we
// insert starting at the end so that each time we need to seek up to the
// first bucket to find the first non-empty one.
us.insert(0);