Hoogle Search

Within LTS Haskell 24.25 (ghc-9.10.3)

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

  1. mapMaybeFvRn :: (a -> RnM (b, FreeVars)) -> Maybe a -> RnM (Maybe b, FreeVars)

    ghc GHC.Rename.Utils

    No documentation available.

  2. mapMaybeNameEnv :: (a -> Maybe b) -> NameEnv a -> NameEnv b

    ghc GHC.Types.Name.Env

    No documentation available.

  3. mapMaybeOccEnv :: (a -> Maybe b) -> OccEnv a -> OccEnv b

    ghc GHC.Types.Name.Occurrence

    mapMaybe for b OccEnv.

  4. mapMaybeModuleEnv :: (Module -> a -> Maybe b) -> ModuleEnv a -> ModuleEnv b

    ghc GHC.Unit.Module.Env

    No documentation available.

  5. mapModuleEnv :: (a -> b) -> ModuleEnv a -> ModuleEnv b

    ghc GHC.Unit.Module.Env

    No documentation available.

  6. mapMG :: (ModSummary -> ModSummary) -> ModuleGraph -> ModuleGraph

    ghc GHC.Unit.Module.Graph

    Map a function f over all the ModSummaries. To preserve invariants f can't change the isBoot status.

  7. mapMaybe' :: Foldable f => (a -> Maybe b) -> f a -> [b]

    ghc GHC.Utils.Misc

    No documentation available.

  8. mapMaybeM :: Applicative m => (a -> m (Maybe b)) -> [a] -> m [b]

    ghc GHC.Utils.Monad

    Applicative version of mapMaybe

  9. mapM_ :: Monad m => (a -> m ()) -> Consumer' a m r

    pipes Pipes.Prelude

    Consume all values using a monadic function

  10. mapMaybe :: forall (m :: Type -> Type) a b r . Functor m => (a -> Maybe b) -> Pipe a b m r

    pipes Pipes.Prelude

    (mapMaybe f) yields Just results of f. Basic laws: 

    mapMaybe (f >=> g) = mapMaybe f >-> mapMaybe g

mapMaybe (pure @Maybe . f) = mapMaybe (Just . f) = map f

mapMaybe (const Nothing) = drain
    As a result of the second law, 
    mapMaybe return = mapMaybe Just = cat

Page 23 of many | Previous | Next