Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
profunctors Data.Profunctor.Monad Laws:
promap f . promap g ≡ promap (f . g) promap id ≡ id
dimapWandering :: Traversing p => (a' -> a) -> (b -> b') -> p a b -> p a' b'profunctors Data.Profunctor.Traversing A definition of dimap for Traversing instances that define an explicit wander.
lmapWandering :: Traversing p => (a -> b) -> p b c -> p a cprofunctors Data.Profunctor.Traversing lmapWandering may be a more efficient implementation of lmap than the default produced from dimapWandering.
rmapWandering :: Traversing p => (b -> c) -> p a b -> p a cprofunctors Data.Profunctor.Traversing rmapWandering is the same as the default produced from dimapWandering.
dimap :: Profunctor p => (a -> b) -> (c -> d) -> p b c -> p a dprofunctors Data.Profunctor.Types Map over both arguments at the same time.
dimap f g ≡ lmap f . rmap g
lmap :: Profunctor p => (a -> b) -> p b c -> p a cprofunctors Data.Profunctor.Types Map the first argument contravariantly.
lmap f ≡ dimap f id
rmap :: Profunctor p => (b -> c) -> p a b -> p a cprofunctors Data.Profunctor.Types Map the second argument covariantly.
rmap ≡ dimap id
dimap :: Profunctor p => (a -> b) -> (c -> d) -> p b c -> p a dprofunctors Data.Profunctor.Unsafe Map over both arguments at the same time.
dimap f g ≡ lmap f . rmap g
lmap :: Profunctor p => (a -> b) -> p b c -> p a cprofunctors Data.Profunctor.Unsafe Map the first argument contravariantly.
lmap f ≡ dimap f id
rmap :: Profunctor p => (b -> c) -> p a b -> p a cprofunctors Data.Profunctor.Unsafe Map the second argument covariantly.
rmap ≡ dimap id