Hoogle Search
Within LTS Haskell 24.33 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
Opt_SortValidHoleFits :: GeneralFlagghc-lib GHC No documentation available.
topSortModuleGraph :: Bool -> ModuleGraph -> Maybe HomeUnitModule -> [SCC ModuleGraphNode]ghc-lib GHC Topological sort of the module graph Calculate SCCs of the module graph, possibly dropping the hi-boot nodes The resulting list of strongly-connected-components is in topologically sorted order, starting with the module(s) at the bottom of the dependency graph (ie compile them first) and ending with the ones at the top. Drop hi-boot nodes (first boolean arg)?
- False: treat the hi-boot summaries as nodes of the graph, so the graph must be acyclic
- True: eliminate the hi-boot nodes, and instead pretend the a source-import of Foo is an import of Foo The resulting graph has no hi-boot nodes, but can be cyclic
getSuccEdgesSorted :: CFG -> BlockId -> [(BlockId, EdgeInfo)]ghc-lib GHC.CmmToAsm.CFG Destinations from bid ordered by weight (descending)
topSortModuleGraph :: Bool -> ModuleGraph -> Maybe HomeUnitModule -> [SCC ModuleGraphNode]ghc-lib GHC.Driver.Make Topological sort of the module graph Calculate SCCs of the module graph, possibly dropping the hi-boot nodes The resulting list of strongly-connected-components is in topologically sorted order, starting with the module(s) at the bottom of the dependency graph (ie compile them first) and ending with the ones at the top. Drop hi-boot nodes (first boolean arg)?
- False: treat the hi-boot summaries as nodes of the graph, so the graph must be acyclic
- True: eliminate the hi-boot nodes, and instead pretend the a source-import of Foo is an import of Foo The resulting graph has no hi-boot nodes, but can be cyclic
mergeSortAsts :: [HieAST Type] -> [HieAST Type]ghc-lib GHC.Iface.Ext.Utils combines and sorts ASTs using a merge sort
scopedSort :: [TyCoVar] -> [TyCoVar]ghc-lib 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-lib 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
HFSNoSorting :: HoleFitSortingAlgghc-lib GHC.Tc.Errors.Hole No documentation available.
-
ghc-lib GHC.Tc.Errors.Hole No documentation available.
getHoleFitSortingAlg :: TcM HoleFitSortingAlgghc-lib GHC.Tc.Errors.Hole No documentation available.