]> granicus.if.org Git - python/commitdiff
Minor re-wording in the exaplantion of sequence comparisons.
authorFred Drake <fdrake@acm.org>
Wed, 1 Aug 2001 17:17:13 +0000 (17:17 +0000)
committerFred Drake <fdrake@acm.org>
Wed, 1 Aug 2001 17:17:13 +0000 (17:17 +0000)
This closes SF bug #445749.

Doc/tut/tut.tex

index 9ce0ac86e20c79ca8b50301ee8bb98c7c1831e97..2a084ffa9b2fbd0600b95f326679c715e47d5f5e 100644 (file)
@@ -2039,9 +2039,10 @@ If two items to be compared are themselves sequences of the same type,
 the lexicographical comparison is carried out recursively.  If all
 items of two sequences compare equal, the sequences are considered
 equal.  If one sequence is an initial sub-sequence of the other, the
-shorter sequence is the smaller one.  Lexicographical ordering for
-strings uses the \ASCII{} ordering for individual characters.  Some
-examples of comparisons between sequences with the same types:
+shorter sequence is the smaller (lesser) one.  Lexicographical
+ordering for strings uses the \ASCII{} ordering for individual
+characters.  Some examples of comparisons between sequences with the
+same types:
 
 \begin{verbatim}
 (1, 2, 3)              < (1, 2, 4)