diff options
author | Georg Brandl <georg@python.org> | 2010-02-06 18:44:44 (GMT) |
---|---|---|
committer | Georg Brandl <georg@python.org> | 2010-02-06 18:44:44 (GMT) |
commit | 6f82cd309c735debd5f6476c21e30c1f91375017 (patch) | |
tree | fb28e09c5c59991120121a6afed02349f3cdf70e /Doc/faq/design.rst | |
parent | 2d798ac619788e32cf15425802db0fa8179d6865 (diff) | |
download | cpython-6f82cd309c735debd5f6476c21e30c1f91375017.zip cpython-6f82cd309c735debd5f6476c21e30c1f91375017.tar.gz cpython-6f82cd309c735debd5f6476c21e30c1f91375017.tar.bz2 |
#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.rst | 7 |
1 files changed, 4 insertions, 3 deletions
diff --git a/Doc/faq/design.rst b/Doc/faq/design.rst index 5be6add..957c2c9 100644 --- a/Doc/faq/design.rst +++ b/Doc/faq/design.rst @@ -664,9 +664,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]... |