On 12/19/06, Georg Brandl <g.brandl at gmx.net> wrote:
> > - turning list comprehensions into syntactic sugar for generator expressions
>> I'd like to point out that there is already my patch for that, which implements
> set comprehensions and list comprehensions exactly as syntactic sugar for
> GEs. This, however, affects performance greatly as LCs are executed in their own
> function scope, which isn't necessary. A better implementation would therefore
> leave the LC implementation as is, only preventing the name leaking into the
> enclosing scope.
Do you think you have it in you to tackle this?
--
--Guido van Rossum (home page: http://www.python.org/~guido/)
