regex-tdfa-1.3.2.2: 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.

Modules

regex-tdfa-1.3.2.2

Data
Submodules
- IntMap
  Submodules
  - Data.IntMap.CharMap2
  - Data.IntMap.EnumMap2
- IntSet
  Submodules
  - Data.IntSet.EnumSet2
Text
Submodules
- Regex
  Submodules
  - Text.Regex.TDFA
    Submodules
    Text.Regex.TDFA.ByteString
    Submodules
    Text.Regex.TDFA.ByteString.Lazy
    Text.Regex.TDFA.Common
    Text.Regex.TDFA.CorePattern
    Text.Regex.TDFA.IntArrTrieSet
    NewDFA
    Submodules
    Text.Regex.TDFA.NewDFA.Engine
    Text.Regex.TDFA.NewDFA.Engine_FA
    Text.Regex.TDFA.NewDFA.Engine_NC
    Text.Regex.TDFA.NewDFA.Engine_NC_FA
    Text.Regex.TDFA.NewDFA.MakeTest
    Text.Regex.TDFA.NewDFA.Tester
    Text.Regex.TDFA.NewDFA.Uncons
    Text.Regex.TDFA.Pattern
    Text.Regex.TDFA.ReadRegex
    Text.Regex.TDFA.Sequence
    Text.Regex.TDFA.String
    Text.Regex.TDFA.TDFA
    Text.Regex.TDFA.TNFA
    Text.Regex.TDFA.Text
    Submodules
    Text.Regex.TDFA.Text.Lazy