haskell-regex-tdfa 1.2.0-4build3 source package in Ubuntu

Changelog

haskell-regex-tdfa (1.2.0-4build3) wily; urgency=medium

  * Rebuild for new GHC ABIs.

 -- Colin Watson <email address hidden>  Wed, 01 Jul 2015 15:15:56 +0100

Upload details

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

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
haskell-regex-tdfa_1.2.0.orig.tar.gz 64.5 KiB fc82ac14aae378c543a55cdac3f944aae5bff9918c4a342e1da87d38ba4ef401
haskell-regex-tdfa_1.2.0-4build3.debian.tar.xz 3.4 KiB 2f7ae53bd97d76947663dffbabf848b9440cbe6dcd1994483b81b9f40e913500
haskell-regex-tdfa_1.2.0-4build3.dsc 2.5 KiB c97d67c9dd2b9fe3afec737eb332dd4eeb7e1ecf4ac8c9eb778e570d0f9d5e9c

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 wily.

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

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

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

libghc-regex-tdfa-prof: Haskell library for a 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.