diff options
| author | Serhiy Storchaka <storchaka@gmail.com> | 2015-01-18 09:28:37 (GMT) |
|---|---|---|
| committer | Serhiy Storchaka <storchaka@gmail.com> | 2015-01-18 09:28:37 (GMT) |
| commit | d3faf43f9ba7da0ae504c9186b10d0fa3a8eb300 (patch) | |
| tree | 1e6ffa87d3c0087fc5bb3509bc9ef455ce98c7ff /Doc/tutorial/datastructures.rst | |
| parent | b2653b344e01710a99bc782a0b9e4b4d0f8eed5f (diff) | |
| download | cpython-d3faf43f9ba7da0ae504c9186b10d0fa3a8eb300.zip cpython-d3faf43f9ba7da0ae504c9186b10d0fa3a8eb300.tar.gz cpython-d3faf43f9ba7da0ae504c9186b10d0fa3a8eb300.tar.bz2 | |
Issue #23181: More "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 5c3ae16..1ea299f 100644 --- a/Doc/tutorial/datastructures.rst +++ b/Doc/tutorial/datastructures.rst @@ -684,7 +684,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) |