Hoogle Search

Within LTS Haskell 24.38 (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.Graph.Ppr

   Pretty printing of graphs.

2. module GHC.Data.Pair

   No documentation available.

3. data Pair a

   ghc	GHC.Data.Pair

   No documentation available.

4. Pair :: a -> a -> Pair a

   ghc	GHC.Data.Pair

   No documentation available.

5. data Pair a b

   ghc	GHC.Data.Strict

   No documentation available.

6. newtype Point s a

   ghc	GHC.Data.UnionFind

   A variable which can be unified; alternately, this can be thought of as an equivalence class with a distinguished representative.

7. Point :: STRef s (Link s a) -> Point s a

   ghc	GHC.Data.UnionFind

   No documentation available.

8. type Prefix = Word64

   ghc	GHC.Data.Word64Map.Internal

   No documentation available.

9. type Prefix = Word64

   ghc	GHC.Data.Word64Set.Internal

   No documentation available.

10. data PrimitiveImplementation

    ghc	GHC.Driver.Backend

    This enumeration type specifies how the back end wishes GHC's primitives to be implemented. (Module GHC.StgToCmm.Prim provides a generic implementation of every primitive, but some primitives, like IntQuotRemOp, can be implemented more efficiently by certain back ends on certain platforms. For example, by using a machine instruction that simultaneously computes quotient and remainder.) For the meaning of each alternative, consult GHC.StgToCmm.Config. (In a perfect world, type PrimitiveImplementation would be defined there, in the module that determines its meaning. But I could not figure out how to do it without mutual recursion across module boundaries.)

Page 118 of many | Previous | Next