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.Flip
Description
Documentation
Make a Bifunctor
flipping the arguments of a Bifunctor
.
Instances
BifunctorFunctor (Flip :: (k1 -> k2 -> Type) -> k2 -> k1 -> Type) Source # | |
Bifunctor p => Bifunctor (Flip p) Source # | |
Bifoldable p => Bifoldable (Flip p) Source # | |
Bitraversable p => Bitraversable (Flip p) Source # | |
Defined in Data.Bifunctor.Flip Methods bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Flip p a b -> f (Flip p c d) | |
Eq2 p => Eq2 (Flip p) Source # | |
Defined in Data.Bifunctor.Flip | |
Ord2 p => Ord2 (Flip p) Source # | |
Defined in Data.Bifunctor.Flip Methods liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> Flip p a c -> Flip p b d -> Ordering | |
Read2 p => Read2 (Flip p) Source # | |
Defined in Data.Bifunctor.Flip Methods liftReadsPrec2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> Int -> ReadS (Flip p a b) liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [Flip p a b] liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (Flip p a b) liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [Flip p a b] | |
Show2 p => Show2 (Flip p) Source # | |
Defined in Data.Bifunctor.Flip Methods liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> Flip p a b -> ShowS liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [Flip p a b] -> ShowS | |
Biapplicative p => Biapplicative (Flip p) Source # | |
Bifunctor p => Functor (Flip p a) Source # | |
Bifoldable p => Foldable (Flip p a) Source # | |
Defined in Data.Bifunctor.Flip Methods fold :: Monoid m => Flip p a m -> m foldMap :: Monoid m => (a0 -> m) -> Flip p a a0 -> m foldMap' :: Monoid m => (a0 -> m) -> Flip p a a0 -> m foldr :: (a0 -> b -> b) -> b -> Flip p a a0 -> b foldr' :: (a0 -> b -> b) -> b -> Flip p a a0 -> b foldl :: (b -> a0 -> b) -> b -> Flip p a a0 -> b foldl' :: (b -> a0 -> b) -> b -> Flip p a a0 -> b foldr1 :: (a0 -> a0 -> a0) -> Flip p a a0 -> a0 foldl1 :: (a0 -> a0 -> a0) -> Flip p a a0 -> a0 elem :: Eq a0 => a0 -> Flip p a a0 -> Bool maximum :: Ord a0 => Flip p a a0 -> a0 minimum :: Ord a0 => Flip p a a0 -> a0 | |
Bitraversable p => Traversable (Flip p a) Source # | |
(Eq2 p, Eq a) => Eq1 (Flip p a) Source # | |
Defined in Data.Bifunctor.Flip | |
(Ord2 p, Ord a) => Ord1 (Flip p a) Source # | |
Defined in Data.Bifunctor.Flip Methods liftCompare :: (a0 -> b -> Ordering) -> Flip p a a0 -> Flip p a b -> Ordering | |
(Read2 p, Read a) => Read1 (Flip p a) Source # | |
Defined in Data.Bifunctor.Flip Methods liftReadsPrec :: (Int -> ReadS a0) -> ReadS [a0] -> Int -> ReadS (Flip p a a0) liftReadList :: (Int -> ReadS a0) -> ReadS [a0] -> ReadS [Flip p a a0] liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec (Flip p a a0) liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [Flip p a a0] | |
(Show2 p, Show a) => Show1 (Flip p a) Source # | |
Defined in Data.Bifunctor.Flip Methods liftShowsPrec :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> Int -> Flip p a a0 -> ShowS liftShowList :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> [Flip p a a0] -> ShowS | |
Eq (p b a) => Eq (Flip p a b) Source # | |
Ord (p b a) => Ord (Flip p a b) Source # | |
Read (p b a) => Read (Flip p a b) Source # | |
Defined in Data.Bifunctor.Flip | |
Show (p b a) => Show (Flip p a b) Source # | |
Generic (Flip p a b) Source # | |
type Rep (Flip p a b) Source # | |
Defined in Data.Bifunctor.Flip type Rep (Flip p a b) = D1 ('MetaData "Flip" "Data.Bifunctor.Flip" "bifunctors-5.5.11-2mt06i80omZ6vW2zUZn5Ka" 'True) (C1 ('MetaCons "Flip" 'PrefixI 'True) (S1 ('MetaSel ('Just "runFlip") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (p b a)))) |