haskell-regex-tdfa 1.2.0-4build4 source package in Ubuntu
Changelog
haskell-regex-tdfa (1.2.0-4build4) xenial; urgency=medium * Rebuild for new GHC ABIs. -- Colin Watson <email address hidden> Wed, 09 Dec 2015 15:49:54 +0000
Upload details
- Uploaded by:
- Colin Watson
- Uploaded to:
- Xenial
- Original maintainer:
- Debian Haskell Group
- Architectures:
- any all
- Section:
- haskell
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| haskell-regex-tdfa_1.2.0.orig.tar.gz | 64.5 KiB | fc82ac14aae378c543a55cdac3f944aae5bff9918c4a342e1da87d38ba4ef401 |
| haskell-regex-tdfa_1.2.0-4build4.debian.tar.xz | 3.5 KiB | 5b80dacd367a5c2e885fcdb88e8b5492e33c6071b069299fb46dee0fda32fa89 |
| haskell-regex-tdfa_1.2.0-4build4.dsc | 2.5 KiB | 2451c01abe096f819527b48f5735cd1cd90bd23990792afebb4832666ea177fb |
Available diffs
- diff from 1.2.0-4build3 to 1.2.0-4build4 (314 bytes)
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.
