bifunctors 5.5.12 → 5.5.13
raw patch · 3 files changed
+14/−9 lines, 3 filesPVP ok
version bump matches the API change (PVP)
API changes (from Hackage documentation)
Files
- CHANGELOG.markdown +5/−0
- bifunctors.cabal +2/−2
- src/Data/Biapplicative.hs +7/−7
CHANGELOG.markdown view
@@ -1,3 +1,8 @@+5.5.13 [2022.09.12]+-------------------+* Make the `Biapplicative` instances for tuples lazy, to match their `Bifunctor`+ instances.+ 5.5.12 [2022.05.07] ------------------- * Backport an upstream GHC change which removes the default implementation of
bifunctors.cabal view
@@ -1,6 +1,6 @@ name: bifunctors category: Data, Functors-version: 5.5.12+version: 5.5.13 license: BSD3 cabal-version: >= 1.10 license-file: LICENSE@@ -61,7 +61,7 @@ base-orphans >= 0.8.4 && < 1, comonad >= 5.0.7 && < 6, containers >= 0.2 && < 0.7,- template-haskell >= 2.4 && < 2.19,+ template-haskell >= 2.4 && < 2.20, th-abstraction >= 0.4.2.0 && < 0.5, transformers >= 0.3 && < 0.7
src/Data/Biapplicative.hs view
@@ -268,9 +268,9 @@ instance Biapplicative (,) where bipure = (,) {-# INLINE bipure #-}- (f, g) <<*>> (a, b) = (f a, g b)+ ~(f, g) <<*>> ~(a, b) = (f a, g b) {-# INLINE (<<*>>) #-}- biliftA2 f g (x, y) (a, b) = (f x a, g y b)+ biliftA2 f g ~(x, y) ~(a, b) = (f x a, g y b) {-# INLINE biliftA2 #-} instance Biapplicative Arg where@@ -284,31 +284,31 @@ instance Monoid x => Biapplicative ((,,) x) where bipure = (,,) mempty {-# INLINE bipure #-}- (x, f, g) <<*>> (x', a, b) = (mappend x x', f a, g b)+ ~(x, f, g) <<*>> ~(x', a, b) = (mappend x x', f a, g b) {-# INLINE (<<*>>) #-} instance (Monoid x, Monoid y) => Biapplicative ((,,,) x y) where bipure = (,,,) mempty mempty {-# INLINE bipure #-}- (x, y, f, g) <<*>> (x', y', a, b) = (mappend x x', mappend y y', f a, g b)+ ~(x, y, f, g) <<*>> ~(x', y', a, b) = (mappend x x', mappend y y', f a, g b) {-# INLINE (<<*>>) #-} instance (Monoid x, Monoid y, Monoid z) => Biapplicative ((,,,,) x y z) where bipure = (,,,,) mempty mempty mempty {-# INLINE bipure #-}- (x, y, z, f, g) <<*>> (x', y', z', a, b) = (mappend x x', mappend y y', mappend z z', f a, g b)+ ~(x, y, z, f, g) <<*>> ~(x', y', z', a, b) = (mappend x x', mappend y y', mappend z z', f a, g b) {-# INLINE (<<*>>) #-} instance (Monoid x, Monoid y, Monoid z, Monoid w) => Biapplicative ((,,,,,) x y z w) where bipure = (,,,,,) mempty mempty mempty mempty {-# INLINE bipure #-}- (x, y, z, w, f, g) <<*>> (x', y', z', w', a, b) = (mappend x x', mappend y y', mappend z z', mappend w w', f a, g b)+ ~(x, y, z, w, f, g) <<*>> ~(x', y', z', w', a, b) = (mappend x x', mappend y y', mappend z z', mappend w w', f a, g b) {-# INLINE (<<*>>) #-} instance (Monoid x, Monoid y, Monoid z, Monoid w, Monoid v) => Biapplicative ((,,,,,,) x y z w v) where bipure = (,,,,,,) mempty mempty mempty mempty mempty {-# INLINE bipure #-}- (x, y, z, w, v, f, g) <<*>> (x', y', z', w', v', a, b) = (mappend x x', mappend y y', mappend z z', mappend w w', mappend v v', f a, g b)+ ~(x, y, z, w, v, f, g) <<*>> ~(x', y', z', w', v', a, b) = (mappend x x', mappend y y', mappend z z', mappend w w', mappend v v', f a, g b) {-# INLINE (<<*>>) #-} #ifdef MIN_VERSION_tagged