Package1.3.2.5Text

regex-tdfa

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

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

Modules

24 modules

Data.IntMap.CharMap268
Data.IntMap.EnumMap267
Data.IntSet.EnumSet230
Text.Regex.TDFA21SPDX-License-Identifier: BSD-3-Clause
Text.Regex.TDFA.ByteString6This modules provides RegexMaker and RegexLike instances for using
Text.Regex.TDFA.ByteString.Lazy6This modules provides RegexMaker and RegexLike instances for using
Text.Regex.TDFA.Common48Common provides simple functions to the backend.
Text.Regex.TDFA.CorePattern12The CorePattern module deconstructs the Pattern tree created by
Text.Regex.TDFA.IntArrTrieSet5This creates a lazy Trie based on a finite range of Ints and is used to
Text.Regex.TDFA.NewDFA.Engine1This is the code for the main engine. This captures the posix subexpressions. This execMatch
Text.Regex.TDFA.NewDFA.Engine_FA1This is the code for the main engine. This captures the posix
Text.Regex.TDFA.NewDFA.Engine_NC1This is the non-capturing form of Text.Regex.TDFA.NewDFA.String
Text.Regex.TDFA.NewDFA.Engine_NC_FA1This is the non-capturing form of Text.Regex.TDFA.NewDFA.String
Text.Regex.TDFA.NewDFA.MakeTest2
Text.Regex.TDFA.NewDFA.Tester1Like Engine, but merely checks to see whether any match at all is found.
Text.Regex.TDFA.NewDFA.Uncons1
Text.Regex.TDFA.Pattern14This Text.Regex.TDFA.Pattern module provides the Pattern data
Text.Regex.TDFA.ReadRegex1This is a POSIX version of parseRegex that allows NUL characters.
Text.Regex.TDFA.Sequence6This modules provides RegexMaker and RegexLike instances for using
Text.Regex.TDFA.String8This modules provides RegexMaker and RegexLike instances for using
Text.Regex.TDFA.TDFA6Text.Regex.TDFA.TDFA converts the QNFA from TNFA into the DFA.
Text.Regex.TDFA.TNFA5Text.Regex.TDFA.TNFA converts the CorePattern Q/P data (and its
Text.Regex.TDFA.Text6This modules provides RegexMaker and RegexLike instances for using
Text.Regex.TDFA.Text.Lazy6This 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 · 4