If this goes in can we document that adding a key parameter makes the sort stable and key=None causes a stable sort to happen? Current CPython won't have to do anything at all with that, but other Pythons (or a future CPython where a mythical faster-than-timsort nonstable sort is discovered) would have a documented way to force stability. -- Christopher A. Craig <list-python-dev at ccraig.org>
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4