Data.Profunctor

Documentation

class Profunctor p where

Minimal complete definition

Nothing

Methods

dimap :: (a -> b) -> (c -> d) -> p b c -> p a d

lmap :: (a -> b) -> p b c -> p a c

rmap :: (b -> c) -> p a b -> p a c

Instances

Functor f => Profunctor (Kleisli f)

Defined in Data.Profunctor

Methods

dimap :: (a -> b) -> (c -> d) -> Kleisli f b c -> Kleisli f a d

lmap :: (a -> b) -> Kleisli f b c -> Kleisli f a c

rmap :: (b -> c) -> Kleisli f a b -> Kleisli f a c

Profunctor ((->) :: Type -> Type -> Type)

Defined in Data.Profunctor

Methods

dimap :: (a -> b) -> (c -> d) -> (b -> c) -> a -> d

lmap :: (a -> b) -> (b -> c) -> a -> c

rmap :: (b -> c) -> (a -> b) -> a -> c

Functor f => Profunctor (Cokleisli f)

Defined in Data.Profunctor

Methods

dimap :: (a -> b) -> (c -> d) -> Cokleisli f b c -> Cokleisli f a d

lmap :: (a -> b) -> Cokleisli f b c -> Cokleisli f a c

rmap :: (b -> c) -> Cokleisli f a b -> Cokleisli f a c

(^>>) :: Profunctor p => (a -> b) -> p b c -> p a c infixr 1

(>>^) :: Profunctor p => p a b -> (b -> c) -> p a c infixr 1

(<<^) :: Profunctor p => p b c -> (a -> b) -> p a c infixr 1

(^<<) :: Profunctor p => (b -> c) -> p a b -> p a c infixr 1

class Profunctor p => Strong f p where

Methods

strong :: p a₁ b₁ -> p a₂ b₂ -> p (f a₁ a₂) (f b₁ b₂)

Instances

Functor f => Strong Either (Kleisli f)

Defined in Data.Profunctor

Methods

strong :: Kleisli f a₁ b₁ -> Kleisli f a₂ b₂ -> Kleisli f (Either a₁ a₂) (Either b₁ b₂)

Applicative p => Strong (,) (Kleisli p)

Defined in Data.Profunctor

Methods

strong :: Kleisli p a₁ b₁ -> Kleisli p a₂ b₂ -> Kleisli p (a₁, a₂) (b₁, b₂)

Strong Either ((->) :: Type -> Type -> Type)

Defined in Data.Profunctor

Methods

strong :: (a₁ -> b₁) -> (a₂ -> b₂) -> Either a₁ a₂ -> Either b₁ b₂

Comonad ɯ => Strong Either (Cokleisli ɯ)

Defined in Data.Profunctor

Methods

strong :: Cokleisli ɯ a₁ b₁ -> Cokleisli ɯ a₂ b₂ -> Cokleisli ɯ (Either a₁ a₂) (Either b₁ b₂)

Strong (,) ((->) :: Type -> Type -> Type)

Defined in Data.Profunctor

Methods

strong :: (a₁ -> b₁) -> (a₂ -> b₂) -> (a₁, a₂) -> (b₁, b₂)

(***) :: Strong (,) p => p a₁ b₁ -> p a₂ b₂ -> p (a₁, a₂) (b₁, b₂) infixr 3

(&&&) :: Strong (,) p => p a b₁ -> p a b₂ -> p a (b₁, b₂) infixr 3

(+++) :: Strong Either p => p a₁ b₁ -> p a₂ b₂ -> p (Either a₁ a₂) (Either b₁ b₂) infixr 2

(|||) :: Strong Either p => p a₁ b -> p a₂ b -> p (Either a₁ a₂) b infixr 2

class Profunctor p => Costrong f p where

Minimal complete definition

Nothing

Methods

costrongL :: p (f a c) (f b c) -> p a b

costrongR :: p (f a b) (f a c) -> p b c

costrongL :: Braided f => p (f a c) (f b c) -> p a b

costrongR :: Braided f => p (f a b) (f a c) -> p b c

Instances

Monad m => Costrong Either (Kleisli m)

Defined in Data.Profunctor

Methods

costrongL :: Kleisli m (Either a c) (Either b c) -> Kleisli m a b

costrongR :: Kleisli m (Either a b) (Either a c) -> Kleisli m b c

MonadFix m => Costrong (,) (Kleisli m)

Defined in Data.Profunctor

Methods

costrongL :: Kleisli m (a, c) (b, c) -> Kleisli m a b

costrongR :: Kleisli m (a, b) (a, c) -> Kleisli m b c

Costrong Either ((->) :: Type -> Type -> Type)

Defined in Data.Profunctor

Methods

costrongL :: (Either a c -> Either b c) -> a -> b

costrongR :: (Either a b -> Either a c) -> b -> c

Functor f => Costrong Either (Cokleisli f)

Defined in Data.Profunctor

Methods

costrongL :: Cokleisli f (Either a c) (Either b c) -> Cokleisli f a b

costrongR :: Cokleisli f (Either a b) (Either a c) -> Cokleisli f b c

Costrong (,) ((->) :: Type -> Type -> Type)

Defined in Data.Profunctor

Methods

costrongL :: ((a, c) -> (b, c)) -> a -> b

costrongR :: ((a, b) -> (a, c)) -> b -> c

class Profunctor p => Closed f p where

Methods

closed :: p a b -> p (f a) (f b)

Instances

(Traversable f, Applicative p) => Closed f (Kleisli p)

Defined in Data.Profunctor

Methods

closed :: Kleisli p a b -> Kleisli p (f a) (f b)

(Cotraversable f, Functor ɯ) => Closed f (Cokleisli ɯ)

Defined in Data.Profunctor

Methods

closed :: Cokleisli ɯ a b -> Cokleisli ɯ (f a) (f b)

Functor f => Closed f ((->) :: Type -> Type -> Type)

Defined in Data.Profunctor

Methods

closed :: (a -> b) -> f a -> f b