Safe Haskell	None
Language	Haskell2010

Fresnel.Profunctor.Traversing1

Contents

Synopsis

class Strong p => Traversing1 (p :: Type -> Type -> Type) where
- wander1 :: (forall (f :: Type -> Type). Apply f => (a -> f b) -> s -> f t) -> p a b -> p s t
dimapTraversing1 :: Traversing1 p => (a' -> a) -> (b -> b') -> p a b -> p a' b'
lmapTraversing1 :: Traversing1 p => (a' -> a) -> p a b -> p a' b
rmapTraversing1 :: Traversing1 p => (b -> b') -> p a b -> p a b'
firstTraversing1 :: Traversing1 p => p a b -> p (a, c) (b, c)
secondTraversing1 :: Traversing1 p => p a b -> p (c, a) (c, b)

Documentation

Methods

wander1 :: (forall (f :: Type -> Type). Apply f => (a -> f b) -> s -> f t) -> p a b -> p s t Source #

Instances details

Apply f => Traversing1 (OptionalStar f) Source #
Instance details Defined in Fresnel.Profunctor.Traversing1 Methods wander1 :: (forall (f0 :: Type -> Type). Apply f0 => (a -> f0 b) -> s -> f0 t) -> OptionalStar f a b -> OptionalStar f s t Source #
Apply f => Traversing1 (Star1 f) Source #
Instance details Defined in Fresnel.Profunctor.Star1 Methods wander1 :: (forall (f0 :: Type -> Type). Apply f0 => (a -> f0 b) -> s -> f0 t) -> Star1 f a b -> Star1 f s t Source #
Monad m => Traversing1 (Kleisli m) Source #
Instance details Defined in Fresnel.Profunctor.Traversing1 Methods wander1 :: (forall (f :: Type -> Type). Apply f => (a -> f b) -> s -> f t) -> Kleisli m a b -> Kleisli m s t Source #
Semigroup r => Traversing1 (Forget r :: Type -> Type -> Type) Source #
Instance details Defined in Fresnel.Profunctor.Traversing1 Methods wander1 :: (forall (f :: Type -> Type). Apply f => (a -> f b) -> s -> f t) -> Forget r a b -> Forget r s t Source #
Applicative f => Traversing1 (Star f) Source #
Instance details Defined in Fresnel.Profunctor.Traversing1 Methods wander1 :: (forall (f0 :: Type -> Type). Apply f0 => (a -> f0 b) -> s -> f0 t) -> Star f a b -> Star f s t Source #
Traversing1 (->) Source #
Instance details Defined in Fresnel.Profunctor.Traversing1 Methods wander1 :: (forall (f :: Type -> Type). Apply f => (a -> f b) -> s -> f t) -> (a -> b) -> s -> t Source #

Profunctor from Traversing1

dimapTraversing1 :: Traversing1 p => (a' -> a) -> (b -> b') -> p a b -> p a' b' Source #

lmapTraversing1 :: Traversing1 p => (a' -> a) -> p a b -> p a' b Source #

rmapTraversing1 :: Traversing1 p => (b -> b') -> p a b -> p a b' Source #

firstTraversing1 :: Traversing1 p => p a b -> p (a, c) (b, c) Source #

secondTraversing1 :: Traversing1 p => p a b -> p (c, a) (c, b) Source #