Regex package:regex-tdfa

data Regex

regex-tdfa Text.Regex.TDFA Text.Regex.TDFA.ByteString Text.Regex.TDFA.ByteString.Lazy Text.Regex.TDFA.Common Text.Regex.TDFA.Sequence Text.Regex.TDFA.String Text.Regex.TDFA.Text Text.Regex.TDFA.Text.Lazy

The TDFA backend specific Regex type, used by this module's RegexOptions and RegexMaker.

Regex :: DFA -> Index -> (Index, Index) -> (Tag, Tag) -> TrieSet DFA -> Array Tag OP -> Array GroupIndex [GroupInfo] -> Bool -> CompOption -> ExecOption -> Regex

regex-tdfa Text.Regex.TDFA.Common

package regex-tdfa

Uses

Pure Haskell Tagged DFA Backend for "Text.Regex" (regex-base) This package provides a pure Haskell "Tagged" DFA regex engine for regex-base. This implementation was inspired by the algorithm (and Master's thesis) behind the regular expression library known as TRE or libtre. Please consult the Text.Regex.TDFA module for API documentation including a tutorial with usage examples; see also https://wiki.haskell.org/Regular_expressions for general information about regular expression support in Haskell.

regexec :: Regex -> ByteString -> Either String (Maybe (ByteString, ByteString, ByteString, [ByteString]))

regex-tdfa Text.Regex.TDFA.ByteString Text.Regex.TDFA.ByteString.Lazy

regex_b_index :: Regex -> (Index, Index)

regex-tdfa Text.Regex.TDFA.Common

indexes of smallest and largest states

regex_b_tags :: Regex -> (Tag, Tag)

regex-tdfa Text.Regex.TDFA.Common

indexes of smallest and largest tags

regex_compOptions :: Regex -> CompOption

regex-tdfa Text.Regex.TDFA.Common

regex_dfa :: Regex -> DFA

regex-tdfa Text.Regex.TDFA.Common

starting DFA state

regex_execOptions :: Regex -> ExecOption

regex-tdfa Text.Regex.TDFA.Common

regex_groups :: Regex -> Array GroupIndex [GroupInfo]

regex-tdfa Text.Regex.TDFA.Common

information about each group

regex_init :: Regex -> Index

regex-tdfa Text.Regex.TDFA.Common

index of starting state

regex_isFrontAnchored :: Regex -> Bool

regex-tdfa Text.Regex.TDFA.Common

used for optimizing execution

regex_tags :: Regex -> Array Tag OP

regex-tdfa Text.Regex.TDFA.Common

information about each tag

regex_trie :: Regex -> TrieSet DFA

regex-tdfa Text.Regex.TDFA.Common

All DFA states

regexec :: Regex -> Seq Char -> Either String (Maybe (Seq Char, Seq Char, Seq Char, [Seq Char]))

regex-tdfa Text.Regex.TDFA.Sequence

regexec :: Regex -> String -> Either String (Maybe (String, String, String, [String]))

regex-tdfa Text.Regex.TDFA.String

regexec :: Regex -> Text -> Either String (Maybe (Text, Text, Text, [Text]))

regex-tdfa Text.Regex.TDFA.Text Text.Regex.TDFA.Text.Lazy

getVersion_Text_Regex_TDFA :: Version

regex-tdfa Text.Regex.TDFA

module Text.Regex.TDFA.ReadRegex

regex-tdfa

This is a POSIX version of parseRegex that allows NUL characters. Lazy/Possessive/Backrefs are not recognized. Anchors ^ and $ are recognized. A PGroup returned always has (Maybe GroupIndex) set to (Just _) and never to Nothing.

parseRegex :: String -> Either ParseError (Pattern, (GroupIndex, DoPa))

regex-tdfa Text.Regex.TDFA.ReadRegex

Return either an error message or a tuple of the Pattern and the largest group index and the largest DoPa index (both have smallest index of 1). Since the regular expression is supplied as [Char] it automatically supports unicode and \NUL characters.

patternToRegex :: (Pattern, (GroupIndex, DoPa)) -> CompOption -> ExecOption -> Regex

regex-tdfa Text.Regex.TDFA.TDFA