stl_deque.h: Fix typo.

2002-12-20  Sylvain Pion   <Sylvain.Pion@mpi-sb.mpg.de>

	* include/bits/stl_deque.h: Fix typo.
	* include/bits/stl_list.h: Same.
	* include/bits/stl_map.h: Same.
	* include/bits/stl_multimap.h: Same.
	* include/bits/stl_queue.h: Same.
	* include/bits/stl_stack.h: Same.
	* include/bits/stl_vector.h: Same.

From-SVN: r60442

libstdc++-v3/ChangeLog

@@ -1,3 +1,13 @@
+2002-12-20  Sylvain Pion   <Sylvain.Pion@mpi-sb.mpg.de>
+
+	* include/bits/stl_deque.h: Fix typo.
+	* include/bits/stl_list.h: Same.
+	* include/bits/stl_map.h: Same.
+	* include/bits/stl_multimap.h: Same.
+	* include/bits/stl_queue.h: Same.
+	* include/bits/stl_stack.h: Same.
+	* include/bits/stl_vector.h: Same.
+
 2002-12-18  Benjamin Kosnik  <bkoz@redhat.com>
 
  	* docs/html/documentation.html: Add link for debug.html.

libstdc++-v3/include/bits/stl_deque.h

@@ -1549,12 +1549,12 @@ namespace std
    *  @brief  Deque ordering relation.
    *  @param  x  A %deque.
    *  @param  y  A %deque of the same type as @a x.
-   *  @return  True iff @a x is lexographically less than @a y.
+   *  @return  True iff @a x is lexicographically less than @a y.
    *
    *  This is a total ordering relation.  It is linear in the size of the
    *  deques.  The elements must be comparable with @c <.
    *
-   *  See std::lexographical_compare() for how the determination is made.
+   *  See std::lexicographical_compare() for how the determination is made.
   */
   template <typename _Tp, typename _Alloc>
   inline bool operator<(const deque<_Tp, _Alloc>& __x,

libstdc++-v3/include/bits/stl_list.h

@@ -1116,12 +1116,12 @@ namespace std
    *  @brief  List ordering relation.
    *  @param  x  A %list.
    *  @param  y  A %list of the same type as @a x.
-   *  @return  True iff @a x is lexographically less than @a y.
+   *  @return  True iff @a x is lexicographically less than @a y.
    *
    *  This is a total ordering relation.  It is linear in the size of the
    *  lists.  The elements must be comparable with @c <.
    *
-   *  See std::lexographical_compare() for how the determination is made.
+   *  See std::lexicographical_compare() for how the determination is made.
   */
   template<typename _Tp, typename _Alloc>
     inline bool

libstdc++-v3/include/bits/stl_map.h

@@ -610,12 +610,12 @@ namespace std
    *  @brief  Map ordering relation.
    *  @param  x  A %map.
    *  @param  y  A %map of the same type as @a x.
-   *  @return  True iff @a x is lexographically less than @a y.
+   *  @return  True iff @a x is lexicographically less than @a y.
    *
    *  This is a total ordering relation.  It is linear in the size of the
    *  maps.  The elements must be comparable with @c <.
    *
-   *  See std::lexographical_compare() for how the determination is made.
+   *  See std::lexicographical_compare() for how the determination is made.
   */
   template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
     inline bool

libstdc++-v3/include/bits/stl_multimap.h

@@ -584,12 +584,12 @@ namespace std
    *  @brief  Multimap ordering relation.
    *  @param  x  A %multimap.
    *  @param  y  A %multimap of the same type as @a x.
-   *  @return  True iff @a x is lexographically less than @a y.
+   *  @return  True iff @a x is lexicographically less than @a y.
    *
    *  This is a total ordering relation.  It is linear in the size of the
    *  multimaps.  The elements must be comparable with @c <.
    *
-   *  See std::lexographical_compare() for how the determination is made.
+   *  See std::lexicographical_compare() for how the determination is made.
   */
   template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
     inline bool

libstdc++-v3/include/bits/stl_queue.h

@@ -228,12 +228,12 @@ namespace std
    *  @brief  Queue ordering relation.
    *  @param  x  A %queue.
    *  @param  y  A %queue of the same type as @a x.
-   *  @return  True iff @a x is lexographically less than @a y.
+   *  @return  True iff @a x is lexicographically less than @a y.
    *
    *  This is an total ordering relation.  Complexity and semantics depend on
    *  the underlying sequence type, but the expected rules are:  this relation
    *  is linear in the size of the sequences, the elements must be comparable
-   *  with @c <, and std::lexographical_compare() is usually used to make the
+   *  with @c <, and std::lexicographical_compare() is usually used to make the
    *  determination.
   */
   template <typename _Tp, typename _Sequence>

libstdc++-v3/include/bits/stl_stack.h

@@ -209,12 +209,12 @@ namespace std
    *  @brief  Stack ordering relation.
    *  @param  x  A %stack.
    *  @param  y  A %stack of the same type as @a x.
-   *  @return  True iff @a x is lexographically less than @a y.
+   *  @return  True iff @a x is lexicographically less than @a y.
    *
    *  This is an total ordering relation.  Complexity and semantics depend on
    *  the underlying sequence type, but the expected rules are:  this relation
    *  is linear in the size of the sequences, the elements must be comparable
-   *  with @c <, and std::lexographical_compare() is usually used to make the
+   *  with @c <, and std::lexicographical_compare() is usually used to make the
    *  determination.
   */
   template <typename _Tp, typename _Seq>

libstdc++-v3/include/bits/stl_vector.h

@@ -943,12 +943,12 @@ namespace std
    *  @brief  Vector ordering relation.
    *  @param  x  A %vector.
    *  @param  y  A %vector of the same type as @a x.
-   *  @return  True iff @a x is lexographically less than @a y.
+   *  @return  True iff @a x is lexicographically less than @a y.
    *
    *  This is a total ordering relation.  It is linear in the size of the
    *  vectors.  The elements must be comparable with @c <.
    *
-   *  See std::lexographical_compare() for how the determination is made.
+   *  See std::lexicographical_compare() for how the determination is made.
   */
   template<typename _Tp, typename _Alloc>
     inline bool