haskell-regex-tdfa 1.3.2-1build2 source package in Ubuntu
Changelog
haskell-regex-tdfa (1.3.2-1build2) lunar; urgency=medium * Rebuild against new GHC ABI. -- Gianfranco Costamagna <email address hidden> Fri, 09 Dec 2022 14:37:07 +0100
Upload details
- Uploaded by:
- Gianfranco Costamagna
- Uploaded to:
- Lunar
- Original maintainer:
- Debian Haskell Group
- Architectures:
- any all
- Section:
- haskell
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Mantic | release | universe | haskell | |
| Lunar | release | universe | haskell |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| haskell-regex-tdfa_1.3.2.orig.tar.gz | 80.9 KiB | 2660d7dc5f00718c39454c844d354dea26d605db9864f80951efad5f7284dfd1 |
| haskell-regex-tdfa_1.3.2-1build2.debian.tar.xz | 4.3 KiB | 07289c58b4fcbe15f435d8cc511828943712d255c276d06db6821da53a309311 |
| haskell-regex-tdfa_1.3.2-1build2.dsc | 2.4 KiB | 62aee081d1809a9c3a849080bbaf3ca042e13c29a173668dead9dfd01a78b40a |
Available diffs
- diff from 1.3.1.2-1build2 to 1.3.2-1build2 (20.1 KiB)
- diff from 1.3.2-1build1 to 1.3.2-1build2 (328 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.
