[Haskell-cafe] Haskell performance when it comes to regex?

Chris Dornan chris at chrisdornan.com
Tue May 30 10:08:08 UTC 2017

Brandon Allbery allbery.b at gmail.com:
> TDFA is pure Haskell and mostly exists for when you can't be certain that a faster C binding will support UTF8
> (most POSIX regex implementations do not, and PCRE only does so if someone built it with UTF8 support).
> When it's usable, the C bindings will almost always be faster.

I think we are in agreement, though I would generally recommend TDFA, unless you need the highest performance
(as in this case) or Perl-style REs. But then again I like my REs plain and simple (and Posix) and packages with
as few external dependencies as possible.


More information about the Haskell-Cafe mailing list