Package1.3.2.6Text

regex-tdfa

Pure Haskell Tagged DFA Backend for "Text.Regex" (regex-base)

Version1.3.2.6
CategoryText
LicenceBSD-3-Clause
AuthorChristopher Kuklewicz
MaintainerAndreas Abel
Homepagewiki.haskell.org/Regular_expressions
Pinned byhackage regex-tdfa 1.3.2.6
Sourcehackage.haskell.org/package/regex-tdfa-1.3.2.6

Modules

Data.IntMap.CharMap2
Data.IntMap.EnumMap2
Data.IntSet.EnumSet2
Text.Regex.TDFASPDX-License-Identifier: BSD-3-Clause
Text.Regex.TDFA.ByteStringThis modules provides RegexMaker and RegexLike instances for using
Text.Regex.TDFA.ByteString.LazyThis modules provides RegexMaker and RegexLike instances for using
Text.Regex.TDFA.CommonCommon provides simple functions to the backend.
Text.Regex.TDFA.CorePatternThe CorePattern module deconstructs the Pattern tree created by
Text.Regex.TDFA.IntArrTrieSetThis creates a lazy Trie based on a finite range of Ints and is used to
Text.Regex.TDFA.NewDFA.EngineThis is the code for the main engine. This captures the posix subexpressions. This execMatch
Text.Regex.TDFA.NewDFA.Engine_FAThis is the code for the main engine. This captures the posix
Text.Regex.TDFA.NewDFA.Engine_NCThis is the non-capturing form of Text.Regex.TDFA.NewDFA.String
Text.Regex.TDFA.NewDFA.Engine_NC_FAThis is the non-capturing form of Text.Regex.TDFA.NewDFA.String
Text.Regex.TDFA.NewDFA.MakeTest
Text.Regex.TDFA.NewDFA.TesterLike Engine, but merely checks to see whether any match at all is found.
Text.Regex.TDFA.NewDFA.Uncons
Text.Regex.TDFA.PatternThis Text.Regex.TDFA.Pattern module provides the Pattern data
Text.Regex.TDFA.ReadRegexThis is a POSIX version of parseRegex that allows NUL characters.
Text.Regex.TDFA.SequenceThis modules provides RegexMaker and RegexLike instances for using
Text.Regex.TDFA.StringThis modules provides RegexMaker and RegexLike instances for using
Text.Regex.TDFA.TDFAText.Regex.TDFA.TDFA converts the QNFA from TNFA into the DFA.
Text.Regex.TDFA.TNFAText.Regex.TDFA.TNFA converts the CorePattern Q/P data (and its
Text.Regex.TDFA.TextThis modules provides RegexMaker and RegexLike instances for using
Text.Regex.TDFA.Text.LazyThis modules provides RegexMaker and RegexLike instances for using

Description

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.

Depends on

8 packages

Modules

Description

Depends on

Used by in this set · 8