Data.Functor.Compose

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

Description

Composition of functors.

Since: base-4.9.0.0

newtype Compose f g a infixr 9 Source

Right-to-left composition of functors. The composition of applicative functors is always applicative, but the composition of monads is not always a monad.

Constructors

Compose infixr 9

Fields

Instances
Instances details
Functor f => Generic1 (Compose f g :: k -> Type)

Since: base-4.9.0.0
Instance details

Defined in Data.Functor.Compose

Associated Types

type Rep1 (Compose f g) :: k -> Type Source

Methods

from1 :: forall (a :: k0). Compose f g a -> Rep1 (Compose f g) a Source

to1 :: forall (a :: k0). Rep1 (Compose f g) a -> Compose f g a Source

TestEquality f => TestEquality (Compose f g :: k2 -> Type)

The deduction (via generativity) that if g x :~: g y then x :~: y.

Since: base-4.14.0.0
Instance details

Defined in Data.Functor.Compose

Methods

testEquality :: forall (a :: k) (b :: k). Compose f g a -> Compose f g b -> Maybe (a :~: b) Source

(Functor f, Functor g) => Functor (Compose f g)

Since: base-4.9.0.0
Instance details

Defined in Data.Functor.Compose

Methods

fmap :: (a -> b) -> Compose f g a -> Compose f g b Source

(<$) :: a -> Compose f g b -> Compose f g a Source

(Applicative f, Applicative g) => Applicative (Compose f g)

Since: base-4.9.0.0
Instance details

Defined in Data.Functor.Compose

Methods

pure :: a -> Compose f g a Source

(<*>) :: Compose f g (a -> b) -> Compose f g a -> Compose f g b Source

liftA2 :: (a -> b -> c) -> Compose f g a -> Compose f g b -> Compose f g c Source

(*>) :: Compose f g a -> Compose f g b -> Compose f g b Source

(<*) :: Compose f g a -> Compose f g b -> Compose f g a Source

(Foldable f, Foldable g) => Foldable (Compose f g)

Since: base-4.9.0.0
Instance details

Defined in Data.Functor.Compose

Methods

fold :: Monoid m => Compose f g m -> m Source

foldMap :: Monoid m => (a -> m) -> Compose f g a -> m Source

foldMap' :: Monoid m => (a -> m) -> Compose f g a -> m Source

foldr :: (a -> b -> b) -> b -> Compose f g a -> b Source

foldr' :: (a -> b -> b) -> b -> Compose f g a -> b Source

foldl :: (b -> a -> b) -> b -> Compose f g a -> b Source

foldl' :: (b -> a -> b) -> b -> Compose f g a -> b Source

foldr1 :: (a -> a -> a) -> Compose f g a -> a Source

foldl1 :: (a -> a -> a) -> Compose f g a -> a Source

toList :: Compose f g a -> [a] Source

null :: Compose f g a -> Bool Source

length :: Compose f g a -> Int Source

elem :: Eq a => a -> Compose f g a -> Bool Source

maximum :: Ord a => Compose f g a -> a Source

minimum :: Ord a => Compose f g a -> a Source

sum :: Num a => Compose f g a -> a Source

product :: Num a => Compose f g a -> a Source

(Traversable f, Traversable g) => Traversable (Compose f g)

Since: base-4.9.0.0
Instance details

Defined in Data.Functor.Compose

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Compose f g a -> f0 (Compose f g b) Source

sequenceA :: Applicative f0 => Compose f g (f0 a) -> f0 (Compose f g a) Source

mapM :: Monad m => (a -> m b) -> Compose f g a -> m (Compose f g b) Source

sequence :: Monad m => Compose f g (m a) -> m (Compose f g a) Source

(Alternative f, Applicative g) => Alternative (Compose f g)

Since: base-4.9.0.0
Instance details

Defined in Data.Functor.Compose

Methods

empty :: Compose f g a Source

(<|>) :: Compose f g a -> Compose f g a -> Compose f g a Source

some :: Compose f g a -> Compose f g [a] Source

many :: Compose f g a -> Compose f g [a] Source

(Show1 f, Show1 g) => Show1 (Compose f g)

Since: base-4.9.0.0
Instance details

Defined in Data.Functor.Compose

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Compose f g a -> ShowS Source

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Compose f g a] -> ShowS Source

