lazify: A simple utility for lazy record matching

[ bsd3, data, library ] [ Propose Tags ]

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.

Downloads

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]
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 NixOS:0.1.0.1
Downloads 92 total (2 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]