Message236435
If I remember correctly, the complexity and performance of sort/sorted depends if the data set is sorted or not. You may recreated the list/dictionary at each iteration to get performances closer to "items = sorted(dct.items(), key=lambda kv: kv[0])" (dict keys are not sorted by their content, especially with strings). |
|
Date |
User |
Action |
Args |
2015-02-23 10:56:11 | vstinner | set | recipients:
+ vstinner, rhettinger, serhiy.storchaka, wbolster, josh.r |
2015-02-23 10:56:11 | vstinner | set | messageid: <1424688971.15.0.492360579953.issue23493@psf.upfronthosting.co.za> |
2015-02-23 10:56:11 | vstinner | link | issue23493 messages |
2015-02-23 10:56:10 | vstinner | create | |
|