Safe Haskell	Safe
Language	Haskell2010

Data.Profunctor.Mapping

Contents

Closed in terms of Mapping

Synopsis

Documentation

class (Traversing p, Closed p) => Mapping p where #

Minimal complete definition

map'

Methods

map' :: Functor f => p a b -> p (f a) (f b) #

Laws:

map' . rmap f ≡ rmap (fmap f) . map'
map' . map' ≡ dimap Compose getCompose . map'
dimap Identity runIdentity . map' ≡ id

Instances

Mapping (->) #
Methods map' :: Functor f => (a -> b) -> f a -> f b #
(Monad m, Distributive m) => Mapping (Kleisli m) #
Methods map' :: Functor f => Kleisli m a b -> Kleisli m (f a) (f b) #
(Applicative m, Distributive m) => Mapping (Star m) #
Methods map' :: Functor f => Star m a b -> Star m (f a) (f b) #
Mapping (FreeMapping p) #
Methods map' :: Functor f => FreeMapping p a b -> FreeMapping p (f a) (f b) #
Profunctor p => Mapping (CofreeMapping p) #
Methods map' :: Functor f => CofreeMapping p a b -> CofreeMapping p (f a) (f b) #
Mapping p => Mapping (Coyoneda p) #
Methods map' :: Functor f => Coyoneda p a b -> Coyoneda p (f a) (f b) #
Mapping p => Mapping (Yoneda p) #
Methods map' :: Functor f => Yoneda p a b -> Yoneda p (f a) (f b) #
(Mapping p, Mapping q) => Mapping (Procompose p q) #
Methods map' :: Functor f => Procompose p q a b -> Procompose p q (f a) (f b) #

newtype CofreeMapping p a b #

Constructors

CofreeMapping
Fields runCofreeMapping :: forall f. Functor f => p (f a) (f b)

Instances

ProfunctorComonad CofreeMapping #
Methods proextract :: Profunctor p => CofreeMapping p :-> p # produplicate :: Profunctor p => CofreeMapping p :-> CofreeMapping (CofreeMapping p) #
ProfunctorFunctor CofreeMapping #
Methods promap :: Profunctor p => (p :-> q) -> CofreeMapping p :-> CofreeMapping q #
Profunctor p => Profunctor (CofreeMapping p) #
Methods dimap :: (a -> b) -> (c -> d) -> CofreeMapping p b c -> CofreeMapping p a d # lmap :: (a -> b) -> CofreeMapping p b c -> CofreeMapping p a c # rmap :: (b -> c) -> CofreeMapping p a b -> CofreeMapping p a c # (#.) :: Coercible * c b => (b -> c) -> CofreeMapping p a b -> CofreeMapping p a c # (.#) :: Coercible * b a => CofreeMapping p b c -> (a -> b) -> CofreeMapping p a c #
Profunctor p => Strong (CofreeMapping p) #
Methods first' :: CofreeMapping p a b -> CofreeMapping p (a, c) (b, c) # second' :: CofreeMapping p a b -> CofreeMapping p (c, a) (c, b) #
Profunctor p => Choice (CofreeMapping p) #
Methods left' :: CofreeMapping p a b -> CofreeMapping p (Either a c) (Either b c) # right' :: CofreeMapping p a b -> CofreeMapping p (Either c a) (Either c b) #
Profunctor p => Closed (CofreeMapping p) #
Methods closed :: CofreeMapping p a b -> CofreeMapping p (x -> a) (x -> b) #
Profunctor p => Traversing (CofreeMapping p) #
Methods traverse' :: Traversable f => CofreeMapping p a b -> CofreeMapping p (f a) (f b) # wander :: (forall f. Applicative f => (a -> f b) -> s -> f t) -> CofreeMapping p a b -> CofreeMapping p s t #
Profunctor p => Mapping (CofreeMapping p) #
Methods map' :: Functor f => CofreeMapping p a b -> CofreeMapping p (f a) (f b) #

data FreeMapping p a b where #

FreeMapping -| CofreeMapping

Constructors

FreeMapping :: Functor f => (f y -> b) -> p x y -> (a -> f x) -> FreeMapping p a b

Instances

ProfunctorMonad FreeMapping #
Methods proreturn :: Profunctor p => p :-> FreeMapping p # projoin :: Profunctor p => FreeMapping (FreeMapping p) :-> FreeMapping p #
ProfunctorFunctor FreeMapping #
Methods promap :: Profunctor p => (p :-> q) -> FreeMapping p :-> FreeMapping q #
Profunctor (FreeMapping p) #
Methods dimap :: (a -> b) -> (c -> d) -> FreeMapping p b c -> FreeMapping p a d # lmap :: (a -> b) -> FreeMapping p b c -> FreeMapping p a c # rmap :: (b -> c) -> FreeMapping p a b -> FreeMapping p a c # (#.) :: Coercible * c b => (b -> c) -> FreeMapping p a b -> FreeMapping p a c # (.#) :: Coercible * b a => FreeMapping p b c -> (a -> b) -> FreeMapping p a c #
Strong (FreeMapping p) #
Methods first' :: FreeMapping p a b -> FreeMapping p (a, c) (b, c) # second' :: FreeMapping p a b -> FreeMapping p (c, a) (c, b) #
Choice (FreeMapping p) #
Methods left' :: FreeMapping p a b -> FreeMapping p (Either a c) (Either b c) # right' :: FreeMapping p a b -> FreeMapping p (Either c a) (Either c b) #
Closed (FreeMapping p) #
Methods closed :: FreeMapping p a b -> FreeMapping p (x -> a) (x -> b) #
Traversing (FreeMapping p) #
Methods traverse' :: Traversable f => FreeMapping p a b -> FreeMapping p (f a) (f b) # wander :: (forall f. Applicative f => (a -> f b) -> s -> f t) -> FreeMapping p a b -> FreeMapping p s t #
Mapping (FreeMapping p) #
Methods map' :: Functor f => FreeMapping p a b -> FreeMapping p (f a) (f b) #

Closed in terms of Mapping

traverseMapping :: (Mapping p, Functor f) => p a b -> p (f a) (f b) #

closedMapping :: Mapping p => p a b -> p (x -> a) (x -> b) #