haskell-regex-tdfa 1.1.8-1 source package in Ubuntu
Changelog
haskell-regex-tdfa (1.1.8-1) unstable; urgency=low * New upstream version. -- Clint Adams <email address hidden> Mon, 13 Feb 2012 21:47:38 -0500
Upload details
- Uploaded by:
- Debian Haskell Group
- Uploaded to:
- Sid
- Original maintainer:
- Debian Haskell Group
- Architectures:
- any all
- Section:
- haskell
- Urgency:
- Low Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Precise | release | universe | haskell |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| haskell-regex-tdfa_1.1.8-1.dsc | 2.4 KiB | 8073b99b2b0bc684634c5c913011fe2f45a067e8eaf4d09c4c677551054d5a14 |
| haskell-regex-tdfa_1.1.8.orig.tar.gz | 64.4 KiB | 7d9ca2ff95e602c46090dfa56f3176fe903d8d08ac9d725c79af56be0aece5d4 |
| haskell-regex-tdfa_1.1.8-1.debian.tar.gz | 3.3 KiB | d7c23ff0b6093abe5d2129e00035a4e0b2afaa491e4d83e9284264c6b1fbe03f |
Available diffs
No changes file available.
Binary packages built by this source
- libghc-regex-tdfa-dev: No summary available for libghc-regex-tdfa-dev in ubuntu quantal.
No description available for libghc-
regex-tdfa- dev in ubuntu quantal.
- 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: No summary available for libghc-regex-tdfa-prof in ubuntu quantal.
No description available for libghc-
regex-tdfa- prof in ubuntu quantal.
