March 16, 2008
1:17 p.m.
Collin Winter wrote:
The biggest win in terms of performance would be to reimplement the pattern matching engine used by the fixers.: it by far dominates the running time, taking 99+% of the runtime when I ran 2to3 over Twisted, for example. The current design is a heavily-recursive system, and as such bombs out when it encounters, e.g., files with a thousand assignment statements in a row. I'd also like something more expressive: the current DSL can't express recursive patterns.
Do you have time to mentor a GSoC project? Or can you mentor a mentor ...? :) Christian