haskell-regex-tdfa 1.1.7-2 source package in Ubuntu

Changelog

haskell-regex-tdfa (1.1.7-2) unstable; urgency=low

  * Build against parsec-3
 -- Ubuntu Archive Auto-Sync <email address hidden>   Tue,  14 Jun 2011 10:03:37 +0000

Upload details

Uploaded by:
Ubuntu Archive Auto-Sync
Uploaded to:
Oneiric
Original maintainer:
Debian Haskell Group
Architectures:
any
Section:
haskell
Urgency:
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
haskell-regex-tdfa_1.1.7.orig.tar.gz 64.3 KiB 9ef812cc6946fc5b8a2d7349ea5812a7caf862a727960e3fbfdd1d61154b1f1a
haskell-regex-tdfa_1.1.7-2.debian.tar.gz 3.4 KiB ed1ae926805eade5435947b4894ab76c148066f228c803b05c616c6b64f6e2b8
haskell-regex-tdfa_1.1.7-2.dsc 1.7 KiB 2f5bbf156c7a1576c4b33cbf9e1a5fabd6a464e5bba3908f3a4df11139c912d2

Available diffs

View changes file

Binary packages built by this source

libghc-regex-tdfa-dev: No summary available for libghc-regex-tdfa-dev in ubuntu oneiric.

No description available for libghc-regex-tdfa-dev in ubuntu oneiric.

libghc-regex-tdfa-doc: No summary available for libghc-regex-tdfa-doc in ubuntu oneiric.

No description available for libghc-regex-tdfa-doc in ubuntu oneiric.

libghc-regex-tdfa-prof: Profiling libraries for the 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).
 .
 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.
 .
 This package contains the profiling libraries compiled for GHC.