Congratulations! This is really cool.
And this also made me find a bug in GHC :)
http://hackage.haskell.org/trac/ghc/ticket/3059
2009/3/2 ChrisK :
> Announcing the version 1.0.0 release of regex-tdfa.
>
> I am proud of this release.
> This is not just a bug fix release.
> It is a serious improvem
ChrisK wrote:
The previous versions allowed bad combinations of pattern and searched
text length to scale badly in the length of the text. Previously the
worst case for text of length N was O(N^3).
The new worst case asymptotic runtime scaled as O(N).
There is never any backtracking.
And the wo
Announcing the version 1.0.0 release of regex-tdfa.
I am proud of this release.
This is not just a bug fix release.
It is a serious improvement in the asymptotic running time.
The previous versions allowed bad combinations of pattern and searched
text length to scale badly in the length of the t
