From 44c3ceb8aca1bc1bbb6de97a69fedfef360e590a Mon Sep 17 00:00:00 2001 From: Georg Brandl Date: Fri, 15 Oct 2010 15:31:09 +0000 Subject: [PATCH] #8267: Use sorted() to get a sorted list of dict keys. --- Doc/tutorial/controlflow.rst | 6 +++--- Doc/tutorial/datastructures.rst | 4 ++-- 2 files changed, 5 insertions(+), 5 deletions(-) diff --git a/Doc/tutorial/controlflow.rst b/Doc/tutorial/controlflow.rst index a9247cd0b9..a30d49cb10 100644 --- a/Doc/tutorial/controlflow.rst +++ b/Doc/tutorial/controlflow.rst @@ -431,9 +431,9 @@ function like this:: print "-- I'm sorry, we're all out of", kind for arg in arguments: print arg print "-" * 40 - keys = keywords.keys() - keys.sort() - for kw in keys: print kw, ":", keywords[kw] + keys = sorted(keywords.keys()) + for kw in keys: + print kw, ":", keywords[kw] It could be called like this:: diff --git a/Doc/tutorial/datastructures.rst b/Doc/tutorial/datastructures.rst index dfc2b33bb9..cbf3491000 100644 --- a/Doc/tutorial/datastructures.rst +++ b/Doc/tutorial/datastructures.rst @@ -481,8 +481,8 @@ using a non-existent key. The :meth:`keys` method of a dictionary object returns a list of all the keys used in the dictionary, in arbitrary order (if you want it sorted, just apply -the :meth:`sort` method to the list of keys). To check whether a single key is -in the dictionary, use the :keyword:`in` keyword. +the :func:`sorted` function to it). To check whether a single key is in the +dictionary, use the :keyword:`in` keyword. Here is a small example using a dictionary:: -- 2.50.1