Modulerebase-1.21.2Haskell2010

Rebase.Data.Profunctor.Mapping

classclass (Traversing p, Closed p) => Mapping (p :: Type -> Type -> Type) where

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

Instances11Mapping, …

Mapping (FreeMapping p)Defined in profunctors-5.6.3 · Data.Profunctor.Mapping
Mapping p => Mapping (Coyoneda p)Defined in profunctors-5.6.3 · Data.Profunctor.Yoneda
Mapping p => Mapping (Yoneda p)Defined in profunctors-5.6.3 · Data.Profunctor.Yoneda
Profunctor p => Mapping (CofreeMapping p)Defined in profunctors-5.6.3 · Data.Profunctor.Mapping
(Monad m, Distributive m) => Mapping (Kleisli m)Defined in profunctors-5.6.3 · Data.Profunctor.Mapping
Mapping (->)Defined in profunctors-5.6.3 · Data.Profunctor.Mapping
(Applicative m, Distributive m) => Mapping (Star m)Defined in profunctors-5.6.3 · Data.Profunctor.Mapping
Mapping p => Mapping (WrappedProfunctor p)Defined in invariant-0.6.4 · Data.Functor.Invariant
(Functor f, Mapping p) => Mapping (Tannen f p)Defined in profunctors-5.6.3 · Data.Profunctor.Mapping
(Functor f, Mapping p) => Mapping (Cayley f p)Defined in profunctors-5.6.3 · Data.Profunctor.Cayley
(Mapping p, Mapping q) => Mapping (Procompose p q)Defined in profunctors-5.6.3 · Data.Profunctor.Composition

newtypenewtype CofreeMapping (p :: Type -> Type -> Type) a b

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

Instances9ProfunctorComonad, ProfunctorFunctor, Choice, Closed, Mapping, Strong, …

ProfunctorComonad CofreeMappingDefined in profunctors-5.6.3 · Data.Profunctor.Mapping
ProfunctorFunctor CofreeMappingDefined in profunctors-5.6.3 · Data.Profunctor.Mapping
Profunctor p => Choice (CofreeMapping p)Defined in profunctors-5.6.3 · Data.Profunctor.Mapping
Profunctor p => Closed (CofreeMapping p)Defined in profunctors-5.6.3 · Data.Profunctor.Mapping
Profunctor p => Mapping (CofreeMapping p)Defined in profunctors-5.6.3 · Data.Profunctor.Mapping
Profunctor p => Strong (CofreeMapping p)Defined in profunctors-5.6.3 · Data.Profunctor.Mapping
Profunctor p => Profunctor (CofreeMapping p)Defined in profunctors-5.6.3 · Data.Profunctor.Mapping
Profunctor p => Traversing (CofreeMapping p)Defined in profunctors-5.6.3 · Data.Profunctor.Mapping
Invariant2 p => Invariant2 (CofreeMapping p)Defined in invariant-0.6.4 · Data.Functor.Invariant
from the profunctors package

datadata FreeMapping (p :: Type -> Type -> Type) a b where

FreeMapping -| CofreeMapping

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

Instances11ProfunctorMonad, ProfunctorFunctor, Choice, Closed, Mapping, Strong, …

ProfunctorMonad FreeMappingDefined in profunctors-5.6.3 · Data.Profunctor.Mapping
ProfunctorFunctor FreeMappingDefined in profunctors-5.6.3 · Data.Profunctor.Mapping
Choice (FreeMapping p)Defined in profunctors-5.6.3 · Data.Profunctor.Mapping
Closed (FreeMapping p)Defined in profunctors-5.6.3 · Data.Profunctor.Mapping
Mapping (FreeMapping p)Defined in profunctors-5.6.3 · Data.Profunctor.Mapping
Strong (FreeMapping p)Defined in profunctors-5.6.3 · Data.Profunctor.Mapping
Profunctor (FreeMapping p)Defined in profunctors-5.6.3 · Data.Profunctor.Mapping
Traversing (FreeMapping p)Defined in profunctors-5.6.3 · Data.Profunctor.Mapping
Invariant2 (FreeMapping p)Defined in invariant-0.6.4 · Data.Functor.Invariant
from the profunctors package
Functor (FreeMapping p a)Defined in profunctors-5.6.3 · Data.Profunctor.Mapping
Invariant (FreeMapping p a)Defined in invariant-0.6.4 · Data.Functor.Invariant
from the profunctors package

valueclosedMapping :: Mapping p => p a b -> p (x -> a) (x -> b)

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

valuewanderMapping