diff options
| author | redi <redi@138bc75d-0d04-0410-961f-82ee72b054a4> | 2002-12-23 17:36:24 +0000 |
|---|---|---|
| committer | redi <redi@138bc75d-0d04-0410-961f-82ee72b054a4> | 2002-12-23 17:36:24 +0000 |
| commit | 7831499677e142e3ebcd00f4fea7ecec35d7688b (patch) | |
| tree | 8d175ba6490b13dbf0e4c7263b1d4947b4b15ecb /libstdc++-v3/include/bits/stl_queue.h | |
| parent | ca86fd55623c1ba577dea76f3ea5483bf3832bd0 (diff) | |
| download | ppe42-gcc-7831499677e142e3ebcd00f4fea7ecec35d7688b.tar.gz ppe42-gcc-7831499677e142e3ebcd00f4fea7ecec35d7688b.zip | |
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.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@60442 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'libstdc++-v3/include/bits/stl_queue.h')
| -rw-r--r-- | libstdc++-v3/include/bits/stl_queue.h | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/libstdc++-v3/include/bits/stl_queue.h b/libstdc++-v3/include/bits/stl_queue.h index ff2ba266aab..c69b7ee0557 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 <typename _Tp, typename _Sequence> |
