bifunctors-5.4.1: Bifunctors

Safe Haskell | Safe
Language | Haskell98

Data.Bifunctor.Sum

# Documentation

data Sum p q a b #

Constructors

L2 (p a b) |
R2 (q a b) |

Instances

BifunctorFunctor k k1 k k1 (Sum k k1 p) # |
Methods bifmap :: (Sum k k1 p :-> k) p q -> (k :-> k) (t p) (t q) #
BifunctorMonad k k1 (Sum k k1 p) # |
Methods bireturn :: p a b -> t p a b # bibind :: (Sum k k1 p :-> k) p (t q) -> (Sum k k1 p :-> k) (t p) (t q) # bijoin :: t (t p) a b -> t p a b #
(Bifunctor p, Bifunctor q) => Bifunctor (Sum * * p q) # |
Methods bimap :: (a -> b) -> (c -> d) -> Sum * * p q a c -> Sum * * p q b d # first :: (a -> b) -> Sum * * p q a c -> Sum * * p q b c # second :: (b -> c) -> Sum * * p q a b -> Sum * * p q a c #
(Bifoldable p, Bifoldable q) => Bifoldable (Sum * * p q) # |
Methods bifold :: Monoid m => Sum * * p q m m -> m # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Sum * * p q a b -> m # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Sum * * p q a b -> c # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Sum * * p q a b -> c #
(Bitraversable p, Bitraversable q) => Bitraversable (Sum * * p q) # |
Methods bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Sum * * p q a b -> f (Sum * * p q c d) #
Generic1 (Sum k * p q a) # |
Associated Types type Rep1 (Sum k * p q a :: * -> *) :: * -> * # Methods from1 :: Sum k * p q a a -> Rep1 (Sum k * p q a) a # to1 :: Rep1 (Sum k * p q a) a -> Sum k * p q a a #
(Eq (p a b), Eq (q a b)) => Eq (Sum k k1 p q a b) # |
Methods (==) :: Sum k k1 p q a b -> Sum k k1 p q a b -> Bool # (/=) :: Sum k k1 p q a b -> Sum k k1 p q a b -> Bool #
(Ord (p a b), Ord (q a b)) => Ord (Sum k k1 p q a b) # |
Methods compare :: Sum k k1 p q a b -> Sum k k1 p q a b -> Ordering # (<) :: Sum k k1 p q a b -> Sum k k1 p q a b -> Bool # (<=) :: Sum k k1 p q a b -> Sum k k1 p q a b -> Bool # (>) :: Sum k k1 p q a b -> Sum k k1 p q a b -> Bool # (>=) :: Sum k k1 p q a b -> Sum k k1 p q a b -> Bool # max :: Sum k k1 p q a b -> Sum k k1 p q a b -> Sum k k1 p q a b # min :: Sum k k1 p q a b -> Sum k k1 p q a b -> Sum k k1 p q a b #
(Read (p a b), Read (q a b)) => Read (Sum k k1 p q a b) # |
Methods readsPrec :: Int -> ReadS (Sum k k1 p q a b) # readList :: ReadS [Sum k k1 p q a b] # readPrec :: ReadPrec (Sum k k1 p q a b) # readListPrec :: ReadPrec [Sum k k1 p q a b] #
(Show (p a b), Show (q a b)) => Show (Sum k k1 p q a b) # |
Methods showsPrec :: Int -> Sum k k1 p q a b -> ShowS # show :: Sum k k1 p q a b -> String # showList :: [Sum k k1 p q a b] -> ShowS #
Generic (Sum k k1 p q a b) # |
Associated Types type Rep (Sum k k1 p q a b) :: * -> * # Methods from :: Sum k k1 p q a b -> Rep (Sum k k1 p q a b) x # to :: Rep (Sum k k1 p q a b) x -> Sum k k1 p q a b #
type Rep1 (Sum k * p q a) # |
type Rep1 (Sum k * p q a) = D1 (MetaData "Sum" "Data.Bifunctor.Sum" "bifunctors-5.4.1-Ac6G6TmMVPE36jXOz0jDKq" False) ((:+:) (C1 (MetaCons "L2" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 (p a)))) (C1 (MetaCons "R2" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 (q a)))))
type Rep (Sum k k1 p q a b) # |
type Rep (Sum k k1 p q a b) = D1 (MetaData "Sum" "Data.Bifunctor.Sum" "bifunctors-5.4.1-Ac6G6TmMVPE36jXOz0jDKq" False) ((:+:) (C1 (MetaCons "L2" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (p a b)))) (C1 (MetaCons "R2" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (q a b)))))