haskell-regex-tdfa 1.2.3-1 source package in Ubuntu

Changelog

haskell-regex-tdfa (1.2.3-1) unstable; urgency=medium

  [ Ilias Tsitsimpis ]
  * Change Priority to optional. Since Debian Policy version 4.0.1,
    priority extra has been deprecated.
  * Use the HTTPS form of the copyright-format URL
  * Modify d/watch and Source field in d/copyright to use HTTPS
  * Declare compliance with Debian policy 4.1.1
  * Use salsa.debian.org URLs in Vcs-{Browser,Git} fields

  [ Clint Adams ]
  * Bump to Standards-Version 4.1.4.
  * New upstream release

 -- Clint Adams <email address hidden>  Mon, 09 Apr 2018 16:55:20 -0400

Upload details

Uploaded by:
Debian Haskell Group on 2018-04-11
Uploaded to:
Sid
Original maintainer:
Debian Haskell Group
Architectures:
any all
Section:
haskell
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Cosmic proposed on 2018-05-18 universe haskell

Downloads

File Size SHA-256 Checksum
haskell-regex-tdfa_1.2.3-1.dsc 2.6 KiB 87118753078d2dc703e6e27cbfe23f95b6f6e1e672b687b49f899edd03ad0fbe
haskell-regex-tdfa_1.2.3.orig.tar.gz 64.7 KiB 89b17ebb812d4597c0007fbbc21c78dfef70a133aa41b208217a9c99bed600d9
haskell-regex-tdfa_1.2.3-1.debian.tar.xz 3.8 KiB 3e5b304eede94892734b1b88c0d4bdd356bec0d8b7997020ec3f37109ec0bdbe

No changes file available.

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.