#8267: Use sorted() to get a sorted list of dict keys.

diff --git a/Doc/tutorial/controlflow.rst b/Doc/tutorial/controlflow.rst
index a9247cd0b9a5769d900354cfdb7fce845f7be83f..a30d49cb10baeb9b6142a6f5e9c1bd76b583af2c 100644 (file)
--- 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 dfc2b33bb9e979ea01a65a6ee78e5ec37ef9685a..cbf3491000cea02d68711b945915e1f5fa33d389 100644 (file)
--- 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::