Ubuntu
haskell-weighted-regexp package

haskell-weighted-regexp 0.3.1.1-1build1 source package in Ubuntu

Changelog

haskell-weighted-regexp (0.3.1.1-1build1) precise; urgency=low

  * Rebuild for new GHC ABIs.
 -- Colin Watson <email address hidden>   Sun, 13 Nov 2011 11:40:44 +0000

Upload details

Uploaded by:
Colin Watson
Uploaded to:
Precise
Original maintainer:
Debian Haskell Group
Architectures:
any all
Section:
haskell
Urgency:
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
haskell-weighted-regexp_0.3.1.1.orig.tar.gz 23.0 KiB 6b0a570d6151df64d28181a579e87eff8f9e5e485230629bd716e491e628e8c1
haskell-weighted-regexp_0.3.1.1-1build1.debian.tar.gz 2.4 KiB 9c9df592c6b0d31f6c4c5e9821926bea96ea95d9010adae3c86e586d6334ff9c
haskell-weighted-regexp_0.3.1.1-1build1.dsc 2.4 KiB c75e473dfde5536c2c365bd122b197c44731629e77d8a4bb9207f42b4fee2021

Available diffs

View changes file

Binary packages built by this source

libghc-weighted-regexp-dev: Weighted Regular Expression Matcher

 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.
 .
 This package provides a library for the Haskell programming language.
 See http://www.haskell.org/ for more information on Haskell.

libghc-weighted-regexp-doc: Weighted Regular Expression Matcher; documentation

 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.
 .
 This package provides the documentation for a library for the Haskell
 programming language.
 See http://www.haskell.org/ for more information on Haskell.

libghc-weighted-regexp-prof: Weighted Regular Expression Matcher; profiling libraries

 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.
 .
 This package provides a library for the Haskell programming language, compiled
 for profiling. See http://www.haskell.org/ for more information on Haskell.