New submission from Jason Dagit <[email protected]>: Hello,
Don Stewart pointed out to me today that our hashed-storage constraint is overly constrained. It's good that we provide a lower bound that takes into account the necessary bug fixes, but we are not taking into account bug fix releases of hashed-storage that become available after a darcs release. This patch fixes that by specifying an upper bound. I'm also making the assumption that hashed-storage will follow the PVP: http://www.haskell.org/haskellwiki/Package_versioning_policy Thanks, Jason ---------- files: darcs_cabal_-provide-reasonable-upper-bound-on-h_s.dpatch, unnamed messages: 12147 nosy: dagit status: needs-review title: Provide a more reasonable upper bound on hashed-storage version __________________________________ Darcs bug tracker <[email protected]> <http://bugs.darcs.net/patch346> __________________________________Hello,
Don Stewart pointed out to me today that our hashed-storage constraint is overly constrained. Â It's good that we provide a lower bound that takes into account the necessary bug fixes, but we are not taking into account bug fix releases of hashed-storage that become available after a darcs release.
This patch fixes that by specifying an upper bound. Â I'm also making the assumption that hashed-storage will follow the PVP:
Thanks,
Jason
darcs_cabal_-provide-reasonable-upper-bound-on-h_s.dpatch
Description: Binary data
_______________________________________________ darcs-users mailing list [email protected] http://lists.osuosl.org/mailman/listinfo/darcs-users
