Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

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

Exact lookup

1. AnnSortKey :: [tag] -> AnnSortKey tag

   ghc	GHC.Parser.Annotation

   No documentation available.

2. NoAnnSortKey :: AnnSortKey tag

   ghc	GHC.Parser.Annotation

   No documentation available.

3. scopedSort :: [TyCoVar] -> [TyCoVar]

   ghc	GHC.Plugins

   Do a topological sort on a list of tyvars, so that binders occur before occurrences E.g. given [ a::k, k::*, b::k ] it'll return a well-scoped list [ k::*, a::k, b::k ] This is a deterministic sorting operation (that is, doesn't depend on Uniques). It is also meant to be stable: that is, variables should not be reordered unnecessarily. This is specified in Note [ScopedSort] See also Note [Ordering of implicit variables] in GHC.Rename.HsType

4. depSortWithAnnotStgPgm :: Module -> [StgTopBinding] -> [(CgStgTopBinding, ImpFVs)]

   ghc	GHC.Stg.FVs

   Dependency sort a STG program, and annotate it with free variables The returned bindings: * Are in dependency order * Each StgRhsClosure is correctly annotated (in its extension field) with the free variables needed in the closure * Each StgCase is correctly annotated (in its extension field) with the variables that must be saved across the case

5. HFSNoSorting :: HoleFitSortingAlg

   ghc	GHC.Tc.Errors.Hole

   No documentation available.

6. data HoleFitSortingAlg

   ghc	GHC.Tc.Errors.Hole

   No documentation available.

7. getHoleFitSortingAlg :: TcM HoleFitSortingAlg

   ghc	GHC.Tc.Errors.Hole

   No documentation available.

8. ClassDeclSort :: DeclSort

   ghc	GHC.Tc.Errors.Types

   No documentation available.

9. DataDeclSort :: NewOrData -> DataSort

   ghc	GHC.Tc.Errors.Types

   No documentation available.

10. DataFamilySort :: DataSort

    ghc	GHC.Tc.Errors.Types

    No documentation available.

Page 99 of many | Previous | Next