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. mapMonotonic :: (Key -> Key) -> Word64Set -> Word64Set

    ghc-lib-parser GHC.Data.Word64Set.Internal

    The mapMonotonic f s == map f s, but works only when f is strictly increasing. The precondition is not checked. Semi-formally, we have:

    and [x < y ==> f x < f y | x <- ls, y <- ls]
    ==> mapMonotonic f s == map f s
    where ls = toList s
    

  2. mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()

    ghc-lib-parser GHC.Prelude.Basic

    Map each element of a structure to a monadic action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see mapM. mapM_ is just like traverse_, but specialised to monadic actions.

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

    ghc-lib-parser GHC.Types.Name.Env

    No documentation available.

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

    ghc-lib-parser GHC.Types.Name.Occurrence

    mapMaybe for b OccEnv.

  5. mapMUniqDSet :: (Monad m, Uniquable b) => (a -> m b) -> UniqDSet a -> m (UniqDSet b)

    ghc-lib-parser GHC.Types.Unique.DSet

    Like mapUniqDSet but for mapM. Assumes the function we are mapping over the UniqDSet does not modify uniques, as per Note [UniqSet invariant] in GHC.Types.Unique.Set.

  6. mapMaybeUniqSet_sameUnique :: (a -> Maybe b) -> UniqSet a -> UniqSet b

    ghc-lib-parser GHC.Types.Unique.Set

    Like mapMaybe, but you must ensure the passed in function does not change the Unique.

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

    ghc-lib-parser GHC.Unit.Module.Env

    No documentation available.

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

    ghc-lib-parser GHC.Unit.Module.Env

    No documentation available.

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

    ghc-lib-parser GHC.Unit.Module.Graph

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

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

    ghc-lib-parser GHC.Utils.Misc

    No documentation available.

Page 36 of many | Previous | Next