[libstdc++ patch] : fix typos in Doxygen comments
Sylvain Pion
Sylvain.Pion@mpi-sb.mpg.de
Fri Dec 20 08:07:00 GMT 2002
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.
--
Sylvain
Index: libstdc++-v3/include/bits/stl_deque.h
===================================================================
RCS file: /cvs/gcc/gcc/libstdc++-v3/include/bits/stl_deque.h,v
retrieving revision 1.31
diff -u -r1.31 stl_deque.h
--- libstdc++-v3/include/bits/stl_deque.h 16 Dec 2002 18:22:59 -0000 1.31
+++ libstdc++-v3/include/bits/stl_deque.h 20 Dec 2002 15:57:59 -0000
@@ -1549,12 +1549,12 @@
* @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,
Index: libstdc++-v3/include/bits/stl_list.h
===================================================================
RCS file: /cvs/gcc/gcc/libstdc++-v3/include/bits/stl_list.h,v
retrieving revision 1.21
diff -u -r1.21 stl_list.h
--- libstdc++-v3/include/bits/stl_list.h 16 Dec 2002 18:22:59 -0000 1.21
+++ libstdc++-v3/include/bits/stl_list.h 20 Dec 2002 15:57:59 -0000
@@ -1116,12 +1116,12 @@
* @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
Index: libstdc++-v3/include/bits/stl_map.h
===================================================================
RCS file: /cvs/gcc/gcc/libstdc++-v3/include/bits/stl_map.h,v
retrieving revision 1.15
diff -u -r1.15 stl_map.h
--- libstdc++-v3/include/bits/stl_map.h 23 Aug 2002 16:52:29 -0000 1.15
+++ libstdc++-v3/include/bits/stl_map.h 20 Dec 2002 15:58:00 -0000
@@ -610,12 +610,12 @@
* @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
Index: libstdc++-v3/include/bits/stl_multimap.h
===================================================================
RCS file: /cvs/gcc/gcc/libstdc++-v3/include/bits/stl_multimap.h,v
retrieving revision 1.15
diff -u -r1.15 stl_multimap.h
--- libstdc++-v3/include/bits/stl_multimap.h 23 Aug 2002 16:52:29 -0000 1.15
+++ libstdc++-v3/include/bits/stl_multimap.h 20 Dec 2002 15:58:00 -0000
@@ -584,12 +584,12 @@
* @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
Index: libstdc++-v3/include/bits/stl_queue.h
===================================================================
RCS file: /cvs/gcc/gcc/libstdc++-v3/include/bits/stl_queue.h,v
retrieving revision 1.15
diff -u -r1.15 stl_queue.h
--- libstdc++-v3/include/bits/stl_queue.h 9 Aug 2002 16:51:15 -0000 1.15
+++ libstdc++-v3/include/bits/stl_queue.h 20 Dec 2002 15:58:00 -0000
@@ -228,12 +228,12 @@
* @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>
Index: libstdc++-v3/include/bits/stl_stack.h
===================================================================
RCS file: /cvs/gcc/gcc/libstdc++-v3/include/bits/stl_stack.h,v
retrieving revision 1.12
diff -u -r1.12 stl_stack.h
--- libstdc++-v3/include/bits/stl_stack.h 9 Aug 2002 16:51:15 -0000 1.12
+++ libstdc++-v3/include/bits/stl_stack.h 20 Dec 2002 15:58:00 -0000
@@ -209,12 +209,12 @@
* @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>
Index: libstdc++-v3/include/bits/stl_vector.h
===================================================================
RCS file: /cvs/gcc/gcc/libstdc++-v3/include/bits/stl_vector.h,v
retrieving revision 1.31
diff -u -r1.31 stl_vector.h
--- libstdc++-v3/include/bits/stl_vector.h 16 Dec 2002 18:22:59 -0000 1.31
+++ libstdc++-v3/include/bits/stl_vector.h 20 Dec 2002 15:58:01 -0000
@@ -943,12 +943,12 @@
* @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
More information about the Libstdc++
mailing list