bifunctors 5.5 → 5.5.1
raw patch · 5 files changed
+189/−103 lines, 5 filesPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
API changes (from Hackage documentation)
- Data.Bifoldable: biList :: Bifoldable t => t a a -> [a]
- Data.Bifoldable: biall :: Bifoldable t => (a -> Bool) -> (b -> Bool) -> t a b -> Bool
- Data.Bifoldable: biand :: Bifoldable t => t Bool Bool -> Bool
- Data.Bifoldable: biany :: Bifoldable t => (a -> Bool) -> (b -> Bool) -> t a b -> Bool
- Data.Bifoldable: biasum :: (Bifoldable t, Alternative f) => t (f a) (f a) -> f a
- Data.Bifoldable: biconcat :: Bifoldable t => t [a] [a] -> [a]
- Data.Bifoldable: biconcatMap :: Bifoldable t => (a -> [c]) -> (b -> [c]) -> t a b -> [c]
- Data.Bifoldable: bielem :: (Bifoldable t, Eq a) => a -> t a a -> Bool
- Data.Bifoldable: bifind :: Bifoldable t => (a -> Bool) -> t a a -> Maybe a
- Data.Bifoldable: bifold :: (Bifoldable p, Monoid m) => p m m -> m
- Data.Bifoldable: bifoldMap :: (Bifoldable p, Monoid m) => (a -> m) -> (b -> m) -> p a b -> m
- Data.Bifoldable: bifoldl :: Bifoldable p => (c -> a -> c) -> (c -> b -> c) -> c -> p a b -> c
- Data.Bifoldable: bifoldl' :: Bifoldable t => (a -> b -> a) -> (a -> c -> a) -> a -> t b c -> a
- Data.Bifoldable: bifoldl1 :: Bifoldable t => (a -> a -> a) -> t a a -> a
- Data.Bifoldable: bifoldlM :: (Bifoldable t, Monad m) => (a -> b -> m a) -> (a -> c -> m a) -> a -> t b c -> m a
- Data.Bifoldable: bifoldr :: Bifoldable p => (a -> c -> c) -> (b -> c -> c) -> c -> p a b -> c
- Data.Bifoldable: bifoldr' :: Bifoldable t => (a -> c -> c) -> (b -> c -> c) -> c -> t a b -> c
- Data.Bifoldable: bifoldr1 :: Bifoldable t => (a -> a -> a) -> t a a -> a
- Data.Bifoldable: bifoldrM :: (Bifoldable t, Monad m) => (a -> c -> m c) -> (b -> c -> m c) -> c -> t a b -> m c
- Data.Bifoldable: biforM_ :: (Bifoldable t, Monad m) => t a b -> (a -> m c) -> (b -> m d) -> m ()
- Data.Bifoldable: bifor_ :: (Bifoldable t, Applicative f) => t a b -> (a -> f c) -> (b -> f d) -> f ()
- Data.Bifoldable: bilength :: Bifoldable t => t a b -> Int
- Data.Bifoldable: bimapM_ :: (Bifoldable t, Monad m) => (a -> m c) -> (b -> m d) -> t a b -> m ()
- Data.Bifoldable: bimaximum :: forall t a. (Bifoldable t, Ord a) => t a a -> a
- Data.Bifoldable: bimaximumBy :: Bifoldable t => (a -> a -> Ordering) -> t a a -> a
- Data.Bifoldable: biminimum :: forall t a. (Bifoldable t, Ord a) => t a a -> a
- Data.Bifoldable: biminimumBy :: Bifoldable t => (a -> a -> Ordering) -> t a a -> a
- Data.Bifoldable: bimsum :: (Bifoldable t, MonadPlus m) => t (m a) (m a) -> m a
- Data.Bifoldable: binotElem :: (Bifoldable t, Eq a) => a -> t a a -> Bool
- Data.Bifoldable: binull :: Bifoldable t => t a b -> Bool
- Data.Bifoldable: bior :: Bifoldable t => t Bool Bool -> Bool
- Data.Bifoldable: biproduct :: (Bifoldable t, Num a) => t a a -> a
- Data.Bifoldable: bisequenceA_ :: (Bifoldable t, Applicative f) => t (f a) (f b) -> f ()
- Data.Bifoldable: bisequence_ :: (Bifoldable t, Monad m) => t (m a) (m b) -> m ()
- Data.Bifoldable: bisum :: (Bifoldable t, Num a) => t a a -> a
- Data.Bifoldable: bitraverse_ :: (Bifoldable t, Applicative f) => (a -> f c) -> (b -> f d) -> t a b -> f ()
- Data.Bifoldable: class Bifoldable p where bifold = bifoldMap id id bifoldMap f g = bifoldr (mappend . f) (mappend . g) mempty bifoldr f g z t = appEndo (bifoldMap (Endo #. f) (Endo #. g) t) z bifoldl f g z t = appEndo (getDual (bifoldMap (Dual . Endo . flip f) (Dual . Endo . flip g) t)) z
- Data.Bifoldable: instance Data.Bifoldable.Bifoldable ((,,) x)
- Data.Bifoldable: instance Data.Bifoldable.Bifoldable ((,,,) x y)
- Data.Bifoldable: instance Data.Bifoldable.Bifoldable ((,,,,) x y z)
- Data.Bifoldable: instance Data.Bifoldable.Bifoldable ((,,,,,) x y z w)
- Data.Bifoldable: instance Data.Bifoldable.Bifoldable ((,,,,,,) x y z w v)
- Data.Bifoldable: instance Data.Bifoldable.Bifoldable (,)
- Data.Bifoldable: instance Data.Bifoldable.Bifoldable (GHC.Generics.K1 i)
- Data.Bifoldable: instance Data.Bifoldable.Bifoldable Data.Either.Either
- Data.Bifoldable: instance Data.Bifoldable.Bifoldable Data.Functor.Const.Const
- Data.Bifoldable: instance Data.Bifoldable.Bifoldable Data.Functor.Constant.Constant
- Data.Bifoldable: instance Data.Bifoldable.Bifoldable Data.Semigroup.Arg
- Data.Bifoldable: instance Data.Bifoldable.Bifoldable Data.Tagged.Tagged
- Data.Bifoldable: instance GHC.Classes.Ord a => GHC.Base.Monoid (Data.Bifoldable.Max a)
- Data.Bifoldable: instance GHC.Classes.Ord a => GHC.Base.Monoid (Data.Bifoldable.Min a)
- Data.Bifunctor.Biff: instance forall k k1 (p :: k -> k1 -> *) k2 (f :: k2 -> k) k3 (g :: k3 -> k1) (a :: k2) (b :: k3). GHC.Classes.Eq (p (f a) (g b)) => GHC.Classes.Eq (Data.Bifunctor.Biff.Biff p f g a b)
- Data.Bifunctor.Biff: instance forall k k1 (p :: k -> k1 -> *) k2 (f :: k2 -> k) k3 (g :: k3 -> k1) (a :: k2) (b :: k3). GHC.Classes.Ord (p (f a) (g b)) => GHC.Classes.Ord (Data.Bifunctor.Biff.Biff p f g a b)
- Data.Bifunctor.Biff: instance forall k k1 (p :: k -> k1 -> *) k2 (f :: k2 -> k) k3 (g :: k3 -> k1) (a :: k2) (b :: k3). GHC.Generics.Generic (Data.Bifunctor.Biff.Biff p f g a b)
- Data.Bifunctor.Biff: instance forall k k1 (p :: k -> k1 -> *) k2 (f :: k2 -> k) k3 (g :: k3 -> k1) (a :: k2) (b :: k3). GHC.Read.Read (p (f a) (g b)) => GHC.Read.Read (Data.Bifunctor.Biff.Biff p f g a b)
- Data.Bifunctor.Biff: instance forall k k1 (p :: k -> k1 -> *) k2 (f :: k2 -> k) k3 (g :: k3 -> k1) (a :: k2) (b :: k3). GHC.Show.Show (p (f a) (g b)) => GHC.Show.Show (Data.Bifunctor.Biff.Biff p f g a b)
- Data.Bifunctor.Biff: instance forall k k1 (p :: k1 -> * -> *) (f :: k -> k1) (a :: k) (g :: GHC.Types.* -> *). GHC.Base.Functor (p (f a)) => GHC.Generics.Generic1 (Data.Bifunctor.Biff.Biff p f g a)
- Data.Bifunctor.Clown: instance forall k (f :: k -> *) (a :: k) k1 (b :: k1). GHC.Classes.Eq (f a) => GHC.Classes.Eq (Data.Bifunctor.Clown.Clown f a b)
- Data.Bifunctor.Clown: instance forall k (f :: k -> *) (a :: k) k1 (b :: k1). GHC.Classes.Ord (f a) => GHC.Classes.Ord (Data.Bifunctor.Clown.Clown f a b)
- Data.Bifunctor.Clown: instance forall k (f :: k -> *) (a :: k) k1 (b :: k1). GHC.Generics.Generic (Data.Bifunctor.Clown.Clown f a b)
- Data.Bifunctor.Clown: instance forall k (f :: k -> *) (a :: k) k1 (b :: k1). GHC.Read.Read (f a) => GHC.Read.Read (Data.Bifunctor.Clown.Clown f a b)
- Data.Bifunctor.Clown: instance forall k (f :: k -> *) (a :: k) k1 (b :: k1). GHC.Show.Show (f a) => GHC.Show.Show (Data.Bifunctor.Clown.Clown f a b)
- Data.Bifunctor.Clown: instance forall k (f :: k -> *) (a :: k). GHC.Generics.Generic1 (Data.Bifunctor.Clown.Clown f a)
- Data.Bifunctor.Flip: instance forall k k1 (p :: k1 -> k -> *) (a :: k) (b :: k1). GHC.Classes.Eq (p b a) => GHC.Classes.Eq (Data.Bifunctor.Flip.Flip p a b)
- Data.Bifunctor.Flip: instance forall k k1 (p :: k1 -> k -> *) (a :: k) (b :: k1). GHC.Classes.Ord (p b a) => GHC.Classes.Ord (Data.Bifunctor.Flip.Flip p a b)
- Data.Bifunctor.Flip: instance forall k k1 (p :: k1 -> k -> *) (a :: k) (b :: k1). GHC.Generics.Generic (Data.Bifunctor.Flip.Flip p a b)
- Data.Bifunctor.Flip: instance forall k k1 (p :: k1 -> k -> *) (a :: k) (b :: k1). GHC.Read.Read (p b a) => GHC.Read.Read (Data.Bifunctor.Flip.Flip p a b)
- Data.Bifunctor.Flip: instance forall k k1 (p :: k1 -> k -> *) (a :: k) (b :: k1). GHC.Show.Show (p b a) => GHC.Show.Show (Data.Bifunctor.Flip.Flip p a b)
- Data.Bifunctor.Joker: instance forall (g :: * -> *) k (a :: k). GHC.Generics.Generic1 (Data.Bifunctor.Joker.Joker g a)
- Data.Bifunctor.Joker: instance forall k (g :: k -> *) k1 (a :: k1) (b :: k). GHC.Classes.Eq (g b) => GHC.Classes.Eq (Data.Bifunctor.Joker.Joker g a b)
- Data.Bifunctor.Joker: instance forall k (g :: k -> *) k1 (a :: k1) (b :: k). GHC.Classes.Ord (g b) => GHC.Classes.Ord (Data.Bifunctor.Joker.Joker g a b)
- Data.Bifunctor.Joker: instance forall k (g :: k -> *) k1 (a :: k1) (b :: k). GHC.Generics.Generic (Data.Bifunctor.Joker.Joker g a b)
- Data.Bifunctor.Joker: instance forall k (g :: k -> *) k1 (a :: k1) (b :: k). GHC.Read.Read (g b) => GHC.Read.Read (Data.Bifunctor.Joker.Joker g a b)
- Data.Bifunctor.Joker: instance forall k (g :: k -> *) k1 (a :: k1) (b :: k). GHC.Show.Show (g b) => GHC.Show.Show (Data.Bifunctor.Joker.Joker g a b)
- Data.Bifunctor.Product: instance forall k (f :: k -> * -> *) (g :: k -> * -> *) (a :: k). GHC.Generics.Generic1 (Data.Bifunctor.Product.Product f g a)
- Data.Bifunctor.Product: instance forall k k1 (f :: k -> k1 -> *) (g :: k -> k1 -> *) (a :: k) (b :: k1). (GHC.Classes.Eq (g a b), GHC.Classes.Eq (f a b)) => GHC.Classes.Eq (Data.Bifunctor.Product.Product f g a b)
- Data.Bifunctor.Product: instance forall k k1 (f :: k -> k1 -> *) (g :: k -> k1 -> *) (a :: k) (b :: k1). (GHC.Classes.Ord (g a b), GHC.Classes.Ord (f a b)) => GHC.Classes.Ord (Data.Bifunctor.Product.Product f g a b)
- Data.Bifunctor.Product: instance forall k k1 (f :: k -> k1 -> *) (g :: k -> k1 -> *) (a :: k) (b :: k1). (GHC.Read.Read (g a b), GHC.Read.Read (f a b)) => GHC.Read.Read (Data.Bifunctor.Product.Product f g a b)
- Data.Bifunctor.Product: instance forall k k1 (f :: k -> k1 -> *) (g :: k -> k1 -> *) (a :: k) (b :: k1). (GHC.Show.Show (g a b), GHC.Show.Show (f a b)) => GHC.Show.Show (Data.Bifunctor.Product.Product f g a b)
- Data.Bifunctor.Product: instance forall k k1 (f :: k -> k1 -> *) (g :: k -> k1 -> *) (a :: k) (b :: k1). GHC.Generics.Generic (Data.Bifunctor.Product.Product f g a b)
- Data.Bifunctor.Product: instance forall k k1 (p :: k1 -> k -> *). Data.Bifunctor.Functor.BifunctorComonad (Data.Bifunctor.Product.Product p)
- Data.Bifunctor.Product: instance forall k k1 (p :: k1 -> k -> *). Data.Bifunctor.Functor.BifunctorFunctor (Data.Bifunctor.Product.Product p)
- Data.Bifunctor.Sum: instance forall k (p :: k -> * -> *) (q :: k -> * -> *) (a :: k). GHC.Generics.Generic1 (Data.Bifunctor.Sum.Sum p q a)
- Data.Bifunctor.Sum: instance forall k k1 (p :: k -> k1 -> *) (q :: k -> k1 -> *) (a :: k) (b :: k1). (GHC.Classes.Eq (q a b), GHC.Classes.Eq (p a b)) => GHC.Classes.Eq (Data.Bifunctor.Sum.Sum p q a b)
- Data.Bifunctor.Sum: instance forall k k1 (p :: k -> k1 -> *) (q :: k -> k1 -> *) (a :: k) (b :: k1). (GHC.Classes.Ord (q a b), GHC.Classes.Ord (p a b)) => GHC.Classes.Ord (Data.Bifunctor.Sum.Sum p q a b)
- Data.Bifunctor.Sum: instance forall k k1 (p :: k -> k1 -> *) (q :: k -> k1 -> *) (a :: k) (b :: k1). (GHC.Read.Read (q a b), GHC.Read.Read (p a b)) => GHC.Read.Read (Data.Bifunctor.Sum.Sum p q a b)
- Data.Bifunctor.Sum: instance forall k k1 (p :: k -> k1 -> *) (q :: k -> k1 -> *) (a :: k) (b :: k1). (GHC.Show.Show (q a b), GHC.Show.Show (p a b)) => GHC.Show.Show (Data.Bifunctor.Sum.Sum p q a b)
- Data.Bifunctor.Sum: instance forall k k1 (p :: k -> k1 -> *) (q :: k -> k1 -> *) (a :: k) (b :: k1). GHC.Generics.Generic (Data.Bifunctor.Sum.Sum p q a b)
- Data.Bifunctor.Sum: instance forall k k1 (p :: k1 -> k -> *). Data.Bifunctor.Functor.BifunctorFunctor (Data.Bifunctor.Sum.Sum p)
- Data.Bifunctor.Sum: instance forall k k1 (p :: k1 -> k -> *). Data.Bifunctor.Functor.BifunctorMonad (Data.Bifunctor.Sum.Sum p)
- Data.Bifunctor.Tannen: instance forall k (f :: * -> *) (p :: k -> GHC.Types.* -> *) (a :: k). GHC.Base.Functor f => GHC.Generics.Generic1 (Data.Bifunctor.Tannen.Tannen f p a)
- Data.Bifunctor.Tannen: instance forall k (f :: k -> *) k1 k2 (p :: k1 -> k2 -> k) (a :: k1) (b :: k2). GHC.Classes.Eq (f (p a b)) => GHC.Classes.Eq (Data.Bifunctor.Tannen.Tannen f p a b)
- Data.Bifunctor.Tannen: instance forall k (f :: k -> *) k1 k2 (p :: k1 -> k2 -> k) (a :: k1) (b :: k2). GHC.Classes.Ord (f (p a b)) => GHC.Classes.Ord (Data.Bifunctor.Tannen.Tannen f p a b)
- Data.Bifunctor.Tannen: instance forall k (f :: k -> *) k1 k2 (p :: k1 -> k2 -> k) (a :: k1) (b :: k2). GHC.Generics.Generic (Data.Bifunctor.Tannen.Tannen f p a b)
- Data.Bifunctor.Tannen: instance forall k (f :: k -> *) k1 k2 (p :: k1 -> k2 -> k) (a :: k1) (b :: k2). GHC.Read.Read (f (p a b)) => GHC.Read.Read (Data.Bifunctor.Tannen.Tannen f p a b)
- Data.Bifunctor.Tannen: instance forall k (f :: k -> *) k1 k2 (p :: k1 -> k2 -> k) (a :: k1) (b :: k2). GHC.Show.Show (f (p a b)) => GHC.Show.Show (Data.Bifunctor.Tannen.Tannen f p a b)
- Data.Bifunctor.Wrapped: instance forall k (p :: k -> * -> *) (a :: k). GHC.Generics.Generic1 (Data.Bifunctor.Wrapped.WrappedBifunctor p a)
- Data.Bifunctor.Wrapped: instance forall k k1 (p :: k -> k1 -> *) (a :: k) (b :: k1). GHC.Classes.Eq (p a b) => GHC.Classes.Eq (Data.Bifunctor.Wrapped.WrappedBifunctor p a b)
- Data.Bifunctor.Wrapped: instance forall k k1 (p :: k -> k1 -> *) (a :: k) (b :: k1). GHC.Classes.Ord (p a b) => GHC.Classes.Ord (Data.Bifunctor.Wrapped.WrappedBifunctor p a b)
- Data.Bifunctor.Wrapped: instance forall k k1 (p :: k -> k1 -> *) (a :: k) (b :: k1). GHC.Generics.Generic (Data.Bifunctor.Wrapped.WrappedBifunctor p a b)
- Data.Bifunctor.Wrapped: instance forall k k1 (p :: k -> k1 -> *) (a :: k) (b :: k1). GHC.Read.Read (p a b) => GHC.Read.Read (Data.Bifunctor.Wrapped.WrappedBifunctor p a b)
- Data.Bifunctor.Wrapped: instance forall k k1 (p :: k -> k1 -> *) (a :: k) (b :: k1). GHC.Show.Show (p a b) => GHC.Show.Show (Data.Bifunctor.Wrapped.WrappedBifunctor p a b)
- Data.Bitraversable: bifoldMapDefault :: forall t m a b. (Bitraversable t, Monoid m) => (a -> m) -> (b -> m) -> t a b -> m
- Data.Bitraversable: bifor :: (Bitraversable t, Applicative f) => t a b -> (a -> f c) -> (b -> f d) -> f (t c d)
- Data.Bitraversable: biforM :: (Bitraversable t, Monad m) => t a b -> (a -> m c) -> (b -> m d) -> m (t c d)
- Data.Bitraversable: bimapAccumL :: Bitraversable t => (a -> b -> (a, c)) -> (a -> d -> (a, e)) -> a -> t b d -> (a, t c e)
- Data.Bitraversable: bimapAccumR :: Bitraversable t => (a -> b -> (a, c)) -> (a -> d -> (a, e)) -> a -> t b d -> (a, t c e)
- Data.Bitraversable: bimapDefault :: forall t a b c d. Bitraversable t => (a -> b) -> (c -> d) -> t a c -> t b d
- Data.Bitraversable: bimapM :: (Bitraversable t, Monad m) => (a -> m c) -> (b -> m d) -> t a b -> m (t c d)
- Data.Bitraversable: bisequence :: (Bitraversable t, Monad m) => t (m a) (m b) -> m (t a b)
- Data.Bitraversable: bisequenceA :: (Bitraversable t, Applicative f) => t (f a) (f b) -> f (t a b)
- Data.Bitraversable: bitraverse :: (Bitraversable t, Applicative f) => (a -> f c) -> (b -> f d) -> t a b -> f (t c d)
- Data.Bitraversable: class (Bifunctor t, Bifoldable t) => Bitraversable t where bitraverse f g = bisequenceA . bimap f g
- Data.Bitraversable: instance Data.Bitraversable.Bitraversable ((,,) x)
- Data.Bitraversable: instance Data.Bitraversable.Bitraversable ((,,,) x y)
- Data.Bitraversable: instance Data.Bitraversable.Bitraversable ((,,,,) x y z)
- Data.Bitraversable: instance Data.Bitraversable.Bitraversable ((,,,,,) x y z w)
- Data.Bitraversable: instance Data.Bitraversable.Bitraversable ((,,,,,,) x y z w v)
- Data.Bitraversable: instance Data.Bitraversable.Bitraversable (,)
- Data.Bitraversable: instance Data.Bitraversable.Bitraversable (GHC.Generics.K1 i)
- Data.Bitraversable: instance Data.Bitraversable.Bitraversable Data.Either.Either
- Data.Bitraversable: instance Data.Bitraversable.Bitraversable Data.Functor.Const.Const
- Data.Bitraversable: instance Data.Bitraversable.Bitraversable Data.Functor.Constant.Constant
- Data.Bitraversable: instance Data.Bitraversable.Bitraversable Data.Semigroup.Arg
- Data.Bitraversable: instance Data.Bitraversable.Bitraversable Data.Tagged.Tagged
- Data.Bitraversable: instance GHC.Base.Applicative (Data.Bitraversable.StateL s)
- Data.Bitraversable: instance GHC.Base.Applicative (Data.Bitraversable.StateR s)
- Data.Bitraversable: instance GHC.Base.Functor (Data.Bitraversable.StateL s)
- Data.Bitraversable: instance GHC.Base.Functor (Data.Bitraversable.StateR s)
+ Data.Bifunctor.Biff: instance forall k1 k2 (p :: k1 -> k2 -> *) k3 (f :: k3 -> k1) k4 (g :: k4 -> k2) (a :: k3) (b :: k4). GHC.Classes.Eq (p (f a) (g b)) => GHC.Classes.Eq (Data.Bifunctor.Biff.Biff p f g a b)
+ Data.Bifunctor.Biff: instance forall k1 k2 (p :: k1 -> k2 -> *) k3 (f :: k3 -> k1) k4 (g :: k4 -> k2) (a :: k3) (b :: k4). GHC.Classes.Ord (p (f a) (g b)) => GHC.Classes.Ord (Data.Bifunctor.Biff.Biff p f g a b)
+ Data.Bifunctor.Biff: instance forall k1 k2 (p :: k1 -> k2 -> *) k3 (f :: k3 -> k1) k4 (g :: k4 -> k2) (a :: k3) (b :: k4). GHC.Generics.Generic (Data.Bifunctor.Biff.Biff p f g a b)
+ Data.Bifunctor.Biff: instance forall k1 k2 (p :: k1 -> k2 -> *) k3 (f :: k3 -> k1) k4 (g :: k4 -> k2) (a :: k3) (b :: k4). GHC.Read.Read (p (f a) (g b)) => GHC.Read.Read (Data.Bifunctor.Biff.Biff p f g a b)
+ Data.Bifunctor.Biff: instance forall k1 k2 (p :: k1 -> k2 -> *) k3 (f :: k3 -> k1) k4 (g :: k4 -> k2) (a :: k3) (b :: k4). GHC.Show.Show (p (f a) (g b)) => GHC.Show.Show (Data.Bifunctor.Biff.Biff p f g a b)
+ Data.Bifunctor.Biff: instance forall k1 k2 k3 (p :: k3 -> * -> *) (f :: k2 -> k3) (a :: k2) (g :: k1 -> *). GHC.Base.Functor (p (f a)) => GHC.Generics.Generic1 (Data.Bifunctor.Biff.Biff p f g a)
+ Data.Bifunctor.Clown: instance forall k1 (f :: k1 -> *) (a :: k1) k2 (b :: k2). GHC.Classes.Eq (f a) => GHC.Classes.Eq (Data.Bifunctor.Clown.Clown f a b)
+ Data.Bifunctor.Clown: instance forall k1 (f :: k1 -> *) (a :: k1) k2 (b :: k2). GHC.Classes.Ord (f a) => GHC.Classes.Ord (Data.Bifunctor.Clown.Clown f a b)
+ Data.Bifunctor.Clown: instance forall k1 (f :: k1 -> *) (a :: k1) k2 (b :: k2). GHC.Generics.Generic (Data.Bifunctor.Clown.Clown f a b)
+ Data.Bifunctor.Clown: instance forall k1 (f :: k1 -> *) (a :: k1) k2 (b :: k2). GHC.Read.Read (f a) => GHC.Read.Read (Data.Bifunctor.Clown.Clown f a b)
+ Data.Bifunctor.Clown: instance forall k1 (f :: k1 -> *) (a :: k1) k2 (b :: k2). GHC.Show.Show (f a) => GHC.Show.Show (Data.Bifunctor.Clown.Clown f a b)
+ Data.Bifunctor.Clown: instance forall k1 k2 (f :: k2 -> *) (a :: k2). GHC.Generics.Generic1 (Data.Bifunctor.Clown.Clown f a)
+ Data.Bifunctor.Flip: instance forall k1 k2 (p :: k2 -> k1 -> *) (a :: k1) (b :: k2). GHC.Classes.Eq (p b a) => GHC.Classes.Eq (Data.Bifunctor.Flip.Flip p a b)
+ Data.Bifunctor.Flip: instance forall k1 k2 (p :: k2 -> k1 -> *) (a :: k1) (b :: k2). GHC.Classes.Ord (p b a) => GHC.Classes.Ord (Data.Bifunctor.Flip.Flip p a b)
+ Data.Bifunctor.Flip: instance forall k1 k2 (p :: k2 -> k1 -> *) (a :: k1) (b :: k2). GHC.Generics.Generic (Data.Bifunctor.Flip.Flip p a b)
+ Data.Bifunctor.Flip: instance forall k1 k2 (p :: k2 -> k1 -> *) (a :: k1) (b :: k2). GHC.Read.Read (p b a) => GHC.Read.Read (Data.Bifunctor.Flip.Flip p a b)
+ Data.Bifunctor.Flip: instance forall k1 k2 (p :: k2 -> k1 -> *) (a :: k1) (b :: k2). GHC.Show.Show (p b a) => GHC.Show.Show (Data.Bifunctor.Flip.Flip p a b)
+ Data.Bifunctor.Joker: instance forall k1 (g :: k1 -> *) k2 (a :: k2) (b :: k1). GHC.Classes.Eq (g b) => GHC.Classes.Eq (Data.Bifunctor.Joker.Joker g a b)
+ Data.Bifunctor.Joker: instance forall k1 (g :: k1 -> *) k2 (a :: k2) (b :: k1). GHC.Classes.Ord (g b) => GHC.Classes.Ord (Data.Bifunctor.Joker.Joker g a b)
+ Data.Bifunctor.Joker: instance forall k1 (g :: k1 -> *) k2 (a :: k2) (b :: k1). GHC.Generics.Generic (Data.Bifunctor.Joker.Joker g a b)
+ Data.Bifunctor.Joker: instance forall k1 (g :: k1 -> *) k2 (a :: k2) (b :: k1). GHC.Read.Read (g b) => GHC.Read.Read (Data.Bifunctor.Joker.Joker g a b)
+ Data.Bifunctor.Joker: instance forall k1 (g :: k1 -> *) k2 (a :: k2) (b :: k1). GHC.Show.Show (g b) => GHC.Show.Show (Data.Bifunctor.Joker.Joker g a b)
+ Data.Bifunctor.Joker: instance forall k1 (g :: k1 -> *) k2 (a :: k2). GHC.Generics.Generic1 (Data.Bifunctor.Joker.Joker g a)
+ Data.Bifunctor.Product: instance forall k1 k2 (f :: k1 -> k2 -> *) (g :: k1 -> k2 -> *) (a :: k1) (b :: k2). (GHC.Classes.Eq (g a b), GHC.Classes.Eq (f a b)) => GHC.Classes.Eq (Data.Bifunctor.Product.Product f g a b)
+ Data.Bifunctor.Product: instance forall k1 k2 (f :: k1 -> k2 -> *) (g :: k1 -> k2 -> *) (a :: k1) (b :: k2). (GHC.Classes.Ord (g a b), GHC.Classes.Ord (f a b)) => GHC.Classes.Ord (Data.Bifunctor.Product.Product f g a b)
+ Data.Bifunctor.Product: instance forall k1 k2 (f :: k1 -> k2 -> *) (g :: k1 -> k2 -> *) (a :: k1) (b :: k2). (GHC.Read.Read (g a b), GHC.Read.Read (f a b)) => GHC.Read.Read (Data.Bifunctor.Product.Product f g a b)
+ Data.Bifunctor.Product: instance forall k1 k2 (f :: k1 -> k2 -> *) (g :: k1 -> k2 -> *) (a :: k1) (b :: k2). (GHC.Show.Show (g a b), GHC.Show.Show (f a b)) => GHC.Show.Show (Data.Bifunctor.Product.Product f g a b)
+ Data.Bifunctor.Product: instance forall k1 k2 (f :: k1 -> k2 -> *) (g :: k1 -> k2 -> *) (a :: k1) (b :: k2). GHC.Generics.Generic (Data.Bifunctor.Product.Product f g a b)
+ Data.Bifunctor.Product: instance forall k1 k2 (f :: k2 -> k1 -> *) (g :: k2 -> k1 -> *) (a :: k2). GHC.Generics.Generic1 (Data.Bifunctor.Product.Product f g a)
+ Data.Bifunctor.Product: instance forall k1 k2 (p :: k1 -> k2 -> *). Data.Bifunctor.Functor.BifunctorComonad (Data.Bifunctor.Product.Product p)
+ Data.Bifunctor.Product: instance forall k1 k2 (p :: k1 -> k2 -> *). Data.Bifunctor.Functor.BifunctorFunctor (Data.Bifunctor.Product.Product p)
+ Data.Bifunctor.Sum: instance forall k1 k2 (p :: k1 -> k2 -> *) (q :: k1 -> k2 -> *) (a :: k1) (b :: k2). (GHC.Classes.Eq (q a b), GHC.Classes.Eq (p a b)) => GHC.Classes.Eq (Data.Bifunctor.Sum.Sum p q a b)
+ Data.Bifunctor.Sum: instance forall k1 k2 (p :: k1 -> k2 -> *) (q :: k1 -> k2 -> *) (a :: k1) (b :: k2). (GHC.Classes.Ord (q a b), GHC.Classes.Ord (p a b)) => GHC.Classes.Ord (Data.Bifunctor.Sum.Sum p q a b)
+ Data.Bifunctor.Sum: instance forall k1 k2 (p :: k1 -> k2 -> *) (q :: k1 -> k2 -> *) (a :: k1) (b :: k2). (GHC.Read.Read (q a b), GHC.Read.Read (p a b)) => GHC.Read.Read (Data.Bifunctor.Sum.Sum p q a b)
+ Data.Bifunctor.Sum: instance forall k1 k2 (p :: k1 -> k2 -> *) (q :: k1 -> k2 -> *) (a :: k1) (b :: k2). (GHC.Show.Show (q a b), GHC.Show.Show (p a b)) => GHC.Show.Show (Data.Bifunctor.Sum.Sum p q a b)
+ Data.Bifunctor.Sum: instance forall k1 k2 (p :: k1 -> k2 -> *) (q :: k1 -> k2 -> *) (a :: k1) (b :: k2). GHC.Generics.Generic (Data.Bifunctor.Sum.Sum p q a b)
+ Data.Bifunctor.Sum: instance forall k1 k2 (p :: k1 -> k2 -> *). Data.Bifunctor.Functor.BifunctorFunctor (Data.Bifunctor.Sum.Sum p)
+ Data.Bifunctor.Sum: instance forall k1 k2 (p :: k1 -> k2 -> *). Data.Bifunctor.Functor.BifunctorMonad (Data.Bifunctor.Sum.Sum p)
+ Data.Bifunctor.Sum: instance forall k1 k2 (p :: k2 -> k1 -> *) (q :: k2 -> k1 -> *) (a :: k2). GHC.Generics.Generic1 (Data.Bifunctor.Sum.Sum p q a)
+ Data.Bifunctor.Tannen: instance forall k1 (f :: k1 -> *) k2 k3 (p :: k2 -> k3 -> k1) (a :: k2) (b :: k3). GHC.Classes.Eq (f (p a b)) => GHC.Classes.Eq (Data.Bifunctor.Tannen.Tannen f p a b)
+ Data.Bifunctor.Tannen: instance forall k1 (f :: k1 -> *) k2 k3 (p :: k2 -> k3 -> k1) (a :: k2) (b :: k3). GHC.Classes.Ord (f (p a b)) => GHC.Classes.Ord (Data.Bifunctor.Tannen.Tannen f p a b)
+ Data.Bifunctor.Tannen: instance forall k1 (f :: k1 -> *) k2 k3 (p :: k2 -> k3 -> k1) (a :: k2) (b :: k3). GHC.Generics.Generic (Data.Bifunctor.Tannen.Tannen f p a b)
+ Data.Bifunctor.Tannen: instance forall k1 (f :: k1 -> *) k2 k3 (p :: k2 -> k3 -> k1) (a :: k2) (b :: k3). GHC.Read.Read (f (p a b)) => GHC.Read.Read (Data.Bifunctor.Tannen.Tannen f p a b)
+ Data.Bifunctor.Tannen: instance forall k1 (f :: k1 -> *) k2 k3 (p :: k2 -> k3 -> k1) (a :: k2) (b :: k3). GHC.Show.Show (f (p a b)) => GHC.Show.Show (Data.Bifunctor.Tannen.Tannen f p a b)
+ Data.Bifunctor.Tannen: instance forall k1 k2 (f :: * -> *) (p :: k1 -> k2 -> *) (a :: k1). GHC.Base.Functor f => GHC.Generics.Generic1 (Data.Bifunctor.Tannen.Tannen f p a)
+ Data.Bifunctor.Wrapped: instance forall k1 k2 (p :: k1 -> k2 -> *) (a :: k1) (b :: k2). GHC.Classes.Eq (p a b) => GHC.Classes.Eq (Data.Bifunctor.Wrapped.WrappedBifunctor p a b)
+ Data.Bifunctor.Wrapped: instance forall k1 k2 (p :: k1 -> k2 -> *) (a :: k1) (b :: k2). GHC.Classes.Ord (p a b) => GHC.Classes.Ord (Data.Bifunctor.Wrapped.WrappedBifunctor p a b)
+ Data.Bifunctor.Wrapped: instance forall k1 k2 (p :: k1 -> k2 -> *) (a :: k1) (b :: k2). GHC.Generics.Generic (Data.Bifunctor.Wrapped.WrappedBifunctor p a b)
+ Data.Bifunctor.Wrapped: instance forall k1 k2 (p :: k1 -> k2 -> *) (a :: k1) (b :: k2). GHC.Read.Read (p a b) => GHC.Read.Read (Data.Bifunctor.Wrapped.WrappedBifunctor p a b)
+ Data.Bifunctor.Wrapped: instance forall k1 k2 (p :: k1 -> k2 -> *) (a :: k1) (b :: k2). GHC.Show.Show (p a b) => GHC.Show.Show (Data.Bifunctor.Wrapped.WrappedBifunctor p a b)
+ Data.Bifunctor.Wrapped: instance forall k1 k2 (p :: k2 -> k1 -> *) (a :: k2). GHC.Generics.Generic1 (Data.Bifunctor.Wrapped.WrappedBifunctor p a)
- Data.Biapplicative: class Bifunctor p => Biapplicative p where a *>> b = bimap (const id) (const id) <<$>> a <<*>> b a <<* b = bimap const const <<$>> a <<*>> b
+ Data.Biapplicative: class Bifunctor p => Biapplicative p
- Data.Bifunctor.Functor: class BifunctorFunctor t => BifunctorComonad t where biextend f = bifmap f . biduplicate biduplicate = biextend id
+ Data.Bifunctor.Functor: class BifunctorFunctor t => BifunctorComonad t
- Data.Bifunctor.Functor: class BifunctorFunctor t => BifunctorMonad t where bibind f = bijoin . bifmap f bijoin = bibind id
+ Data.Bifunctor.Functor: class BifunctorFunctor t => BifunctorMonad t
Files
- .travis.yml +120/−87
- CHANGELOG.markdown +5/−1
- bifunctors.cabal +4/−3
- src/Data/Bifunctor/TH/Internal.hs +26/−12
- tests/BifunctorSpec.hs +34/−0
.travis.yml view
@@ -1,114 +1,147 @@-# This file has been generated -- see https://github.com/hvr/multi-ghc-travis+# This Travis job script has been generated by a script via+#+# runghc make_travis_yml_2.hs '-o' '.travis.yml' '--irc-channel=irc.freenode.org#haskell-lens' '--no-no-tests-no-bench' '--no-installed' 'cabal.project'+#+# For more information, see https://github.com/hvr/multi-ghc-travis+# language: c sudo: false +git:+ submodules: false # whether to recursively clone submodules++notifications:+ irc:+ channels:+ - "irc.freenode.org#haskell-lens"+ skip_join: true+ template:+ - "\x0313bifunctors\x03/\x0306%{branch}\x03 \x0314%{commit}\x03 %{build_url} %{message}"+ cache: directories:- - $HOME/.cabsnap - $HOME/.cabal/packages+ - $HOME/.cabal/store before_cache: - rm -fv $HOME/.cabal/packages/hackage.haskell.org/build-reports.log- - rm -fv $HOME/.cabal/packages/hackage.haskell.org/00-index.tar+ # remove files that are regenerated by 'cabal update'+ - rm -fv $HOME/.cabal/packages/hackage.haskell.org/00-index.*+ - rm -fv $HOME/.cabal/packages/hackage.haskell.org/*.json+ - rm -fv $HOME/.cabal/packages/hackage.haskell.org/01-index.cache+ - rm -fv $HOME/.cabal/packages/hackage.haskell.org/01-index.tar+ - rm -fv $HOME/.cabal/packages/hackage.haskell.org/01-index.tar.idx + - rm -rfv $HOME/.cabal/packages/head.hackage+ matrix: include:- - env: CABALVER=1.18 GHCVER=7.0.4- compiler: ": #GHC 7.0.4"- addons: {apt: {packages: [cabal-install-1.18,ghc-7.0.4], sources: [hvr-ghc]}}- - env: CABALVER=1.18 GHCVER=7.2.2- compiler: ": #GHC 7.2.2"- addons: {apt: {packages: [cabal-install-1.18,ghc-7.2.2], sources: [hvr-ghc]}}- - env: CABALVER=1.18 GHCVER=7.4.2- compiler: ": #GHC 7.4.2"- addons: {apt: {packages: [cabal-install-1.18,ghc-7.4.2], sources: [hvr-ghc]}}- - env: CABALVER=1.18 GHCVER=7.6.3- compiler: ": #GHC 7.6.3"- addons: {apt: {packages: [cabal-install-1.18,ghc-7.6.3], sources: [hvr-ghc]}}- - env: CABALVER=1.18 GHCVER=7.8.4- compiler: ": #GHC 7.8.4"- addons: {apt: {packages: [cabal-install-1.18,ghc-7.8.4], sources: [hvr-ghc]}}- - env: CABALVER=1.22 GHCVER=7.10.3- compiler: ": #GHC 7.10.3"- addons: {apt: {packages: [cabal-install-1.22,ghc-7.10.3], sources: [hvr-ghc]}}- - env: CABALVER=1.24 GHCVER=8.0.2- compiler: ": #GHC 8.0.2"- addons: {apt: {packages: [cabal-install-1.24,ghc-8.0.2], sources: [hvr-ghc]}}- - env: CABALVER=2.0 GHCVER=8.2.2- compiler: ": #GHC 8.2.2"- addons: {apt: {packages: [cabal-install-2.0,ghc-8.2.2], sources: [hvr-ghc]}}- - env: CABALVER=head GHCVER=head- compiler: ": #GHC head"- addons: {apt: {packages: [cabal-install-head,ghc-head], sources: [hvr-ghc]}}+ - compiler: "ghc-7.0.4"+ # env: TEST=--disable-tests BENCH=--disable-benchmarks+ addons: {apt: {packages: [*apt_packages,cabal-install-2.0,ghc-7.0.4], sources: [hvr-ghc]}}+ - compiler: "ghc-7.2.2"+ # env: TEST=--disable-tests BENCH=--disable-benchmarks+ addons: {apt: {packages: [*apt_packages,cabal-install-2.0,ghc-7.2.2], sources: [hvr-ghc]}}+ - compiler: "ghc-7.4.2"+ # env: TEST=--disable-tests BENCH=--disable-benchmarks+ addons: {apt: {packages: [*apt_packages,cabal-install-2.0,ghc-7.4.2], sources: [hvr-ghc]}}+ - compiler: "ghc-7.6.3"+ # env: TEST=--disable-tests BENCH=--disable-benchmarks+ addons: {apt: {packages: [*apt_packages,cabal-install-2.0,ghc-7.6.3], sources: [hvr-ghc]}}+ - compiler: "ghc-7.8.4"+ # env: TEST=--disable-tests BENCH=--disable-benchmarks+ addons: {apt: {packages: [*apt_packages,cabal-install-2.0,ghc-7.8.4], sources: [hvr-ghc]}}+ - compiler: "ghc-7.10.3"+ # env: TEST=--disable-tests BENCH=--disable-benchmarks+ addons: {apt: {packages: [*apt_packages,cabal-install-2.0,ghc-7.10.3], sources: [hvr-ghc]}}+ - compiler: "ghc-8.0.2"+ # env: TEST=--disable-tests BENCH=--disable-benchmarks+ addons: {apt: {packages: [*apt_packages,cabal-install-2.0,ghc-8.0.2], sources: [hvr-ghc]}}+ - compiler: "ghc-8.2.2"+ # env: TEST=--disable-tests BENCH=--disable-benchmarks+ addons: {apt: {packages: [*apt_packages,cabal-install-2.0,ghc-8.2.2], sources: [hvr-ghc]}}+ - compiler: "ghc-8.4.1"+ env: GHCHEAD=true+ addons: {apt: {packages: [*apt_packages,cabal-install-head,ghc-8.4.1], sources: [hvr-ghc]}}+ - compiler: "ghc-head"+ env: GHCHEAD=true+ addons: {apt: {packages: [*apt_packages,cabal-install-head,ghc-head], sources: [hvr-ghc]}} allow_failures:- - env: CABALVER=1.18 GHCVER=7.0.4- - env: CABALVER=1.18 GHCVER=7.2.2- - env: CABALVER=head GHCVER=head+ - compiler: "ghc-7.0.4"+ - compiler: "ghc-7.2.2"+ - compiler: "ghc-8.4.1"+ - compiler: "ghc-head" before_install:- - unset CC- - export PATH=$HOME/.cabal/bin:/opt/ghc/$GHCVER/bin:/opt/cabal/$CABALVER/bin:$PATH+ - HC=${CC}+ - HCPKG=${HC/ghc/ghc-pkg}+ - unset CC+ - ROOTDIR=$(pwd)+ - mkdir -p $HOME/.local/bin+ - "PATH=/opt/ghc/bin:/opt/ghc-ppa-tools/bin:$HOME/local/bin:$PATH"+ - HCNUMVER=$(( $(${HC} --numeric-version|sed -E 's/([0-9]+)\.([0-9]+)\.([0-9]+).*/\1 * 10000 + \2 * 100 + \3/') ))+ - echo $HCNUMVER install:- - cabal --version- - echo "$(ghc --version) [$(ghc --print-project-git-commit-id 2> /dev/null || echo '?')]"- - if [ -f $HOME/.cabal/packages/hackage.haskell.org/00-index.tar.gz ];- then- zcat $HOME/.cabal/packages/hackage.haskell.org/00-index.tar.gz >- $HOME/.cabal/packages/hackage.haskell.org/00-index.tar;- fi- - travis_retry cabal update -v- - sed -i 's/^jobs:/-- jobs:/' ${HOME}/.cabal/config- - cabal install --only-dependencies --enable-tests --dry -v > installplan.txt- - sed -i -e '1,/^Resolving /d' installplan.txt; cat installplan.txt+ - cabal --version+ - echo "$(${HC} --version) [$(${HC} --print-project-git-commit-id 2> /dev/null || echo '?')]"+ - BENCH=${BENCH---enable-benchmarks}+ - TEST=${TEST---enable-tests}+ - HADDOCK=${HADDOCK-true}+ - INSTALLED=${INSTALLED-true}+ - GHCHEAD=${GHCHEAD-false}+ - travis_retry cabal update -v+ - "sed -i.bak 's/^jobs:/-- jobs:/' ${HOME}/.cabal/config"+ - rm -fv cabal.project cabal.project.local+ # Overlay Hackage Package Index for GHC HEAD: https://github.com/hvr/head.hackage+ - |+ if $GHCHEAD; then+ sed -i.bak 's/-- allow-newer:.*/allow-newer: *:base, *:template-haskell, *:ghc, *:Cabal/' ${HOME}/.cabal/config -# check whether current requested install-plan matches cached package-db snapshot- - if diff -u installplan.txt $HOME/.cabsnap/installplan.txt;- then- echo "cabal build-cache HIT";- rm -rfv .ghc;- cp -a $HOME/.cabsnap/ghc $HOME/.ghc;- cp -a $HOME/.cabsnap/lib $HOME/.cabsnap/share $HOME/.cabsnap/bin $HOME/.cabal/;- else- echo "cabal build-cache MISS";- rm -rf $HOME/.cabsnap;- mkdir -p $HOME/.ghc $HOME/.cabal/lib $HOME/.cabal/share $HOME/.cabal/bin;- cabal install -j --only-dependencies --enable-tests;- fi+ echo 'repository head.hackage' >> ${HOME}/.cabal/config+ echo ' url: http://head.hackage.haskell.org/' >> ${HOME}/.cabal/config+ echo ' secure: True' >> ${HOME}/.cabal/config+ echo ' root-keys: 07c59cb65787dedfaef5bd5f987ceb5f7e5ebf88b904bbd4c5cbdeb2ff71b740' >> ${HOME}/.cabal/config+ echo ' 2e8555dde16ebd8df076f1a8ef13b8f14c66bad8eafefd7d9e37d0ed711821fb' >> ${HOME}/.cabal/config+ echo ' 8f79fd2389ab2967354407ec852cbe73f2e8635793ac446d09461ffb99527f6e' >> ${HOME}/.cabal/config+ echo ' key-threshold: 3' >> ${HOME}/.cabal.config -# snapshot package-db on cache miss- - if [ ! -d $HOME/.cabsnap ];- then- echo "snapshotting package-db to build-cache";- mkdir $HOME/.cabsnap;- cp -a $HOME/.ghc $HOME/.cabsnap/ghc;- cp -a $HOME/.cabal/lib $HOME/.cabal/share $HOME/.cabal/bin installplan.txt $HOME/.cabsnap/;- fi+ cabal new-update head.hackage -v+ fi+ - grep -Ev -- '^\s*--' ${HOME}/.cabal/config | grep -Ev '^\s*$'+ - "printf 'packages: \".\"\\n' > cabal.project"+ - cat cabal.project+ - if [ -f "./configure.ac" ]; then+ (cd "." && autoreconf -i);+ fi+ - rm -f cabal.project.freeze+ - cabal new-build -w ${HC} ${TEST} ${BENCH} --project-file="cabal.project" --dep -j2 all+ - rm -rf "."/.ghc.environment.* "."/dist+ - DISTDIR=$(mktemp -d /tmp/dist-test.XXXX) # Here starts the actual work to be performed for the package under test; # any command which exits with a non-zero exit code causes the build to fail. script:- - cabal configure -v2 --enable-tests # -v2 provides useful information for debugging- - cabal build # this builds all libraries and executables (including tests/benchmarks)- - cabal test --show-details=always- - cabal haddock- - cabal sdist # tests that a source-distribution can be generated- - export SRC_TGZ=$(cabal info . | awk '{print $2 ".tar.gz";exit}') ;- cd dist/;- if [ -f "$SRC_TGZ" ]; then- cabal install "$SRC_TGZ";- else- echo "expected '$SRC_TGZ' not found";- exit 1;- fi+ # test that source-distributions can be generated+ - (cd "." && cabal sdist)+ - mv "."/dist/bifunctors-*.tar.gz ${DISTDIR}/+ - cd ${DISTDIR} || false+ - find . -maxdepth 1 -name '*.tar.gz' -exec tar -xvf '{}' \;+ - "printf 'packages: bifunctors-*/*.cabal\\n' > cabal.project"+ - cat cabal.project -notifications:- irc:- channels:- - "irc.freenode.org#haskell-lens"- skip_join: true- template:- - "\x0313bifunctors\x0f/\x0306%{branch}\x0f \x0314%{commit}\x0f %{message} \x0302\x1f%{build_url}\x0f" + # build & run tests, build benchmarks+ - cabal new-build -w ${HC} ${TEST} ${BENCH} all+ - if [ "x$TEST" = "x--enable-tests" ]; then cabal new-test -w ${HC} ${TEST} ${BENCH} all; fi++ # cabal check+ - (cd bifunctors-* && cabal check)++ # haddock+ - rm -rf ./dist-newstyle+ - if $HADDOCK; then cabal new-haddock -w ${HC} ${TEST} ${BENCH} all; else echo "Skipping haddock generation";fi++# REGENDATA ["-o",".travis.yml","--irc-channel=irc.freenode.org#haskell-lens","--no-no-tests-no-bench","--no-installed","cabal.project"] # EOF
CHANGELOG.markdown view
@@ -1,5 +1,9 @@+5.5.1 [2018.02.04]+------------------+* Test suite fixes for GHC 8.4.+ 5.5 [2017.12.07]----+---------------- * `Data.Bifunctor.TH` now derives `bimap`/`bitraverse` implementations for empty data types that are strict in the argument. * `Data.Bifunctor.TH` no longer derives `bifoldr`/`bifoldMap` implementations
bifunctors.cabal view
@@ -1,6 +1,6 @@ name: bifunctors category: Data, Functors-version: 5.5+version: 5.5.1 license: BSD3 cabal-version: >= 1.8 license-file: LICENSE@@ -11,9 +11,9 @@ bug-reports: http://github.com/ekmett/bifunctors/issues copyright: Copyright (C) 2008-2016 Edward A. Kmett synopsis: Bifunctors-description: Bifunctors+description: Bifunctors. build-type: Simple-tested-with: GHC == 7.0.4, GHC == 7.2.2, GHC == 7.4.2, GHC == 7.6.3, GHC == 7.8.4, GHC == 7.10.3, GHC == 8.0.2, GHC == 8.2.2+tested-with: GHC == 7.0.4, GHC == 7.2.2, GHC == 7.4.2, GHC == 7.6.3, GHC == 7.8.4, GHC == 7.10.3, GHC == 8.0.2, GHC == 8.2.2, GHC == 8.4.1 extra-source-files: .travis.yml CHANGELOG.markdown README.markdown source-repository head@@ -95,6 +95,7 @@ main-is: Spec.hs other-modules: BifunctorSpec ghc-options: -Wall+ build-tool-depends: hspec-discover:hspec-discover >= 1.8 build-depends: base >= 4 && < 5, bifunctors,
src/Data/Bifunctor/TH/Internal.hs view
@@ -422,12 +422,6 @@ bitraverseConstValName :: Name bitraverseConstValName = mkBifunctorsName_v "Data.Bifunctor.TH.Internal" "bitraverseConst" -dualDataName :: Name-dualDataName = mkNameG_d "base" "Data.Monoid" "Dual"--endoDataName :: Name-endoDataName = mkNameG_d "base" "Data.Monoid" "Endo"- wrapMonadDataName :: Name wrapMonadDataName = mkNameG_d "base" "Control.Applicative" "WrapMonad" @@ -440,9 +434,6 @@ traversableTypeName :: Name traversableTypeName = mkNameG_tc "base" "Data.Traversable" "Traversable" -appEndoValName :: Name-appEndoValName = mkNameG_v "base" "Data.Monoid" "appEndo"- composeValName :: Name composeValName = mkNameG_v "base" "GHC.Base" "." @@ -464,9 +455,6 @@ foldMapValName :: Name foldMapValName = mkNameG_v "base" "Data.Foldable" "foldMap" -getDualValName :: Name-getDualValName = mkNameG_v "base" "Data.Monoid" "getDual"- seqValName :: Name seqValName = mkNameG_v "ghc-prim" "GHC.Prim" "seq" @@ -555,4 +543,30 @@ bitraverseValName :: Name bitraverseValName = mkBifunctorsName_v "Data.Bitraversable" "bitraverse"+#endif++#if MIN_VERSION_base(4,11,0)+appEndoValName :: Name+appEndoValName = mkNameG_v "base" "Data.Semigroup.Internal" "appEndo"++dualDataName :: Name+dualDataName = mkNameG_d "base" "Data.Semigroup.Internal" "Dual"++endoDataName :: Name+endoDataName = mkNameG_d "base" "Data.Semigroup.Internal" "Endo"++getDualValName :: Name+getDualValName = mkNameG_v "base" "Data.Semigroup.Internal" "getDual"+#else+appEndoValName :: Name+appEndoValName = mkNameG_v "base" "Data.Monoid" "appEndo"++dualDataName :: Name+dualDataName = mkNameG_d "base" "Data.Monoid" "Dual"++endoDataName :: Name+endoDataName = mkNameG_d "base" "Data.Monoid" "Endo"++getDualValName :: Name+getDualValName = mkNameG_v "base" "Data.Monoid" "getDual" #endif
tests/BifunctorSpec.hs view
@@ -200,14 +200,31 @@ instance (Bifunctor (f Int), Functor g) => Bifunctor (ComplexConstraint f g) where bimap = $(makeBimap ''ComplexConstraint)+ instance (Bifoldable (f Int), Foldable g) => Bifoldable (ComplexConstraint f g) where bifoldr = $(makeBifoldr ''ComplexConstraint) bifoldMap = $(makeBifoldMap ''ComplexConstraint)++bifoldlComplexConstraint+ :: (Bifoldable (f Int), Foldable g)+ => (c -> a -> c) -> (c -> b -> c) -> c -> ComplexConstraint f g a b -> c+bifoldlComplexConstraint = $(makeBifoldl ''ComplexConstraint)++bifoldComplexConstraint+ :: (Bifoldable (f Int), Foldable g, Monoid m)+ => ComplexConstraint f g m m -> m+bifoldComplexConstraint = $(makeBifold ''ComplexConstraint)+ instance (Bitraversable (f Int), Traversable g) => Bitraversable (ComplexConstraint f g) where bitraverse = $(makeBitraverse ''ComplexConstraint) +bisequenceAComplexConstraint+ :: (Bitraversable (f Int), Traversable g, Applicative t)+ => ComplexConstraint f g (t a) (t b) -> t (ComplexConstraint f g a b)+bisequenceAComplexConstraint = $(makeBisequenceA ''ComplexConstraint)+ $(deriveBifunctor ''Universal) $(deriveBifunctor ''Existential)@@ -250,13 +267,30 @@ instance (Bifunctor (f Int), Functor g) => Bifunctor (ComplexConstraintFam f g) where bimap = $(makeBimap 'ComplexConstraintFam)+ instance (Bifoldable (f Int), Foldable g) => Bifoldable (ComplexConstraintFam f g) where bifoldr = $(makeBifoldr 'ComplexConstraintFam) bifoldMap = $(makeBifoldMap 'ComplexConstraintFam)++bifoldlComplexConstraintFam+ :: (Bifoldable (f Int), Foldable g)+ => (c -> a -> c) -> (c -> b -> c) -> c -> ComplexConstraintFam f g a b -> c+bifoldlComplexConstraintFam = $(makeBifoldl 'ComplexConstraintFam)++bifoldComplexConstraintFam+ :: (Bifoldable (f Int), Foldable g, Monoid m)+ => ComplexConstraintFam f g m m -> m+bifoldComplexConstraintFam = $(makeBifold 'ComplexConstraintFam)+ instance (Bitraversable (f Int), Traversable g) => Bitraversable (ComplexConstraintFam f g) where bitraverse = $(makeBitraverse 'ComplexConstraintFam)++bisequenceAComplexConstraintFam+ :: (Bitraversable (f Int), Traversable g, Applicative t)+ => ComplexConstraintFam f g (t a) (t b) -> t (ComplexConstraintFam f g a b)+bisequenceAComplexConstraintFam = $(makeBisequenceA 'ComplexConstraintFam) $(deriveBifunctor 'UniversalFam)