> FWIW, I've posted a patch to implement list.copysort() that > includes a news announcement, docs, and unittests: > > www.python.org/sf/825814 Despite my suggesting a better name, I'm not in favor of this (let's say -0). For one, this will surely make lots of people write for key in D.keys().copysort(): ... which makes an unnecessary copy of the keys. I'd rather continue to write keys = D.keys() keys.sort() for key in keys: ... --Guido van Rossum (home page: http://www.python.org/~guido/)
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