Copyright | (C) 2008-2016 Edward Kmett |
---|---|
License | BSD-style (see the file LICENSE) |
Maintainer | Edward Kmett <ekmett@gmail.com> |
Stability | provisional |
Portability | portable |
Safe Haskell | Safe |
Language | Haskell98 |
Documentation
newtype Biff p f g a b Source #
Instances
Functor (p (f a)) => Generic1 (Biff p f g a :: k1 -> *) Source # | |
(Bitraversable p, Traversable f, Traversable g) => Bitraversable (Biff p f g) Source # | |
Defined in Data.Bifunctor.Biff bitraverse :: Applicative f0 => (a -> f0 c) -> (b -> f0 d) -> Biff p f g a b -> f0 (Biff p f g c d) # | |
(Bifoldable p, Foldable f, Foldable g) => Bifoldable (Biff p f g) Source # | |
(Bifunctor p, Functor f, Functor g) => Bifunctor (Biff p f g) Source # | |
(Biapplicative p, Applicative f, Applicative g) => Biapplicative (Biff p f g) Source # | |
(Bifunctor p, Functor g) => Functor (Biff p f g a) Source # | |
(Bifoldable p, Foldable g) => Foldable (Biff p f g a) Source # | |
Defined in Data.Bifunctor.Biff fold :: Monoid m => Biff p f g a m -> m # foldMap :: Monoid m => (a0 -> m) -> Biff p f g a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Biff p f g a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Biff p f g a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Biff p f g a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Biff p f g a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Biff p f g a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Biff p f g a a0 -> a0 # toList :: Biff p f g a a0 -> [a0] # null :: Biff p f g a a0 -> Bool # length :: Biff p f g a a0 -> Int # elem :: Eq a0 => a0 -> Biff p f g a a0 -> Bool # maximum :: Ord a0 => Biff p f g a a0 -> a0 # minimum :: Ord a0 => Biff p f g a a0 -> a0 # | |
(Bitraversable p, Traversable g) => Traversable (Biff p f g a) Source # | |
Defined in Data.Bifunctor.Biff traverse :: Applicative f0 => (a0 -> f0 b) -> Biff p f g a a0 -> f0 (Biff p f g a b) # sequenceA :: Applicative f0 => Biff p f g a (f0 a0) -> f0 (Biff p f g a a0) # mapM :: Monad m => (a0 -> m b) -> Biff p f g a a0 -> m (Biff p f g a b) # sequence :: Monad m => Biff p f g a (m a0) -> m (Biff p f g a a0) # | |
Eq (p (f a) (g b)) => Eq (Biff p f g a b) Source # | |
Ord (p (f a) (g b)) => Ord (Biff p f g a b) Source # | |
Defined in Data.Bifunctor.Biff compare :: Biff p f g a b -> Biff p f g a b -> Ordering # (<) :: Biff p f g a b -> Biff p f g a b -> Bool # (<=) :: Biff p f g a b -> Biff p f g a b -> Bool # (>) :: Biff p f g a b -> Biff p f g a b -> Bool # (>=) :: Biff p f g a b -> Biff p f g a b -> Bool # | |
Read (p (f a) (g b)) => Read (Biff p f g a b) Source # | |
Show (p (f a) (g b)) => Show (Biff p f g a b) Source # | |
Generic (Biff p f g a b) Source # | |
type Rep1 (Biff p f g a :: k3 -> *) Source # | |
Defined in Data.Bifunctor.Biff | |
type Rep (Biff p f g a b) Source # | |
Defined in Data.Bifunctor.Biff |