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

Description

Synopsis

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, 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
(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 b => (a -> b c) -> (d -> b e) -> Tannen f p a d -> b (Tannen f p c e) Source bisequenceA :: Applicative a => Tannen f p (a b) (a c) -> a (Tannen f p b c) Source bimapM :: Monad m => (a -> m c) -> (b -> m d) -> Tannen f p a b -> m (Tannen f p c d) Source bisequence :: Monad m => Tannen f p (m a) (m b) -> m (Tannen f p a b) 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 :: (b -> c) -> Tannen f p a b -> Tannen f p a c (<$) :: b -> Tannen f p a c -> Tannen f p a b
(Foldable f, Bifoldable p) => Foldable (Tannen f p a) Source
Methods fold :: Monoid m => Tannen f p a m -> m foldMap :: Monoid m => (b -> m) -> Tannen f p a b -> m foldr :: (b -> c -> c) -> c -> Tannen f p a b -> c foldr' :: (b -> c -> c) -> c -> Tannen f p a b -> c foldl :: (b -> c -> b) -> b -> Tannen f p a c -> b foldl' :: (b -> c -> b) -> b -> Tannen f p a c -> b foldr1 :: (b -> b -> b) -> Tannen f p a b -> b foldl1 :: (b -> b -> b) -> Tannen f p a b -> b toList :: Tannen f p a b -> [b] null :: Tannen f p a b -> Bool length :: Tannen f p a b -> Int elem :: Eq b => b -> Tannen f p a b -> Bool maximum :: Ord b => Tannen f p a b -> b minimum :: Ord b => Tannen f p a b -> b sum :: Num b => Tannen f p a b -> b product :: Num b => Tannen f p a b -> b
(Traversable f, Bitraversable p) => Traversable (Tannen f p a) Source
Methods traverse :: Applicative c => (b -> c d) -> Tannen f p a b -> c (Tannen f p a d) sequenceA :: Applicative b => Tannen f p a (b c) -> b (Tannen f p a c) mapM :: Monad m => (b -> m c) -> Tannen f p a b -> m (Tannen f p a c) sequence :: Monad m => Tannen f p a (m b) -> m (Tannen f p a b)
Eq (f (p a b)) => Eq (Tannen f p a b) Source
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) Source
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
Read (f (p a b)) => Read (Tannen f p a b) Source
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) Source
Methods showsPrec :: Int -> Tannen f p a b -> ShowS show :: Tannen f p a b -> String showList :: [Tannen f p a b] -> ShowS