News for hackers. Stuff that matters.
Re:PyPy 1.7 released: widening the sweet spot by mattdeboard on Monday November 21, 2011 @08:39AM (#3261033)
It is hard to tell from some of the release statements when they mean a particular thing is an improvement over CPython or over previous performance by PyPy, e.g.:

>Specialized list implementation. There is a branch that implements lists of integers/floats/strings as compactly as array.array. This should drastically improve performance/memory impact of some applications

Is this improvement over CPython or over previous implementation in PyPy? There are several such comments.

Re:PyPy 1.7 released: widening the sweet spot by vladev on Monday November 21, 2011 @08:45AM (#3261051)
Currently, PyPy is faster than CPython at pretty much anything (except when C is involved, for example, but they are working on that, too). You can see their benchmarks and comparisons at http://speed.pypy.org/.

What I think they mean by those statements is that this will improve performance over the previous version of PyPy - therefore - improve over CPython as well.

Re:PyPy 1.7 released: widening the sweet spot by nickik on Monday November 21, 2011 @08:53AM (#3261082)
If something is new its an improvment over CPython oderwise its a improvment over pypy. See here for lists: http://morepypy.blogspot.com/2011/10/more-compact-lists-with...
Re:PyPy 1.7 released: widening the sweet spot by masklinn on Monday November 21, 2011 @10:32AM (#3261409)
> Is this improvement over CPython or over previous implementation in PyPy?

Both.

Re:PyPy 1.7 released: widening the sweet spot by Raphael_Amiard on Monday November 21, 2011 @09:34AM (#3261211)
I'd say this particular improvement is necessarily in pypy, because plain lists are always boxed in CPython, which doesn't perform any of that kind of type specific optimizations, being a plain old interpreter.