haskell-regex-tdfa 1.3.1.0-2build2 source package in Ubuntu
Changelog
haskell-regex-tdfa (1.3.1.0-2build2) hirsute; urgency=medium * No-change rebuild for new GHC ABIs -- Steve Langasek <email address hidden> Thu, 29 Oct 2020 20:46:13 +0000
Upload details
- Uploaded by:
- Steve Langasek
- Uploaded to:
- Hirsute
- Original maintainer:
- Ubuntu Developers
- Architectures:
- any all
- Section:
- haskell
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Jammy | release | universe | haskell |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| haskell-regex-tdfa_1.3.1.0.orig.tar.gz | 75.9 KiB | 15c376783d397b3b9933cf35980808feddde273bd6f2445babbccb2f76a42ec0 |
| haskell-regex-tdfa_1.3.1.0-2build2.debian.tar.xz | 4.5 KiB | 9bb8fbcee11344ee84162de07834446fb62893ca3de3f0decf21c2d0d348808f |
| haskell-regex-tdfa_1.3.1.0-2build2.dsc | 2.6 KiB | 335e9beb1945cdfb2236f5f906f33c8f395b7e9d21afd2d473234287401c0bde |
Available diffs
- diff from 1.3.1.0-2build1 to 1.3.1.0-2build2 (345 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.
