Ubuntu
haskell-regex-tdfa package

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

Changelog

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

  * New upstream release

 -- Clint Adams <email address hidden>  Fri, 04 Dec 2015 00:24:24 -0500

Upload details

Uploaded by:
Debian Haskell Group
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

Downloads

File Size SHA-256 Checksum
haskell-regex-tdfa_1.2.1-1.dsc 2.6 KiB 93452d192b438510f6b37aff938d5594a66a59bbc894ee338e4632ea75cdecb4
haskell-regex-tdfa_1.2.1-1.debian.tar.xz 3.5 KiB 8af972c873a0d00007000173e14967372f784e0205bf5a59c1b880b7c13f3163
haskell-regex-tdfa_1.2.1.orig.tar.gz 64.6 KiB a38d305eeb78be2e34542b423e6a4763fbb8ad1df757aed01993785858c871a7

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.