Xiang Zhang added the comment:
I write a new version restoring the fast path for dict. It now uses PyDict_Next
and seems to be much faster than the path using keys.
[cpython]$ ./python -m timeit -s 'from collections import OrderedDict; d =
{"a":1,"c":2,"b":3,"d":4}' 'OrderedDict(d)'
1000000 loops, best of 3: 0.639 usec per loop
[cpython]$ ./python -m timeit -s 'from collections import OrderedDict; d =
{"a":1,"c":2,"b":3,"d":4}' 'OrderedDict(d)'
1000000 loops, best of 3: 0.372 usec per loop
----------
Added file: http://bugs.python.org/file43902/odict_update_v3.patch
_______________________________________
Python tracker <rep...@bugs.python.org>
<http://bugs.python.org/issue27576>
_______________________________________
_______________________________________________
Python-bugs-list mailing list
Unsubscribe:
https://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
