haskell-regex-tdfa 1.3.1.0-2build1 source package in Ubuntu

Changelog

haskell-regex-tdfa (1.3.1.0-2build1) groovy; urgency=medium

  * No change rebuild against new ghc ABI.

 -- Dimitri John Ledkov <email address hidden>  Wed, 22 Jul 2020 01:27:44 +0100

Upload details

Uploaded by:
Dimitri John Ledkov on 2020-07-22
Uploaded to:
Groovy
Original maintainer:
Ubuntu Developers
Architectures:
any all
Section:
haskell
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Groovy release on 2020-07-27 universe haskell

Downloads

File Size SHA-256 Checksum
haskell-regex-tdfa_1.3.1.0.orig.tar.gz 75.9 KiB 15c376783d397b3b9933cf35980808feddde273bd6f2445babbccb2f76a42ec0
haskell-regex-tdfa_1.3.1.0-2build1.debian.tar.xz 4.4 KiB f7b0303bccdb1f5aaf9dfa776993c4281174052a89d8bcd7f55ac48562e35e93
haskell-regex-tdfa_1.3.1.0-2build1.dsc 2.5 KiB 01839ed1b2e30c4db5509627db226cb8a4086b1dac4da9058d7a28d1a3b63c6c

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.