summaryrefslogtreecommitdiffstats
path: root/Doc
diff options
context:
space:
mode:
authorRaymond Hettinger <python@rcn.com>2016-04-26 08:11:10 (GMT)
committerRaymond Hettinger <python@rcn.com>2016-04-26 08:11:10 (GMT)
commitb9531bcdcce35c443f1b7c6f1c79ed8ae575f36b (patch)
treed598a561fc059c96400815d0e2911c1a9e0a8431 /Doc
parentb3b366d803207eb580a315a2b49733f100e92e89 (diff)
downloadcpython-b9531bcdcce35c443f1b7c6f1c79ed8ae575f36b.zip
cpython-b9531bcdcce35c443f1b7c6f1c79ed8ae575f36b.tar.gz
cpython-b9531bcdcce35c443f1b7c6f1c79ed8ae575f36b.tar.bz2
Issue #24715: Improve sort stability example
Diffstat (limited to 'Doc')
-rw-r--r--Doc/howto/sorting.rst6
1 files changed, 5 insertions, 1 deletions
diff --git a/Doc/howto/sorting.rst b/Doc/howto/sorting.rst
index 10cb94c..0334b26 100644
--- a/Doc/howto/sorting.rst
+++ b/Doc/howto/sorting.rst
@@ -262,7 +262,11 @@ Odd and Ends
twice:
>>> data = [('red', 1), ('blue', 1), ('red', 2), ('blue', 2)]
- >>> assert sorted(data, reverse=True) == list(reversed(sorted(reversed(data))))
+ >>> standard_way = sorted(data, key=itemgetter(0), reverse=True)
+ >>> double_reversed = list(reversed(sorted(reversed(data), key=itemgetter(0))))
+ >>> assert standard_way == double_reversed
+ >>> standard_way
+ [('red', 1), ('red', 2), ('blue', 1), ('blue', 2)]
* The sort routines are guaranteed to use :meth:`__lt__` when making comparisons
between two objects. So, it is easy to add a standard sort order to a class by