[Pkg-haskell-commits] darcs: haskell-regex-tdfa: Use standard substvars
Joachim Breitner
mail at joachim-breitner.de
Mon Dec 22 14:55:31 UTC 2014
Sun Dec 21 12:26:19 UTC 2014 Joachim Breitner <mail at joachim-breitner.de>
* Use standard substvars
M ./changelog +1
M ./control -32 +22
Sun Dec 21 12:26:19 UTC 2014 Joachim Breitner <mail at joachim-breitner.de>
* Use standard substvars
diff -rN -u old-haskell-regex-tdfa/changelog new-haskell-regex-tdfa/changelog
--- old-haskell-regex-tdfa/changelog 2014-12-22 14:55:31.074356099 +0000
+++ new-haskell-regex-tdfa/changelog 2014-12-22 14:55:31.078356101 +0000
@@ -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 at debian.org> Sat, 20 Dec 2014 16:58:39 +0100
diff -rN -u old-haskell-regex-tdfa/control new-haskell-regex-tdfa/control
--- old-haskell-regex-tdfa/control 2014-12-22 14:55:31.074356099 +0000
+++ new-haskell-regex-tdfa/control 2014-12-22 14:55:31.074356099 +0000
@@ -25,14 +25,7 @@
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,40 @@
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}
+
More information about the Pkg-haskell-commits
mailing list