* 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
* @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
* @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
* @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)).
*/
* @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)).
*/
* @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)).
*/
* @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)).
*/
* @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