(Read1 f, Read1 g) => Read1 (Compose f g)

Since: base-4.9.0.0
Instance details

Defined in Data.Functor.Compose

Methods

liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Compose f g a) Source

liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Compose f g a] Source

liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Compose f g a) Source

liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Compose f g a] Source

(Ord1 f, Ord1 g) => Ord1 (Compose f g)

Since: base-4.9.0.0
Instance details

Defined in Data.Functor.Compose

Methods

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

(Eq1 f, Eq1 g) => Eq1 (Compose f g)

Since: base-4.9.0.0
Instance details

Defined in Data.Functor.Compose

Methods

liftEq :: (a -> b -> Bool) -> Compose f g a -> Compose f g b -> Bool Source

(Functor f, Contravariant g) => Contravariant (Compose f g)
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> Compose f g b -> Compose f g a Source

(>$) :: b -> Compose f g b -> Compose f g a Source

(Eq1 f, Eq1 g, Eq a) => Eq (Compose f g a)

Since: base-4.9.0.0
Instance details

Defined in Data.Functor.Compose

Methods

(==) :: Compose f g a -> Compose f g a -> Bool Source

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

(Typeable a, Typeable f, Typeable g, Typeable k1, Typeable k2, Data (f (g a))) => Data (Compose f g a)

Since: base-4.9.0.0
Instance details

Defined in Data.Functor.Compose

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g0. g0 -> c g0) -> Compose f g a -> c (Compose f g a) Source

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

toConstr :: Compose f g a -> Constr Source

dataTypeOf :: Compose f g a -> DataType Source

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Compose f g a)) Source

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

gmapT :: (forall b. Data b => b -> b) -> Compose f g a -> Compose f g a Source

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

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

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

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

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

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

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

(Ord1 f, Ord1 g, Ord a) => Ord (Compose f g a)

Since: base-4.9.0.0
Instance details

Defined in Data.Functor.Compose

Methods

compare :: Compose f g a -> Compose f g a -> Ordering Source

(<) :: Compose f g a -> Compose f g a -> Bool Source

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

(>) :: Compose f g a -> Compose f g a -> Bool Source

(>=) :: Compose f g a -> Compose f g a -> Bool Source

max :: Compose f g a -> Compose f g a -> Compose f g a Source

min :: Compose f g a -> Compose f g a -> Compose f g a Source

(Read1 f, Read1 g, Read a) => Read (Compose f g a)

Since: base-4.9.0.0
Instance details

Defined in Data.Functor.Compose

Methods

readsPrec :: Int -> ReadS (Compose f g a) Source

readList :: ReadS [Compose f g a] Source

readPrec :: ReadPrec (Compose f g a) Source

readListPrec :: ReadPrec [Compose f g a] Source

(Show1 f, Show1 g, Show a) => Show (Compose f g a)

Since: base-4.9.0.0
Instance details

Defined in Data.Functor.Compose

Methods

showsPrec :: Int -> Compose f g a -> ShowS Source

show :: Compose f g a -> String Source

showList :: [Compose f g a] -> ShowS Source

Generic (Compose f g a)

Since: base-4.9.0.0
Instance details

Defined in Data.Functor.Compose

Associated Types

type Rep (Compose f g a) :: Type -> Type Source

Methods

from :: Compose f g a -> Rep (Compose f g a) x Source

to :: Rep (Compose f g a) x -> Compose f g a Source

type Rep1 (Compose f g :: k -> Type)
Instance details

Defined in Data.Functor.Compose

type Rep1 (Compose f g :: k -> Type) = D1 ('MetaData "Compose" "Data.Functor.Compose" "base" 'True) (C1 ('MetaCons "Compose" 'PrefixI 'True) (S1 ('MetaSel ('Just "getCompose") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (f :.: Rec1 g)))
type Rep (Compose f g a)
Instance details

Defined in Data.Functor.Compose

type Rep (Compose f g a) = D1 ('MetaData "Compose" "Data.Functor.Compose" "base" 'True) (C1 ('MetaCons "Compose" 'PrefixI 'True) (S1 ('MetaSel ('Just "getCompose") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (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.10.2/docs/html/libraries/base-4.14.1.0/Data-Functor-Compose.html