Tim Peters added the comment: Your last line can't possibly return True, because `somelist.reverse()` returns None.
So the last line is irrelevant. Your complaint appears to be about the line before, which shows that the list retains its original order. That's expected. All the keys are equal, so a stable sort _must_ retain the original order (that's what "stable" means). So that's not a bug - it's a feature. The idea that `x.sort(reverse=True)` must do the same as `x.sort(); x.reverse()` is something you made up in your head ;-) That is, the docs don't say that. What they do say: """ reverse is a boolean value. If set to True, then the list elements are sorted as if each comparison were reversed. """ That has no effect on keys that compare equal. It means that keys that compare "less than" are treated as if they had compared "greater than" instead, and vice versa. While it may not be immediately obvious, what `x.sort(reverse=True)` is actually equivalent to is the sequence: x.reverse() x.sort() x.reverse() ---------- nosy: +tim.peters resolution: -> not a bug stage: -> resolved status: open -> closed type: -> behavior _______________________________________ Python tracker <rep...@bugs.python.org> <http://bugs.python.org/issue29754> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: https://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
