map package:profunctors

Map over both arguments at the same time.
dimap f g ≡ lmap f . rmap g
Map the first argument contravariantly.
lmap f ≡ dimap f id
Map the second argument covariantly.
rmapdimap id
FreeMapping -| CofreeMapping
Laws:
promap f . promap g ≡ promap (f . g)
promap idid
A definition of dimap for Traversing instances that define an explicit wander.
lmapWandering may be a more efficient implementation of lmap than the default produced from dimapWandering.
rmapWandering is the same as the default produced from dimapWandering.