Hoogle Search

Within LTS Haskell 24.34 (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

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

  3. mapPlugins :: Plugins -> (Plugin -> [CommandLineOption] -> a) -> [a]

    ghc-lib-parser GHC.Driver.Plugins

    No documentation available.

  4. mapDerivStrategy :: forall p (pass :: Pass) . p ~ GhcPass pass => (XViaStrategy p -> XViaStrategy p) -> DerivStrategy p -> DerivStrategy p

    ghc-lib-parser GHC.Hs.Decls

    Map over the via type if dealing with ViaStrategy. Otherwise, return the DerivStrategy unchanged.

  5. mapHsOuterImplicit :: (XHsOuterImplicit pass -> XHsOuterImplicit pass) -> HsOuterTyVarBndrs flag pass -> HsOuterTyVarBndrs flag pass

    ghc-lib-parser GHC.Hs.Type

    No documentation available.

  6. mapLocA :: NoAnn ann => (a -> b) -> GenLocated SrcSpan a -> GenLocated (EpAnn ann) b

    ghc-lib-parser GHC.Parser.Annotation

    No documentation available.

  7. mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)

    ghc-lib-parser GHC.Prelude.Basic

    Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see mapM_.

    Examples

    mapM is literally a traverse with a type signature restricted to Monad. Its implementation may be more efficient due to additional power of Monad.

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

  9. mappend :: Monoid a => a -> a -> a

    ghc-lib-parser GHC.Prelude.Basic

    An associative operation NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.

  10. mapDecoratedSDoc :: (SDoc -> SDoc) -> DecoratedSDoc -> DecoratedSDoc

    ghc-lib-parser GHC.Types.Error

    Apply a transformation function to all elements of a DecoratedSDoc.

Page 223 of many | Previous | Next