haskell-regex-tdfa 1.1.7-2build1 source package in Ubuntu
Changelog
haskell-regex-tdfa (1.1.7-2build1) precise; urgency=low * Rebuild for new GHC ABIs. -- Colin Watson <email address hidden> Mon, 07 Nov 2011 11:13:17 +0000
Upload details
- Uploaded by:
- Colin Watson
- Uploaded to:
- Precise
- Original maintainer:
- Debian Haskell Group
- Architectures:
- any all
- Section:
- haskell
- Urgency:
- Low Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| haskell-regex-tdfa_1.1.7.orig.tar.gz | 64.3 KiB | 9ef812cc6946fc5b8a2d7349ea5812a7caf862a727960e3fbfdd1d61154b1f1a |
| haskell-regex-tdfa_1.1.7-2build1.debian.tar.gz | 3.4 KiB | ac40e75e7a62d2095f651bc42c98e87b5fe0168a8dbc6f8aef7cce73a65de84c |
| haskell-regex-tdfa_1.1.7-2build1.dsc | 2.5 KiB | 27fd8072e5d4b8856d01ade37178ee28d08263388a51e84a24598dbb14f1adac |
Available diffs
- diff from 1.1.7-2 to 1.1.7-2build1 (336 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 contains the libraries compiled for GHC.
- libghc-regex-tdfa-doc: Documentation for the 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 contains the library documentation.
- libghc-regex-tdfa-prof: Profiling libraries for the 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 contains the profiling libraries compiled for GHC.
