semver-range
Implementation of semver and NPM-style semantic version ranges in Haskell (by adnelson)
hasql-dynamic-statements
Dynamic statements for Hasql (by nikita-volkov)
| semver-range | hasql-dynamic-statements | |
|---|---|---|
| - | 1 | |
| 12 | 5 | |
| - | - | |
| 0.0 | 6.7 | |
| over 4 years ago | 3 months ago | |
| Haskell | Haskell | |
| MIT License | MIT 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.
semver-range
Posts with mentions or reviews of semver-range.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning semver-range yet.
Tracking mentions began in Dec 2020.
hasql-dynamic-statements
Posts with mentions or reviews of hasql-dynamic-statements.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-02-09.
-
Persistent vs. beam for production database
In typical CRUD applications you can get a long way with type-checked plain SQL and tuples via hasql-th, which is a great time saver at prototyping. Later on when you have more conditional logic in your queries you can gradually substitute it with dynamic statements. It works very well in production where you incrementally refine your own high-level abstractions with appropriate encoders/decoders, you can even build your own DSL on top of it, instead of relying on pre-defined query building APIs of Persistent and Beam. But again, both Persistent and Beam will work well too.
What are some alternatives?
When comparing semver-range and hasql-dynamic-statements you can also consider the following projects:
dag - A well-typed Directed Acyclic Graph in Haskell
logging-effect - A very general logging effect for Haskell
cognimeta-utils - Utilities used by Perdure
aeson-json-ast - Integration layer for "json-ast" and "aeson"
hworker - A reliable at-least-once job queue built on Redis.
type-sets - type level sets
rss - A library for generating RSS 2.0 feeds.
final - final monad helper for Haskell to instead of return
hasql-implicits - Implicit definitions for Hasql, such as default codecs for standard types
lucid-foundation - The Zurb Foundation's API as Lucid constructs.
google-oauth2 - Google OAuth2 token negotiation
semver-range vs dag
hasql-dynamic-statements vs logging-effect
semver-range vs cognimeta-utils
hasql-dynamic-statements vs aeson-json-ast
semver-range vs logging-effect
hasql-dynamic-statements vs hworker
semver-range vs type-sets
hasql-dynamic-statements vs rss
semver-range vs final
hasql-dynamic-statements vs hasql-implicits
semver-range vs lucid-foundation
hasql-dynamic-statements vs google-oauth2