Documentation

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

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

Methods

bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> WrappedBifunctor * * p a b -> f (WrappedBifunctor * * p c d) 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

Methods

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

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

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

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)

Methods

from1 :: WrappedBifunctor k * p a b -> Rep1 (WrappedBifunctor k * p a) b

to1 :: Rep1 (WrappedBifunctor k * p a) b -> WrappedBifunctor k * p a b

Methods

(==) :: WrappedBifunctor k k p a b -> WrappedBifunctor k k p a b -> Bool

(/=) :: WrappedBifunctor k k p a b -> WrappedBifunctor k k p a b -> Bool

Methods

compare :: WrappedBifunctor k k p a b -> WrappedBifunctor k k p a b -> Ordering

(<) :: WrappedBifunctor k k p a b -> WrappedBifunctor k k p a b -> Bool

(<=) :: WrappedBifunctor k k p a b -> WrappedBifunctor k k p a b -> Bool

(>) :: WrappedBifunctor k k p a b -> WrappedBifunctor k k p a b -> Bool

(>=) :: WrappedBifunctor k k p a b -> WrappedBifunctor k k p a b -> Bool

max :: WrappedBifunctor k k p a b -> WrappedBifunctor k k p a b -> WrappedBifunctor k k p a b

min :: WrappedBifunctor k k p a b -> WrappedBifunctor k k p a b -> WrappedBifunctor k k p a b

Methods

readsPrec :: Int -> ReadS (WrappedBifunctor k k p a b)

readList :: ReadS [WrappedBifunctor k k p a b]

readPrec :: ReadPrec (WrappedBifunctor k k p a b)

readListPrec :: ReadPrec [WrappedBifunctor k k p a b]

Methods

showsPrec :: Int -> WrappedBifunctor k k p a b -> ShowS

show :: WrappedBifunctor k k p a b -> String

showList :: [WrappedBifunctor k k p a b] -> ShowS

Methods

from :: WrappedBifunctor k k p a b -> Rep (WrappedBifunctor k k p a b) x

to :: Rep (WrappedBifunctor k k p a b) x -> WrappedBifunctor k k p a b