1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
|
Source: haskell-weighted-regexp
Section: haskell
Priority: extra
Maintainer: Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
Uploaders: Joachim Breitner <nomeata@debian.org>
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}
|
