regex-tdfa-1.3.1.2: Pure Haskell Tagged DFA Backend for "Text.Regex" (regex-base)
Safe HaskellSafe-Inferred
LanguageHaskell2010

Text.Regex.TDFA.NewDFA.Engine_FA

Description

This is the code for the main engine. This captures the posix subexpressions. There is also a non-capturing engine, and a testing engine.

It is polymorphic over the internal Uncons type class, and specialized to produce the needed variants.

Documentation

execMatch :: forall text. Uncons text => Regex -> Position -> Char -> text -> [MatchArray] Source #