[Pkg-haskell-maintainers] haskell-regex-tdfa_1.1.2-1_amd64.changes is NEW

[Archive Administrator]

(new) haskell-regex-tdfa_1.1.2-1.diff.gz optional haskell
(new) haskell-regex-tdfa_1.1.2-1.dsc optional haskell
(new) haskell-regex-tdfa_1.1.2.orig.tar.gz optional haskell
(new) libghc6-regex-tdfa-dev_1.1.2-1_amd64.deb optional haskell
Haskell library for a tagged DFA regex engine
 .
 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 contains the libraries compiled for GHC 6.
(new) libghc6-regex-tdfa-doc_1.1.2-1_all.deb optional doc
Documentation for the tagged DFA regex engine
 .
 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 contains the library documentation.
(new) libghc6-regex-tdfa-prof_1.1.2-1_amd64.deb optional haskell
Profiling libraries for the tagged DFA regex engine
 .
 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 contains the profiling libraries compiled for GHC 6.
Changes: haskell-regex-tdfa (1.1.2-1) unstable; urgency=low
 .
  * Initial Debian package. Closes: #536235.


Override entries for your package:

Announcing to debian-devel-changes at lists.debian.org
Closing bugs: 536235 


Your package contains new components which requires manual editing of
the override file.  It is ok otherwise, so please be patient.  New
packages are usually added to the override file about once a week.

You may have gotten the distribution wrong.  You'll get warnings above
if files already exist in other distributions.