Mirror
/
cpython
mirror of https://github.com/python/cpython
4
1
Fork 0
Code Issues Releases Wiki Activity

Minor re-wording in the exaplantion of sequence comparisons. 

This closes SF bug #445749.
This commit is contained in:
Fred Drake 2001-08-01 17:17:13 +00:00
parent e74f8de385
commit 20c94913de
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
Doc/tut/tut.tex
View 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 the lexicographical comparison is carried out recursively. If all
items of two sequences compare equal, the sequences are considered items of two sequences compare equal, the sequences are considered
equal. If one sequence is an initial sub-sequence of the other, the equal. If one sequence is an initial sub-sequence of the other, the
shorter sequence is the smaller one. Lexicographical ordering for shorter sequence is the smaller (lesser) one. Lexicographical
strings uses the \ASCII{} ordering for individual characters. Some ordering for strings uses the \ASCII{} ordering for individual
examples of comparisons between sequences with the same types: characters. Some examples of comparisons between sequences with the
same types:
\begin{verbatim} \begin{verbatim}
(1, 2, 3) < (1, 2, 4) (1, 2, 3) < (1, 2, 4)