Data.Bifunctor.Tannen

Documentation

newtype Tannen f p a b

Compose a Functor on the outside of a Bifunctor.

Constructors

Tannen

Fields

• runTannen :: f (p a b)

Instances

Functor f => BifunctorFunctor (Tannen f :: (k1 -> k2 -> Type) -> k1 -> k2 -> Type)

Defined in Data.Bifunctor.Tannen

Methods

bifmap :: forall (p :: k -> k -> Type) (q :: k -> k -> Type). (p :-> q) -> Tannen f p :-> Tannen f q

Comonad f => BifunctorComonad (Tannen f :: (k1 -> k2 -> Type) -> k1 -> k2 -> Type)

Defined in Data.Bifunctor.Tannen

Methods

biextract :: forall (p :: k -> k -> Type). Tannen f p :-> p

biextend :: forall (p :: k -> k -> Type) (q :: k -> k -> Type). (Tannen f p :-> q) -> Tannen f p :-> Tannen f q

biduplicate :: forall (p :: k -> k -> Type). Tannen f p :-> Tannen f (Tannen f p)

(Functor f, Monad f) => BifunctorMonad (Tannen f :: (k1 -> k2 -> Type) -> k1 -> k2 -> Type)

Defined in Data.Bifunctor.Tannen

Methods

bireturn :: forall (p :: k -> k -> Type). p :-> Tannen f p

bibind :: forall (p :: k -> k -> Type) (q :: k -> k -> Type). (p :-> Tannen f q) -> Tannen f p :-> Tannen f q

bijoin :: forall (p :: k -> k -> Type). Tannen f (Tannen f p) :-> Tannen f p

(Applicative f, Category p) => Category (Tannen f p :: k -> k -> Type)

Defined in Data.Bifunctor.Tannen

Methods

id :: forall (a :: k0). Tannen f p a a

(.) :: forall (b :: k0) (c :: k0) (a :: k0). Tannen f p b c -> Tannen f p a b -> Tannen f p a c

Functor f => Generic1 (Tannen f p a :: k2 -> Type)

Defined in Data.Bifunctor.Tannen

Associated Types

type Rep1 (Tannen f p a) :: k -> Type

Methods

from1 :: forall (a0 :: k). Tannen f p a a0 -> Rep1 (Tannen f p a) a0

to1 :: forall (a0 :: k). Rep1 (Tannen f p a) a0 -> Tannen f p a a0

(Applicative f, Arrow p) => Arrow (Tannen f p)

Defined in Data.Bifunctor.Tannen

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, ArrowChoice p) => ArrowChoice (Tannen f p)

Defined in Data.Bifunctor.Tannen

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)

Defined in Data.Bifunctor.Tannen

Methods

loop :: Tannen f p (b, d) (c, d) -> Tannen f p b c

(Applicative f, ArrowPlus p) => ArrowPlus (Tannen f p)

Defined in Data.Bifunctor.Tannen

Methods

(<+>) :: Tannen f p b c -> Tannen f p b c -> Tannen f p b c

(Applicative f, ArrowZero p) => ArrowZero (Tannen f p)

Defined in Data.Bifunctor.Tannen

Methods

zeroArrow :: Tannen f p b c

(Foldable f, Bifoldable p) => Bifoldable (Tannen f p)

Defined in Data.Bifunctor.Tannen

Methods

bifold :: Monoid m => Tannen f p m m -> m

bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Tannen f p a b -> m

bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Tannen f p a b -> c

bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Tannen f p a b -> c

(Functor f, Bifunctor p) => Bifunctor (Tannen f p)

Defined in Data.Bifunctor.Tannen

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

(Traversable f, Bitraversable p) => Bitraversable (Tannen f p)

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)

(Eq1 f, Eq2 p) => Eq2 (Tannen f p)

Defined in Data.Bifunctor.Tannen

Methods

liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> Tannen f p a c -> Tannen f p b d -> Bool

(Ord1 f, Ord2 p) => Ord2 (Tannen f p)

Defined in Data.Bifunctor.Tannen

Methods

liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> Tannen f p a c -> Tannen f p b d -> Ordering

(Read1 f, Read2 p) => Read2 (Tannen f p)

Defined in Data.Bifunctor.Tannen

Methods

liftReadsPrec2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> Int -> ReadS (Tannen f p a b)

liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [Tannen f p a b]

liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (Tannen f p a b)

liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [Tannen f p a b]

(Show1 f, Show2 p) => Show2 (Tannen f p)

Defined in Data.Bifunctor.Tannen

Methods

liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> Tannen f p a b -> ShowS

liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [Tannen f p a b] -> ShowS

(Applicative f, Biapplicative p) => Biapplicative (Tannen f p)

Defined in Data.Bifunctor.Tannen

Methods

bipure :: a -> b -> Tannen f p a b

(<<*>>) :: Tannen f p (a -> b) (c -> d) -> Tannen f p a c -> Tannen f p b d

biliftA2 :: (a -> b -> c) -> (d -> e -> f0) -> Tannen f p a d -> Tannen f p b e -> Tannen f p c f0

(*>>) :: Tannen f p a b -> Tannen f p c d -> Tannen f p c d

(<<*) :: Tannen f p a b -> Tannen f p c d -> Tannen f p a b

(Foldable1 f, Bifoldable1 p) => Bifoldable1 (Tannen f p)

Defined in Data.Bifunctor.Tannen

Methods

bifold1 :: Semigroup m => Tannen f p m m -> m

bifoldMap1 :: Semigroup m => (a -> m) -> (b -> m) -> Tannen f p a b -> m

(Foldable f, Bifoldable p) => Foldable (Tannen f p a)

Defined in Data.Bifunctor.Tannen

Methods

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

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

foldMap' :: Monoid m => (a0 -> m) -> Tannen f p a a0 -> m

foldr :: (a0 -> b -> b) -> b -> Tannen f p a a0 -> b

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

foldl :: (b -> a0 -> b) -> b -> Tannen f p a a0 -> b

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

foldr1 :: (a0 -> a0 -> a0) -> Tannen f p a a0 -> a0

foldl1 :: (a0 -> a0 -> a0) -> Tannen f p a a0 -> a0

toList :: Tannen f p a a0 -> [a0]

null :: Tannen f p a a0 -> Bool

length :: Tannen f p a a0 -> Int

elem :: Eq a0 => a0 -> Tannen f p a a0 -> Bool

maximum :: Ord a0 => Tannen f p a a0 -> a0

minimum :: Ord a0 => Tannen f p a a0 -> a0

sum :: Num a0 => Tannen f p a a0 -> a0

product :: Num a0 => Tannen f p a a0 -> a0

(Eq1 f, Eq2 p, Eq a) => Eq1 (Tannen f p a)

Defined in Data.Bifunctor.Tannen

Methods

liftEq :: (a0 -> b -> Bool) -> Tannen f p a a0 -> Tannen f p a b -> Bool

(Ord1 f, Ord2 p, Ord a) => Ord1 (Tannen f p a)

Defined in Data.Bifunctor.Tannen

Methods

liftCompare :: (a0 -> b -> Ordering) -> Tannen f p a a0 -> Tannen f p a b -> Ordering

(Read1 f, Read2 p, Read a) => Read1 (Tannen f p a)

Defined in Data.Bifunctor.Tannen

Methods

liftReadsPrec :: (Int -> ReadS a0) -> ReadS [a0] -> Int -> ReadS (Tannen f p a a0)

liftReadList :: (Int -> ReadS a0) -> ReadS [a0] -> ReadS [Tannen f p a a0]

liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec (Tannen f p a a0)

liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [Tannen f p a a0]

