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