lazify: A simple utility for lazy record matching
Since early Haskell history, it's been convenient to make values
stricter using seq. Making them lazier has always been a bit
of a chore. This package offers tools for doing so.
For an idiomatic classy approach with generic defaults, use Data.Lazify. To just go with whatever the generics say (aside from overlapping instances), use Data.Lazify.Generic.
Modules
[Index] [Quick Jump]
Downloads
- lazify-0.1.0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
| Versions [RSS] | 0.1.0.1 |
|---|---|
| Change log | CHANGELOG.md |
| Dependencies | base (>=4.10.0 && <4.16), containers (>=0.5.8.1 && <0.7), ghc-prim, tagged (>=0.8.6 && <1), transformers (>=0.6 && <0.7) [details] |
| Tested with | ghc ==8.2.2 || ==8.4.4 || ==8.6.5 || ==8.8.4 || ==8.10.4 || ==9.0.1 |
| License | BSD-3-Clause |
| Copyright | 2019 David Feuer |
| Author | David Feuer |
| Maintainer | David.Feuer@gmail.com |
| Category | Data |
| Home page | https://github.com/treeowl/lazify |
| Bug tracker | https://github.com/treeowl/lazify/issues |
| Uploaded | by dfeuer at 2021-09-03T09:41:39Z |
| Distributions | |
| Downloads | 170 total (5 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2021-09-03 [all 1 reports] |