diff options
| author | Berker Peksag <berker.peksag@gmail.com> | 2016-06-01 20:54:33 (GMT) |
|---|---|---|
| committer | Berker Peksag <berker.peksag@gmail.com> | 2016-06-01 20:54:33 (GMT) |
| commit | 5b6a14d1cbc66b6a60ba695b519c210155a35adc (patch) | |
| tree | 1c956a7f06cb71f5733254baeabdfdbc17b7a73d /Doc/faq/programming.rst | |
| parent | 93818c752dce7b161287c559ef9c0f6b9d413309 (diff) | |
| download | cpython-5b6a14d1cbc66b6a60ba695b519c210155a35adc.zip cpython-5b6a14d1cbc66b6a60ba695b519c210155a35adc.tar.gz cpython-5b6a14d1cbc66b6a60ba695b519c210155a35adc.tar.bz2 | |
Fix link in programming FAQ.
The example actually uses the sort method of list object.
Diffstat (limited to 'Doc/faq/programming.rst')
| -rw-r--r-- | Doc/faq/programming.rst | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Doc/faq/programming.rst b/Doc/faq/programming.rst index 8157124..b2ad7a7 100644 --- a/Doc/faq/programming.rst +++ b/Doc/faq/programming.rst @@ -1312,7 +1312,7 @@ I want to do a complicated sort: can you do a Schwartzian Transform in Python? The technique, attributed to Randal Schwartz of the Perl community, sorts the elements of a list by a metric which maps each element to its "sort value". In -Python, use the ``key`` argument for the :func:`sort()` function:: +Python, use the ``key`` argument for the :meth:`list.sort` method:: Isorted = L[:] Isorted.sort(key=lambda s: int(s[10:15])) |