From 20c94913de538bfa88378670f43f127b042851cf Mon Sep 17 00:00:00 2001 From: Fred Drake Date: Wed, 1 Aug 2001 17:17:13 +0000 Subject: [PATCH] Minor re-wording in the exaplantion of sequence comparisons. This closes SF bug #445749. --- Doc/tut/tut.tex | 7 ++++--- 1 file changed, 4 insertions(+), 3 deletions(-) diff --git a/Doc/tut/tut.tex b/Doc/tut/tut.tex index 9ce0ac86e20..2a084ffa9b2 100644 --- a/Doc/tut/tut.tex +++ b/Doc/tut/tut.tex @@ -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)