BSD-3-Clause licensed by Christopher Kuklewicz
Maintained by [email protected]

Module documentation for 1.2.0

This version can be pinned in stack with:[email protected]:70ec3906536229a167a4600f4c8f8fa8a9ee3e9988750e34249f3a2e1c40c9f7,5184
  • Data
    • Data.IntMap
      • Data.IntMap.CharMap2
      • Data.IntMap.EnumMap2
    • Data.IntSet
      • Data.IntSet.EnumSet2
  • Text
    • Text.Regex
      • Text.Regex.TDFA
        • Text.Regex.TDFA.ByteString
          • Text.Regex.TDFA.ByteString.Lazy
        • Text.Regex.TDFA.Common
        • Text.Regex.TDFA.CorePattern
        • Text.Regex.TDFA.IntArrTrieSet
        • Text.Regex.TDFA.NewDFA
          • 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

A new all Haskell "tagged" DFA regex engine, inspired by libtre