[Python-checkins] cpython (3.2): Streamline mention of sorted()

[antoine.pitrou]

http://hg.python.org/cpython/rev/bf0c5cd303e5
changeset:   73845:bf0c5cd303e5
branch:      3.2
user:        Antoine Pitrou <solipsis at pitrou.net>
date:        Sat Dec 03 23:08:57 2011 +0100
summary:
  Streamline mention of sorted()

files:
  Doc/faq/design.rst |  8 ++++----
  1 files changed, 4 insertions(+), 4 deletions(-)


diff --git a/Doc/faq/design.rst b/Doc/faq/design.rst
--- a/Doc/faq/design.rst
+++ b/Doc/faq/design.rst
@@ -625,10 +625,10 @@
 you won't be fooled into accidentally overwriting a list when you need a sorted
 copy but also need to keep the unsorted version around.
 
-In Python 2.4 a new built-in function -- :func:`sorted` -- has been added.
-This function creates a new list from a provided iterable, sorts it and returns
-it.  For example, here's how to iterate over the keys of a dictionary in sorted
-order::
+If you want to return a new list, use the built-in :func:`sorted` function
+instead.  This function creates a new list from a provided iterable, sorts
+it and returns it.  For example, here's how to iterate over the keys of a
+dictionary in sorted order::
 
    for key in sorted(mydict):
        ... # do whatever with mydict[key]...

-- 
Repository URL: http://hg.python.org/cpython