Changes by Georg Brandl ge...@python.org:
--
assignee: - rhettinger
___
Python tracker rep...@bugs.python.org
http://bugs.python.org/issue2268
___
___
Python-bugs-list
Changes by Georg Brandl ge...@python.org:
--
versions: +Python 3.2 -Python 3.0
___
Python tracker rep...@bugs.python.org
http://bugs.python.org/issue2268
___
___
Changes by Guido van Rossum gu...@python.org:
--
nosy: -gvanrossum
___
Python tracker rep...@bugs.python.org
http://bugs.python.org/issue2268
___
___
Python-bugs-list
Raymond Hettinger rhettin...@users.sourceforge.net added the comment:
The was a nice attempt at a peephole optimization.
I'm rejecting it because:
* too many other things need to be changed to support it
* the measured win is somewhat small
* we have a negative bias towards expanding the
Alexander Belopolsky [EMAIL PROTECTED] added the comment:
Just to quantify the improvement:
Before:
$ ./python -m timeit -sx='abc' x[::-1]
100 loops, best of 3: 0.305 usec per loop
$ ./python -O -m timeit -sx='abc' x[::-1]
100 loops, best of 3: 0.275 usec per loop
After:
$ ./python
New submission from Alexander Belopolsky [EMAIL PROTECTED]:
I am attaching a proof-of-concept patch which would optimize bytecode
generated from constant slices as follows:
Before patch:
dis(lambda:x[1:2:3])
1 0 LOAD_GLOBAL 0 (x)
3 LOAD_CONST
Changes by Jean-Paul Calderone [EMAIL PROTECTED]:
--
nosy: -exarkun
__
Tracker [EMAIL PROTECTED]
http://bugs.python.org/issue2268
__
___
Python-bugs-list mailing list