diff options
author | Raymond Hettinger <python@rcn.com> | 2008-02-14 13:32:18 (GMT) |
---|---|---|
committer | Raymond Hettinger <python@rcn.com> | 2008-02-14 13:32:18 (GMT) |
commit | 7116186691681cddb96ea60276af0a343ac98e9e (patch) | |
tree | b0300ee87ab8f9eb781f5b7d95a3ee9438e9b9d5 /Doc/library/stdtypes.rst | |
parent | 68f5fbe94488b671ee6dfae74d918cc6a8eeca56 (diff) | |
download | cpython-7116186691681cddb96ea60276af0a343ac98e9e.zip cpython-7116186691681cddb96ea60276af0a343ac98e9e.tar.gz cpython-7116186691681cddb96ea60276af0a343ac98e9e.tar.bz2 |
Documentation nit.
Diffstat (limited to 'Doc/library/stdtypes.rst')
-rw-r--r-- | Doc/library/stdtypes.rst | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/Doc/library/stdtypes.rst b/Doc/library/stdtypes.rst index c976007..c90b0a5 100644 --- a/Doc/library/stdtypes.rst +++ b/Doc/library/stdtypes.rst @@ -1326,13 +1326,13 @@ Notes: *reverse* is a boolean value. If set to ``True``, then the list elements are sorted as if each comparison were reversed. - Starting with Python 2.3, the :meth:`sort` method is guaranteed to be stable. A + The :meth:`sort` method is guaranteed to be stable. A sort is stable if it guarantees not to change the relative order of elements that compare equal --- this is helpful for sorting in multiple passes (for example, sort by department, then by salary grade). While a list is being sorted, the effect of attempting to mutate, or even - inspect, the list is undefined. The C implementation of Python 2.3 and newer + inspect, the list is undefined. The C implementation makes the list appear empty for the duration, and raises :exc:`ValueError` if it can detect that the list has been mutated during a sort. |