can-i-haz 0.2.0.0 → 0.2.0.1
raw patch · 4 files changed
+13/−10 lines, 4 filesPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
API changes (from Hackage documentation)
- Control.Monad.Except.CoHas: instance Control.Monad.Except.CoHas.SuccessfulSearch l (Data.Either.Either l r) path => Control.Monad.Except.CoHas.CoHas l (Data.Either.Either l r)
- Control.Monad.Except.CoHas: instance Control.Monad.Except.CoHas.SuccessfulSearch r (Data.Either.Either l r) path => Control.Monad.Except.CoHas.CoHas r (Data.Either.Either l r)
- Control.Monad.Reader.Has: instance Control.Monad.Reader.Has.SuccessfulSearch a0 (a0, a1) path => Control.Monad.Reader.Has.Has a0 (a0, a1)
- Control.Monad.Reader.Has: instance Control.Monad.Reader.Has.SuccessfulSearch a0 (a0, a1, a2) path => Control.Monad.Reader.Has.Has a0 (a0, a1, a2)
- Control.Monad.Reader.Has: instance Control.Monad.Reader.Has.SuccessfulSearch a1 (a0, a1) path => Control.Monad.Reader.Has.Has a1 (a0, a1)
- Control.Monad.Reader.Has: instance Control.Monad.Reader.Has.SuccessfulSearch a1 (a0, a1, a2) path => Control.Monad.Reader.Has.Has a1 (a0, a1, a2)
- Control.Monad.Reader.Has: instance Control.Monad.Reader.Has.SuccessfulSearch a2 (a0, a1, a2) path => Control.Monad.Reader.Has.Has a2 (a0, a1, a2)
+ Control.Monad.Except.CoHas: instance Control.Monad.Except.CoHas.SuccessfulSearch a (Data.Either.Either l r) path => Control.Monad.Except.CoHas.CoHas a (Data.Either.Either l r)
+ Control.Monad.Reader.Has: instance Control.Monad.Reader.Has.SuccessfulSearch a (a0, a1) path => Control.Monad.Reader.Has.Has a (a0, a1)
+ Control.Monad.Reader.Has: instance Control.Monad.Reader.Has.SuccessfulSearch a (a0, a1, a2) path => Control.Monad.Reader.Has.Has a (a0, a1, a2)
+ Control.Monad.Reader.Has: instance Control.Monad.Reader.Has.SuccessfulSearch a (a0, a1, a2, a3) path => Control.Monad.Reader.Has.Has a (a0, a1, a2, a3)
+ Control.Monad.Reader.Has: instance Control.Monad.Reader.Has.SuccessfulSearch a (a0, a1, a2, a3, a4) path => Control.Monad.Reader.Has.Has a (a0, a1, a2, a3, a4)
+ Control.Monad.Reader.Has: instance Control.Monad.Reader.Has.SuccessfulSearch a (a0, a1, a2, a3, a4, a5) path => Control.Monad.Reader.Has.Has a (a0, a1, a2, a3, a4, a5)
Files
- ChangeLog.md +5/−0
- can-i-haz.cabal +2/−2
- src/Control/Monad/Except/CoHas.hs +1/−2
- src/Control/Monad/Reader/Has.hs +5/−6
ChangeLog.md view
@@ -1,5 +1,10 @@ # Changelog for can-i-haz +## 0.2.0.1++* Less boilerplate for `Has` tuple instances and `CoHas` `Either` instance.+* Out-of-the-box `Has` support for up to sextuples due to the reduced boilerplate.+ ## 0.2.0.0 * Added `CoHas` class (dual to `Has`), allowing injecting values into sum types.
can-i-haz.cabal view
@@ -4,10 +4,10 @@ -- -- see: https://github.com/sol/hpack ----- hash: f095662cefa6570b0b71e77b9752c4419c6e4597b04918e7a0671690c9efb5c4+-- hash: 0394d90d99b920a658070f87d57d6cd3df94ee5b5af1d08be8b70136c4888334 name: can-i-haz-version: 0.2.0.0+version: 0.2.0.1 synopsis: Generic implementation of the Has and CoHas patterns description: Please see the README on GitHub at <https://github.com/0xd34df00d/can-i-haz#readme> category: Control
src/Control/Monad/Except/CoHas.hs view
@@ -125,5 +125,4 @@ instance CoHas sum sum where inject = id -instance SuccessfulSearch l (Either l r) path => CoHas l (Either l r)-instance SuccessfulSearch r (Either l r) path => CoHas r (Either l r)+instance SuccessfulSearch a (Either l r) path => CoHas a (Either l r)
src/Control/Monad/Reader/Has.hs view
@@ -142,9 +142,8 @@ instance Has record record where extract = id -instance SuccessfulSearch a0 (a0, a1) path => Has a0 (a0, a1)-instance SuccessfulSearch a1 (a0, a1) path => Has a1 (a0, a1)--instance SuccessfulSearch a0 (a0, a1, a2) path => Has a0 (a0, a1, a2)-instance SuccessfulSearch a1 (a0, a1, a2) path => Has a1 (a0, a1, a2)-instance SuccessfulSearch a2 (a0, a1, a2) path => Has a2 (a0, a1, a2)+instance SuccessfulSearch a (a0, a1) path => Has a (a0, a1)+instance SuccessfulSearch a (a0, a1, a2) path => Has a (a0, a1, a2)+instance SuccessfulSearch a (a0, a1, a2, a3) path => Has a (a0, a1, a2, a3)+instance SuccessfulSearch a (a0, a1, a2, a3, a4) path => Has a (a0, a1, a2, a3, a4)+instance SuccessfulSearch a (a0, a1, a2, a3, a4, a5) path => Has a (a0, a1, a2, a3, a4, a5)