Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. mapName :: Name

   ghc	GHC.Builtin.Names

   No documentation available.

2. map_RDR :: RdrName

   ghc	GHC.Builtin.Names

   No documentation available.

3. mappendClassOpKey :: Unique

   ghc	GHC.Builtin.Names

   No documentation available.

4. mappendName :: Name

   ghc	GHC.Builtin.Names

   No documentation available.

5. mappend_RDR :: RdrName

   ghc	GHC.Builtin.Names

   No documentation available.

6. mapBlock :: forall n n' (e :: Extensibility) (x :: Extensibility) . (forall (e1 :: Extensibility) (x1 :: Extensibility) . () => n e1 x1 -> n' e1 x1) -> Block n e x -> Block n' e x

   ghc	GHC.Cmm.Dataflow.Block

   map a function over the nodes of a Block

7. mapBlock' :: forall n n' (e :: Extensibility) (x :: Extensibility) . (forall (e1 :: Extensibility) (x1 :: Extensibility) . () => n e1 x1 -> n' e1 x1) -> Block n e x -> Block n' e x

   ghc	GHC.Cmm.Dataflow.Block

   A strict mapBlock

8. mapBlock3' :: forall n n' (e :: Extensibility) (x :: Extensibility) . (n C O -> n' C O, n O O -> n' O O, n O C -> n' O C) -> Block n e x -> Block n' e x

   ghc	GHC.Cmm.Dataflow.Block

   map over a block, with different functions to apply to first nodes, middle nodes and last nodes respectively. The map is strict.

9. mapGraph :: forall n n' (e :: Extensibility) (x :: Extensibility) . (forall (e1 :: Extensibility) (x1 :: Extensibility) . () => n e1 x1 -> n' e1 x1) -> Graph n e x -> Graph n' e x

   ghc	GHC.Cmm.Dataflow.Graph

   Maps over all nodes in a graph.

10. mapGraphBlocks :: forall block (n :: Extensibility -> Extensibility -> Type) block' (n' :: Extensibility -> Extensibility -> Type) (e :: Extensibility) (x :: Extensibility) . (forall (e1 :: Extensibility) (x1 :: Extensibility) . () => block n e1 x1 -> block' n' e1 x1) -> Graph' block n e x -> Graph' block' n' e x

    ghc	GHC.Cmm.Dataflow.Graph

    Function mapGraphBlocks enables a change of representation of blocks, nodes, or both. It lifts a polymorphic block transform into a polymorphic graph transform. When the block representation stabilizes, a similar function should be provided for blocks.

Page 89 of many | Previous | Next