regex-tdfa
Pure Haskell Tagged DFA Backend for "Text.Regex" (regex-base) (by haskell-hvr)
large-records
Library to support efficient compilation of large records (linear in the number of record fields) (by well-typed)
| regex-tdfa | large-records | |
|---|---|---|
| 1 | 2 | |
| 35 | 41 | |
| - | - | |
| 4.6 | 5.9 | |
| 15 days ago | 7 months ago | |
| Haskell | Haskell | |
| GNU General Public License v3.0 or later | BSD 3-clause "New" or "Revised" License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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-tdfa
Posts with mentions or reviews of regex-tdfa.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-01-24.
-
Haskell ghost knowledge; difficult to access, not written down
regex-tdfa, a very popular library, is buggy (e.g. here) despite claiming that "This regex-tdfa package implements, correctly, POSIX extended regular expressions [and your OS likely doesn't]"; its bugs very likely won't be fixed despite the fact that the library is still maintained
large-records
Posts with mentions or reviews of large-records.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-01-24.
-
New large-records release: now with 100% fewer quotes
Good question! I checked, and no, they are currently discarded. I think that's fixable. I've opened a ticked at https://github.com/well-typed/large-records/issues/80 .
-
Haskell ghost knowledge; difficult to access, not written down
Also: maybe you already knew GHC.Generics instances had superlinear compilation time, but betcha you didn't know even normal records themselves had superlinear compilation time. At least I didn't know until Edsko's super-recent investigation (resulting in yet-unreleased https://github.com/well-typed/large-records)
What are some alternatives?
When comparing regex-tdfa and large-records you can also consider the following projects:
jrec - Literally the best anonymous records
superrecord - Haskell: Supercharged anonymous records
rust-bindgen - Automatically generates Rust FFI bindings to C (and some C++) libraries.