Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
Opt_SortValidHoleFits :: GeneralFlagghc GHC.Driver.Session No documentation available.
-
ghc GHC.Hs.Type Haskell Tuple Sort
mergeSortAsts :: [HieAST Type] -> [HieAST Type]ghc GHC.Iface.Ext.Utils combines and sorts ASTs using a merge sort
-
ghc GHC.Iface.Type The various types of TyCons which have special, built-in syntax.
ifaceTyConSort :: IfaceTyConInfo -> IfaceTyConSortghc GHC.Iface.Type No documentation available.
-
ghc GHC.Parser.Annotation Captures the sort order of sub elements for ValBinds, ClassDecl, ClsInstDecl
AnnSortKey :: [tag] -> AnnSortKey tagghc GHC.Parser.Annotation No documentation available.
NoAnnSortKey :: AnnSortKey tagghc GHC.Parser.Annotation No documentation available.
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
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