haskell-regex-tdfa 1.3.2.2-1build1 source package in Ubuntu
Changelog
haskell-regex-tdfa (1.3.2.2-1build1) oracular; urgency=medium * Rebuild against new GHC ABIs. -- Gianfranco Costamagna <email address hidden> Wed, 15 May 2024 10:57:49 +0200
Upload details
- Uploaded by:
- Gianfranco Costamagna
- Uploaded to:
- Oracular
- Original maintainer:
- Debian Haskell Group
- Architectures:
- any all
- Section:
- haskell
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Oracular | release | universe | haskell |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| haskell-regex-tdfa_1.3.2.2.orig.tar.gz | 81.1 KiB | 933ed5c54246bb50e335d86b884ffb70bc252b5f776fb291f162a80a27bd75b7 |
| haskell-regex-tdfa_1.3.2.2-1build1.debian.tar.xz | 4.1 KiB | 859ae541b1bba1e8b35499409cc5e361ca44ed8b0522e9b1deca1d5f45f76f38 |
| haskell-regex-tdfa_1.3.2.2-1build1.dsc | 2.5 KiB | d85d78f49241c0e9feedf10cf160407f15a6013eb654670e8588b93c096a1f06 |
Available diffs
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.
