haskell-regex-tdfa 1.2.1-1build1 source package in Ubuntu

Changelog

haskell-regex-tdfa (1.2.1-1build1) xenial; urgency=medium

  * Rebuild for new GHC ABIs.

 -- Colin Watson <email address hidden>  Mon, 11 Jan 2016 18:33:07 +0000

Upload details

Uploaded by:
Colin Watson on 2016-01-11
Uploaded to:
Xenial
Original maintainer:
Debian Haskell Group
Architectures:
any all
Section:
haskell
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Xenial release on 2016-02-10 universe haskell

Downloads

File Size SHA-256 Checksum
haskell-regex-tdfa_1.2.1.orig.tar.gz 64.6 KiB a38d305eeb78be2e34542b423e6a4763fbb8ad1df757aed01993785858c871a7
haskell-regex-tdfa_1.2.1-1build1.debian.tar.xz 3.5 KiB e95e621b5e227237865b4a3e4def2f744d6fe05b51414e9166d7c4bc72b97f10
haskell-regex-tdfa_1.2.1-1build1.dsc 2.5 KiB b669f837b0196b5380760e132ad91b61a2c4f37f570ac9b3ed6e93603efb93be

View changes file

Binary packages built by this source

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

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

libghc-regex-tdfa-doc: Haskell library for a tagged DFA regex engine; documentation

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

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.