Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

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

Exact lookup

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

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

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

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

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

   profunctors	Data.Profunctor.Types

   Map the second argument covariantly.

   rmap ≡ dimap id
   

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

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

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

   profunctors	Data.Profunctor.Unsafe

   Map the second argument covariantly.

   rmap ≡ dimap id
   

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

10. gmapAccumM :: (Data d, Monad m) => (forall e . Data e => a -> e -> (a, m e)) -> a -> d -> (a, m d)

    syb	Data.Generics.Twins

    gmapM with accumulation

Page 433 of many | Previous | Next