We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
QueryHF
All of these function definitions seem excessively verbose.
Perhaps even just factoring out a reusable combinator for the Byron-versus-Shelley split would reduce the noise by approximately 2.5x?
Originally posted by @nfrisby in #1267 (comment)
As @amesgen also suggested, we could use some TH helper. Same applies to Cardano/Ledger.hs instances.
Let's do this after the merge.
The text was updated successfully, but these errors were encountered:
main
This was sufficiently implemented in #1304
Sorry, something went wrong.
No branches or pull requests
Perhaps even just factoring out a reusable combinator for the Byron-versus-Shelley split would reduce the noise by approximately 2.5x?
Originally posted by @nfrisby in #1267 (comment)
As @amesgen also suggested, we could use some TH helper. Same applies to Cardano/Ledger.hs instances.
Let's do this after the merge.
The text was updated successfully, but these errors were encountered: