blob: 2a3b77a280ad18dfdb099b1310cc552b696ac676 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
|
Document: libghc-regex-tdfa-doc
Title: Manual for the Haskell regex-tdfa library
Abstract: An pure Haskell alternative to GHC's Text.Regex which uses 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.
Section: Programming
Format: HTML
Index: /usr/share/doc/libghc-regex-tdfa-doc/html/doc-index.html
Files: /usr/share/doc/libghc-regex-tdfa-doc/html/*.html
/usr/share/doc/libghc-regex-tdfa-doc/html/src/*.html
|
