regex-easy
regex-applicative-text
Our great sponsors
| regex-easy | regex-applicative-text | |
|---|---|---|
| 0 | 0 | |
| 2 | 4 | |
| - | - | |
| 0.0 | 0.0 | |
| about 9 years ago | 3 months ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
regex-easy
We haven't tracked posts mentioning regex-easy yet.
Tracking mentions began in Dec 2020.
regex-applicative-text
We haven't tracked posts mentioning regex-applicative-text yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
regex-applicative - Regex-based parsing with an applicative interface
regex-tdfa-pipes - Parse with regular expressions on Producers.
regex-posix-clib
regex - regex: A Regular Expression Toolkit for regex-base
regex-pcre-text - he PCRE/Text backend to accompany regex-base; needs regex-pcre and regex-tdfa-text
regex-tdfa - A new all Haskell "tagged" DFA regex engine, inspired by libtre
regex-tdfa-quasiquoter - Quasi-quoter for TDFA (extended POSIX) regular expressions.
regex-genex - Given a list of regexes, generate all possible strings that matches all of them.