bifunctors-5.4.2: Bifunctors

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

Functor f => BifunctorFunctor k k1 k k1 (Tannen k k1 * f) Source # |
Methods bifmap :: (k :-> k) p q -> (Tannen k k1 * f :-> k) (t p) (t q) Source #
Comonad f => BifunctorComonad k k1 (Tannen k k1 * f) Source # |
Methods biextract :: t p a b -> p a b Source # biextend :: (Tannen k k1 * f :-> k) (t p) q -> (Tannen k k1 * f :-> k) (t p) (t q) Source # biduplicate :: t p a b -> t (t p) a b Source #
(Functor f, Monad f) => BifunctorMonad k k1 (Tannen k k1 * f) Source # |
Methods bireturn :: p a b -> t p a b Source # bibind :: (Tannen k k1 * f :-> k) p (t q) -> (Tannen k k1 * f :-> k) (t p) (t q) Source # bijoin :: t (t p) a b -> t p a b Source #
(Applicative f, Category k p) => Category k (Tannen k k * f p) Source # |
Methods id :: cat a a # (.) :: cat b c -> cat a b -> cat a c #
(Functor f, Bifunctor p) => Bifunctor (Tannen * * * f p) Source # |
Methods bimap :: (a -> b) -> (c -> d) -> Tannen * * * f p a c -> Tannen * * * f p b d # first :: (a -> b) -> Tannen * * * f p a c -> Tannen * * * f p b c # second :: (b -> c) -> Tannen * * * f p a b -> Tannen * * * f p a c #
(Applicative f, Arrow p) => Arrow (Tannen * * * f p) Source # |
Methods arr :: (b -> c) -> Tannen * * * f p b c # first :: Tannen * * * f p b c -> Tannen * * * f p (b, d) (c, d) # second :: Tannen * * * f p b c -> Tannen * * * f p (d, b) (d, c) # (***) :: Tannen * * * f p b c -> Tannen * * * f p b' c' -> Tannen * * * f p (b, b') (c, c') # (&&&) :: Tannen * * * f p b c -> Tannen * * * f p b c' -> Tannen * * * f p b (c, c') #
(Applicative f, ArrowZero p) => ArrowZero (Tannen * * * f p) Source # |
Methods zeroArrow :: Tannen * * * f p b c #
(Applicative f, ArrowPlus p) => ArrowPlus (Tannen * * * f p) Source # |
Methods (<+>) :: Tannen * * * f p b c -> Tannen * * * f p b c -> Tannen * * * f p b c #
(Applicative f, ArrowChoice p) => ArrowChoice (Tannen * * * f p) Source # |
Methods left :: Tannen * * * f p b c -> Tannen * * * f p (Either b d) (Either c d) # right :: Tannen * * * f p b c -> Tannen * * * f p (Either d b) (Either d c) # (+++) :: Tannen * * * f p b c -> Tannen * * * f p b' c' -> Tannen * * * f p (Either b b') (Either c c') # (|||) :: Tannen * * * f p b d -> Tannen * * * f p c d -> Tannen * * * f p (Either b c) d #
(Applicative f, ArrowLoop p) => ArrowLoop (Tannen * * * f p) Source # |
Methods loop :: Tannen * * * f p (b, d) (c, d) -> Tannen * * * f p b c #
(Foldable f, Bifoldable p) => Bifoldable (Tannen * * * f p) Source # |
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 #
(Traversable f, Bitraversable p) => Bitraversable (Tannen * * * f p) Source # |
Methods bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Tannen * * * f p a b -> f (Tannen * * * f p c d) Source #
(Applicative f, Biapplicative p) => Biapplicative (Tannen * * * f p) Source # |
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 # (*>>) :: 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 # |
Methods fmap :: (a -> b) -> Tannen * * * f p a a -> Tannen * * * f p a b # (<$) :: a -> Tannen * * * f p a b -> Tannen * * * f p a a #
(Foldable f, Bifoldable p) => Foldable (Tannen * * * f p a) Source # |

Methods

fold :: Monoid m => Tannen * * * f p a m -> m #

foldMap :: Monoid m => (a -> m) -> Tannen * * * f p a a -> m #

foldr :: (a -> b -> b) -> b -> Tannen * * * f p a a -> b #

foldr' :: (a -> b -> b) -> b -> Tannen * * * f p a a -> b #

foldl :: (b -> a -> b) -> b -> Tannen * * * f p a a -> b #

foldl' :: (b -> a -> b) -> b -> Tannen * * * f p a a -> b #

foldr1 :: (a -> a -> a) -> Tannen * * * f p a a -> a #

foldl1 :: (a -> a -> a) -> Tannen * * * f p a a -> a #

