bifunctors-5: Bifunctors

Copyright(C) 2008-2015 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

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

bisequenceA :: Applicative f => WrappedBifunctor p (f a) (f b) -> f (WrappedBifunctor p a b) Source

bimapM :: Monad m => (a -> m c) -> (b -> m d) -> WrappedBifunctor p a b -> m (WrappedBifunctor p c d) Source

bisequence :: Monad m => WrappedBifunctor p (m a) (m b) -> m (WrappedBifunctor p a b) Source

Biapplicative p => Biapplicative (WrappedBifunctor p) Source 
Bifunctor p => Functor (WrappedBifunctor p a) Source 

Methods

fmap :: (b -> c) -> WrappedBifunctor p a b -> WrappedBifunctor p a c

(<$) :: b -> WrappedBifunctor p a c -> WrappedBifunctor p a b

Bifoldable p => Foldable (WrappedBifunctor p a) Source 

Methods

fold :: Monoid m => WrappedBifunctor p a m -> m

foldMap :: Monoid m => (b -> m) -> WrappedBifunctor p a b -> m

foldr :: (b -> c -> c) -> c -> WrappedBifunctor p a b -> c

foldr' :: (b -> c -> c) -> c -> WrappedBifunctor p a b -> c

foldl :: (b -> c -> b) -> b -> WrappedBifunctor p a c -> b

foldl' :: (b -> c -> b) -> b -> WrappedBifunctor p a c -> b

foldr1 :: (b -> b -> b) -> WrappedBifunctor p a b -> b

foldl1 :: (b -> b -> b) -> WrappedBifunctor p a b -> b

toList :: WrappedBifunctor p a b -> [b]

null :: WrappedBifunctor p a b -> Bool

length :: WrappedBifunctor p a b -> Int

elem :: Eq b => b -> WrappedBifunctor p a b -> Bool

maximum :: Ord b => WrappedBifunctor p a b -> b

minimum :: Ord b => WrappedBifunctor p a b -> b

sum :: Num b => WrappedBifunctor p a b -> b

product :: Num b => WrappedBifunctor p a b -> b

Bitraversable p => Traversable (WrappedBifunctor p a) Source 

Methods

traverse :: Applicative f => (b -> f c) -> WrappedBifunctor p a b -> f (WrappedBifunctor p a c)

sequenceA :: Applicative f => WrappedBifunctor p a (f b) -> f (WrappedBifunctor p a b)

mapM :: Monad m => (b -> m c) -> WrappedBifunctor p a b -> m (WrappedBifunctor p a c)

sequence :: Monad m => WrappedBifunctor p a (m b) -> m (WrappedBifunctor p a b)

Eq (p a b) => Eq (WrappedBifunctor p a b) Source 

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 
Read (p a b) => Read (WrappedBifunctor p a b) Source 
Show (p a b) => Show (WrappedBifunctor p a b) Source