Copyright	(C) 2008-2015 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 bisequenceA :: Applicative a => Biff p f g (a b) (a c) -> a (Biff p f g b c) Source bimapM :: Monad m => (a -> m c) -> (b -> m d) -> Biff p f g a b -> m (Biff p f g c d) Source bisequence :: Monad m => Biff p f g (m a) (m b) -> m (Biff p f g a b) 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 p f g a) Source
Methods fmap :: (b -> c) -> Biff p f g a b -> Biff p f g a c (<$) :: b -> Biff p f g a c -> Biff p f g a b
(Bifoldable p, Foldable g) => Foldable (Biff p f g a) Source
Methods fold :: Monoid m => Biff p f g a m -> m foldMap :: Monoid m => (b -> m) -> Biff p f g a b -> m foldr :: (b -> c -> c) -> c -> Biff p f g a b -> c foldr' :: (b -> c -> c) -> c -> Biff p f g a b -> c foldl :: (b -> c -> b) -> b -> Biff p f g a c -> b foldl' :: (b -> c -> b) -> b -> Biff p f g a c -> b foldr1 :: (b -> b -> b) -> Biff p f g a b -> b foldl1 :: (b -> b -> b) -> Biff p f g a b -> b toList :: Biff p f g a b -> [b] null :: Biff p f g a b -> Bool length :: Biff p f g a b -> Int elem :: Eq b => b -> Biff p f g a b -> Bool maximum :: Ord b => Biff p f g a b -> b minimum :: Ord b => Biff p f g a b -> b sum :: Num b => Biff p f g a b -> b product :: Num b => Biff p f g a b -> b
(Bitraversable p, Traversable g) => Traversable (Biff p f g a) Source
Methods traverse :: Applicative c => (b -> c d) -> Biff p f g a b -> c (Biff p f g a d) sequenceA :: Applicative b => Biff p f g a (b c) -> b (Biff p f g a c) mapM :: Monad m => (b -> m c) -> Biff p f g a b -> m (Biff p f g a c) sequence :: Monad m => Biff p f g a (m b) -> m (Biff p f g a b)
Eq (p (f a) (g b)) => Eq (Biff p f g a b) Source
Methods (==) :: 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
Ord (p (f a) (g b)) => Ord (Biff p f g a b) Source
Methods 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 max :: Biff p f g a b -> Biff p f g a b -> Biff p f g a b min :: Biff p f g a b -> Biff p f g a b -> Biff p f g a b
Read (p (f a) (g b)) => Read (Biff p f g a b) Source
Methods readsPrec :: Int -> ReadS (Biff p f g a b) readList :: ReadS [Biff p f g a b] readPrec :: ReadPrec (Biff p f g a b) readListPrec :: ReadPrec [Biff p f g a b]
Show (p (f a) (g b)) => Show (Biff p f g a b) Source
Methods showsPrec :: Int -> Biff p f g a b -> ShowS show :: Biff p f g a b -> String showList :: [Biff p f g a b] -> ShowS