toList :: Tannen * * * f p a a -> [a] #

null :: Tannen * * * f p a a -> Bool #

length :: Tannen * * * f p a a -> Int #

elem :: Eq a => a -> Tannen * * * f p a a -> Bool #

maximum :: Ord a => Tannen * * * f p a a -> a #

minimum :: Ord a => Tannen * * * f p a a -> a #

sum :: Num a => Tannen * * * f p a a -> a #

product :: Num a => Tannen * * * f p a a -> a #

(Traversable f, Bitraversable p) => Traversable (Tannen * * * f p a) Source # |
Methods traverse :: Applicative f => (a -> f b) -> Tannen * * * f p a a -> f (Tannen * * * f p a b) # sequenceA :: Applicative f => Tannen * * * f p a (f a) -> f (Tannen * * * f p a a) # mapM :: Monad m => (a -> m b) -> Tannen * * * f p a a -> m (Tannen * * * f p a b) # sequence :: Monad m => Tannen * * * f p a (m a) -> m (Tannen * * * f p a a) #
Functor f => Generic1 (Tannen * k * f p a) Source # |
Associated Types type Rep1 (Tannen * k * f p a :: * -> *) :: * -> * # Methods from1 :: Tannen * k * f p a a -> Rep1 (Tannen * k * f p a) a # to1 :: Rep1 (Tannen * k * f p a) a -> Tannen * k * f p a a #
Eq (f (p a b)) => Eq (Tannen k2 k1 k f p a b) Source # |
Methods (==) :: Tannen k2 k1 k f p a b -> Tannen k2 k1 k f p a b -> Bool # (/=) :: Tannen k2 k1 k f p a b -> Tannen k2 k1 k f p a b -> Bool #
Ord (f (p a b)) => Ord (Tannen k2 k1 k f p a b) Source # |

Methods

compare :: Tannen k2 k1 k f p a b -> Tannen k2 k1 k f p a b -> Ordering #

(<) :: Tannen k2 k1 k f p a b -> Tannen k2 k1 k f p a b -> Bool #

(<=) :: Tannen k2 k1 k f p a b -> Tannen k2 k1 k f p a b -> Bool #

(>) :: Tannen k2 k1 k f p a b -> Tannen k2 k1 k f p a b -> Bool #

(>=) :: Tannen k2 k1 k f p a b -> Tannen k2 k1 k f p a b -> Bool #

max :: Tannen k2 k1 k f p a b -> Tannen k2 k1 k f p a b -> Tannen k2 k1 k f p a b #

min :: Tannen k2 k1 k f p a b -> Tannen k2 k1 k f p a b -> Tannen k2 k1 k f p a b #

Read (f (p a b)) => Read (Tannen k2 k1 k f p a b) Source # |
Methods readsPrec :: Int -> ReadS (Tannen k2 k1 k f p a b) # readList :: ReadS [Tannen k2 k1 k f p a b] # readPrec :: ReadPrec (Tannen k2 k1 k f p a b) # readListPrec :: ReadPrec [Tannen k2 k1 k f p a b] #
Show (f (p a b)) => Show (Tannen k2 k1 k f p a b) Source # |
Methods showsPrec :: Int -> Tannen k2 k1 k f p a b -> ShowS # show :: Tannen k2 k1 k f p a b -> String # showList :: [Tannen k2 k1 k f p a b] -> ShowS #
Generic (Tannen k2 k1 k f p a b) Source # |
Associated Types type Rep (Tannen k2 k1 k f p a b) :: * -> * # Methods from :: Tannen k2 k1 k f p a b -> Rep (Tannen k2 k1 k f p a b) x # to :: Rep (Tannen k2 k1 k f p a b) x -> Tannen k2 k1 k f p a b #
type Rep1 (Tannen * k * f p a) Source # |
type Rep1 (Tannen * k * f p a) = D1 (MetaData "Tannen" "Data.Bifunctor.Tannen" "bifunctors-5.4.2-D9NYUY1YNw7CNbta2tOtAS" True) (C1 (MetaCons "Tannen" PrefixI True) (S1 (MetaSel (Just Symbol "runTannen") NoSourceUnpackedness NoSourceStrictness DecidedLazy) ((:.:) f (Rec1 (p a)))))
type Rep (Tannen k2 k1 k f p a b) Source # |
type Rep (Tannen k2 k1 k f p a b) = D1 (MetaData "Tannen" "Data.Bifunctor.Tannen" "bifunctors-5.4.2-D9NYUY1YNw7CNbta2tOtAS" True) (C1 (MetaCons "Tannen" PrefixI True) (S1 (MetaSel (Just Symbol "runTannen") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (f (p a b)))))