haskell-regex-tdfa 1.2.2-3build2 source package in Ubuntu

Changelog

haskell-regex-tdfa (1.2.2-3build2) artful; urgency=medium

  * Rebuild against new GHC ABI.

 -- Gianfranco Costamagna <email address hidden>  Tue, 20 Jun 2017 23:27:34 +0200

Upload details

Uploaded by:
Gianfranco Costamagna on 2017-06-20
Uploaded to:
Artful
Original maintainer:
Debian Haskell Group
Architectures:
any all
Section:
haskell
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Bionic release on 2017-10-24 universe haskell
Artful release on 2017-06-24 universe haskell

Downloads

File Size SHA-256 Checksum
haskell-regex-tdfa_1.2.2.orig.tar.gz 64.4 KiB cb12d675be7b31ed8086d8d022023d03eb553e55dbee6e1b7a4154933d471d39
haskell-regex-tdfa_1.2.2-3build2.debian.tar.xz 3.7 KiB 1b9a603f4eb746d0a61617d1f29e42498cdd5637ad1f277732bd1adc150855b5
haskell-regex-tdfa_1.2.2-3build2.dsc 2.5 KiB eba10f20c41c3ca9d37d316efc51de0f1c22fb4aa8afbd752deb74a5ee578045

Available diffs

View changes file

Binary packages built by this source

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

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.