drop regex-posix in favour of regex-tdfa?
regex-tdfa is written in Haskell (regex-posix uses a C backend), and it uses the standard DFA algorithm compared to regex-posix's naive backtracking, so it is asymptotically better (though it would probably be a good idea to check performance on some non-pathalogical examples to make sure the constant factor isn't too bad).
http://article.gmane.org/gmane.comp.lang.haskell.cafe/18553
For GHC 6.8 we should drop regex-posix in favour of this.
Trac metadata
Trac field | Value |
---|---|
Version | 6.7 |
Type | Task |
TypeOfFailure | OtherFailure |
Priority | normal |
Resolution | Unresolved |
Component | libraries (other) |
Test case | |
Differential revisions | |
BlockedBy | |
Related | |
Blocking | |
CC | |
Operating system | Unknown |
Architecture | Unknown |