stl_deque.h: Fix misspelling of `Create' as `Creats'.

	* include/bits/stl_deque.h: Fix misspelling of `Create' as `Creats'.
	* include/bits/stl_list.h: Likewise.
	* include/bits/stl_map.h: Likewise.
	* include/bits/stl_multimap.h: Likewise.
	* include/bits/stl_vector.h: Likewise.

From-SVN: r55388

5 files changed, 7 insertions, 7 deletions

diff --git a/libstdc++-v3/include/bits/stl_deque.h b/libstdc++-v3/include/bits/stl_deque.h
index 6eb6a8c..c7fab2d 100644
--- a/libstdc++-v3/include/bits/stl_deque.h
+++ b/libstdc++-v3/include/bits/stl_deque.h
@@ -729,7 +729,7 @@ public:
    *  @param  first  An input iterator.
    *  @param  last  An input iterator.
    * 
-   *  Creats a %deque consisting of copies of the elements from [first,last).
+   *  Create a %deque consisting of copies of the elements from [first,last).
    *
    *  If the iterators are forward, bidirectional, or random-access, then
    *  this will call the elements' copy constructor N times (where N is
diff --git a/libstdc++-v3/include/bits/stl_list.h b/libstdc++-v3/include/bits/stl_list.h
index 75931cb..cb12e01 100644
--- a/libstdc++-v3/include/bits/stl_list.h
+++ b/libstdc++-v3/include/bits/stl_list.h
@@ -495,7 +495,7 @@ public:
    *  @param  first  An input iterator.
    *  @param  last  An input iterator.
    * 
-   *  Creats a %list consisting of copies of the elements from [first,last).
+   *  Create a %list consisting of copies of the elements from [first,last).
    *  This is linear in N (where N is distance(first,last)).
    *
    *  @if maint
diff --git a/libstdc++-v3/include/bits/stl_map.h b/libstdc++-v3/include/bits/stl_map.h
index f85b604..26546d3 100644
--- a/libstdc++-v3/include/bits/stl_map.h
+++ b/libstdc++-v3/include/bits/stl_map.h
@@ -170,7 +170,7 @@ public:
    *  @param  first  An input iterator.
    *  @param  last  An input iterator.
    *
-   *  Creats a %map consisting of copies of the elements from [first,last).
+   *  Create a %map consisting of copies of the elements from [first,last).
    *  This is linear in N if the range is already sorted, and NlogN
    *  otherwise (where N is distance(first,last)).
   */
@@ -186,7 +186,7 @@ public:
    *  @param  comp  A comparison functor.
    *  @param  a  An allocator object.
    *
-   *  Creats a %map consisting of copies of the elements from [first,last).
+   *  Create a %map consisting of copies of the elements from [first,last).
    *  This is linear in N if the range is already sorted, and NlogN
    *  otherwise (where N is distance(first,last)).
   */
diff --git a/libstdc++-v3/include/bits/stl_multimap.h b/libstdc++-v3/include/bits/stl_multimap.h
index 3da5d7b..d85c4fd 100644
--- a/libstdc++-v3/include/bits/stl_multimap.h
+++ b/libstdc++-v3/include/bits/stl_multimap.h
@@ -183,7 +183,7 @@ public:
    *  @param  first  An input iterator.
    *  @param  last  An input iterator.
    *
-   *  Creats a %multimap consisting of copies of the elements from
+   *  Create a %multimap consisting of copies of the elements from
    *  [first,last).  This is linear in N if the range is already sorted,
    *  and NlogN otherwise (where N is distance(first,last)).
   */
@@ -199,7 +199,7 @@ public:
    *  @param  comp  A comparison functor.
    *  @param  a  An allocator object.
    *
-   *  Creats a %multimap consisting of copies of the elements from [first,last).
+   *  Create a %multimap consisting of copies of the elements from [first,last).
    *  This is linear in N if the range is already sorted, and NlogN
    *  otherwise (where N is distance(first,last)).
   */
diff --git a/libstdc++-v3/include/bits/stl_vector.h b/libstdc++-v3/include/bits/stl_vector.h
index a948d5f..038aa0d 100644
--- a/libstdc++-v3/include/bits/stl_vector.h
+++ b/libstdc++-v3/include/bits/stl_vector.h
@@ -272,7 +272,7 @@ public:
    *  @param  first  An input iterator.
    *  @param  last  An input iterator.
    * 
-   *  Creats a %vector consisting of copies of the elements from [first,last).
+   *  Create a %vector consisting of copies of the elements from [first,last).
    *
    *  If the iterators are forward, bidirectional, or random-access, then
    *  this will call the elements' copy constructor N times (where N is