On Mar 21, 2009, Rubén Rodríguez Pérez <[email protected]> wrote: > It takes like five seconds per file when it works, and sed gets to use > more than a GB of memory in that time, is that normal?
Unfortunately, it is, now. We really are building some monster regular expressions there. I wonder if some different language, using some different regex engine, would fare better... But then, converting from sed regexes \(a\|b\) to some extended (a|b) notation that enabled grouping without discarding, although cleaner, would be kind of painful. I'm kind of thinking perl, in part because I've wanted look-ahead matches for some stuff, but I'm open to suggestions. I guess playing a bit with s2p, just to see how it goes, makes some sense... Thoughts? -- Alexandre Oliva, freedom fighter http://FSFLA.org/~lxoliva/ You must be the change you wish to see in the world. -- Gandhi Be Free! -- http://FSFLA.org/ FSF Latin America board member Free Software Evangelist Red Hat Brazil Compiler Engineer _______________________________________________ linux-libre mailing list [email protected] http://www.fsfla.org/cgi-bin/mailman/listinfo/linux-libre
