bifunctors-5.5.1: Bifunctors

Copyright(C) 2008-2016 Edward Kmett
LicenseBSD-style (see the file LICENSE)
MaintainerEdward Kmett <ekmett@gmail.com>
Stabilityprovisional
Portabilityportable
Safe HaskellSafe
LanguageHaskell98

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

Instances

Generic1 k1 (WrappedBifunctor k2 k1 p a) Source # 

Associated Types

type Rep1 (WrappedBifunctor k2 k1 p a) (f :: WrappedBifunctor k2 k1 p a -> *) :: k -> * #

Methods

from1 :: f a -> Rep1 (WrappedBifunctor k2 k1 p a) f a #

to1 :: Rep1 (WrappedBifunctor k2 k1 p a) f a -> f a #

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) #

Bifoldable p => Bifoldable (WrappedBifunctor * * p) Source # 

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 #

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 #

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) #

Eq (p a b) => Eq (WrappedBifunctor k1 k2 p a b) Source # 

Methods

(==) :: WrappedBifunctor k1 k2 p a b -> WrappedBifunctor k1 k2 p a b -> Bool #

(/=) :: WrappedBifunctor k1 k2 p a b -> WrappedBifunctor k1 k2 p a b -> Bool #

Ord (p a b) => Ord (WrappedBifunctor k1 k2 p a b) Source # 

Methods

compare :: WrappedBifunctor k1 k2 p a b -> WrappedBifunctor k1 k2 p a b -> Ordering #

(<) :: WrappedBifunctor k1 k2 p a b -> WrappedBifunctor k1 k2 p a b -> Bool #

(<=) :: WrappedBifunctor k1 k2 p a b -> WrappedBifunctor k1 k2 p a b -> Bool #

(>) :: WrappedBifunctor k1 k2 p a b -> WrappedBifunctor k1 k2 p a b -> Bool #

(>=) :: WrappedBifunctor k1 k2 p a b -> WrappedBifunctor k1 k2 p a b -> Bool #

max :: WrappedBifunctor k1 k2 p a b -> WrappedBifunctor k1 k2 p a b -> WrappedBifunctor k1 k2 p a b #

min :: WrappedBifunctor k1 k2 p a b -> WrappedBifunctor k1 k2 p a b -> WrappedBifunctor k1 k2 p a b #

Read (p a b) => Read (WrappedBifunctor k1 k2 p a b) Source # 

Methods

readsPrec :: Int -> ReadS (WrappedBifunctor k1 k2 p a b) #

readList :: ReadS [WrappedBifunctor k1 k2 p a b] #

readPrec :: ReadPrec (WrappedBifunctor k1 k2 p a b) #

readListPrec :: ReadPrec [WrappedBifunctor k1 k2 p a b] #

Show (p a b) => Show (WrappedBifunctor k1 k2 p a b) Source # 

Methods

showsPrec :: Int -> WrappedBifunctor k1 k2 p a b -> ShowS #

show :: WrappedBifunctor k1 k2 p a b -> String #

showList :: [WrappedBifunctor k1 k2 p a b] -> ShowS #

Generic (WrappedBifunctor k1 k2 p a b) Source # 

Associated Types

type Rep (WrappedBifunctor k1 k2 p a b) :: * -> * #

Methods

from :: WrappedBifunctor k1 k2 p a b -> Rep (WrappedBifunctor k1 k2 p a b) x #

to :: Rep (WrappedBifunctor k1 k2 p a b) x -> WrappedBifunctor k1 k2 p a b #

type Rep1 k1 (WrappedBifunctor k2 k1 p a) Source # 
type Rep1 k1 (WrappedBifunctor k2 k1 p a) = D1 k1 (MetaData "WrappedBifunctor" "Data.Bifunctor.Wrapped" "bifunctors-5.5.1-Hd2UXQIBBQJ5NmYijuocPa" True) (C1 k1 (MetaCons "WrapBifunctor" PrefixI True) (S1 k1 (MetaSel (Just Symbol "unwrapBifunctor") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 k1 (p a))))
type Rep (WrappedBifunctor k1 k2 p a b) Source # 
type Rep (WrappedBifunctor k1 k2 p a b) = D1 * (MetaData "WrappedBifunctor" "Data.Bifunctor.Wrapped" "bifunctors-5.5.1-Hd2UXQIBBQJ5NmYijuocPa" True) (C1 * (MetaCons "WrapBifunctor" PrefixI True) (S1 * (MetaSel (Just Symbol "unwrapBifunctor") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (p a b))))