summaryrefslogtreecommitdiffstats
path: root/Doc/faq/design.rst
diff options
context:
space:
mode:
authorGeorg Brandl <georg@python.org>2010-02-06 18:46:57 (GMT)
committerGeorg Brandl <georg@python.org>2010-02-06 18:46:57 (GMT)
commitc4a55fccaba4936458c32f5f3b3913fcf2848b42 (patch)
treea90e0efacec59c07bc943ba8ab8593a3a1f6f4ed /Doc/faq/design.rst
parent3102bd9afe7fe657a8e3533b5cdee3e5e9282f27 (diff)
downloadcpython-c4a55fccaba4936458c32f5f3b3913fcf2848b42.zip
cpython-c4a55fccaba4936458c32f5f3b3913fcf2848b42.tar.gz
cpython-c4a55fccaba4936458c32f5f3b3913fcf2848b42.tar.bz2
Recorded merge of revisions 78024 via svnmerge from
svn+ssh://pythondev@svn.python.org/python/trunk ........ r78024 | georg.brandl | 2010-02-06 19:44:44 +0100 (Sa, 06 Feb 2010) | 1 line #5341: fix "builtin" where used as an adjective ("built-in" is correct). ........
Diffstat (limited to 'Doc/faq/design.rst')
-rw-r--r--Doc/faq/design.rst7
1 files changed, 4 insertions, 3 deletions
diff --git a/Doc/faq/design.rst b/Doc/faq/design.rst
index b6a0e17..627ee4e 100644
--- a/Doc/faq/design.rst
+++ b/Doc/faq/design.rst
@@ -649,9 +649,10 @@ order to remind you of that fact, it does not return the sorted list. This way,
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 builtin -- :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::
+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::
for key in sorted(mydict):
... # do whatever with mydict[key]...