|File Search||Catalog||Content Search|
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 libraries compiled for GHC.
haskell-regex-tdfa (1.1.8-2+b1) sid; urgency=low * Binary-only non-maintainer upload for i386; no source changes. * Rebuild against new transformers/mtl -- i386 Build Daemon (murphy) <email@example.com> Fri, 25 May 2012 19:14:55 +0000 haskell-regex-tdfa (1.1.8-2) unstable; urgency=low * Remove doc-base file, avoids squeeze → wheezy upgrade problems -- Joachim Bre more»
This package was originally debianised by Erik de Castro Lopo <firstname.lastname@example.org> Mon, 11 May 2009. It was downloaded from the Haskell hackage repository at http://hackage.haskell.org/cgi-bin/hackage-scripts/package/regex-tdfa Copyright: Copyright (c) 2007-2009, Christopher Kuklewicz All rights reserved. Redistribution and use in source and binary forms, with or without modification, more»