diff options
| author | Georg Brandl <georg@python.org> | 2015-01-14 08:26:30 +0100 |
|---|---|---|
| committer | Georg Brandl <georg@python.org> | 2015-01-14 08:26:30 +0100 |
| commit | 3be472b5f777fe5ebc0c1f4b6c0d96c73352db9c (patch) | |
| tree | addfeeb14af6240b6454926ef9a4cce2a51f9207 /Doc/tutorial/datastructures.rst | |
| parent | 1a8ada89f9b3d9b10654adce979046d865906a44 (diff) | |
| download | cpython-git-3be472b5f777fe5ebc0c1f4b6c0d96c73352db9c.tar.gz | |
Closes #23181: codepoint -> code point
Diffstat (limited to 'Doc/tutorial/datastructures.rst')
| -rw-r--r-- | Doc/tutorial/datastructures.rst | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Doc/tutorial/datastructures.rst b/Doc/tutorial/datastructures.rst index 6dc17aa6dc..a2031ed867 100644 --- a/Doc/tutorial/datastructures.rst +++ b/Doc/tutorial/datastructures.rst @@ -685,7 +685,7 @@ 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 (lesser) one. Lexicographical ordering for strings uses the Unicode -codepoint number to order individual characters. Some examples of comparisons +code point number to order individual characters. Some examples of comparisons between sequences of the same type:: (1, 2, 3) < (1, 2, 4) |