Regex -regex-compat

data Regex
regex-posix Text.Regex.Posix.Wrap, regex-posix Text.Regex.Posix.String, regex-posix Text.Regex.Posix.Sequence, regex-posix Text.Regex.Posix.ByteString, regex-posix Text.Regex.Posix.ByteString.Lazy
A compiled regular expression.
class RegexLike regex source => RegexContext regex source target
regex-base Text.Regex.Base.RegexLike
RegexContext is the polymorphic interface to do matching. Since target is polymorphic you may need to suply the type explicitly in contexts The monadic matchM version uses fail to report when the regex has no match in source. Two examples: Here the contest Bool is inferred: > [ c | let notVowel = makeRegex "[^aeiou]" :: Regex, c <- ['a'..'z'], match notVowel [c] ] > > "bcdfghjklmnpqrstvwxyz" Here the context '[String]' must be supplied: > let notVowel = (makeRegex "[^aeiou]" :: Regex ) > in do { c <- ['a'..'z'] ; matchM notVowel [c] } :: [String] > > ["b","c","d","f","g","h","j","k","l","m","n","p","q","r","s","t","v","w","x","y","z"]
class Extract source => RegexLike regex source
regex-base Text.Regex.Base.RegexLike
RegexLike is parametrized on a regular expression type and a source type to run the matching on. There are default implementations: matchTest and matchOnceText use matchOnce; matchCount and matchAllText use matchAll. matchOnce uses matchOnceText and matchAll uses matchAllText. So a minimal complete instance need to provide at least (matchOnce or matchOnceText) and (matchAll or matchAllText). Additional definitions are often provided > [ c | let notVowel = makeRegex "[^aeiou]" :: Regex, c <- ['a'..'z'], matchTest notVowel [c] ] > > "bcdfghjklmnpqrstvwxyz" The strictness of these functions is instance dependent.
class RegexOptions regex compOpt execOpt => RegexMaker regex compOpt execOpt source | regex -> compOpt execOpt, compOpt -> regex execOpt, execOpt -> regex compOpt
regex-base Text.Regex.Base.RegexLike
RegexMaker captures the creation of the compiled regular expression from a source type and an option type. makeRegexM and makeRegexM report parse error using MonadError, usually (Either String regex). The makeRegex function has a default implementation that depends on makeRegexOpts and used defaultCompOpt and defaultExecOpt. Similarly for makeRegexM and makeRegexOptsM. There are also default implementaions for makeRegexOpts and makeRegexOptsM in terms of each other. So a minimal instance definition needs to only define one of these, hopefully makeRegexOptsM.
class RegexOptions regex compOpt execOpt | regex -> compOpt execOpt, compOpt -> regex execOpt, execOpt -> regex compOpt
regex-base Text.Regex.Base.RegexLike
Rather than carry them around spearately, the options for how to execute a regex are kept as part of the regex. There are two types of options. Those that can only be specified at compilation time and never changed are CompOpt. Those that can be changed later and affect how matching is performed are ExecOpt. The actually types for these depend on the backend.
module Text.Regex.Base.RegexLike
regex-base Text.Regex.Base.RegexLike
Classes and instances for Regex matching. All the classes are declared here, and some common type aliases, and the MatchResult data type. The only instances here are for Extract String and Extract ByteString. There are no data values. The RegexContext instances are in Text.Regex.Base.Context, except for ones which run afoul of a repeated variable (RegexContext regex a a), which are defined in each modules' String and ByteString modules.
package regex-applicative
package
regex-applicative is a Haskell library for parsing using regular expressions. Parsers can be built using Applicative interface. Version 0.3.0.2
package regex-base
package
Interface API for regex-posix,pcre,parsec,tdfa,dfa Version 0.93.2
package regex-compat
package
One module layer over regex-posix to replace Text.Regex Version 0.95.1
package regex-compat-tdfa
package
One module layer over regex-tdfa to replace Text.Regex. regex-compat can't use Unicode characters correctly because of using regex-posix. This is not good for Unicode users. I modified regex-compat to use regex-tdfa for solving today's problem. Version 0.95.1.4
package regex-deriv
package
Regex algorithm implementation using derivatives. Version 0.0.4
package regex-dfa
package
The lazy DFA engine, based on CTKLight, for regex-base Version 0.91
package regex-genex
package
From a regex, generate all possible strings it can match Version 0.6.0
package regex-parsec
package
A better performance, lazy, powerful replacement of Text.Regex and JRegex Version 0.90
package regex-pcre
package
The PCRE backend to accompany regex-base, see www.pcre.org Version 0.94.4
package regex-pcre-builtin
package
The PCRE backend to accompany regex-base, with bundled code from www.pcre.org Version 0.94.4.7.8.31
package regex-pderiv
package
Regex algorithm implementation using partial derivatives. The svn source also shipped with two other referential implementations, e.g. Thomspon NFA and Glushkov NFA. For more detail please check out http:code.google.compxhaskell-library/ Version 0.1.3
package regex-posix
package
The posix regex backend for regex-base Version 0.95.2
package regex-posix-unittest
package
Most platforms have a buggy system regex library and this probes the bugs by using the regex-posix package, run with &quot;regex-posix-unittest&quot; Version 1.1
package regex-tdfa
package
A new all Haskell &quot;tagged&quot; DFA regex engine, inspired by libtre Version 1.1.8

Show more results