Documentation nit.

This commit is contained in:
Raymond Hettinger 2008-02-14 13:32:18 +00:00
parent 68f5fbe944
commit 7116186691
1 changed files with 2 additions and 2 deletions

View File

@ -1326,13 +1326,13 @@ Notes:
*reverse* is a boolean value. If set to ``True``, then the list elements are *reverse* is a boolean value. If set to ``True``, then the list elements are
sorted as if each comparison were reversed. 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 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 that compare equal --- this is helpful for sorting in multiple passes (for
example, sort by department, then by salary grade). example, sort by department, then by salary grade).
While a list is being sorted, the effect of attempting to mutate, or even 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 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. can detect that the list has been mutated during a sort.