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. mAX_SMALL_BITMAP_SIZE :: Platform -> Int

   ghc	GHC.Data.Bitmap

   Magic number, must agree with BITMAP_BITS_SHIFT in InfoTables.h. Some kinds of bitmap pack a size/bitmap into a single word if possible, or fall back to an external pointer when the bitmap is too large. This value represents the largest size of bitmap that can be packed into a single word.

2. mkBitmap :: Platform -> [Bool] -> Bitmap

   ghc	GHC.Data.Bitmap

   Make a bitmap from a sequence of bits

3. strictMapFsEnv :: (a -> b) -> FastStringEnv a -> FastStringEnv b

   ghc	GHC.Data.FastString.Env

   No documentation available.

4. module GHC.Data.FiniteMap

   No documentation available.

5. graphMap :: Graph k cls color -> UniqFM k (Node k cls color)

   ghc	GHC.Data.Graph.Base

   All active nodes in the graph.

6. graphMapModify :: (UniqFM k (Node k cls color) -> UniqFM k (Node k cls color)) -> Graph k cls color -> Graph k cls color

   ghc	GHC.Data.Graph.Base

   Modify the finite map holding the nodes in the graph.

7. emap :: DynGraph gr => (b -> c) -> gr a b -> gr a c

   ghc	GHC.Data.Graph.Inductive.Graph

   Map a function over the Edge labels in a graph.

8. gfiltermap :: DynGraph gr => (Context a b -> MContext c d) -> gr a b -> gr c d

   ghc	GHC.Data.Graph.Inductive.Graph

   Build a graph out of the contexts for which the predicate is satisfied by recursively calling match.

9. gmap :: DynGraph gr => (Context a b -> Context c d) -> gr a b -> gr c d

   ghc	GHC.Data.Graph.Inductive.Graph

   Map a function over the graph by recursively calling match.

10. nemap :: DynGraph gr => (a -> c) -> (b -> d) -> gr a b -> gr c d

    ghc	GHC.Data.Graph.Inductive.Graph

    Map functions over both the Node and Edge labels in a graph.

Page 449 of many | Previous | Next