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

Description

Synopsis

newtype WrappedBifunctor p a b = WrapBifunctor {
- unwrapBifunctor :: p a b
}

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

Instances details

Generic1 ( WrappedBifunctor p a :: k1 -> Type ) Source #
Instance details Defined in Data.Bifunctor.Wrapped Associated Types type Rep1 ( WrappedBifunctor p a) :: k -> Type Source # Methods from1 :: forall (a0 :: k). WrappedBifunctor p a a0 -> Rep1 ( WrappedBifunctor p a) a0 Source # to1 :: forall (a0 :: k). Rep1 ( WrappedBifunctor p a) a0 -> WrappedBifunctor p a a0 Source #
Bitraversable p => Bitraversable ( WrappedBifunctor p) Source #
Instance details Defined in Data.Bifunctor.Wrapped Methods bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> WrappedBifunctor p a b -> f ( WrappedBifunctor p c d) Source #
Bifoldable p => Bifoldable ( WrappedBifunctor p) Source #
Instance details Defined in Data.Bifunctor.Wrapped 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 #
Bifunctor p => Bifunctor ( WrappedBifunctor p) Source #
Instance details Defined in Data.Bifunctor.Wrapped Methods bimap :: (a -> b) -> (c -> d) -> WrappedBifunctor p a c -> WrappedBifunctor p b d Source # first :: (a -> b) -> WrappedBifunctor p a c -> WrappedBifunctor p b c Source # second :: (b -> c) -> WrappedBifunctor p a b -> WrappedBifunctor p a c Source #
Eq2 p => Eq2 ( WrappedBifunctor p) Source #
Instance details Defined in Data.Bifunctor.Wrapped Methods liftEq2 :: (a -> b -> Bool ) -> (c -> d -> Bool ) -> WrappedBifunctor p a c -> WrappedBifunctor p b d -> Bool Source #
Ord2 p => Ord2 ( WrappedBifunctor p) Source #
Instance details Defined in Data.Bifunctor.Wrapped Methods liftCompare2 :: (a -> b -> Ordering ) -> (c -> d -> Ordering ) -> WrappedBifunctor p a c -> WrappedBifunctor p b d -> Ordering Source #
Read2 p => Read2 ( WrappedBifunctor p) Source #
Instance details Defined in Data.Bifunctor.Wrapped Methods liftReadsPrec2 :: ( Int -> ReadS a) -> ReadS [a] -> ( Int -> ReadS b) -> ReadS [b] -> Int -> ReadS ( WrappedBifunctor p a b) Source # liftReadList2 :: ( Int -> ReadS a) -> ReadS [a] -> ( Int -> ReadS b) -> ReadS [b] -> ReadS [ WrappedBifunctor p a b] Source # liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec ( WrappedBifunctor p a b) Source # liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [ WrappedBifunctor p a b] Source #
Show2 p => Show2 ( WrappedBifunctor p) Source #
Instance details Defined in Data.Bifunctor.Wrapped Methods liftShowsPrec2 :: ( Int -> a -> ShowS ) -> ([a] -> ShowS ) -> ( Int -> b -> ShowS ) -> ([b] -> ShowS ) -> Int -> WrappedBifunctor p a b -> ShowS Source # liftShowList2 :: ( Int -> a -> ShowS ) -> ([a] -> ShowS ) -> ( Int -> b -> ShowS ) -> ([b] -> ShowS ) -> [ WrappedBifunctor p a b] -> ShowS Source #
Biapplicative p => Biapplicative ( WrappedBifunctor p) Source #
Instance details Defined in Data.Bifunctor.Wrapped Methods bipure :: a -> b -> WrappedBifunctor p a b Source # (<<>>) :: WrappedBifunctor p (a -> b) (c -> d) -> WrappedBifunctor p a c -> WrappedBifunctor p b d Source # biliftA2 :: (a -> b -> c) -> (d -> e -> f) -> WrappedBifunctor p a d -> WrappedBifunctor p b e -> WrappedBifunctor p c f 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 #
Instance details Defined in Data.Bifunctor.Wrapped Methods fmap :: (a0 -> b) -> WrappedBifunctor p a a0 -> WrappedBifunctor p a b Source # (<$) :: a0 -> WrappedBifunctor p a b -> WrappedBifunctor p a a0 Source #
Bifoldable p => Foldable ( WrappedBifunctor p a) Source #
Instance details Defined in Data.Bifunctor.Wrapped Methods fold :: Monoid m => WrappedBifunctor p a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> WrappedBifunctor p a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> WrappedBifunctor p a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> WrappedBifunctor p a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> WrappedBifunctor p a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> WrappedBifunctor p a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> WrappedBifunctor p a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> WrappedBifunctor p a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> WrappedBifunctor p a a0 -> a0 Source # toList :: WrappedBifunctor p a a0 -> [a0] Source # null :: WrappedBifunctor p a a0 -> Bool Source # length :: WrappedBifunctor p a a0 -> Int Source # elem :: Eq a0 => a0 -> WrappedBifunctor p a a0 -> Bool Source # maximum :: Ord a0 => WrappedBifunctor p a a0 -> a0 Source # minimum :: Ord a0 => WrappedBifunctor p a a0 -> a0 Source # sum :: Num a0 => WrappedBifunctor p a a0 -> a0 Source # product :: Num a0 => WrappedBifunctor p a a0 -> a0 Source #
Bitraversable p => Traversable ( WrappedBifunctor p a) Source #
Instance details Defined in Data.Bifunctor.Wrapped Methods traverse :: Applicative f => (a0 -> f b) -> WrappedBifunctor p a a0 -> f ( WrappedBifunctor p a b) Source # sequenceA :: Applicative f => WrappedBifunctor p a (f a0) -> f ( WrappedBifunctor p a a0) Source # mapM :: Monad m => (a0 -> m b) -> WrappedBifunctor p a a0 -> m ( WrappedBifunctor p a b) Source # sequence :: Monad m => WrappedBifunctor p a (m a0) -> m ( WrappedBifunctor p a a0) Source #
( Eq2 p, Eq a) => Eq1 ( WrappedBifunctor p a) Source #
Instance details Defined in Data.Bifunctor.Wrapped Methods liftEq :: (a0 -> b -> Bool ) -> WrappedBifunctor p a a0 -> WrappedBifunctor p a b -> Bool Source #
( Ord2 p, Ord a) => Ord1 ( WrappedBifunctor p a) Source #
Instance details Defined in Data.Bifunctor.Wrapped Methods liftCompare :: (a0 -> b -> Ordering ) -> WrappedBifunctor p a a0 -> WrappedBifunctor p a b -> Ordering Source #
( Read2 p, Read a) => Read1 ( WrappedBifunctor p a) Source #
Instance details Defined in Data.Bifunctor.Wrapped Methods liftReadsPrec :: ( Int -> ReadS a0) -> ReadS [a0] -> Int -> ReadS ( WrappedBifunctor p a a0) Source # liftReadList :: ( Int -> ReadS a0) -> ReadS [a0] -> ReadS [ WrappedBifunctor p a a0] Source # liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec ( WrappedBifunctor p a a0) Source # liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [ WrappedBifunctor p a a0] Source #
( Show2 p, Show a) => Show1 ( WrappedBifunctor p a) Source #
Instance details Defined in Data.Bifunctor.Wrapped Methods liftShowsPrec :: ( Int -> a0 -> ShowS ) -> ([a0] -> ShowS ) -> Int -> WrappedBifunctor p a a0 -> ShowS Source # liftShowList :: ( Int -> a0 -> ShowS ) -> ([a0] -> ShowS ) -> [ WrappedBifunctor p a a0] -> ShowS Source #
Eq (p a b) => Eq ( WrappedBifunctor p a b) Source #
Instance details Defined in Data.Bifunctor.Wrapped Methods (==) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool Source # (/=) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool Source #
Ord (p a b) => Ord ( WrappedBifunctor p a b) Source #
Instance details Defined in Data.Bifunctor.Wrapped Methods compare :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Ordering Source # (<) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool Source # (<=) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool Source # (>) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool Source # (>=) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool Source # max :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> WrappedBifunctor p a b Source # min :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> WrappedBifunctor p a b Source #
Read (p a b) => Read ( WrappedBifunctor p a b) Source #
Instance details Defined in Data.Bifunctor.Wrapped Methods readsPrec :: Int -> ReadS ( WrappedBifunctor p a b) Source # readList :: ReadS [ WrappedBifunctor p a b] Source # readPrec :: ReadPrec ( WrappedBifunctor p a b) Source # readListPrec :: ReadPrec [ WrappedBifunctor p a b] Source #
Show (p a b) => Show ( WrappedBifunctor p a b) Source #
Instance details Defined in Data.Bifunctor.Wrapped Methods showsPrec :: Int -> WrappedBifunctor p a b -> ShowS Source # show :: WrappedBifunctor p a b -> String Source # showList :: [ WrappedBifunctor p a b] -> ShowS Source #
Generic ( WrappedBifunctor p a b) Source #
Instance details Defined in Data.Bifunctor.Wrapped Associated Types type Rep ( WrappedBifunctor p a b) :: Type -> Type Source # Methods from :: WrappedBifunctor p a b -> Rep ( WrappedBifunctor p a b) x Source # to :: Rep ( WrappedBifunctor p a b) x -> WrappedBifunctor p a b Source #
type Rep1 ( WrappedBifunctor p a :: k1 -> Type ) Source #
Instance details Defined in Data.Bifunctor.Wrapped type Rep1 ( WrappedBifunctor p a :: k1 -> Type ) = D1 (' MetaData "WrappedBifunctor" "Data.Bifunctor.Wrapped" "bifunctors-5.5.14-4o2vxpA6iYN8K0rfLgtyzm" ' True ) ( C1 (' MetaCons "WrapBifunctor" ' PrefixI ' True ) ( S1 (' MetaSel (' Just "unwrapBifunctor") ' NoSourceUnpackedness ' NoSourceStrictness ' DecidedLazy ) ( Rec1 (p a))))
type Rep ( WrappedBifunctor p a b) Source #
Instance details Defined in Data.Bifunctor.Wrapped type Rep ( WrappedBifunctor p a b) = D1 (' MetaData "WrappedBifunctor" "Data.Bifunctor.Wrapped" "bifunctors-5.5.14-4o2vxpA6iYN8K0rfLgtyzm" ' True ) ( C1 (' MetaCons "WrapBifunctor" ' PrefixI ' True ) ( S1 (' MetaSel (' Just "unwrapBifunctor") ' NoSourceUnpackedness ' NoSourceStrictness ' DecidedLazy ) ( Rec0 (p a b))))