lazify: A simple utility for lazy record matching
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
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.
Properties
| Versions | 0.1.0.0, 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] |
| 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:34:31Z |
Modules
[Index]
Downloads
- lazify-0.1.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees