Fixes: https://pagure.io/koji/issue/963
Also l.sort() is in case of larger lists faster than l = sorted(l)
l.sort()
l = sorted(l)
l = [{'a': random.random()} for x in xrange(1000000)] x = l[:] %timeit sorted(l, key=lambda x: x['a']) 1 loop, best of 3: 1.62 s per loop %timeit -r 1 x.sort(key=lambda x: x['a']) 1 loop, best of 1: 625 ms per loop
In py3 are differences smaller (818ms vs 547ms), but still in favor of l.sort()
rebased onto 3ae5a9bfb762eaa2538a204e7d3b90c8c392bf51
Commit f71804d0 fixes this pull-request
Pull-Request has been merged by mikem
Fixes: https://pagure.io/koji/issue/963
Also
l.sort()is in case of larger lists faster thanl = sorted(l)