Hoogle Search

Within LTS Haskell 24.51 (ghc-9.10.3)

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

Exact lookup

1. mapBlockTop :: (LiveBasicBlock instr -> LiveBasicBlock instr) -> LiveCmmDecl statics instr -> LiveCmmDecl statics instr

   ghc-lib	GHC.CmmToAsm.Reg.Liveness

   map a function across all the basic blocks in this code

2. mapBlockTopM :: Monad m => (LiveBasicBlock instr -> m (LiveBasicBlock instr)) -> LiveCmmDecl statics instr -> m (LiveCmmDecl statics instr)

   ghc-lib	GHC.CmmToAsm.Reg.Liveness

   map a function across all the basic blocks in this code (monadic version)

3. mapGenBlockTop :: (GenBasicBlock i -> GenBasicBlock i) -> GenCmmDecl d h (ListGraph i) -> GenCmmDecl d h (ListGraph i)

   ghc-lib	GHC.CmmToAsm.Reg.Liveness

   No documentation available.

4. mapGenBlockTopM :: Monad m => (GenBasicBlock i -> m (GenBasicBlock i)) -> GenCmmDecl d h (ListGraph i) -> m (GenCmmDecl d h (ListGraph i))

   ghc-lib	GHC.CmmToAsm.Reg.Liveness

   map a function across all the basic blocks in this code (monadic version)

5. mapLiveCmmDecl :: (instr -> b) -> LiveCmmDecl statics instr -> LiveCmmDecl statics b

   ghc-lib	GHC.CmmToAsm.Reg.Liveness

   Map over instruction type in LiveCmmDecl

6. mapSCCM :: Monad m => (a -> m b) -> SCC a -> m (SCC b)

   ghc-lib	GHC.CmmToAsm.Reg.Liveness

   No documentation available.

7. mapRegFormatSet :: HasDebugCallStack => (Reg -> Reg) -> UniqSet RegWithFormat -> UniqSet RegWithFormat

   ghc-lib	GHC.CmmToAsm.Reg.Target

   No documentation available.

8. mapLabels :: PureSupernode node => (Label -> Label) -> node -> node

   ghc-lib	GHC.Data.Graph.Collapse

   No documentation available.

9. mapAndUnzipM :: Applicative m => (a -> m (b, c)) -> [a] -> m ([b], [c])

   ghc-lib	GHC.HsToCore.Monad

   The mapAndUnzipM function maps its first argument over a list, returning the result as a pair of lists. This function is mainly used with complicated data structures or a state monad.

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

    ghc-lib	GHC.HsToCore.Monad

    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.

Page 342 of many | Previous | Next