diff options
| author | Berker Peksag <berker.peksag@gmail.com> | 2016-06-01 20:55:00 (GMT) |
|---|---|---|
| committer | Berker Peksag <berker.peksag@gmail.com> | 2016-06-01 20:55:00 (GMT) |
| commit | 32072714fd4796465d76ac25836c08de661cbeef (patch) | |
| tree | f7a49af5d380c67f2d4bfe41d80c5b03a814fe2c /Doc/faq | |
| parent | ef1179e451b84a2ff1d6ac324ff0441608b4323a (diff) | |
| parent | 5b6a14d1cbc66b6a60ba695b519c210155a35adc (diff) | |
| download | cpython-32072714fd4796465d76ac25836c08de661cbeef.zip cpython-32072714fd4796465d76ac25836c08de661cbeef.tar.gz cpython-32072714fd4796465d76ac25836c08de661cbeef.tar.bz2 | |
Merge from 3.5
Diffstat (limited to 'Doc/faq')
| -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 a0ddfb4..ac10ea5 100644 --- a/Doc/faq/programming.rst +++ b/Doc/faq/programming.rst @@ -1313,7 +1313,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])) |