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.
Opt_SortValidHoleFits :: GeneralFlagghc GHC.Driver.Flags No documentation available.
topSortModuleGraph :: Bool -> ModuleGraph -> Maybe HomeUnitModule -> [SCC ModuleGraphNode]ghc 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
Opt_SortBySizeHoleFits :: GeneralFlagghc GHC.Driver.Session No documentation available.
Opt_SortBySubsumHoleFits :: GeneralFlagghc GHC.Driver.Session No documentation available.
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