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

Data.Bifunctor.Biff

Description

Synopsis

Documentation

newtype Biff p f g a b Source #

Compose two Functors on the inside of a Bifunctor.

Constructors

Biff
Fields runBiff :: p (f a) (g b)

Instances

(Bifunctor p, Functor f, Functor g) => Bifunctor (Biff * * * * p f g) Source #
Methods bimap :: (a -> b) -> (c -> d) -> Biff * * * * p f g a c -> Biff * * * * p f g b d # first :: (a -> b) -> Biff * * * * p f g a c -> Biff * * * * p f g b c # second :: (b -> c) -> Biff * * * * p f g a b -> Biff * * * * p f g a c #
(Bifoldable p, Foldable f, Foldable g) => Bifoldable (Biff * * * * p f g) Source #
Methods bifold :: Monoid m => Biff * * * * p f g m m -> m Source # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Biff * * * * p f g a b -> m Source # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Biff * * * * p f g a b -> c Source # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Biff * * * * p f g a b -> c Source #
(Bitraversable p, Traversable f, Traversable g) => Bitraversable (Biff * * * * p f g) Source #
Methods bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Biff * * * * p f g a b -> f (Biff * * * * p f g c d) Source #
(Biapplicative p, Applicative f, Applicative g) => Biapplicative (Biff * * * * p f g) Source #
Methods bipure :: a -> b -> Biff * * * * p f g a b Source # (<<>>) :: Biff * * * p f g (a -> b) (c -> d) -> Biff * * * * p f g a c -> Biff * * * * p f g b d Source # (>>) :: Biff * * * p f g a b -> Biff * * * * p f g c d -> Biff * * * * p f g c d Source # (<<) :: Biff * * * p f g a b -> Biff * * * * p f g c d -> Biff * * * * p f g a b Source #
(Bifunctor p, Functor g) => Functor (Biff * k * * p f g a) Source #
Methods fmap :: (a -> b) -> Biff * k * * p f g a a -> Biff * k * * p f g a b # (<$) :: a -> Biff * k * * p f g a b -> Biff * k * * p f g a a #
(Bifoldable p, Foldable g) => Foldable (Biff * k * * p f g a) Source #
Methods fold :: Monoid m => Biff * k * * p f g a m -> m # foldMap :: Monoid m => (a -> m) -> Biff * k * * p f g a a -> m # foldr :: (a -> b -> b) -> b -> Biff * k * * p f g a a -> b # foldr' :: (a -> b -> b) -> b -> Biff * k * * p f g a a -> b # foldl :: (b -> a -> b) -> b -> Biff * k * * p f g a a -> b # foldl' :: (b -> a -> b) -> b -> Biff * k * * p f g a a -> b # foldr1 :: (a -> a -> a) -> Biff * k * * p f g a a -> a # foldl1 :: (a -> a -> a) -> Biff * k * * p f g a a -> a # toList :: Biff * k * * p f g a a -> [a] # null :: Biff * k * * p f g a a -> Bool # length :: Biff * k * * p f g a a -> Int # elem :: Eq a => a -> Biff * k * * p f g a a -> Bool # maximum :: Ord a => Biff * k * * p f g a a -> a # minimum :: Ord a => Biff * k * * p f g a a -> a # sum :: Num a => Biff * k * * p f g a a -> a # product :: Num a => Biff * k * * p f g a a -> a #
(Bitraversable p, Traversable g) => Traversable (Biff * k * * p f g a) Source #
Methods traverse :: Applicative f => (a -> f b) -> Biff * k * * p f g a a -> f (Biff * k * * p f g a b) # sequenceA :: Applicative f => Biff * k * * p f g a (f a) -> f (Biff * k * * p f g a a) # mapM :: Monad m => (a -> m b) -> Biff * k * * p f g a a -> m (Biff * k * * p f g a b) # sequence :: Monad m => Biff * k * * p f g a (m a) -> m (Biff * k * * p f g a a) #
Functor (p (f a)) => Generic1 (Biff k k1 * * p f g a) Source #
Associated Types type Rep1 (Biff k k1 * * p f g a :: * -> ) :: -> * # Methods from1 :: Biff k k1 * * p f g a a -> Rep1 (Biff k k1 * * p f g a) a # to1 :: Rep1 (Biff k k1 * * p f g a) a -> Biff k k1 * * p f g a a #
Eq (p (f a) (g b)) => Eq (Biff k k2 k1 k3 p f g a b) Source #
Methods (==) :: Biff k k2 k1 k3 p f g a b -> Biff k k2 k1 k3 p f g a b -> Bool # (/=) :: Biff k k2 k1 k3 p f g a b -> Biff k k2 k1 k3 p f g a b -> Bool #
Ord (p (f a) (g b)) => Ord (Biff k k2 k1 k3 p f g a b) Source #
Methods compare :: Biff k k2 k1 k3 p f g a b -> Biff k k2 k1 k3 p f g a b -> Ordering # (<) :: Biff k k2 k1 k3 p f g a b -> Biff k k2 k1 k3 p f g a b -> Bool # (<=) :: Biff k k2 k1 k3 p f g a b -> Biff k k2 k1 k3 p f g a b -> Bool # (>) :: Biff k k2 k1 k3 p f g a b -> Biff k k2 k1 k3 p f g a b -> Bool # (>=) :: Biff k k2 k1 k3 p f g a b -> Biff k k2 k1 k3 p f g a b -> Bool # max :: Biff k k2 k1 k3 p f g a b -> Biff k k2 k1 k3 p f g a b -> Biff k k2 k1 k3 p f g a b # min :: Biff k k2 k1 k3 p f g a b -> Biff k k2 k1 k3 p f g a b -> Biff k k2 k1 k3 p f g a b #
Read (p (f a) (g b)) => Read (Biff k k2 k1 k3 p f g a b) Source #
Methods readsPrec :: Int -> ReadS (Biff k k2 k1 k3 p f g a b) # readList :: ReadS [Biff k k2 k1 k3 p f g a b] # readPrec :: ReadPrec (Biff k k2 k1 k3 p f g a b) # readListPrec :: ReadPrec [Biff k k2 k1 k3 p f g a b] #
Show (p (f a) (g b)) => Show (Biff k k2 k1 k3 p f g a b) Source #
Methods showsPrec :: Int -> Biff k k2 k1 k3 p f g a b -> ShowS # show :: Biff k k2 k1 k3 p f g a b -> String # showList :: [Biff k k2 k1 k3 p f g a b] -> ShowS #
Generic (Biff k k2 k1 k3 p f g a b) Source #
Associated Types type Rep (Biff k k2 k1 k3 p f g a b) :: * -> * # Methods from :: Biff k k2 k1 k3 p f g a b -> Rep (Biff k k2 k1 k3 p f g a b) x # to :: Rep (Biff k k2 k1 k3 p f g a b) x -> Biff k k2 k1 k3 p f g a b #
type Rep1 (Biff k k1 * * p f g a) Source #
type Rep1 (Biff k k1 * * p f g a) = D1 (MetaData "Biff" "Data.Bifunctor.Biff" "bifunctors-5.4.1-A8ejiCckDCyBAiTlmd5e0O" True) (C1 (MetaCons "Biff" PrefixI True) (S1 (MetaSel (Just Symbol "runBiff") NoSourceUnpackedness NoSourceStrictness DecidedLazy) ((:.:) (p (f a)) (Rec1 g))))
type Rep (Biff k k2 k1 k3 p f g a b) Source #
type Rep (Biff k k2 k1 k3 p f g a b) = D1 (MetaData "Biff" "Data.Bifunctor.Biff" "bifunctors-5.4.1-A8ejiCckDCyBAiTlmd5e0O" True) (C1 (MetaCons "Biff" PrefixI True) (S1 (MetaSel (Just Symbol "runBiff") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (p (f a) (g b)))))