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

Brandon Allbery allbery.b at gmail.com
Mon May 29 20:48:53 UTC 2017

On Mon, May 29, 2017 at 3:53 PM, Chris Dornan <chris at chrisdornan.com> wrote:

>   * I switched from Text.Regex.TDFA to Text.Regex.PCRE (as I think you
>     observed, judging by your commit messages), it seems to be somewhat
>     faster, at lease for these relatively small data sets;

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.

brandon s allbery kf8nh                               sine nomine associates
allbery.b at gmail.com                                  ballbery at sinenomine.net
unix, openafs, kerberos, infrastructure, xmonad        http://sinenomine.net
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/haskell-cafe/attachments/20170529/52c5d441/attachment.html>

More information about the Haskell-Cafe mailing list