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

Changelog

haskell-regex-tdfa (1.2.3.2-1build1) eoan; urgency=medium

  * Rebuild against new GHC abi.

 -- Gianfranco Costamagna <email address hidden>  Sat, 03 Aug 2019 14:56:13 +0200

Upload details

Uploaded by:
Gianfranco Costamagna on 2019-08-03
Uploaded to:
Eoan
Original maintainer:
Debian Haskell Group
Architectures:
any all
Section:
haskell
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Focal release on 2019-10-18 universe haskell
Eoan release on 2019-09-09 universe haskell

Downloads

File Size SHA-256 Checksum
haskell-regex-tdfa_1.2.3.2.orig.tar.gz 66.1 KiB 0e8ea50b60abbe998b191005695647fc2fcb544bdf5b6829b7e7a48f33bed00f
haskell-regex-tdfa_1.2.3.2-1build1.debian.tar.xz 4.0 KiB 85bb884d0b84d75b96124fb358501403c4959d76c60f41887c071d5f9caa0c71
haskell-regex-tdfa_1.2.3.2-1build1.dsc 2.4 KiB 7ca2374bd55eb91c19a69634b118fe872085bd1b8686281d61c910506530b066

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.