Package: libghc-regex-tdfa-prof
Source: haskell-regex-tdfa
Version: 1.3.2.5-1
Architecture: amd64
Architecture-Variant: amd64v3
Maintainer: Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
Original-Maintainer: Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
Installed-Size: 7952
Depends: libghc-array-prof-0.5.8.0-fa0dd, libghc-base-prof-4.20.2.0-47ff0, libghc-bytestring-prof-0.12.2.0-d528c, libghc-containers-prof-0.7-0c6d4, libghc-mtl-prof-2.3.1-edf82, libghc-parsec-prof-3.1.18.0-edc19, libghc-regex-base-prof-0.94.0.3-367c6, libghc-regex-tdfa-dev (= 1.3.2.5-1), libghc-text-prof-2.1.3-8ae9a
Provides: libghc-regex-tdfa-prof-1.3.2.5-e9355
Section: haskell
Priority: optional
Homepage: https://wiki.haskell.org/Regular_expressions
Description: Haskell library for a tagged DFA regex engine; profiling libraries
 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.
