haskell-regex-tdfa 1.1.8-4build1 source package in Ubuntu

Changelog

haskell-regex-tdfa (1.1.8-4build1) saucy; urgency=low

  * Rebuild for new GHC ABIs.
 -- Colin Watson <email address hidden>   Tue, 28 May 2013 22:46:48 +0100

Upload details

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

See full publishing history Publishing

Series Pocket Published Component Section
Trusty release universe haskell

Downloads

File Size SHA-256 Checksum
haskell-regex-tdfa_1.1.8.orig.tar.gz 64.4 KiB 7d9ca2ff95e602c46090dfa56f3176fe903d8d08ac9d725c79af56be0aece5d4
haskell-regex-tdfa_1.1.8-4build1.debian.tar.gz 3.4 KiB cabe74c1940f00621c75d6a041aa1bc81472d45a5df7579c709f1147c5872ec8
haskell-regex-tdfa_1.1.8-4build1.dsc 2.5 KiB 958490f0ff9e1b736d381a6e4e73aa6ba5acfff7e4a111aff83ee2e8520c92e5

View changes file

Binary packages built by this source

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

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

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

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

libghc-regex-tdfa-prof: Profiling libraries for the tagged DFA regex engine; profiling libraries

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