W3cubDocs

/Haskell 8

Data.Functor.Sum

Copyright (c) Ross Paterson 2014
License BSD-style (see the file LICENSE)
Maintainer [email protected]
Stability experimental
Portability portable
Safe Haskell Safe
Language Haskell2010

Description

Sums, lifted to functors.

Since: 4.9.0.0

data Sum f g a Source

Lifted sum of functors.

Constructors

InL (f a)
InR (g a)

Instances

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

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)

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)

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

Generic1 (Sum * f g)

Associated Types

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

Methods

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

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

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

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)

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

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

Methods

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

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

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)

Methods

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

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

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

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)

Methods

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

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

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

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

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

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

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

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

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)

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)

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 (Sum * f g)
type Rep (Sum k f g a)

© The University of Glasgow and others
Licensed under a BSD-style license (see top of the page).
https://downloads.haskell.org/~ghc/8.0.1/docs/html/libraries/base-4.9.0.0/Data-Functor-Sum.html