Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

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

Exact lookup

1. module GHC.Data.Bitmap

   No documentation available.

2. type Bitmap = [StgWord]

   ghc	GHC.Data.Bitmap

   A bitmap represented by a sequence of StgWords on the target architecture. These are used for bitmaps in info tables and other generated code which need to be emitted as sequences of StgWords.

3. intsToReverseBitmap :: Platform -> Int -> [Int] -> Bitmap

   ghc	GHC.Data.Bitmap

   Make a bitmap where the slots specified are the zeros in the bitmap. eg. [0,1,3], size 4 ==> 0x4 (we leave any bits outside the size as zero, just to make the bitmap easier to read). The list of Ints must be already sorted and duplicate-free.

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

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

   ghc	GHC.Data.Bitmap

   Make a bitmap from a sequence of bits

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

   ghc	GHC.Data.FastString.Env

   No documentation available.

7. module GHC.Data.FiniteMap

   No documentation available.

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

   ghc	GHC.Data.Graph.Base

   All active nodes in the graph.

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

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

Page 448 of many | Previous | Next