Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

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

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

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

    profunctors Data.Profunctor.Unsafe

    Map the second argument covariantly. 

    rmap ≡ dimap id

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

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

  6. gmapAccumQ :: Data d => (forall e . Data e => a -> e -> (a, q)) -> a -> d -> (a, [q])

    syb Data.Generics.Twins

    gmapQ with accumulation

  7. gmapAccumQl :: Data d => (r -> r' -> r) -> r -> (forall e . Data e => a -> e -> (a, r')) -> a -> d -> (a, r)

    syb Data.Generics.Twins

    gmapQl with accumulation

  8. gmapAccumQr :: Data d => (r' -> r -> r) -> r -> (forall e . Data e => a -> e -> (a, r')) -> a -> d -> (a, r)

    syb Data.Generics.Twins

    gmapQr with accumulation

  9. gmapAccumT :: Data d => (forall e . Data e => a -> e -> (a, e)) -> a -> d -> (a, d)

    syb Data.Generics.Twins

    gmapT with accumulation

  10. concatMapM :: Monad m => (a -> m [b]) -> [a] -> m [b]

    extra Control.Monad.Extra

    A version of concatMap that works with a monadic predicate.

Page 433 of many | Previous | Next