Copyright | (C) 2015-2018 Edward Kmett |
---|---|
License | BSD-style (see the file LICENSE) |
Maintainer | Edward Kmett <ekmett@gmail.com> |
Stability | experimental |
Portability | portable |
Safe Haskell | Safe |
Language | Haskell2010 |
Data.Profunctor.Mapping
Description
Synopsis
- class (Traversing p, Closed p) => Mapping p where
- newtype CofreeMapping p a b = CofreeMapping {
- runCofreeMapping :: forall f. Functor f => p (f a) (f b)
- data FreeMapping p a b where
- FreeMapping :: Functor f => (f y -> b) -> p x y -> (a -> f x) -> FreeMapping p a b
- wanderMapping :: Mapping p => (forall f. Applicative f => (a -> f b) -> s -> f t) -> p a b -> p s t
- traverseMapping :: (Mapping p, Functor f) => p a b -> p (f a) (f b)
- closedMapping :: Mapping p => p a b -> p (x -> a) (x -> b)
Documentation
class (Traversing p, Closed p) => Mapping p where Source #
Minimal complete definition
Nothing
Methods
Instances
(Monad m, Distributive m) => Mapping (Kleisli m) Source # | |
Profunctor p => Mapping (CofreeMapping p) Source # | |
Defined in Data.Profunctor.Mapping Methods map' :: Functor f => CofreeMapping p a b -> CofreeMapping p (f a) (f b) Source # roam :: ((a -> b) -> s -> t) -> CofreeMapping p a b -> CofreeMapping p s t Source # | |
Mapping (FreeMapping p) Source # | |
Defined in Data.Profunctor.Mapping Methods map' :: Functor f => FreeMapping p a b -> FreeMapping p (f a) (f b) Source # roam :: ((a -> b) -> s -> t) -> FreeMapping p a b -> FreeMapping p s t Source # | |
Mapping p => Mapping (Coyoneda p) Source # | |
Mapping p => Mapping (Yoneda p) Source # | |
(Applicative m, Distributive m) => Mapping (Star m) Source # | |
Mapping (->) Source # | |
(Functor f, Mapping p) => Mapping (Tannen f p) Source # | |
(Functor f, Mapping p) => Mapping (Cayley f p) Source # | |
(Mapping p, Mapping q) => Mapping (Procompose p q) Source # | |
Defined in Data.Profunctor.Composition Methods map' :: Functor f => Procompose p q a b -> Procompose p q (f a) (f b) Source # roam :: ((a -> b) -> s -> t) -> Procompose p q a b -> Procompose p q s t Source # |
newtype CofreeMapping p a b Source #
Constructors
CofreeMapping | |
Fields
|
Instances
data FreeMapping p a b where Source #
FreeMapping -| CofreeMapping
Constructors
FreeMapping :: Functor f => (f y -> b) -> p x y -> (a -> f x) -> FreeMapping p a b |
Instances
ProfunctorMonad FreeMapping Source # | |
Defined in Data.Profunctor.Mapping Methods proreturn :: forall (p :: Type -> Type -> Type). Profunctor p => p :-> FreeMapping p Source # projoin :: forall (p :: Type -> Type -> Type). Profunctor p => FreeMapping (FreeMapping p) :-> FreeMapping p Source # | |
ProfunctorFunctor FreeMapping Source # | |
Defined in Data.Profunctor.Mapping Methods promap :: forall (p :: Type -> Type -> Type) (q :: Type -> Type -> Type). Profunctor p => (p :-> q) -> FreeMapping p :-> FreeMapping q Source # | |
Choice (FreeMapping p) Source # | |
Defined in Data.Profunctor.Mapping Methods left' :: FreeMapping p a b -> FreeMapping p (Either a c) (Either b c) Source # right' :: FreeMapping p a b -> FreeMapping p (Either c a) (Either c b) Source # | |
Closed (FreeMapping p) Source # | |
Defined in Data.Profunctor.Mapping Methods closed :: FreeMapping p a b -> FreeMapping p (x -> a) (x -> b) Source # | |
Mapping (FreeMapping p) Source # | |
Defined in Data.Profunctor.Mapping Methods map' :: Functor f => FreeMapping p a b -> FreeMapping p (f a) (f b) Source # roam :: ((a -> b) -> s -> t) -> FreeMapping p a b -> FreeMapping p s t Source # | |
Strong (FreeMapping p) Source # | |
Defined in Data.Profunctor.Mapping Methods first' :: FreeMapping p a b -> FreeMapping p (a, c) (b, c) Source # second' :: FreeMapping p a b -> FreeMapping p (c, a) (c, b) Source # | |
Traversing (FreeMapping p) Source # | |
Defined in Data.Profunctor.Mapping Methods traverse' :: Traversable f => FreeMapping p a b -> FreeMapping p (f a) (f b) Source # wander :: (forall (f :: Type -> Type). Applicative f => (a -> f b) -> s -> f t) -> FreeMapping p a b -> FreeMapping p s t Source # | |
Profunctor (FreeMapping p) Source # | |
Defined in Data.Profunctor.Mapping Methods dimap :: (a -> b) -> (c -> d) -> FreeMapping p b c -> FreeMapping p a d Source # lmap :: (a -> b) -> FreeMapping p b c -> FreeMapping p a c Source # rmap :: (b -> c) -> FreeMapping p a b -> FreeMapping p a c Source # (#.) :: forall a b c q. Coercible c b => q b c -> FreeMapping p a b -> FreeMapping p a c Source # (.#) :: forall a b c q. Coercible b a => FreeMapping p b c -> q a b -> FreeMapping p a c Source # | |
Functor (FreeMapping p a) Source # | |
Defined in Data.Profunctor.Mapping Methods fmap :: (a0 -> b) -> FreeMapping p a a0 -> FreeMapping p a b (<$) :: a0 -> FreeMapping p a b -> FreeMapping p a a0 |
Traversing in terms of Mapping
wanderMapping :: Mapping p => (forall f. Applicative f => (a -> f b) -> s -> f t) -> p a b -> p s t Source #
Closed in terms of Mapping
traverseMapping :: (Mapping p, Functor f) => p a b -> p (f a) (f b) Source #
closedMapping :: Mapping p => p a b -> p (x -> a) (x -> b) Source #