Safe Haskell	None
Language	Haskell2010

Data.Bifunctor.Tannen

Documentation

newtype Tannen f s a b Source #

Constructors

Tannen
Fields unTannen :: f (s a b)

Instances

(Traversable f, Bitraversable s) => Bitraversable (Tannen f s) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods bitraverse :: Applicative f0 => (a -> f0 c) -> (b -> f0 d) -> Tannen f s a b -> f0 (Tannen f s c d) #
(Foldable f, Bifoldable s) => Bifoldable (Tannen f s) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods bifold :: Monoid m => Tannen f s m m -> m # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Tannen f s a b -> m # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Tannen f s a b -> c # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Tannen f s a b -> c #
(Functor f, Bifunctor s) => Bifunctor (Tannen f s) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods bimap :: (a -> b) -> (c -> d) -> Tannen f s a c -> Tannen f s b d # first :: (a -> b) -> Tannen f s a c -> Tannen f s b c # second :: (b -> c) -> Tannen f s a b -> Tannen f s a c #
(Eq1 f, Eq2 s) => Eq2 (Tannen f s) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> Tannen f s a c -> Tannen f s b d -> Bool #
(Ord1 f, Ord2 s) => Ord2 (Tannen f s) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> Tannen f s a c -> Tannen f s b d -> Ordering #
(Read1 f, Read2 s) => Read2 (Tannen f s) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods liftReadsPrec2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> Int -> ReadS (Tannen f s a b) # liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [Tannen f s a b] # liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (Tannen f s a b) # liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [Tannen f s a b] #
(Show1 f, Show2 s) => Show2 (Tannen f s) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> Tannen f s a b -> ShowS # liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [Tannen f s a b] -> ShowS #
(Cotraversable f, Bicotraversable s) => Bicotraversable (Tannen f s) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods bicollect :: Functor g => (a -> Tannen f s b c) -> g a -> Tannen f s (g b) (g c) Source # bicosequence :: Functor g => g (Tannen f s a b) -> Tannen f s (g a) (g b) Source # bicotraverse :: Functor g => (g a -> b) -> (g c -> d) -> g (Tannen f s a c) -> Tannen f s b d Source #
(Functor f, Functor (s a)) => Functor (Tannen f s a) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods fmap :: (a0 -> b) -> Tannen f s a a0 -> Tannen f s a b # (<$) :: a0 -> Tannen f s a b -> Tannen f s a a0 #
(Foldable f, Foldable (s a)) => Foldable (Tannen f s a) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods fold :: Monoid m => Tannen f s a m -> m # foldMap :: Monoid m => (a0 -> m) -> Tannen f s a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Tannen f s a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Tannen f s a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Tannen f s a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Tannen f s a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Tannen f s a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Tannen f s a a0 -> a0 # toList :: Tannen f s a a0 -> [a0] # null :: Tannen f s a a0 -> Bool # length :: Tannen f s a a0 -> Int # elem :: Eq a0 => a0 -> Tannen f s a a0 -> Bool # maximum :: Ord a0 => Tannen f s a a0 -> a0 # minimum :: Ord a0 => Tannen f s a a0 -> a0 # sum :: Num a0 => Tannen f s a a0 -> a0 # product :: Num a0 => Tannen f s a a0 -> a0 #
(Traversable f, Traversable (s a)) => Traversable (Tannen f s a) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods traverse :: Applicative f0 => (a0 -> f0 b) -> Tannen f s a a0 -> f0 (Tannen f s a b) # sequenceA :: Applicative f0 => Tannen f s a (f0 a0) -> f0 (Tannen f s a a0) # mapM :: Monad m => (a0 -> m b) -> Tannen f s a a0 -> m (Tannen f s a b) # sequence :: Monad m => Tannen f s a (m a0) -> m (Tannen f s a a0) #
(Eq1 f, Eq2 s, Eq a, Eq b) => Eq (Tannen f s a b) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods (==) :: Tannen f s a b -> Tannen f s a b -> Bool # (/=) :: Tannen f s a b -> Tannen f s a b -> Bool #
(Ord1 f, Ord2 s, Ord a, Ord b) => Ord (Tannen f s a b) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods compare :: Tannen f s a b -> Tannen f s a b -> Ordering # (<) :: Tannen f s a b -> Tannen f s a b -> Bool # (<=) :: Tannen f s a b -> Tannen f s a b -> Bool # (>) :: Tannen f s a b -> Tannen f s a b -> Bool # (>=) :: Tannen f s a b -> Tannen f s a b -> Bool # max :: Tannen f s a b -> Tannen f s a b -> Tannen f s a b # min :: Tannen f s a b -> Tannen f s a b -> Tannen f s a b #
(Read1 f, Read2 s, Read a, Read b) => Read (Tannen f s a b) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods readsPrec :: Int -> ReadS (Tannen f s a b) # readList :: ReadS [Tannen f s a b] # readPrec :: ReadPrec (Tannen f s a b) # readListPrec :: ReadPrec [Tannen f s a b] #
(Show1 f, Show2 s, Show a, Show b) => Show (Tannen f s a b) Source #
Instance details Defined in Data.Bifunctor.Tannen Methods showsPrec :: Int -> Tannen f s a b -> ShowS # show :: Tannen f s a b -> String # showList :: [Tannen f s a b] -> ShowS #