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	Haskell98

Data.Bifunctor.Wrapped

Description

Synopsis

Documentation

newtype WrappedBifunctor p a b Source #

Make a Functor over the second argument of a Bifunctor.

Constructors

WrapBifunctor
Fields unwrapBifunctor :: p a b

Instances

Bifunctor p => Bifunctor (WrappedBifunctor * * p) Source #
Methods bimap :: (a -> b) -> (c -> d) -> WrappedBifunctor * * p a c -> WrappedBifunctor * * p b d # first :: (a -> b) -> WrappedBifunctor * * p a c -> WrappedBifunctor * * p b c # second :: (b -> c) -> WrappedBifunctor * * p a b -> WrappedBifunctor * * p a c #
Bifoldable p => Bifoldable (WrappedBifunctor * * p) Source #
Methods bifold :: Monoid m => WrappedBifunctor * * p m m -> m Source # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> WrappedBifunctor * * p a b -> m Source # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> WrappedBifunctor * * p a b -> c Source # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> WrappedBifunctor * * p a b -> c Source #
Bitraversable p => Bitraversable (WrappedBifunctor * * p) Source #
Methods bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> WrappedBifunctor * * p a b -> f (WrappedBifunctor * * p c d) Source #
Biapplicative p => Biapplicative (WrappedBifunctor * * p) Source #
Methods bipure :: a -> b -> WrappedBifunctor * * p a b Source # (<<>>) :: WrappedBifunctor * p (a -> b) (c -> d) -> WrappedBifunctor * * p a c -> WrappedBifunctor * * p b d Source # (>>) :: WrappedBifunctor * p a b -> WrappedBifunctor * * p c d -> WrappedBifunctor * * p c d Source # (<<) :: WrappedBifunctor * p a b -> WrappedBifunctor * * p c d -> WrappedBifunctor * * p a b Source #
Bifunctor p => Functor (WrappedBifunctor * * p a) Source #
Methods fmap :: (a -> b) -> WrappedBifunctor * * p a a -> WrappedBifunctor * * p a b # (<$) :: a -> WrappedBifunctor * * p a b -> WrappedBifunctor * * p a a #
Bifoldable p => Foldable (WrappedBifunctor * * p a) Source #
Methods fold :: Monoid m => WrappedBifunctor * * p a m -> m # foldMap :: Monoid m => (a -> m) -> WrappedBifunctor * * p a a -> m # foldr :: (a -> b -> b) -> b -> WrappedBifunctor * * p a a -> b # foldr' :: (a -> b -> b) -> b -> WrappedBifunctor * * p a a -> b # foldl :: (b -> a -> b) -> b -> WrappedBifunctor * * p a a -> b # foldl' :: (b -> a -> b) -> b -> WrappedBifunctor * * p a a -> b # foldr1 :: (a -> a -> a) -> WrappedBifunctor * * p a a -> a # foldl1 :: (a -> a -> a) -> WrappedBifunctor * * p a a -> a # toList :: WrappedBifunctor * * p a a -> [a] # null :: WrappedBifunctor * * p a a -> Bool # length :: WrappedBifunctor * * p a a -> Int # elem :: Eq a => a -> WrappedBifunctor * * p a a -> Bool # maximum :: Ord a => WrappedBifunctor * * p a a -> a # minimum :: Ord a => WrappedBifunctor * * p a a -> a # sum :: Num a => WrappedBifunctor * * p a a -> a # product :: Num a => WrappedBifunctor * * p a a -> a #
Bitraversable p => Traversable (WrappedBifunctor * * p a) Source #
Methods traverse :: Applicative f => (a -> f b) -> WrappedBifunctor * * p a a -> f (WrappedBifunctor * * p a b) # sequenceA :: Applicative f => WrappedBifunctor * * p a (f a) -> f (WrappedBifunctor * * p a a) # mapM :: Monad m => (a -> m b) -> WrappedBifunctor * * p a a -> m (WrappedBifunctor * * p a b) # sequence :: Monad m => WrappedBifunctor * * p a (m a) -> m (WrappedBifunctor * * p a a) #
Generic1 (WrappedBifunctor * k p a) Source #
Associated Types type Rep1 (WrappedBifunctor * k p a :: * -> ) :: -> * # Methods from1 :: WrappedBifunctor * k p a a -> Rep1 (WrappedBifunctor * k p a) a # to1 :: Rep1 (WrappedBifunctor * k p a) a -> WrappedBifunctor * k p a a #
Eq (p a b) => Eq (WrappedBifunctor k1 k p a b) Source #
Methods (==) :: WrappedBifunctor k1 k p a b -> WrappedBifunctor k1 k p a b -> Bool # (/=) :: WrappedBifunctor k1 k p a b -> WrappedBifunctor k1 k p a b -> Bool #
Ord (p a b) => Ord (WrappedBifunctor k1 k p a b) Source #
Methods compare :: WrappedBifunctor k1 k p a b -> WrappedBifunctor k1 k p a b -> Ordering # (<) :: WrappedBifunctor k1 k p a b -> WrappedBifunctor k1 k p a b -> Bool # (<=) :: WrappedBifunctor k1 k p a b -> WrappedBifunctor k1 k p a b -> Bool # (>) :: WrappedBifunctor k1 k p a b -> WrappedBifunctor k1 k p a b -> Bool # (>=) :: WrappedBifunctor k1 k p a b -> WrappedBifunctor k1 k p a b -> Bool # max :: WrappedBifunctor k1 k p a b -> WrappedBifunctor k1 k p a b -> WrappedBifunctor k1 k p a b # min :: WrappedBifunctor k1 k p a b -> WrappedBifunctor k1 k p a b -> WrappedBifunctor k1 k p a b #
Read (p a b) => Read (WrappedBifunctor k1 k p a b) Source #
Methods readsPrec :: Int -> ReadS (WrappedBifunctor k1 k p a b) # readList :: ReadS [WrappedBifunctor k1 k p a b] # readPrec :: ReadPrec (WrappedBifunctor k1 k p a b) # readListPrec :: ReadPrec [WrappedBifunctor k1 k p a b] #
Show (p a b) => Show (WrappedBifunctor k1 k p a b) Source #
Methods showsPrec :: Int -> WrappedBifunctor k1 k p a b -> ShowS # show :: WrappedBifunctor k1 k p a b -> String # showList :: [WrappedBifunctor k1 k p a b] -> ShowS #
Generic (WrappedBifunctor k1 k p a b) Source #
Associated Types type Rep (WrappedBifunctor k1 k p a b) :: * -> * # Methods from :: WrappedBifunctor k1 k p a b -> Rep (WrappedBifunctor k1 k p a b) x # to :: Rep (WrappedBifunctor k1 k p a b) x -> WrappedBifunctor k1 k p a b #
type Rep1 (WrappedBifunctor * k p a) Source #
type Rep1 (WrappedBifunctor * k p a) = D1 (MetaData "WrappedBifunctor" "Data.Bifunctor.Wrapped" "bifunctors-5.5-32pcfa06LpVCOUG1IJODTZ" True) (C1 (MetaCons "WrapBifunctor" PrefixI True) (S1 (MetaSel (Just Symbol "unwrapBifunctor") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 (p a))))
type Rep (WrappedBifunctor k1 k p a b) Source #
type Rep (WrappedBifunctor k1 k p a b) = D1 (MetaData "WrappedBifunctor" "Data.Bifunctor.Wrapped" "bifunctors-5.5-32pcfa06LpVCOUG1IJODTZ" True) (C1 (MetaCons "WrapBifunctor" PrefixI True) (S1 (MetaSel (Just Symbol "unwrapBifunctor") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (p a b))))