Hi all,
I've been working on a new implementation of the re module. The details
are at http://bugs.python.org/issue2636, specifically from
http://bugs.python.org/issue2636#msg90954. I've included a .pyd file for
Python 2.6 on Windows if you want to try it out.
I'm interested in how fast it is generally, compared with the current re
module, but especially when faced with those 'pathological' regular
expressions which seem to take a long time to finish, for example:
re.search(r"^(.+|D)*A$", "x" * 25 + "B")
which on my PC (1.8GHz) takes 18.98secs with the re module but <0.01secs
with this new implementation.
TIA
--
http://mail.python.org/mailman/listinfo/python-list
