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.

Exact lookup

1. topologicalSortG :: Graph node -> [node]

   ghc	GHC.Data.Graph.Directed

   No documentation available.

2. Opt_SortBySizeHoleFits :: GeneralFlag

   ghc	GHC.Driver.DynFlags

   No documentation available.

3. Opt_SortBySubsumHoleFits :: GeneralFlag

   ghc	GHC.Driver.DynFlags

   No documentation available.

4. Opt_SortValidHoleFits :: GeneralFlag

   ghc	GHC.Driver.DynFlags

   No documentation available.

5. Opt_SortBySizeHoleFits :: GeneralFlag

   ghc	GHC.Driver.Flags

   No documentation available.

6. Opt_SortBySubsumHoleFits :: GeneralFlag

   ghc	GHC.Driver.Flags

   No documentation available.

7. Opt_SortValidHoleFits :: GeneralFlag

   ghc	GHC.Driver.Flags

   No documentation available.

8. 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

9. Opt_SortBySizeHoleFits :: GeneralFlag

   ghc	GHC.Driver.Session

   No documentation available.

10. Opt_SortBySubsumHoleFits :: GeneralFlag

    ghc	GHC.Driver.Session

    No documentation available.

Page 106 of many | Previous | Next