From 7831499677e142e3ebcd00f4fea7ecec35d7688b Mon Sep 17 00:00:00 2001 From: redi Date: Mon, 23 Dec 2002 17:36:24 +0000 Subject: [PATCH] 2002-12-20 Sylvain Pion * 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. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@60442 138bc75d-0d04-0410-961f-82ee72b054a4 --- libstdc++-v3/ChangeLog | 10 ++++++++++ libstdc++-v3/include/bits/stl_deque.h | 4 ++-- libstdc++-v3/include/bits/stl_list.h | 4 ++-- libstdc++-v3/include/bits/stl_map.h | 4 ++-- libstdc++-v3/include/bits/stl_multimap.h | 4 ++-- libstdc++-v3/include/bits/stl_queue.h | 4 ++-- libstdc++-v3/include/bits/stl_stack.h | 4 ++-- libstdc++-v3/include/bits/stl_vector.h | 4 ++-- 8 files changed, 24 insertions(+), 14 deletions(-) diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog index 9378d5e..3cb1684 100644 --- a/libstdc++-v3/ChangeLog +++ b/libstdc++-v3/ChangeLog @@ -1,3 +1,13 @@ +2002-12-20 Sylvain Pion + + * 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 * docs/html/documentation.html: Add link for debug.html. diff --git a/libstdc++-v3/include/bits/stl_deque.h b/libstdc++-v3/include/bits/stl_deque.h index a32212d..bc89059 100644 --- a/libstdc++-v3/include/bits/stl_deque.h +++ b/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 inline bool operator<(const deque<_Tp, _Alloc>& __x, diff --git a/libstdc++-v3/include/bits/stl_list.h b/libstdc++-v3/include/bits/stl_list.h index a13bc1a..3b191a0 100644 --- a/libstdc++-v3/include/bits/stl_list.h +++ b/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 inline bool diff --git a/libstdc++-v3/include/bits/stl_map.h b/libstdc++-v3/include/bits/stl_map.h index ed47bbb..adb2e9a 100644 --- a/libstdc++-v3/include/bits/stl_map.h +++ b/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 inline bool diff --git a/libstdc++-v3/include/bits/stl_multimap.h b/libstdc++-v3/include/bits/stl_multimap.h index 0fa79a8..7b18d46 100644 --- a/libstdc++-v3/include/bits/stl_multimap.h +++ b/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 inline bool diff --git a/libstdc++-v3/include/bits/stl_queue.h b/libstdc++-v3/include/bits/stl_queue.h index ff2ba26..c69b7ee 100644 --- a/libstdc++-v3/include/bits/stl_queue.h +++ b/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 diff --git a/libstdc++-v3/include/bits/stl_stack.h b/libstdc++-v3/include/bits/stl_stack.h index 7f2496c..54b3e15 100644 --- a/libstdc++-v3/include/bits/stl_stack.h +++ b/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 diff --git a/libstdc++-v3/include/bits/stl_vector.h b/libstdc++-v3/include/bits/stl_vector.h index 83ed3c5..cbd3acb 100644 --- a/libstdc++-v3/include/bits/stl_vector.h +++ b/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 inline bool -- 2.7.4