Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. 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.

2. lmapWandering :: Traversing p => (a -> b) -> p b c -> p a c

   profunctors	Data.Profunctor.Traversing

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

3. rmapWandering :: Traversing p => (b -> c) -> p a b -> p a c

   profunctors	Data.Profunctor.Traversing

   rmapWandering is the same as the default produced from dimapWandering.

4. dimap :: Profunctor p => (a -> b) -> (c -> d) -> p b c -> p a d

   profunctors	Data.Profunctor.Types

   Map over both arguments at the same time.

   dimap f g ≡ lmap f . rmap g
   

5. lmap :: Profunctor p => (a -> b) -> p b c -> p a c

   profunctors	Data.Profunctor.Types

   Map the first argument contravariantly.

   lmap f ≡ dimap f id
   

6. rmap :: Profunctor p => (b -> c) -> p a b -> p a c

   profunctors	Data.Profunctor.Types

   Map the second argument covariantly.

   rmap ≡ dimap id
   

7. dimap :: Profunctor p => (a -> b) -> (c -> d) -> p b c -> p a d

   profunctors	Data.Profunctor.Unsafe

   Map over both arguments at the same time.

   dimap f g ≡ lmap f . rmap g
   

8. lmap :: Profunctor p => (a -> b) -> p b c -> p a c

   profunctors	Data.Profunctor.Unsafe

   Map the first argument contravariantly.

   lmap f ≡ dimap f id
   

9. rmap :: Profunctor p => (b -> c) -> p a b -> p a c

   profunctors	Data.Profunctor.Unsafe

   Map the second argument covariantly.

   rmap ≡ dimap id
   

10. gmapAccumA :: forall b d a . (Data d, Applicative a) => (forall e . Data e => b -> e -> (b, a e)) -> b -> d -> (b, a d)

    syb	Data.Generics.Twins

    Applicative version

Page 433 of many | Previous | Next