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.

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

12 files changed, 26 insertions, 11 deletions

diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog
index 613c734ba0e..8d864d927f2 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 d94cb1de3d9..75929a8821a 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 23b3f523bcf..c1684543ca9 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 e31086bebd3..0699838a370 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 09a1db02830..4de8236d97f 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 9b586b01e24..4c553ef683a 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 caabe906058..74ef1443000 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 c5907f849e6..f7f2216ebb1 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 908fcb291d8..e90d7b37e88 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 6b069c78d1d..6c097d657df 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 6f8b2dd480e..b0e8ce409f7 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 9b59e803c4a..eb786dba289 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);