Message289467
Elliot, I don't care if the example behaves differently. Although someone else may ;-)
The only things `.sort()` has ever tried to guarantee in the presence of mutations (of either the list or the elements) during sorting are that (a) the implementation won't segfault; and, (b) the list at the end is _some_ permutation of the input list (no elements are lost or duplicated).
If crazy mutation examples can provoke a segfault, that's possibly "a problem" - but different results really aren't (at least not to me). |
|
Date |
User |
Action |
Args |
2017-03-12 04:01:18 | tim.peters | set | recipients:
+ tim.peters, vstinner, serhiy.storchaka, ppperry, mdk, elliot.gorokhovsky |
2017-03-12 04:01:18 | tim.peters | set | messageid: <1489291278.0.0.47941295317.issue28685@psf.upfronthosting.co.za> |
2017-03-12 04:01:17 | tim.peters | link | issue28685 messages |
2017-03-12 04:01:17 | tim.peters | create | |
|