debian/0000755000000000000000000000000012147643157007200 5ustar debian/watch0000644000000000000000000000035212036252051010213 0ustar version=3 opts="downloadurlmangle=s|archive/([\w\d_-]+)/([\d\.]+)/|archive/$1/$2/$1-$2.tar.gz|,\ filenamemangle=s|(.*)/$|weighted-regexp-$1.tar.gz|" \ http://hackage.haskell.org/packages/archive/weighted-regexp \ ([\d\.]*\d)/ debian/control0000644000000000000000000000601612147625455010607 0ustar Source: haskell-weighted-regexp Section: haskell Priority: extra Maintainer: Debian Haskell Group Uploaders: Joachim Breitner Build-Depends: debhelper (>= 9) , cdbs , haskell-devscripts (>= 0.8.15) , ghc , ghc-prof , happy Build-Depends-Indep: ghc-doc Standards-Version: 3.9.4 Homepage: http://sebfisch.github.com/haskell-regexp/ Vcs-Darcs: http://darcs.debian.org/pkg-haskell/haskell-weighted-regexp Vcs-Browser: http://darcs.debian.org/cgi-bin/darcsweb.cgi?r=pkg-haskell/haskell-weighted-regexp Package: libghc-weighted-regexp-dev Architecture: any Depends: ${haskell:Depends} , ${shlibs:Depends} , ${misc:Depends} Recommends: ${haskell:Recommends} Suggests: ${haskell:Suggests} Provides: ${haskell:Provides} Description: Weighted Regular Expression Matcher${haskell:ShortBlurb} Haskell implementation of a weighted regular expression matcher with linear worst-case time and space bounds. More specifically, the worst-case run time for matching a word against a regular expression is linearly bounded by the length of the word and the size of the regular expression. The memory requirements are independent of the length of the word and linear in the size of the regular expression. This makes this library suitable when processing untrusted data, e.g. in a web service, without risking an unexpected runtime blow-up. . ${haskell:Blurb} Package: libghc-weighted-regexp-prof Architecture: any Depends: ${haskell:Depends} , ${misc:Depends} Recommends: ${haskell:Recommends} Suggests: ${haskell:Suggests} Provides: ${haskell:Provides} Description: Weighted Regular Expression Matcher${haskell:ShortBlurb} Haskell implementation of a weighted regular expression matcher with linear worst-case time and space bounds. More specifically, the worst-case run time for matching a word against a regular expression is linearly bounded by the length of the word and the size of the regular expression. The memory requirements are independent of the length of the word and linear in the size of the regular expression. This makes this library suitable when processing untrusted data, e.g. in a web service, without risking an unexpected runtime blow-up. . ${haskell:Blurb} Package: libghc-weighted-regexp-doc Section: doc Architecture: all Depends: ${misc:Depends}, ${haskell:Depends} Recommends: ${haskell:Recommends} Suggests: ${haskell:Suggests} Description: Weighted Regular Expression Matcher${haskell:ShortBlurb} Haskell implementation of a weighted regular expression matcher with linear worst-case time and space bounds. More specifically, the worst-case run time for matching a word against a regular expression is linearly bounded by the length of the word and the size of the regular expression. The memory requirements are independent of the length of the word and linear in the size of the regular expression. This makes this library suitable when processing untrusted data, e.g. in a web service, without risking an unexpected runtime blow-up. . ${haskell:Blurb} debian/rules0000755000000000000000000000015512036252051010243 0ustar #!/usr/bin/make -f include /usr/share/cdbs/1/rules/debhelper.mk include /usr/share/cdbs/1/class/hlibrary.mk debian/patches/0000755000000000000000000000000012105247376010624 5ustar debian/patches/series0000644000000000000000000000001712105247376012037 0ustar eq-constraints debian/patches/eq-constraints0000644000000000000000000000662112036252050013512 0ustar Description: Add Eq instance constraint to semiring class Num no longer implies Eq, so we need this now. Author: Iain Lane Forwarded: https://github.com/sebfisch/haskell-regexp/pull/22 Index: haskell-weighted-regexp/src/Data/Semiring.hs =================================================================== --- haskell-weighted-regexp.orig/src/Data/Semiring.hs 2012-02-14 23:14:42.000000000 +0000 +++ haskell-weighted-regexp/src/Data/Semiring.hs 2012-02-14 23:17:04.389795495 +0000 @@ -82,5 +82,5 @@ instance Show a => Show (Numeric a) where show = show . getNumeric -instance Num a => Semiring (Numeric a) where +instance (Eq a, Num a) => Semiring (Numeric a) where zero = 0; one = 1; (.+.) = (+); (.*.) = (*) Index: haskell-weighted-regexp/src/Text/RegExp/Data.hs =================================================================== --- haskell-weighted-regexp.orig/src/Text/RegExp/Data.hs 2012-02-14 23:14:42.000000000 +0000 +++ haskell-weighted-regexp/src/Text/RegExp/Data.hs 2012-02-14 23:17:04.389795495 +0000 @@ -35,7 +35,7 @@ instance Weight c c Bool where symWeight = defaultSymWeight -instance Num a => Weight c c (Numeric a) where +instance (Eq a, Num a) => Weight c c (Numeric a) where symWeight = defaultSymWeight weighted :: Weight a b w => RegW w a -> RegW w b Index: haskell-weighted-regexp/src/Text/RegExp/Matching.hs =================================================================== --- haskell-weighted-regexp.orig/src/Text/RegExp/Matching.hs 2011-08-15 05:49:35.000000000 +0100 +++ haskell-weighted-regexp/src/Text/RegExp/Matching.hs 2012-02-14 23:18:54.297493176 +0000 @@ -30,7 +30,7 @@ -- Computes in how many ways a word can be matched against a regular -- expression. -- -matchingCount :: Num a => RegExp c -> [c] -> a +matchingCount :: (Eq a, Num a) => RegExp c -> [c] -> a matchingCount r = getNumeric . fullMatch r {-# SPECIALIZE matchingCount :: RegExp c -> [c] -> Int #-} @@ -50,7 +50,7 @@ {-# SPECIALIZE fullMatch :: RegExp c -> [c] -> Bool #-} {-# SPECIALIZE fullMatch :: RegExp c -> [c] -> Numeric Int #-} -{-# SPECIALIZE fullMatch :: Num a => RegExp c -> [c] -> Numeric a #-} +{-# SPECIALIZE fullMatch :: (Eq a, Num a) => RegExp c -> [c] -> Numeric a #-} {-# SPECIALIZE fullMatch :: RegExp c -> [(Int,c)] -> Leftmost #-} {-# SPECIALIZE fullMatch :: RegExp c -> [c] -> Longest #-} {-# SPECIALIZE fullMatch :: RegExp c -> [(Int,c)] -> LeftLong #-} @@ -67,7 +67,7 @@ {-# SPECIALIZE partialMatch :: RegExp c -> [c] -> Bool #-} {-# SPECIALIZE partialMatch :: RegExp c -> [c] -> Numeric Int #-} -{-# SPECIALIZE partialMatch :: Num a => RegExp c -> [c] -> Numeric a #-} +{-# SPECIALIZE partialMatch :: (Eq a, Num a) => RegExp c -> [c] -> Numeric a #-} {-# SPECIALIZE partialMatch :: RegExp c -> [(Int,c)] -> Leftmost #-} {-# SPECIALIZE partialMatch :: RegExp c -> [c] -> Longest #-} {-# SPECIALIZE partialMatch :: RegExp c -> [(Int,c)] -> LeftLong #-} @@ -78,7 +78,7 @@ {-# SPECIALIZE matchW :: RegW Bool c -> [c] -> Bool #-} {-# SPECIALIZE matchW :: RegW (Numeric Int) c -> [c] -> Numeric Int #-} -{-# SPECIALIZE matchW :: Num a => RegW (Numeric a) c -> [c] -> Numeric a #-} +{-# SPECIALIZE matchW :: (Eq a, Num a) => RegW (Numeric a) c -> [c] -> Numeric a #-} {-# SPECIALIZE matchW :: RegW Leftmost (Int,c) -> [(Int,c)] -> Leftmost #-} {-# SPECIALIZE matchW :: RegW Longest c -> [c] -> Longest #-} {-# SPECIALIZE matchW :: RegW LeftLong (Int,c) -> [(Int,c)] -> LeftLong #-} debian/changelog0000644000000000000000000000213312147643157011051 0ustar haskell-weighted-regexp (0.3.1.2-2) unstable; urgency=low * Enable compat level 9 * Use substvars for Haskell description blurbs -- Joachim Breitner Fri, 24 May 2013 12:52:31 +0200 haskell-weighted-regexp (0.3.1.2-1) experimental; urgency=low * New upstream release + drop patches/support-array-0.4 -- Joachim Breitner Fri, 08 Feb 2013 20:16:05 +0100 haskell-weighted-regexp (0.3.1.1-3) experimental; urgency=low * Depend on haskell-devscripts 0.8.13 to ensure this packages is built against experimental * Bump standards version, no change -- Joachim Breitner Sun, 14 Oct 2012 12:02:29 +0200 haskell-weighted-regexp (0.3.1.1-2) unstable; urgency=low * Extend version range for array in cabal file to support array 0.4 * Add Eq constraint to instances of various classes -- Iain Lane Tue, 14 Feb 2012 22:53:59 +0000 haskell-weighted-regexp (0.3.1.1-1) unstable; urgency=low * Initial release. (Closes: #641939) -- Joachim Breitner Mon, 19 Sep 2011 17:19:44 +0200 debian/source/0000755000000000000000000000000012036252051010462 5ustar debian/source/format0000644000000000000000000000001412036252051011670 0ustar 3.0 (quilt) debian/compat0000644000000000000000000000000212147616362010374 0ustar 9 debian/copyright0000644000000000000000000000335312036252050011120 0ustar Format: http://svn.debian.org/wsvn/dep/web/deps/dep5.mdwn?op=file&rev=135 Upstream-Name: weighted-regexp Upstream-Contact: Sebastian Fischer Source: http://hackage.haskell.org/package/weighted-regexp Copyright: 2010, Thomas Wilke, Frank Huch, Sebastian Fischer License: BSD3 All rights reserved. . Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: . 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. . 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. . 3. Neither the name of the author nor the names of his contributors may be used to endorse or promote products derived from this software without specific prior written permission. . THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.