haskell-regex-tdfa 1.3.1.2-1build2 source package in Ubuntu

Changelog

haskell-regex-tdfa (1.3.1.2-1build2) kinetic; urgency=medium

  * No-change rebuild for new ghc

 -- Steve Langasek <email address hidden>  Tue, 23 Aug 2022 05:46:43 +0000

Upload details

Uploaded by:
Steve Langasek
Uploaded to:
Kinetic
Original maintainer:
Ubuntu Developers
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.3.1.2.orig.tar.gz 79.4 KiB c47a78c9da532ba0883868a1e34427318cba3cccc8e42f995834c74eea286a62
haskell-regex-tdfa_1.3.1.2-1build2.debian.tar.xz 4.3 KiB a113326b4d4ef8ffcb354c4ee9b4444079feca2495b4a00315663b3ff0355e08
haskell-regex-tdfa_1.3.1.2-1build2.dsc 2.6 KiB f3a0b366b3cece745445fbe79315682801790b79bd3cb6c0f6c79d67974a9e22

View changes file

Binary packages built by this source

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

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

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

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

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.