libghc-regex-tdfa-prof - 1.3.2.2-1+b1 main

A pure Haskell alternative to GHC's Text.Regex module (with some
enhancements). The Text.Regex module marshalls the data back and forth to
c-arrays to call libc and this is far too slow (and strict).
.
This module parses regular expression Strings using a Parsec parser and
creates an internal data structure (Text.Regex.Lazy.Pattern). This is then
transformed a DFA table for matching against the input String or
FastPackedString. The input string is consumed lazily, so it may be an
arbitrarily long or infinite source.
.
This package provides a library for the Haskell programming language, compiled
for profiling. See http://www.haskell.org/ for more information on Haskell.