bifunctors-5.5.4: Bifunctors
Data.Bifunctor.Sum
data Sum p q a b Source #
Constructors
Defined in Data.Bifunctor.Sum
Methods
bifmap :: (p0 :-> q) -> Sum p p0 :-> Sum p q Source #
bireturn :: p0 :-> Sum p p0 Source #
bibind :: (p0 :-> Sum p q) -> Sum p p0 :-> Sum p q Source #
bijoin :: Sum p (Sum p p0) :-> Sum p p0 Source #
Associated Types
type Rep1 (Sum p q a) :: k -> Type Source #
from1 :: Sum p q a a0 -> Rep1 (Sum p q a) a0 Source #
to1 :: Rep1 (Sum p q a) a0 -> Sum p q a a0 Source #
bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Sum p q a b -> f (Sum p q c d) Source #
bifold :: Monoid m => Sum p q m m -> m Source #
bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Sum p q a b -> m Source #
bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Sum p q a b -> c Source #
bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Sum p q a b -> c Source #
bimap :: (a -> b) -> (c -> d) -> Sum p q a c -> Sum p q b d Source #
first :: (a -> b) -> Sum p q a c -> Sum p q b c Source #
second :: (b -> c) -> Sum p q a b -> Sum p q a c Source #
(==) :: Sum p q a b -> Sum p q a b -> Bool Source #
(/=) :: Sum p q a b -> Sum p q a b -> Bool Source #
compare :: Sum p q a b -> Sum p q a b -> Ordering Source #
(<) :: Sum p q a b -> Sum p q a b -> Bool Source #
(<=) :: Sum p q a b -> Sum p q a b -> Bool Source #
(>) :: Sum p q a b -> Sum p q a b -> Bool Source #
(>=) :: Sum p q a b -> Sum p q a b -> Bool Source #
max :: Sum p q a b -> Sum p q a b -> Sum p q a b Source #
min :: Sum p q a b -> Sum p q a b -> Sum p q a b Source #
readsPrec :: Int -> ReadS (Sum p q a b) Source #
readList :: ReadS [Sum p q a b] Source #
readPrec :: ReadPrec (Sum p q a b) Source #
readListPrec :: ReadPrec [Sum p q a b] Source #
showsPrec :: Int -> Sum p q a b -> ShowS Source #
show :: Sum p q a b -> String Source #
showList :: [Sum p q a b] -> ShowS Source #
type Rep (Sum p q a b) :: Type -> Type Source #
from :: Sum p q a b -> Rep (Sum p q a b) x Source #
to :: Rep (Sum p q a b) x -> Sum p q a b Source #