summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorFred Drake <fdrake@acm.org>2000-10-25 23:22:54 (GMT)
committerFred Drake <fdrake@acm.org>2000-10-25 23:22:54 (GMT)
commitbce920129c41397928f4e7e0001a7c967379d879 (patch)
tree734bbbf1d2b2a3529a7be426a1c5de6e6d47da6d
parentc8fcdcba36dc39587ba08c932a26d38e667744d4 (diff)
downloadcpython-bce920129c41397928f4e7e0001a7c967379d879.zip
cpython-bce920129c41397928f4e7e0001a7c967379d879.tar.gz
cpython-bce920129c41397928f4e7e0001a7c967379d879.tar.bz2
Typo: shorted --> shorter
This closes bug #117706.
-rw-r--r--Doc/tut/tut.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/Doc/tut/tut.tex b/Doc/tut/tut.tex
index d79eddb..ae835cd 100644
--- a/Doc/tut/tut.tex
+++ b/Doc/tut/tut.tex
@@ -2016,7 +2016,7 @@ 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 subsequence of the other, the
-shorted sequence is the smaller one. Lexicographical ordering for
+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: