New submission from showell <showel...@yahoo.com>: I am attaching a patch to improve the performance of list operations that insert or delete elements at the front of the list. The patch has had some discussion on python-dev in the thread entitled "patch to make list.pop(0) work in O(1) time."
So far the verdict is not to touch list internals to achieve this performance gain, but I am looking to improve the patch regardless and possibly include it in a PEP that documents the decision not to incorporate the patch, with the hope that it either prevents future duplication of effort or eventually gets accepted. At a bare minimum, the patch needs extensive code review, as it touches a lot of internals, and it needs stylistic cleanup. But it does pass all the tests, and it has been benchmarked to show 100X speed improvement on a small test case. ---------- components: Interpreter Core files: DIFF messages: 98324 nosy: Steve Howell severity: normal status: open title: patch for making list/insert at the top of the list avoid memmoves type: performance versions: Python 3.2 Added file: http://bugs.python.org/file16008/DIFF _______________________________________ Python tracker <rep...@bugs.python.org> <http://bugs.python.org/issue7784> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: http://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