(Show1 f, Show2 p, Show a) => Show1 (Tannen f p a)

Defined in Data.Bifunctor.Tannen

Methods

liftShowsPrec :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> Int -> Tannen f p a a0 -> ShowS

liftShowList :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> [Tannen f p a a0] -> ShowS

(Traversable f, Bitraversable p) => Traversable (Tannen f p a)

Defined in Data.Bifunctor.Tannen

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> Tannen f p a a0 -> f0 (Tannen f p a b)

sequenceA :: Applicative f0 => Tannen f p a (f0 a0) -> f0 (Tannen f p a a0)

mapM :: Monad m => (a0 -> m b) -> Tannen f p a a0 -> m (Tannen f p a b)

sequence :: Monad m => Tannen f p a (m a0) -> m (Tannen f p a a0)

(Functor f, Bifunctor p) => Functor (Tannen f p a)

Defined in Data.Bifunctor.Tannen

Methods

fmap :: (a0 -> b) -> Tannen f p a a0 -> Tannen f p a b

(<$) :: a0 -> Tannen f p a b -> Tannen f p a a0

Generic (Tannen f p a b)

Defined in Data.Bifunctor.Tannen

Associated Types

type Rep (Tannen f p a b) :: Type -> Type

Methods

from :: Tannen f p a b -> Rep (Tannen f p a b) x

to :: Rep (Tannen f p a b) x -> Tannen f p a b

Read (f (p a b)) => Read (Tannen f p a b)

Defined in Data.Bifunctor.Tannen

Methods

readsPrec :: Int -> ReadS (Tannen f p a b)

readList :: ReadS [Tannen f p a b]

readPrec :: ReadPrec (Tannen f p a b)

readListPrec :: ReadPrec [Tannen f p a b]

Show (f (p a b)) => Show (Tannen f p a b)

Defined in Data.Bifunctor.Tannen

Methods

showsPrec :: Int -> Tannen f p a b -> ShowS

show :: Tannen f p a b -> String

showList :: [Tannen f p a b] -> ShowS

Eq (f (p a b)) => Eq (Tannen f p a b)

Defined in Data.Bifunctor.Tannen

Methods

(==) :: Tannen f p a b -> Tannen f p a b -> Bool

(/=) :: Tannen f p a b -> Tannen f p a b -> Bool

Ord (f (p a b)) => Ord (Tannen f p a b)

Defined in Data.Bifunctor.Tannen

Methods

compare :: Tannen f p a b -> Tannen f p a b -> Ordering

(<) :: Tannen f p a b -> Tannen f p a b -> Bool

(<=) :: Tannen f p a b -> Tannen f p a b -> Bool

(>) :: Tannen f p a b -> Tannen f p a b -> Bool

(>=) :: Tannen f p a b -> Tannen f p a b -> Bool

max :: Tannen f p a b -> Tannen f p a b -> Tannen f p a b

min :: Tannen f p a b -> Tannen f p a b -> Tannen f p a b

type Rep1 (Tannen f p a :: k1 -> Type)

Defined in Data.Bifunctor.Tannen

type Rep1 (Tannen f p a :: k1 -> Type) = D1 ('MetaData "Tannen" "Data.Bifunctor.Tannen" "bifunctors-5.6-8j8DuS3SamL1CuBJbDn40d" 'True) (C1 ('MetaCons "Tannen" 'PrefixI 'True) (S1 ('MetaSel ('Just "runTannen") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (f :.: Rec1 (p a))))

type Rep (Tannen f p a b)

Defined in Data.Bifunctor.Tannen

type Rep (Tannen f p a b) = D1 ('MetaData "Tannen" "Data.Bifunctor.Tannen" "bifunctors-5.6-8j8DuS3SamL1CuBJbDn40d" 'True) (C1 ('MetaCons "Tannen" 'PrefixI 'True) (S1 ('MetaSel ('Just "runTannen") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (f (p a b)))))