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 b => (a -> b c) -> (d -> b e) -> Biff * * * * p f g a d -> b (Biff * * * * p f g c e) 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 :: (b -> c) -> Biff * * k * p f g a b -> Biff * * k * p f g a c (<$) :: b -> Biff * * k * p f g a c -> Biff * * k * p f g a b
(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 => (b -> m) -> Biff * * k * p f g a b -> m foldr :: (b -> c -> c) -> c -> Biff * * k * p f g a b -> c foldr' :: (b -> c -> c) -> c -> Biff * * k * p f g a b -> c foldl :: (b -> c -> b) -> b -> Biff * * k * p f g a c -> b foldl' :: (b -> c -> b) -> b -> Biff * * k * p f g a c -> b foldr1 :: (b -> b -> b) -> Biff * * k * p f g a b -> b foldl1 :: (b -> b -> b) -> Biff * * k * p f g a b -> b toList :: Biff * * k * p f g a b -> [b] null :: Biff * * k * p f g a b -> Bool length :: Biff * * k * p f g a b -> Int elem :: Eq b => b -> Biff * * k * p f g a b -> Bool maximum :: Ord b => Biff * * k * p f g a b -> b minimum :: Ord b => Biff * * k * p f g a b -> b sum :: Num b => Biff * * k * p f g a b -> b product :: Num b => Biff * * k * p f g a b -> b
(Bitraversable p, Traversable g) => Traversable (Biff * * k * p f g a) Source
Methods traverse :: Applicative c => (b -> c d) -> Biff * * k * p f g a b -> c (Biff * * k * p f g a d) sequenceA :: Applicative b => Biff * * k * p f g a (b c) -> b (Biff * * k * p f g a c) mapM :: Monad m => (b -> m c) -> Biff * * k * p f g a b -> m (Biff * * k * p f g a c) sequence :: Monad m => Biff * * k * p f g a (m b) -> m (Biff * * k * p f g a b)
Functor (p (f a)) => Generic1 (Biff k * k * p f g a) Source
Associated Types type Rep1 (Biff k * k * p f g a :: * -> ) :: -> * Methods from1 :: Biff k * k * p f g a b -> Rep1 (Biff k * k * p f g a) b to1 :: Rep1 (Biff k * k * p f g a) b -> Biff k * k * p f g a b
Eq (p (f a) (g b)) => Eq (Biff k k k k p f g a b) Source
Methods (==) :: Biff k k k k p f g a b -> Biff k k k k p f g a b -> Bool (/=) :: Biff k k k k p f g a b -> Biff k k k k p f g a b -> Bool
Ord (p (f a) (g b)) => Ord (Biff k k k k p f g a b) Source
Methods compare :: Biff k k k k p f g a b -> Biff k k k k p f g a b -> Ordering (<) :: Biff k k k k p f g a b -> Biff k k k k p f g a b -> Bool (<=) :: Biff k k k k p f g a b -> Biff k k k k p f g a b -> Bool (>) :: Biff k k k k p f g a b -> Biff k k k k p f g a b -> Bool (>=) :: Biff k k k k p f g a b -> Biff k k k k p f g a b -> Bool max :: Biff k k k k p f g a b -> Biff k k k k p f g a b -> Biff k k k k p f g a b min :: Biff k k k k p f g a b -> Biff k k k k p f g a b -> Biff k k k k p f g a b
Read (p (f a) (g b)) => Read (Biff k k k k p f g a b) Source
Methods readsPrec :: Int -> ReadS (Biff k k k k p f g a b) readList :: ReadS [Biff k k k k p f g a b] readPrec :: ReadPrec (Biff k k k k p f g a b) readListPrec :: ReadPrec [Biff k k k k p f g a b]
Show (p (f a) (g b)) => Show (Biff k k k k p f g a b) Source
Methods showsPrec :: Int -> Biff k k k k p f g a b -> ShowS show :: Biff k k k k p f g a b -> String showList :: [Biff k k k k p f g a b] -> ShowS
Generic (Biff k k k k p f g a b) Source
Associated Types type Rep (Biff k k k k p f g a b) :: * -> * Methods from :: Biff k k k k p f g a b -> Rep (Biff k k k k p f g a b) x to :: Rep (Biff k k k k p f g a b) x -> Biff k k k k p f g a b
type Rep1 (Biff k k1 k2 k3 p f g a) Source
type Rep (Biff k k1 k2 k3 p f g a b) Source