Data.Functor.Contravariant

# Documentation

class Functor f where Source #

Minimal complete definition

gmap

Methods

gmap :: (a -> b) -> f b -> f a Source #

(>$) :: b -> f b -> f a Source # Instances  Source # Methodsgmap :: (a -> b) -> Proxy * b -> Proxy * a Source #(>$) :: b -> Proxy * b -> Proxy * a Source # Functor (Op2 a) Source # Methodsgmap :: (a -> b) -> Op2 a b -> Op2 a a Source #(>$) :: b -> Op2 a b -> Op2 a a Source # Functor (Op1 a) Source # Methodsgmap :: (a -> b) -> Op1 a b -> Op1 a a Source #(>$) :: b -> Op1 a b -> Op1 a a Source # Source # Methodsgmap :: (a -> b) -> Const * a b -> Const * a a Source #(>$) :: b -> Const * a b -> Const * a a Source # Functor f => Functor (Alt * f) Source # Methodsgmap :: (a -> b) -> Alt * f b -> Alt * f a Source #(>$) :: b -> Alt * f b -> Alt * f a Source # Functor f => Functor (Reverse * f) Source # Methodsgmap :: (a -> b) -> Reverse * f b -> Reverse * f a Source #(>$) :: b -> Reverse * f b -> Reverse * f a Source # Functor f => Functor (Backwards * f) Source # Methodsgmap :: (a -> b) -> Backwards * f b -> Backwards * f a Source #(>$) :: b -> Backwards * f b -> Backwards * f a Source # Functor f => Functor (WriterT w f) Source # Methodsgmap :: (a -> b) -> WriterT w f b -> WriterT w f a Source #(>$) :: b -> WriterT w f b -> WriterT w f a Source # Functor f => Functor (StateT s f) Source # Methodsgmap :: (a -> b) -> StateT s f b -> StateT s f a Source #(>$) :: b -> StateT s f b -> StateT s f a Source # Functor f => Functor (ExceptT e f) Source # Methodsgmap :: (a -> b) -> ExceptT e f b -> ExceptT e f a Source #(>$) :: b -> ExceptT e f b -> ExceptT e f a Source # (Functor f, Functor g) => Functor (Sum * f g) Source # Methodsgmap :: (a -> b) -> Sum * f g b -> Sum * f g a Source #(>$) :: b -> Sum * f g b -> Sum * f g a Source # (Functor f, Functor g) => Functor (Product * f g) Source # Methodsgmap :: (a -> b) -> Product * f g b -> Product * f g a Source #(>$) :: b -> Product * f g b -> Product * f g a Source # Functor f => Functor (ReaderT * r f) Source # Methodsgmap :: (a -> b) -> ReaderT * r f b -> ReaderT * r f a Source #(>$) :: b -> ReaderT * r f b -> ReaderT * r f a Source #

(>$<) :: Functor f => (a -> b) -> f b -> f a Source # newtype Op1 b a Source # Constructors  Op1 Fieldsop1 :: a -> b Instances  Functor (Op1 a) Source # Methodsgmap :: (a -> b) -> Op1 a b -> Op1 a a Source #(>$) :: b -> Op1 a b -> Op1 a a Source #

newtype Op2 b a Source #

Constructors

 Op2 Fieldsop2 :: a -> a -> b

Instances

 Functor (Op2 a) Source # Methodsgmap :: (a -> b) -> Op2 a b -> Op2 a a Source #(>\$) :: b -> Op2 a b -> Op2 a a Source #