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 | Haskell2010 |
Data.Bifunctor.Biff
Description
Documentation
newtype Biff p f g a b Source #
Instances
Functor (p (f a)) => Generic1 ( Biff p f g a :: k3 -> Type ) Source # | |
( Bitraversable p, Traversable f, Traversable g) => Bitraversable ( Biff p f g) Source # | |
Defined in Data.Bifunctor.Biff Methods bitraverse :: Applicative f0 => (a -> f0 c) -> (b -> f0 d) -> Biff p f g a b -> f0 ( Biff p f g c d) Source # |
|
( Bifoldable p, Foldable f, Foldable g) => Bifoldable ( Biff p f g) Source # | |
Defined in Data.Bifunctor.Biff |
|
( Bifunctor p, Functor f, Functor g) => Bifunctor ( Biff p f g) Source # | |
( Eq2 p, Eq1 f, Eq1 g) => Eq2 ( Biff p f g) Source # | |
( Ord2 p, Ord1 f, Ord1 g) => Ord2 ( Biff p f g) Source # | |
Defined in Data.Bifunctor.Biff |
|
( Read2 p, Read1 f, Read1 g) => Read2 ( Biff p f g) Source # | |
Defined in Data.Bifunctor.Biff Methods liftReadsPrec2 :: ( Int -> ReadS a) -> ReadS [a] -> ( Int -> ReadS b) -> ReadS [b] -> Int -> ReadS ( Biff p f g a b) Source # liftReadList2 :: ( Int -> ReadS a) -> ReadS [a] -> ( Int -> ReadS b) -> ReadS [b] -> ReadS [ Biff p f g a b] Source # liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec ( Biff p f g a b) Source # liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [ Biff p f g a b] Source # |
|
( Show2 p, Show1 f, Show1 g) => Show2 ( Biff p f g) Source # | |
Defined in Data.Bifunctor.Biff |
|
( Biapplicative p, Applicative f, Applicative g) => Biapplicative ( Biff p f g) Source # | |
Defined in Data.Bifunctor.Biff 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 # biliftA2 :: (a -> b -> c) -> (d -> e -> f0) -> Biff p f g a d -> Biff p f g b e -> Biff p f g c f0 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 # | |
( Bifoldable p, Foldable g) => Foldable ( Biff p f g a) Source # | |
Defined in Data.Bifunctor.Biff Methods fold :: Monoid m => Biff p f g a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> Biff p f g a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> Biff p f g a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> Biff p f g a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> Biff p f g a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> Biff p f g a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> Biff p f g a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> Biff p f g a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> Biff p f g a a0 -> a0 Source # toList :: Biff p f g a a0 -> [a0] Source # null :: Biff p f g a a0 -> Bool Source # length :: Biff p f g a a0 -> Int Source # elem :: Eq a0 => a0 -> Biff p f g a a0 -> Bool Source # maximum :: Ord a0 => Biff p f g a a0 -> a0 Source # minimum :: Ord a0 => Biff p f g a a0 -> a0 Source # |
|
( Bitraversable p, Traversable g) => Traversable ( Biff p f g a) Source # | |
Defined in Data.Bifunctor.Biff Methods traverse :: Applicative f0 => (a0 -> f0 b) -> Biff p f g a a0 -> f0 ( Biff p f g a b) Source # sequenceA :: Applicative f0 => Biff p f g a (f0 a0) -> f0 ( Biff p f g a a0) Source # mapM :: Monad m => (a0 -> m b) -> Biff p f g a a0 -> m ( Biff p f g a b) Source # sequence :: Monad m => Biff p f g a (m a0) -> m ( Biff p f g a a0) Source # |
|
( Eq2 p, Eq1 f, Eq1 g, Eq a) => Eq1 ( Biff p f g a) Source # | |
( Ord2 p, Ord1 f, Ord1 g, Ord a) => Ord1 ( Biff p f g a) Source # | |
Defined in Data.Bifunctor.Biff |
|
( Read2 p, Read1 f, Read1 g, Read a) => Read1 ( Biff p f g a) Source # | |
Defined in Data.Bifunctor.Biff Methods liftReadsPrec :: ( Int -> ReadS a0) -> ReadS [a0] -> Int -> ReadS ( Biff p f g a a0) Source # liftReadList :: ( Int -> ReadS a0) -> ReadS [a0] -> ReadS [ Biff p f g a a0] Source # liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec ( Biff p f g a a0) Source # liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [ Biff p f g a a0] Source # |
|
( Show2 p, Show1 f, Show1 g, Show a) => Show1 ( Biff p f g a) Source # | |
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 Methods compare :: Biff p f g a b -> Biff p f g a b -> Ordering Source # (<) :: Biff p f g a b -> Biff p f g a b -> Bool Source # (<=) :: Biff p f g a b -> Biff p f g a b -> Bool Source # (>) :: Biff p f g a b -> Biff p f g a b -> Bool Source # (>=) :: Biff p f g a b -> Biff p f g a b -> Bool Source # max :: Biff p f g a b -> Biff p f g a b -> Biff p f g a b Source # min :: Biff p f g a b -> Biff p f g a b -> Biff p f g a b Source # |
|
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 -> Type ) Source # | |
Defined in Data.Bifunctor.Biff |
|
type Rep ( Biff p f g a b) Source # | |
Defined in Data.Bifunctor.Biff |