Hi Christian, hi all,
On Mon, Sep 05, 2005 at 02:32 +0200, [EMAIL PROTECTED] wrote:
> Modified: pypy/dist/pypy/rpython/rlist.py
> ==============================================================================
> --- pypy/dist/pypy/rpython/rlist.py (original)
> +++ pypy/dist/pypy/rpython/rlist.py Mon Sep 5 02:32:49 2005
> @@ -393,8 +393,10 @@
> _ll_list_resize(l, length+1)
> i = length
> items = l.items
> + i1 = i+1
> while i > 0:
> - items[i] = items[i+1]
> + items[i] = items[i1]
> + i1 = i
> i -= 1
> items[0] = newitem
this and this ...
> @@ -403,8 +405,10 @@
> _ll_list_resize(l, length+1)
> items = l.items
> i = length
> + i1 = i+1
> while i > index:
> - items[i] = items[i+1]
> + items[i] = items[i1]
> + i1 = i
> i -= 1
> items[i] = newitem
... are such optimizations measurably effective at all?
I would think that such low-level details are
handled by the backend or, if not, that we could
write a generic transformation that does that for us.
Or am i missing something?
cheers,
holger
_______________________________________________
[email protected]
http://codespeak.net/mailman/listinfo/pypy-dev
