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
Instances
BifunctorFunctor ( Flip :: (k1 -> k2 -> Type ) -> k2 -> k1 -> Type ) 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) Source # |
|
Bifoldable p => Bifoldable ( Flip p) Source # | |
Defined in Data.Bifunctor.Flip |
|
Bifunctor p => Bifunctor ( Flip p) Source # | |
Eq2 p => Eq2 ( Flip p) Source # | |
Ord2 p => Ord2 ( Flip p) Source # | |
Defined in Data.Bifunctor.Flip |
|
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) Source # liftReadList2 :: ( Int -> ReadS a) -> ReadS [a] -> ( Int -> ReadS b) -> ReadS [b] -> ReadS [ Flip p a b] Source # liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec ( Flip p a b) Source # liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [ Flip p a b] Source # |
|
Show2 p => Show2 ( Flip p) Source # | |
Defined in Data.Bifunctor.Flip |
|
Biapplicative p => Biapplicative ( Flip p) Source # | |
Defined in Data.Bifunctor.Flip |
|
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 Source # foldMap :: Monoid m => (a0 -> m) -> Flip p a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> Flip p a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> Flip p a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> Flip p a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> Flip p a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> Flip p a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> Flip p a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> Flip p a a0 -> a0 Source # toList :: Flip p a a0 -> [a0] Source # null :: Flip p a a0 -> Bool Source # length :: Flip p a a0 -> Int Source # elem :: Eq a0 => a0 -> Flip p a a0 -> Bool Source # maximum :: Ord a0 => Flip p a a0 -> a0 Source # minimum :: Ord a0 => Flip p a a0 -> a0 Source # |
|
Bitraversable p => Traversable ( Flip p a) Source # | |
Defined in Data.Bifunctor.Flip Methods traverse :: Applicative f => (a0 -> f b) -> Flip p a a0 -> f ( Flip p a b) Source # sequenceA :: Applicative f => Flip p a (f a0) -> f ( Flip p a a0) Source # mapM :: Monad m => (a0 -> m b) -> Flip p a a0 -> m ( Flip p a b) Source # sequence :: Monad m => Flip p a (m a0) -> m ( Flip p a a0) Source # |
|
( Eq2 p, Eq a) => Eq1 ( Flip p a) Source # | |
( Ord2 p, Ord a) => Ord1 ( Flip p a) Source # | |
Defined in Data.Bifunctor.Flip |
|
( 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) Source # liftReadList :: ( Int -> ReadS a0) -> ReadS [a0] -> ReadS [ Flip p a a0] Source # liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec ( Flip p a a0) Source # liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [ Flip p a a0] Source # |
|
( Show2 p, Show a) => Show1 ( Flip p a) Source # | |
Eq (p b a) => Eq ( Flip p a b) Source # | |
Ord (p b a) => Ord ( Flip p a b) Source # | |
Defined in Data.Bifunctor.Flip Methods compare :: Flip p a b -> Flip p a b -> Ordering Source # (<) :: Flip p a b -> Flip p a b -> Bool Source # (<=) :: Flip p a b -> Flip p a b -> Bool Source # (>) :: Flip p a b -> Flip p a b -> Bool Source # (>=) :: Flip p a b -> Flip p a b -> Bool Source # |
|
Read (p b a) => Read ( Flip p a b) Source # | |
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 |