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

Description

Synopsis

Documentation

newtype Flip p a b Source

Make a Bifunctor flipping the arguments of a Bifunctor.

Constructors

Flip
Fields runFlip :: p b a

Instances

Bifunctor p => Bifunctor (Flip p) Source
Methods bimap :: (a -> b) -> (c -> d) -> Flip p a c -> Flip p b d first :: (a -> b) -> Flip p a c -> Flip p b c second :: (b -> c) -> Flip p a b -> Flip p a c
Bifoldable p => Bifoldable (Flip p) Source
Methods bifold :: Monoid m => Flip p m m -> m Source bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Flip p a b -> m Source bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Flip p a b -> c Source bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Flip p a b -> c Source
Bitraversable p => Bitraversable (Flip p) Source
Methods bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Flip p a b -> f (Flip p c d) Source bisequenceA :: Applicative f => Flip p (f a) (f b) -> f (Flip p a b) Source bimapM :: Monad m => (a -> m c) -> (b -> m d) -> Flip p a b -> m (Flip p c d) Source bisequence :: Monad m => Flip p (m a) (m b) -> m (Flip p a b) Source
Biapplicative p => Biapplicative (Flip p) Source
Methods bipure :: a -> b -> Flip p a b Source (<<>>) :: Flip p (a -> b) (c -> d) -> Flip p a c -> Flip p b d Source (>>) :: Flip p a b -> Flip p c d -> Flip p c d Source (<<*) :: Flip p a b -> Flip p c d -> Flip p a b Source
Bifunctor p => Functor (Flip p a) Source
Methods fmap :: (b -> c) -> Flip p a b -> Flip p a c (<$) :: b -> Flip p a c -> Flip p a b
Bifoldable p => Foldable (Flip p a) Source
Methods fold :: Monoid m => Flip p a m -> m foldMap :: Monoid m => (b -> m) -> Flip p a b -> m foldr :: (b -> c -> c) -> c -> Flip p a b -> c foldr' :: (b -> c -> c) -> c -> Flip p a b -> c foldl :: (b -> c -> b) -> b -> Flip p a c -> b foldl' :: (b -> c -> b) -> b -> Flip p a c -> b foldr1 :: (b -> b -> b) -> Flip p a b -> b foldl1 :: (b -> b -> b) -> Flip p a b -> b toList :: Flip p a b -> [b] null :: Flip p a b -> Bool length :: Flip p a b -> Int elem :: Eq b => b -> Flip p a b -> Bool maximum :: Ord b => Flip p a b -> b minimum :: Ord b => Flip p a b -> b sum :: Num b => Flip p a b -> b product :: Num b => Flip p a b -> b
Bitraversable p => Traversable (Flip p a) Source
Methods traverse :: Applicative f => (b -> f c) -> Flip p a b -> f (Flip p a c) sequenceA :: Applicative f => Flip p a (f b) -> f (Flip p a b) mapM :: Monad m => (b -> m c) -> Flip p a b -> m (Flip p a c) sequence :: Monad m => Flip p a (m b) -> m (Flip p a b)
Eq (p b a) => Eq (Flip p a b) Source
Methods (==) :: Flip p a b -> Flip p a b -> Bool (/=) :: Flip p a b -> Flip p a b -> Bool
Ord (p b a) => Ord (Flip p a b) Source
Methods compare :: Flip p a b -> Flip p a b -> Ordering (<) :: Flip p a b -> Flip p a b -> Bool (<=) :: Flip p a b -> Flip p a b -> Bool (>) :: Flip p a b -> Flip p a b -> Bool (>=) :: Flip p a b -> Flip p a b -> Bool max :: Flip p a b -> Flip p a b -> Flip p a b min :: Flip p a b -> Flip p a b -> Flip p a b
Read (p b a) => Read (Flip p a b) Source
Methods readsPrec :: Int -> ReadS (Flip p a b) readList :: ReadS [Flip p a b] readPrec :: ReadPrec (Flip p a b) readListPrec :: ReadPrec [Flip p a b]
Show (p b a) => Show (Flip p a b) Source
Methods showsPrec :: Int -> Flip p a b -> ShowS show :: Flip p a b -> String showList :: [Flip p a b] -> ShowS