From d3faf43f9ba7da0ae504c9186b10d0fa3a8eb300 Mon Sep 17 00:00:00 2001 From: Serhiy Storchaka Date: Sun, 18 Jan 2015 11:28:37 +0200 Subject: Issue #23181: More "codepoint" -> "code point". --- Doc/tutorial/datastructures.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'Doc/tutorial/datastructures.rst') diff --git a/Doc/tutorial/datastructures.rst b/Doc/tutorial/datastructures.rst index 5c3ae16980..1ea299fbed 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) -- cgit v1.2.1