Copyright	(c) Ross Paterson 2014
License	BSD-style (see the file LICENSE)
Maintainer	libraries@haskell.org
Stability	experimental
Portability	portable
Safe Haskell	Safe
Language	Haskell2010

Data.Functor.Sum

Description

Sums, lifted to functors.

Since: 4.9.0.0

Synopsis

data Sum f g a
- = InL (f a)
- | InR (g a)

Documentation

data Sum f g a Source #

Lifted sum of functors.

Constructors

InL (f a)

InR (g a)

Instances

Generic1 k (Sum k f g) Source #

Associated Types

type Rep1 (Sum k f g) (f :: Sum k f g -> *) :: k -> * Source #

Methods

from1 :: f a -> Rep1 (Sum k f g) f a Source #

to1 :: Rep1 (Sum k f g) f a -> f a Source #

(Functor f, Functor g) => Functor (Sum * f g) Source #

Since: 4.9.0.0

Methods

fmap :: (a -> b) -> Sum * f g a -> Sum * f g b Source #

(<$) :: a -> Sum * f g b -> Sum * f g a Source #

(Foldable f, Foldable g) => Foldable (Sum * f g) Source #

Since: 4.9.0.0

Methods

fold :: Monoid m => Sum * f g m -> m Source #

foldMap :: Monoid m => (a -> m) -> Sum * f g a -> m Source #

foldr :: (a -> b -> b) -> b -> Sum * f g a -> b Source #

foldr' :: (a -> b -> b) -> b -> Sum * f g a -> b Source #

foldl :: (b -> a -> b) -> b -> Sum * f g a -> b Source #

foldl' :: (b -> a -> b) -> b -> Sum * f g a -> b Source #

foldr1 :: (a -> a -> a) -> Sum * f g a -> a Source #

foldl1 :: (a -> a -> a) -> Sum * f g a -> a Source #

toList :: Sum * f g a -> [a] Source #

null :: Sum * f g a -> Bool Source #

length :: Sum * f g a -> Int Source #

elem :: Eq a => a -> Sum * f g a -> Bool Source #

maximum :: Ord a => Sum * f g a -> a Source #

minimum :: Ord a => Sum * f g a -> a Source #

sum :: Num a => Sum * f g a -> a Source #

product :: Num a => Sum * f g a -> a Source #

(Traversable f, Traversable g) => Traversable (Sum * f g) Source #

Since: 4.9.0.0

Methods

traverse :: Applicative f => (a -> f b) -> Sum * f g a -> f (Sum * f g b) Source #

sequenceA :: Applicative f => Sum * f g (f a) -> f (Sum * f g a) Source #

mapM :: Monad m => (a -> m b) -> Sum * f g a -> m (Sum * f g b) Source #

sequence :: Monad m => Sum * f g (m a) -> m (Sum * f g a) Source #

(Show1 f, Show1 g) => Show1 (Sum * f g) Source #

Since: 4.9.0.0

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Sum * f g a -> ShowS Source #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Sum * f g a] -> ShowS Source #

(Read1 f, Read1 g) => Read1 (Sum * f g) Source #

Since: 4.9.0.0

Methods

liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Sum * f g a) Source #

liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Sum * f g a] Source #

liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Sum * f g a) Source #

liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Sum * f g a] Source #

(Ord1 f, Ord1 g) => Ord1 (Sum * f g) Source #

Since: 4.9.0.0

Methods

liftCompare :: (a -> b -> Ordering) -> Sum * f g a -> Sum * f g b -> Ordering Source #

(Eq1 f, Eq1 g) => Eq1 (Sum * f g) Source #

Since: 4.9.0.0

Methods

liftEq :: (a -> b -> Bool) -> Sum * f g a -> Sum * f g b -> Bool Source #

(Eq1 f, Eq1 g, Eq a) => Eq (Sum * f g a) Source #

Since: 4.9.0.0

Methods

(==) :: Sum * f g a -> Sum * f g a -> Bool #

(/=) :: Sum * f g a -> Sum * f g a -> Bool #

(Data (g a), Data (f a), Typeable * k, Typeable (k -> *) g, Typeable (k -> *) f, Typeable k a) => Data (Sum k f g a) Source #

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall b. b -> c b) -> Sum k f g a -> c (Sum k f g a) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Sum k f g a) Source #

toConstr :: Sum k f g a -> Constr Source #

dataTypeOf :: Sum k f g a -> DataType Source #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (Sum k f g a)) Source #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Sum k f g a)) Source #

gmapT :: (forall b. Data b => b -> b) -> Sum k f g a -> Sum k f g a Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Sum k f g a -> r Source #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Sum k f g a -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Sum k f g a -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Sum k f g a -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Sum k f g a -> m (Sum k f g a) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Sum k f g a -> m (Sum k f g a) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Sum k f g a -> m (Sum k f g a) Source #

(Ord1 f, Ord1 g, Ord a) => Ord (Sum * f g a) Source #

Since: 4.9.0.0

Methods

compare :: Sum * f g a -> Sum * f g a -> Ordering #

(<) :: Sum * f g a -> Sum * f g a -> Bool #

(<=) :: Sum * f g a -> Sum * f g a -> Bool #

(>) :: Sum * f g a -> Sum * f g a -> Bool #

(>=) :: Sum * f g a -> Sum * f g a -> Bool #

max :: Sum * f g a -> Sum * f g a -> Sum * f g a #

min :: Sum * f g a -> Sum * f g a -> Sum * f g a #

(Read1 f, Read1 g, Read a) => Read (Sum * f g a) Source #

Since: 4.9.0.0

Methods

readsPrec :: Int -> ReadS (Sum * f g a) Source #

readList :: ReadS [Sum * f g a] Source #

readPrec :: ReadPrec (Sum * f g a) Source #

readListPrec :: ReadPrec [Sum * f g a] Source #

(Show1 f, Show1 g, Show a) => Show (Sum * f g a) Source #

Since: 4.9.0.0

Methods

showsPrec :: Int -> Sum * f g a -> ShowS Source #

show :: Sum * f g a -> String Source #

showList :: [Sum * f g a] -> ShowS Source #

Generic (Sum k f g a) Source #

Associated Types

type Rep (Sum k f g a) :: * -> * Source #

Methods

from :: Sum k f g a -> Rep (Sum k f g a) x Source #

to :: Rep (Sum k f g a) x -> Sum k f g a Source #

type Rep1 k (Sum k f g) Source #

type Rep1 k (Sum k f g) = D1 k (MetaData "Sum" "Data.Functor.Sum" "base" False) ((:+:) k (C1 k (MetaCons "InL" PrefixI False) (S1 k (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 k f))) (C1 k (MetaCons "InR" PrefixI False) (S1 k (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 k g))))

type Rep (Sum k f g a) Source #

type Rep (Sum k f g a) = D1 * (MetaData "Sum" "Data.Functor.Sum" "base" False) ((:+:) * (C1 * (MetaCons "InL" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (f a)))) (C1 * (MetaCons "InR" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (g a)))))