bifunctors 5.6.2 → 5.6.3
raw patch · 2 files changed
+15/−13 lines, 2 filesdep −transformersdep ~template-haskelldep ~transformers-compatPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependencies removed: transformers
Dependency ranges changed: template-haskell, transformers-compat
API changes (from Hackage documentation)
- Data.Bifunctor.Functor: type (:->) p q = forall a b. p a b -> q a b
+ Data.Bifunctor.Functor: type (p :: k -> k1 -> Type) :-> (q :: k -> k1 -> Type) = forall (a :: k) (b :: k1). () => p a b -> q a b
- Data.Biapplicative: class Bifunctor p => Biapplicative p
+ Data.Biapplicative: class Bifunctor p => Biapplicative (p :: Type -> Type -> Type)
- Data.Biapplicative: traverseBiaWith :: forall p a b c s t. Biapplicative p => (forall f x. Applicative f => (a -> f x) -> s -> f (t x)) -> (a -> p b c) -> s -> p (t b) (t c)
+ Data.Biapplicative: traverseBiaWith :: forall p a b c s t. Biapplicative p => (forall (f :: Type -> Type) x. Applicative f => (a -> f x) -> s -> f (t x)) -> (a -> p b c) -> s -> p (t b) (t c)
- Data.Bifunctor.Biap: Biap :: bi a b -> Biap bi a b
+ Data.Bifunctor.Biap: Biap :: bi a b -> Biap (bi :: Type -> Type -> Type) a b
- Data.Bifunctor.Biap: [getBiap] :: Biap bi a b -> bi a b
+ Data.Bifunctor.Biap: [getBiap] :: Biap (bi :: Type -> Type -> Type) a b -> bi a b
- Data.Bifunctor.Biap: newtype Biap bi a b
+ Data.Bifunctor.Biap: newtype Biap (bi :: Type -> Type -> Type) a b
- Data.Bifunctor.Biff: Biff :: p (f a) (g b) -> Biff p f g a b
+ Data.Bifunctor.Biff: Biff :: p (f a) (g b) -> Biff (p :: k -> k1 -> Type) (f :: k2 -> k) (g :: k3 -> k1) (a :: k2) (b :: k3)
- Data.Bifunctor.Biff: [runBiff] :: Biff p f g a b -> p (f a) (g b)
+ Data.Bifunctor.Biff: [runBiff] :: Biff (p :: k -> k1 -> Type) (f :: k2 -> k) (g :: k3 -> k1) (a :: k2) (b :: k3) -> p (f a) (g b)
- Data.Bifunctor.Biff: newtype Biff p f g a b
+ Data.Bifunctor.Biff: newtype Biff (p :: k -> k1 -> Type) (f :: k2 -> k) (g :: k3 -> k1) (a :: k2) (b :: k3)
- Data.Bifunctor.Clown: Clown :: f a -> Clown f a b
+ Data.Bifunctor.Clown: Clown :: f a -> Clown (f :: k -> Type) (a :: k) (b :: k1)
- Data.Bifunctor.Clown: [runClown] :: Clown f a b -> f a
+ Data.Bifunctor.Clown: [runClown] :: Clown (f :: k -> Type) (a :: k) (b :: k1) -> f a
- Data.Bifunctor.Clown: newtype Clown f a b
+ Data.Bifunctor.Clown: newtype Clown (f :: k -> Type) (a :: k) (b :: k1)
- Data.Bifunctor.Fix: In :: p (Fix p a) a -> Fix p a
+ Data.Bifunctor.Fix: In :: p (Fix p a) a -> Fix (p :: Type -> k -> Type) (a :: k)
- Data.Bifunctor.Fix: [out] :: Fix p a -> p (Fix p a) a
+ Data.Bifunctor.Fix: [out] :: Fix (p :: Type -> k -> Type) (a :: k) -> p (Fix p a) a
- Data.Bifunctor.Fix: newtype Fix p a
+ Data.Bifunctor.Fix: newtype Fix (p :: Type -> k -> Type) (a :: k)
- Data.Bifunctor.Flip: Flip :: p b a -> Flip p a b
+ Data.Bifunctor.Flip: Flip :: p b a -> Flip (p :: k -> k1 -> Type) (a :: k1) (b :: k)
- Data.Bifunctor.Flip: [runFlip] :: Flip p a b -> p b a
+ Data.Bifunctor.Flip: [runFlip] :: Flip (p :: k -> k1 -> Type) (a :: k1) (b :: k) -> p b a
- Data.Bifunctor.Flip: newtype Flip p a b
+ Data.Bifunctor.Flip: newtype Flip (p :: k -> k1 -> Type) (a :: k1) (b :: k)
- Data.Bifunctor.Functor: bibind :: BifunctorMonad t => (p :-> t q) -> t p :-> t q
+ Data.Bifunctor.Functor: bibind :: forall (p :: k -> k1 -> Type) (q :: k -> k1 -> Type). BifunctorMonad t => (p :-> t q) -> t p :-> t q
- Data.Bifunctor.Functor: biduplicate :: BifunctorComonad t => t p :-> t (t p)
+ Data.Bifunctor.Functor: biduplicate :: forall (p :: k -> k1 -> Type). BifunctorComonad t => t p :-> t (t p)
- Data.Bifunctor.Functor: biextend :: BifunctorComonad t => (t p :-> q) -> t p :-> t q
+ Data.Bifunctor.Functor: biextend :: forall (p :: k -> k1 -> Type) (q :: k -> k1 -> Type). BifunctorComonad t => (t p :-> q) -> t p :-> t q
- Data.Bifunctor.Functor: biextract :: BifunctorComonad t => t p :-> p
+ Data.Bifunctor.Functor: biextract :: forall (p :: k -> k1 -> Type). BifunctorComonad t => t p :-> p
- Data.Bifunctor.Functor: bifmap :: BifunctorFunctor t => (p :-> q) -> t p :-> t q
+ Data.Bifunctor.Functor: bifmap :: forall (p :: k -> k1 -> Type) (q :: k -> k1 -> Type). BifunctorFunctor t => (p :-> q) -> t p :-> t q
- Data.Bifunctor.Functor: bijoin :: BifunctorMonad t => t (t p) :-> t p
+ Data.Bifunctor.Functor: bijoin :: forall (p :: k -> k1 -> Type). BifunctorMonad t => t (t p) :-> t p
- Data.Bifunctor.Functor: biliftM :: BifunctorMonad t => (p :-> q) -> t p :-> t q
+ Data.Bifunctor.Functor: biliftM :: forall {k1} {k2} (t :: (k1 -> k2 -> Type) -> k1 -> k2 -> Type) (p :: k1 -> k2 -> Type) (q :: k1 -> k2 -> Type). BifunctorMonad t => (p :-> q) -> t p :-> t q
- Data.Bifunctor.Functor: biliftW :: BifunctorComonad t => (p :-> q) -> t p :-> t q
+ Data.Bifunctor.Functor: biliftW :: forall {k1} {k2} (t :: (k1 -> k2 -> Type) -> k1 -> k2 -> Type) (p :: k1 -> k2 -> Type) (q :: k1 -> k2 -> Type). BifunctorComonad t => (p :-> q) -> t p :-> t q
- Data.Bifunctor.Functor: bireturn :: BifunctorMonad t => p :-> t p
+ Data.Bifunctor.Functor: bireturn :: forall (p :: k -> k1 -> Type). BifunctorMonad t => p :-> t p
- Data.Bifunctor.Functor: class BifunctorFunctor t => BifunctorComonad t
+ Data.Bifunctor.Functor: class BifunctorFunctor t => BifunctorComonad (t :: k -> k1 -> Type -> k -> k1 -> Type)
- Data.Bifunctor.Functor: class BifunctorFunctor t
+ Data.Bifunctor.Functor: class BifunctorFunctor (t :: k -> k1 -> Type -> k2 -> k3 -> Type)
- Data.Bifunctor.Functor: class BifunctorFunctor t => BifunctorMonad t
+ Data.Bifunctor.Functor: class BifunctorFunctor t => BifunctorMonad (t :: k -> k1 -> Type -> k -> k1 -> Type)
- Data.Bifunctor.Join: Join :: p a a -> Join p a
+ Data.Bifunctor.Join: Join :: p a a -> Join (p :: k -> k -> Type) (a :: k)
- Data.Bifunctor.Join: [runJoin] :: Join p a -> p a a
+ Data.Bifunctor.Join: [runJoin] :: Join (p :: k -> k -> Type) (a :: k) -> p a a
- Data.Bifunctor.Join: newtype Join p a
+ Data.Bifunctor.Join: newtype Join (p :: k -> k -> Type) (a :: k)
- Data.Bifunctor.Joker: Joker :: g b -> Joker g a b
+ Data.Bifunctor.Joker: Joker :: g b -> Joker (g :: k -> Type) (a :: k1) (b :: k)
- Data.Bifunctor.Joker: [runJoker] :: Joker g a b -> g b
+ Data.Bifunctor.Joker: [runJoker] :: Joker (g :: k -> Type) (a :: k1) (b :: k) -> g b
- Data.Bifunctor.Joker: newtype Joker g a b
+ Data.Bifunctor.Joker: newtype Joker (g :: k -> Type) (a :: k1) (b :: k)
- Data.Bifunctor.Product: Pair :: f a b -> g a b -> Product f g a b
+ Data.Bifunctor.Product: Pair :: f a b -> g a b -> Product (f :: k -> k1 -> Type) (g :: k -> k1 -> Type) (a :: k) (b :: k1)
- Data.Bifunctor.Product: data Product f g a b
+ Data.Bifunctor.Product: data Product (f :: k -> k1 -> Type) (g :: k -> k1 -> Type) (a :: k) (b :: k1)
- Data.Bifunctor.Sum: L2 :: p a b -> Sum p q a b
+ Data.Bifunctor.Sum: L2 :: p a b -> Sum (p :: k -> k1 -> Type) (q :: k -> k1 -> Type) (a :: k) (b :: k1)
- Data.Bifunctor.Sum: R2 :: q a b -> Sum p q a b
+ Data.Bifunctor.Sum: R2 :: q a b -> Sum (p :: k -> k1 -> Type) (q :: k -> k1 -> Type) (a :: k) (b :: k1)
- Data.Bifunctor.Sum: data Sum p q a b
+ Data.Bifunctor.Sum: data Sum (p :: k -> k1 -> Type) (q :: k -> k1 -> Type) (a :: k) (b :: k1)
- Data.Bifunctor.Tannen: Tannen :: f (p a b) -> Tannen f p a b
+ Data.Bifunctor.Tannen: Tannen :: f (p a b) -> Tannen (f :: k -> Type) (p :: k1 -> k2 -> k) (a :: k1) (b :: k2)
- Data.Bifunctor.Tannen: [runTannen] :: Tannen f p a b -> f (p a b)
+ Data.Bifunctor.Tannen: [runTannen] :: Tannen (f :: k -> Type) (p :: k1 -> k2 -> k) (a :: k1) (b :: k2) -> f (p a b)
- Data.Bifunctor.Tannen: newtype Tannen f p a b
+ Data.Bifunctor.Tannen: newtype Tannen (f :: k -> Type) (p :: k1 -> k2 -> k) (a :: k1) (b :: k2)
- Data.Bifunctor.Wrapped: WrapBifunctor :: p a b -> WrappedBifunctor p a b
+ Data.Bifunctor.Wrapped: WrapBifunctor :: p a b -> WrappedBifunctor (p :: k -> k1 -> Type) (a :: k) (b :: k1)
- Data.Bifunctor.Wrapped: [unwrapBifunctor] :: WrappedBifunctor p a b -> p a b
+ Data.Bifunctor.Wrapped: [unwrapBifunctor] :: WrappedBifunctor (p :: k -> k1 -> Type) (a :: k) (b :: k1) -> p a b
- Data.Bifunctor.Wrapped: newtype WrappedBifunctor p a b
+ Data.Bifunctor.Wrapped: newtype WrappedBifunctor (p :: k -> k1 -> Type) (a :: k) (b :: k1)
Files
- CHANGELOG.markdown +5/−0
- bifunctors.cabal +10/−13
CHANGELOG.markdown view
@@ -1,3 +1,8 @@+5.6.3 [2026.01.03]+------------------+* Allow building with `template-haskell-2.24.*` (GHC 9.14).+* Remove unused dependencies.+ 5.6.2 [2024.03.19] ------------------ * Support building with `template-haskell-2.22.*` (GHC 9.10).
bifunctors.cabal view
@@ -1,7 +1,7 @@ cabal-version: 1.24 name: bifunctors category: Data, Functors-version: 5.6.2+version: 5.6.3 license: BSD3 license-file: LICENSE author: Edward A. Kmett@@ -22,9 +22,11 @@ , GHC == 9.0.2 , GHC == 9.2.8 , GHC == 9.4.8- , GHC == 9.6.4- , GHC == 9.8.2- , GHC == 9.10.1+ , GHC == 9.6.7+ , GHC == 9.8.4+ , GHC == 9.10.3+ , GHC == 9.12.2+ , GHC == 9.14.1 extra-source-files: CHANGELOG.markdown README.markdown@@ -47,10 +49,9 @@ base >= 4.9 && < 5, assoc >= 1.1 && < 1.2, comonad >= 5.0.7 && < 6,- containers >= 0.5.7.1 && < 0.8,- template-haskell >= 2.11 && < 2.23,- th-abstraction >= 0.4.2.0 && < 0.8,- transformers >= 0.5 && < 0.7+ containers >= 0.5.7.1 && < 0.9,+ template-haskell >= 2.11 && < 2.25,+ th-abstraction >= 0.4.2.0 && < 0.8 if !impl(ghc >= 8.2) build-depends:@@ -109,8 +110,4 @@ base >= 4 && < 5, bifunctors, hspec >= 1.8,- QuickCheck >= 2 && < 3,- template-haskell,- transformers,- transformers-compat-+ QuickCheck >= 2 && < 3