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.Tannen

Description

Synopsis

newtype Tannen f p a b = Tannen {
- runTannen :: f (p a b)
}

Documentation

newtype Tannen f p a b Source #

Compose a Functor on the outside of a Bifunctor .

Constructors

Tannen
Fields runTannen :: f (p a b)

Instances

Instances details

Functor f => BifunctorFunctor ( Tannen f :: (k1 -> k2 -> Type ) -> k1 -> k2 -> Type ) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods bifmap :: forall (p :: k -> k -> Type ) (q :: k -> k -> Type ). (p :-> q) -> Tannen f p :-> Tannen f q Source #
Comonad f => BifunctorComonad ( Tannen f :: (k1 -> k2 -> Type ) -> k1 -> k2 -> Type ) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods biextract :: forall (p :: k -> k -> Type ). Tannen f p :-> p Source # biextend :: forall (p :: k -> k -> Type ) (q :: k -> k -> Type ). ( Tannen f p :-> q) -> Tannen f p :-> Tannen f q Source # biduplicate :: forall (p :: k -> k -> Type ). Tannen f p :-> Tannen f ( Tannen f p) Source #
( Functor f, Monad f) => BifunctorMonad ( Tannen f :: (k1 -> k2 -> Type ) -> k1 -> k2 -> Type ) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods bireturn :: forall (p :: k -> k -> Type ). p :-> Tannen f p Source # bibind :: forall (p :: k -> k -> Type ) (q :: k -> k -> Type ). (p :-> Tannen f q) -> Tannen f p :-> Tannen f q Source # bijoin :: forall (p :: k -> k -> Type ). Tannen f ( Tannen f p) :-> Tannen f p Source #
( Applicative f, Category p) => Category ( Tannen f p :: k -> k -> Type ) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods id :: forall (a :: k0). Tannen f p a a Source # (.) :: forall (b :: k0) (c :: k0) (a :: k0). Tannen f p b c -> Tannen f p a b -> Tannen f p a c Source #
Functor f => Generic1 ( Tannen f p a :: k2 -> Type ) Source #
Instance details Defined in Data.Bifunctor.Tannen Associated Types type Rep1 ( Tannen f p a) :: k -> Type Source # Methods from1 :: forall (a0 :: k). Tannen f p a a0 -> Rep1 ( Tannen f p a) a0 Source # to1 :: forall (a0 :: k). Rep1 ( Tannen f p a) a0 -> Tannen f p a a0 Source #
( Traversable f, Bitraversable p) => Bitraversable ( Tannen f p) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods bitraverse :: Applicative f0 => (a -> f0 c) -> (b -> f0 d) -> Tannen f p a b -> f0 ( Tannen f p c d) Source #
( Foldable f, Bifoldable p) => Bifoldable ( Tannen f p) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods bifold :: Monoid m => Tannen f p m m -> m Source # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Tannen f p a b -> m Source # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Tannen f p a b -> c Source # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Tannen f p a b -> c Source #
( Functor f, Bifunctor p) => Bifunctor ( Tannen f p) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods bimap :: (a -> b) -> (c -> d) -> Tannen f p a c -> Tannen f p b d Source # first :: (a -> b) -> Tannen f p a c -> Tannen f p b c Source # second :: (b -> c) -> Tannen f p a b -> Tannen f p a c Source #
( Eq1 f, Eq2 p) => Eq2 ( Tannen f p) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods liftEq2 :: (a -> b -> Bool ) -> (c -> d -> Bool ) -> Tannen f p a c -> Tannen f p b d -> Bool Source #
( Ord1 f, Ord2 p) => Ord2 ( Tannen f p) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods liftCompare2 :: (a -> b -> Ordering ) -> (c -> d -> Ordering ) -> Tannen f p a c -> Tannen f p b d -> Ordering Source #
( Read1 f, Read2 p) => Read2 ( Tannen f p) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods liftReadsPrec2 :: ( Int -> ReadS a) -> ReadS [a] -> ( Int -> ReadS b) -> ReadS [b] -> Int -> ReadS ( Tannen f p a b) Source # liftReadList2 :: ( Int -> ReadS a) -> ReadS [a] -> ( Int -> ReadS b) -> ReadS [b] -> ReadS [ Tannen f p a b] Source # liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec ( Tannen f p a b) Source # liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [ Tannen f p a b] Source #
( Show1 f, Show2 p) => Show2 ( Tannen f p) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods liftShowsPrec2 :: ( Int -> a -> ShowS ) -> ([a] -> ShowS ) -> ( Int -> b -> ShowS ) -> ([b] -> ShowS ) -> Int -> Tannen f p a b -> ShowS Source # liftShowList2 :: ( Int -> a -> ShowS ) -> ([a] -> ShowS ) -> ( Int -> b -> ShowS ) -> ([b] -> ShowS ) -> [ Tannen f p a b] -> ShowS Source #
( Applicative f, Arrow p) => Arrow ( Tannen f p) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods arr :: (b -> c) -> Tannen f p b c Source # first :: Tannen f p b c -> Tannen f p (b, d) (c, d) Source # second :: Tannen f p b c -> Tannen f p (d, b) (d, c) Source # (***) :: Tannen f p b c -> Tannen f p b' c' -> Tannen f p (b, b') (c, c') Source # (&&&) :: Tannen f p b c -> Tannen f p b c' -> Tannen f p b (c, c') Source #
( Applicative f, ArrowZero p) => ArrowZero ( Tannen f p) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods zeroArrow :: Tannen f p b c Source #
( Applicative f, ArrowPlus p) => ArrowPlus ( Tannen f p) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods (<+>) :: Tannen f p b c -> Tannen f p b c -> Tannen f p b c Source #
( Applicative f, ArrowChoice p) => ArrowChoice ( Tannen f p) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods left :: Tannen f p b c -> Tannen f p ( Either b d) ( Either c d) Source # right :: Tannen f p b c -> Tannen f p ( Either d b) ( Either d c) Source # (+++) :: Tannen f p b c -> Tannen f p b' c' -> Tannen f p ( Either b b') ( Either c c') Source # (\|\|\|) :: Tannen f p b d -> Tannen f p c d -> Tannen f p ( Either b c) d Source #
( Applicative f, ArrowLoop p) => ArrowLoop ( Tannen f p) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods loop :: Tannen f p (b, d) (c, d) -> Tannen f p b c Source #
( Applicative f, Biapplicative p) => Biapplicative ( Tannen f p) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods bipure :: a -> b -> Tannen f p a b Source # (<<>>) :: Tannen f p (a -> b) (c -> d) -> Tannen f p a c -> Tannen f p b d Source # biliftA2 :: (a -> b -> c) -> (d -> e -> f0) -> Tannen f p a d -> Tannen f p b e -> Tannen f p c f0 Source # (>>) :: Tannen f p a b -> Tannen f p c d -> Tannen f p c d Source # (<<*) :: Tannen f p a b -> Tannen f p c d -> Tannen f p a b Source #
( Functor f, Bifunctor p) => Functor ( Tannen f p a) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods fmap :: (a0 -> b) -> Tannen f p a a0 -> Tannen f p a b Source # (<$) :: a0 -> Tannen f p a b -> Tannen f p a a0 Source #
( Foldable f, Bifoldable p) => Foldable ( Tannen f p a) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods fold :: Monoid m => Tannen f p a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> Tannen f p a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> Tannen f p a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> Tannen f p a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> Tannen f p a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> Tannen f p a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> Tannen f p a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> Tannen f p a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> Tannen f p a a0 -> a0 Source # toList :: Tannen f p a a0 -> [a0] Source # null :: Tannen f p a a0 -> Bool Source # length :: Tannen f p a a0 -> Int Source # elem :: Eq a0 => a0 -> Tannen f p a a0 -> Bool Source # maximum :: Ord a0 => Tannen f p a a0 -> a0 Source # minimum :: Ord a0 => Tannen f p a a0 -> a0 Source # sum :: Num a0 => Tannen f p a a0 -> a0 Source # product :: Num a0 => Tannen f p a a0 -> a0 Source #
( Traversable f, Bitraversable p) => Traversable ( Tannen f p a) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods traverse :: Applicative f0 => (a0 -> f0 b) -> Tannen f p a a0 -> f0 ( Tannen f p a b) Source # sequenceA :: Applicative f0 => Tannen f p a (f0 a0) -> f0 ( Tannen f p a a0) Source # mapM :: Monad m => (a0 -> m b) -> Tannen f p a a0 -> m ( Tannen f p a b) Source # sequence :: Monad m => Tannen f p a (m a0) -> m ( Tannen f p a a0) Source #
( Eq1 f, Eq2 p, Eq a) => Eq1 ( Tannen f p a) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods liftEq :: (a0 -> b -> Bool ) -> Tannen f p a a0 -> Tannen f p a b -> Bool Source #
( Ord1 f, Ord2 p, Ord a) => Ord1 ( Tannen f p a) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods liftCompare :: (a0 -> b -> Ordering ) -> Tannen f p a a0 -> Tannen f p a b -> Ordering Source #
( Read1 f, Read2 p, Read a) => Read1 ( Tannen f p a) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods liftReadsPrec :: ( Int -> ReadS a0) -> ReadS [a0] -> Int -> ReadS ( Tannen f p a a0) Source # liftReadList :: ( Int -> ReadS a0) -> ReadS [a0] -> ReadS [ Tannen f p a a0] Source # liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec ( Tannen f p a a0) Source # liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [ Tannen f p a a0] Source #
( Show1 f, Show2 p, Show a) => Show1 ( Tannen f p a) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods liftShowsPrec :: ( Int -> a0 -> ShowS ) -> ([a0] -> ShowS ) -> Int -> Tannen f p a a0 -> ShowS Source # liftShowList :: ( Int -> a0 -> ShowS ) -> ([a0] -> ShowS ) -> [ Tannen f p a a0] -> ShowS Source #
Eq (f (p a b)) => Eq ( Tannen f p a b) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods (==) :: Tannen f p a b -> Tannen f p a b -> Bool Source # (/=) :: Tannen f p a b -> Tannen f p a b -> Bool Source #
Ord (f (p a b)) => Ord ( Tannen f p a b) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods compare :: Tannen f p a b -> Tannen f p a b -> Ordering Source # (<) :: Tannen f p a b -> Tannen f p a b -> Bool Source # (<=) :: Tannen f p a b -> Tannen f p a b -> Bool Source # (>) :: Tannen f p a b -> Tannen f p a b -> Bool Source # (>=) :: Tannen f p a b -> Tannen f p a b -> Bool Source # max :: Tannen f p a b -> Tannen f p a b -> Tannen f p a b Source # min :: Tannen f p a b -> Tannen f p a b -> Tannen f p a b Source #
Read (f (p a b)) => Read ( Tannen f p a b) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods readsPrec :: Int -> ReadS ( Tannen f p a b) Source # readList :: ReadS [ Tannen f p a b] Source # readPrec :: ReadPrec ( Tannen f p a b) Source # readListPrec :: ReadPrec [ Tannen f p a b] Source #
Show (f (p a b)) => Show ( Tannen f p a b) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods showsPrec :: Int -> Tannen f p a b -> ShowS Source # show :: Tannen f p a b -> String Source # showList :: [ Tannen f p a b] -> ShowS Source #
Generic ( Tannen f p a b) Source #
Instance details Defined in Data.Bifunctor.Tannen Associated Types type Rep ( Tannen f p a b) :: Type -> Type Source # Methods from :: Tannen f p a b -> Rep ( Tannen f p a b) x Source # to :: Rep ( Tannen f p a b) x -> Tannen f p a b Source #
type Rep1 ( Tannen f p a :: k1 -> Type ) Source #
Instance details Defined in Data.Bifunctor.Tannen type Rep1 ( Tannen f p a :: k1 -> Type ) = D1 (' MetaData "Tannen" "Data.Bifunctor.Tannen" "bifunctors-5.5.14-4o2vxpA6iYN8K0rfLgtyzm" ' True ) ( C1 (' MetaCons "Tannen" ' PrefixI ' True ) ( S1 (' MetaSel (' Just "runTannen") ' NoSourceUnpackedness ' NoSourceStrictness ' DecidedLazy ) (f :.: Rec1 (p a))))
type Rep ( Tannen f p a b) Source #
Instance details Defined in Data.Bifunctor.Tannen type Rep ( Tannen f p a b) = D1 (' MetaData "Tannen" "Data.Bifunctor.Tannen" "bifunctors-5.5.14-4o2vxpA6iYN8K0rfLgtyzm" ' True ) ( C1 (' MetaCons "Tannen" ' PrefixI ' True ) ( S1 (' MetaSel (' Just "runTannen") ' NoSourceUnpackedness ' NoSourceStrictness ' DecidedLazy ) ( Rec0 (f (p a b)))))