tip-toe around dictionary keys view in the tutorial

diff --git a/Doc/tutorial/datastructures.rst b/Doc/tutorial/datastructures.rst
index 84e731d90b2899f0466cae3206d4e3b351b3c0c2..0661164f7c009580d6e913e8713ada932db2a444 100644 (file)
--- a/Doc/tutorial/datastructures.rst
+++ b/Doc/tutorial/datastructures.rst
@@ -440,7 +440,7 @@ pair with ``del``. If you store using a key that is already in use, the old
 value associated with that key is forgotten.  It is an error to extract a value
 using a non-existent key.
 
-The :meth:`keys` method of a dictionary object returns a list of all the keys
+Preforming ``list(d.keys())`` on a dictionary 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.