Moduleprofunctors-5.6.3Haskell2010

Data.Profunctor.Traversing

2 types
1 class
7 values

Packageprofunctors-5.6.3
Exports10
LanguageHaskell2010
LicenceBSD-3-Clause
SourceTraversing.hs

classclass (Choice p, Strong p) => Traversing (p :: Type -> Type -> Type) where

Note: Definitions in terms of wander are much more efficient!

Methods

traverse' :: Traversable f => p a b -> p (f a) (f b)

Laws:

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

wander :: (forall (f :: Type -> Type). Applicative f => (a -> f b) -> s -> f t) -> p a b -> p s t
This combinator is mutually defined in terms of traverse'

Instances13Traversing, …

Monad m => Traversing (Kleisli m)Defined in profunctors-5.6.3 · Data.Profunctor.Traversing
Traversing (FreeMapping p)Defined in profunctors-5.6.3 · Data.Profunctor.Mapping
Traversing (FreeTraversing p)Defined in profunctors-5.6.3 · Data.Profunctor.Traversing
Traversing p => Traversing (Coyoneda p)Defined in profunctors-5.6.3 · Data.Profunctor.Yoneda
Traversing p => Traversing (Yoneda p)Defined in profunctors-5.6.3 · Data.Profunctor.Yoneda
Profunctor p => Traversing (CofreeMapping p)Defined in profunctors-5.6.3 · Data.Profunctor.Mapping
Profunctor p => Traversing (CofreeTraversing p)Defined in profunctors-5.6.3 · Data.Profunctor.Traversing
Applicative m => Traversing (Star m)Defined in profunctors-5.6.3 · Data.Profunctor.Traversing
Monoid m => Traversing (Forget m)Defined in profunctors-5.6.3 · Data.Profunctor.Traversing
Traversing (->)Defined in profunctors-5.6.3 · Data.Profunctor.Traversing
(Functor f, Traversing p) => Traversing (Tannen f p)Defined in profunctors-5.6.3 · Data.Profunctor.Traversing
(Functor f, Traversing p) => Traversing (Cayley f p)Defined in profunctors-5.6.3 · Data.Profunctor.Cayley
(Traversing p, Traversing q) => Traversing (Procompose p q)Defined in profunctors-5.6.3 · Data.Profunctor.Composition

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

Constructors

CofreeTraversing
- runCofreeTraversing :: forall (f :: Type -> Type). Traversable f => p (f a) (f b)

Instances6ProfunctorComonad, ProfunctorFunctor, Choice, Strong, Profunctor, Traversing

ProfunctorComonad CofreeTraversingDefined in profunctors-5.6.3 · Data.Profunctor.Traversing
ProfunctorFunctor CofreeTraversingDefined in profunctors-5.6.3 · Data.Profunctor.Traversing
Profunctor p => Choice (CofreeTraversing p)Defined in profunctors-5.6.3 · Data.Profunctor.Traversing
Profunctor p => Strong (CofreeTraversing p)Defined in profunctors-5.6.3 · Data.Profunctor.Traversing
Profunctor p => Profunctor (CofreeTraversing p)Defined in profunctors-5.6.3 · Data.Profunctor.Traversing
Profunctor p => Traversing (CofreeTraversing p)Defined in profunctors-5.6.3 · Data.Profunctor.Traversing

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

FreeTraversing -| CofreeTraversing

Constructors

FreeTraversing :: Traversable f => (f y -> b) -> p x y -> (a -> f x) -> FreeTraversing p a b

Instances7ProfunctorMonad, ProfunctorFunctor, Choice, Strong, Profunctor, Traversing, …

ProfunctorMonad FreeTraversingDefined in profunctors-5.6.3 · Data.Profunctor.Traversing
ProfunctorFunctor FreeTraversingDefined in profunctors-5.6.3 · Data.Profunctor.Traversing
Choice (FreeTraversing p)Defined in profunctors-5.6.3 · Data.Profunctor.Traversing
Strong (FreeTraversing p)Defined in profunctors-5.6.3 · Data.Profunctor.Traversing
Profunctor (FreeTraversing p)Defined in profunctors-5.6.3 · Data.Profunctor.Traversing
Traversing (FreeTraversing p)Defined in profunctors-5.6.3 · Data.Profunctor.Traversing
Functor (FreeTraversing p a)Defined in profunctors-5.6.3 · Data.Profunctor.Traversing

Profunctor in terms of Traversing

3 declarations

valuedimapWandering :: Traversing p => (a' -> a) -> (b -> b') -> p a b -> p a' b'

A definition of dimap for Traversing instances that define an explicit wander.

valuelmapWandering :: Traversing p => (a -> b) -> p b c -> p a c

lmapWandering may be a more efficient implementation of lmap than the default produced from dimapWandering.

valuermapWandering :: Traversing p => (b -> c) -> p a b -> p a c

rmapWandering is the same as the default produced from dimapWandering.

Strong in terms of Traversing

2 declarations

valuefirstTraversing :: Traversing p => p a b -> p (a, c) (b, c)

valuesecondTraversing :: Traversing p => p a b -> p (c, a) (c, b)

Choice in terms of Traversing

2 declarations

valueleftTraversing :: Traversing p => p a b -> p (Either a c) (Either b c)

valuerightTraversing :: Traversing p => p a b -> p (Either c a) (Either c b)