On Sun, Mar 16, 2008 at 10:17 AM, Christian Heimes <lists at cheimes.de> wrote: > 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 > ...? :) I think I'd have time to mentor a GSoC project. Let's talk off-list about that.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4