Data.Bifunctor.Biff

Documentation

newtype Biff p f g a b

Compose two Functors on the inside of a Bifunctor.

Constructors

Biff

Fields

• runBiff :: p (f a) (g b)

Instances

Functor (p (f a)) => Generic1 k1 (Biff k3 * k2 k1 p f g a)

Associated Types

type Rep1 (Biff k3 * k2 k1 p f g a) (f :: Biff k3 * k2 k1 p f g a -> *) :: k -> *

Methods

from1 :: f a -> Rep1 (Biff k3 * k2 k1 p f g a) f a

to1 :: Rep1 (Biff k3 * k2 k1 p f g a) f a -> f a

(Bitraversable p, Traversable f, Traversable g) => Bitraversable (Biff * * * * p f g)

Methods

bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Biff * * * * p f g a b -> f (Biff * * * * p f g c d)

(Bifoldable p, Foldable f, Foldable g) => Bifoldable (Biff * * * * p f g)

Methods

bifold :: Monoid m => Biff * * * * p f g m m -> m

bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Biff * * * * p f g a b -> m

bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Biff * * * * p f g a b -> c

bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Biff * * * * p f g a b -> c

(Bifunctor p, Functor f, Functor g) => Bifunctor (Biff * * * * p f g)

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

(Biapplicative p, Applicative f, Applicative g) => Biapplicative (Biff * * * * p f g)

Methods

bipure :: a -> b -> Biff * * * * p f g a b

(<<*>>) :: Biff * * * * p f g (a -> b) (c -> d) -> Biff * * * * p f g a c -> Biff * * * * p f g b d

(*>>) :: Biff * * * * p f g a b -> Biff * * * * p f g c d -> Biff * * * * p f g c d

(<<*) :: Biff * * * * p f g a b -> Biff * * * * p f g c d -> Biff * * * * p f g a b

(Bifunctor p, Functor g) => Functor (Biff * * k * p f g a)

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)

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)

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)

Eq (p (f a) (g b)) => Eq (Biff k1 k2 k3 k4 p f g a b)

Methods

(==) :: Biff k1 k2 k3 k4 p f g a b -> Biff k1 k2 k3 k4 p f g a b -> Bool

(/=) :: Biff k1 k2 k3 k4 p f g a b -> Biff k1 k2 k3 k4 p f g a b -> Bool

Ord (p (f a) (g b)) => Ord (Biff k1 k2 k3 k4 p f g a b)

Methods

compare :: Biff k1 k2 k3 k4 p f g a b -> Biff k1 k2 k3 k4 p f g a b -> Ordering

(<) :: Biff k1 k2 k3 k4 p f g a b -> Biff k1 k2 k3 k4 p f g a b -> Bool

(<=) :: Biff k1 k2 k3 k4 p f g a b -> Biff k1 k2 k3 k4 p f g a b -> Bool

(>) :: Biff k1 k2 k3 k4 p f g a b -> Biff k1 k2 k3 k4 p f g a b -> Bool

(>=) :: Biff k1 k2 k3 k4 p f g a b -> Biff k1 k2 k3 k4 p f g a b -> Bool

max :: Biff k1 k2 k3 k4 p f g a b -> Biff k1 k2 k3 k4 p f g a b -> Biff k1 k2 k3 k4 p f g a b

min :: Biff k1 k2 k3 k4 p f g a b -> Biff k1 k2 k3 k4 p f g a b -> Biff k1 k2 k3 k4 p f g a b

Read (p (f a) (g b)) => Read (Biff k1 k2 k3 k4 p f g a b)

Methods

readsPrec :: Int -> ReadS (Biff k1 k2 k3 k4 p f g a b)

readList :: ReadS [Biff k1 k2 k3 k4 p f g a b]

readPrec :: ReadPrec (Biff k1 k2 k3 k4 p f g a b)

readListPrec :: ReadPrec [Biff k1 k2 k3 k4 p f g a b]

Show (p (f a) (g b)) => Show (Biff k1 k2 k3 k4 p f g a b)

Methods

showsPrec :: Int -> Biff k1 k2 k3 k4 p f g a b -> ShowS

show :: Biff k1 k2 k3 k4 p f g a b -> String

showList :: [Biff k1 k2 k3 k4 p f g a b] -> ShowS

Generic (Biff k1 k2 k3 k4 p f g a b)

Associated Types

type Rep (Biff k1 k2 k3 k4 p f g a b) :: * -> *

Methods

from :: Biff k1 k2 k3 k4 p f g a b -> Rep (Biff k1 k2 k3 k4 p f g a b) x

to :: Rep (Biff k1 k2 k3 k4 p f g a b) x -> Biff k1 k2 k3 k4 p f g a b

type Rep1 k3 (Biff k1 * k2 k3 p f g a)

type Rep1 k3 (Biff k1 * k2 k3 p f g a) = D1 k3 (MetaData "Biff" "Data.Bifunctor.Biff" "bifunctors-5.5.1-Hd2UXQIBBQJ5NmYijuocPa" True) (C1 k3 (MetaCons "Biff" PrefixI True) (S1 k3 (MetaSel (Just Symbol "runBiff") NoSourceUnpackedness NoSourceStrictness DecidedLazy) ((:.:) * k3 (p (f a)) (Rec1 k3 g))))

type Rep (Biff k1 k2 k3 k4 p f g a b)

type Rep (Biff k1 k2 k3 k4 p f g a b) = D1 * (MetaData "Biff" "Data.Bifunctor.Biff" "bifunctors-5.5.1-Hd2UXQIBBQJ5NmYijuocPa" True) (C1 * (MetaCons "Biff" PrefixI True) (S1 * (MetaSel (Just Symbol "runBiff") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (p (f a) (g b)))))