summaryrefslogtreecommitdiff
path: root/p/haskell-regex-tdfa/debian
diff options
context:
space:
mode:
authorJoachim Breitner <mail@joachim-breitner.de>2014-12-21 15:26:19 +0300
committerJoachim Breitner <mail@joachim-breitner.de>2014-12-21 15:26:19 +0300
commit13980e6543cab8b9375e053cff84a093e66ecb35 (patch)
treef03a048cf4656c2f6004bfb889eb2c62818cb621 /p/haskell-regex-tdfa/debian
parent468b5f657f6606a8ae7fd1327aeb0191cde6a4b6 (diff)
downloadDHG_packages-13980e6543cab8b9375e053cff84a093e66ecb35.tar.gz
haskell-regex-tdfa: Use standard substvars
Diffstat (limited to 'p/haskell-regex-tdfa/debian')
-rw-r--r--p/haskell-regex-tdfa/debian/changelog1
-rw-r--r--p/haskell-regex-tdfa/debian/control53
2 files changed, 22 insertions, 32 deletions
diff --git a/p/haskell-regex-tdfa/debian/changelog b/p/haskell-regex-tdfa/debian/changelog
index 21be315c6..fe8f4a367 100644
--- a/p/haskell-regex-tdfa/debian/changelog
+++ b/p/haskell-regex-tdfa/debian/changelog
@@ -1,6 +1,7 @@
haskell-regex-tdfa (1.2.0-2) UNRELEASED; urgency=medium
* Depend on haskell-devscripts 0.9, found in experimental
+ * Use standard substvars
-- Joachim Breitner <nomeata@debian.org> Sat, 20 Dec 2014 16:58:39 +0100
diff --git a/p/haskell-regex-tdfa/debian/control b/p/haskell-regex-tdfa/debian/control
index 383bd458e..a6e1a479b 100644
--- a/p/haskell-regex-tdfa/debian/control
+++ b/p/haskell-regex-tdfa/debian/control
@@ -25,14 +25,7 @@ Standards-Version: 3.9.4
Homepage: http://hackage.haskell.org/package/regex-tdfa
Vcs-Darcs: http://darcs.debian.org/pkg-haskell/haskell-regex-tdfa
Vcs-Browser: http://darcs.debian.org/cgi-bin/darcsweb.cgi?r=pkg-haskell/haskell-regex-tdfa
-
-Package: libghc-regex-tdfa-dev
-Architecture: any
-Depends: ${haskell:Depends}, ${misc:Depends}
-Suggests: ${haskell:Suggests}
-Recommends: ${haskell:Recommends}
-Provides: ${haskell:Provides}
-Description: Haskell library for a tagged DFA regex engine${haskell:ShortBlurb}
+X-Description: 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).
@@ -42,43 +35,39 @@ Description: Haskell library for a tagged DFA regex engine${haskell:ShortBlurb}
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.
+
+Package: libghc-regex-tdfa-dev
+Architecture: any
+Depends: ${haskell:Depends}
+ , ${shlibs:Depends}
+ , ${misc:Depends}
+Recommends: ${haskell:Recommends}
+Suggests: ${haskell:Suggests}
+Provides: ${haskell:Provides}
+Description: ${haskell:ShortDescription}${haskell:ShortBlurb}
+ ${haskell:LongDescription}
.
${haskell:Blurb}
Package: libghc-regex-tdfa-prof
Architecture: any
-Depends: ${haskell:Depends}, ${misc:Depends}
-Suggests: ${haskell:Suggests}
+Depends: ${haskell:Depends}
+ , ${misc:Depends}
Recommends: ${haskell:Recommends}
+Suggests: ${haskell:Suggests}
Provides: ${haskell:Provides}
-Description: Profiling libraries for the tagged DFA regex engine${haskell:ShortBlurb}
- 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.
+Description: ${haskell:ShortDescription}${haskell:ShortBlurb}
+ ${haskell:LongDescription}
.
${haskell:Blurb}
Package: libghc-regex-tdfa-doc
Section: doc
Architecture: all
-Depends: ${haskell:Depends}, ${misc:Depends}
-Suggests: ${haskell:Suggests}
+Depends: ${misc:Depends}, ${haskell:Depends}
Recommends: ${haskell:Recommends}
-Description: Documentation for the tagged DFA regex engine${haskell:ShortBlurb}
- 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.
+Suggests: ${haskell:Suggests}
+Description: ${haskell:ShortDescription}${haskell:ShortBlurb}
+ ${haskell:LongDescription}
.
${haskell:Blurb}