regex-tdfa
regex-tdfa copied to clipboard
haskell-hvr
Pure Haskell Tagged DFA Backend for "Text.Regex" (regex-base)
~~Better docs for `Pattern` module~~ (fixed in 1.3.2), fix `showPattern` to round-trip. It is claimed that `showPattern` round-trips, but does not: ``` >>> getAllTextMatches ("a \" \\" =~ "[a]") ::...
E.g., https://hackage.haskell.org/package/regex-tdfa-1.3.1.3/docs/Text-Regex-TDFA-Common.html exports lots of auxiliary functions. These should be removed. Needs a major version bump.
In GHCI: ``` Text.Regex.TDFA> "f" =~~ "." :: Maybe String Just "f" Text.Regex.TDFA> "\n" =~~ "." :: Maybe String Nothing ``` The documentation says multiline matching should be enabled by...
Pattern `\\d+|\\b[a-zA-Z']+\\b` fails to find the digits in input "testing, 1, 2 testing". The regex is correct as can be tested here https://regex101.com/r/griuTm/1. Changing the pattern to `\\b[0-9a-zA-Z']+\\b` works, but...
This pull request fixes issue #12. ``` replicate 1000000 'f' =~ "\\`g" :: Bool -- returns quickly replicate 1000000 'f' =~ "^g" :: Bool -- returns slowly as it needs...
When I tried benchmarking, I noticed a strange and significant performance-penalty effect that is exposed by the `Text` support recently merged into `regex-tdfa`. (The `String` and `ByteString` instances don't exhibit...
Hi, thanks for this great library! You mention in docs https://hackage.haskell.org/package/regex-tdfa-1.3.1.1/docs/Text-Regex-TDFA.html common use cases, and there is 4 of them. I am wondering, is that all or are there other...
Just a quick note that a lot of the [other-implementations-are-not-compliant examples](https://wiki.haskell.org/Regex_Posix#Results_and_Bugs) appear to be about empty patterns (e.g., issues with the matching of `()` in `(()|.)(b)`). If you read the...
Metadata
Owner
Metadata
Pure Haskell Tagged DFA Backend for "Text.Regex" (regex-base)