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. Opt_SortBySizeHoleFits :: GeneralFlag

   ghc	GHC

   No documentation available.

2. Opt_SortBySubsumHoleFits :: GeneralFlag

   ghc	GHC

   No documentation available.

3. Opt_SortValidHoleFits :: GeneralFlag

   ghc	GHC

   No documentation available.

4. topSortModuleGraph :: Bool -> ModuleGraph -> Maybe HomeUnitModule -> [SCC ModuleGraphNode]

   ghc	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

5. typeLitSortTyConKey :: Unique

   ghc	GHC.Builtin.Names

   No documentation available.

6. typeLitSortTyConName :: Name

   ghc	GHC.Builtin.Names

   No documentation available.

7. getSuccEdgesSorted :: CFG -> BlockId -> [(BlockId, EdgeInfo)]

   ghc	GHC.CmmToAsm.CFG

   Destinations from bid ordered by weight (descending)

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

   ghc	GHC.Core.TyCo.FVs

   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

9. tup_sort :: AlgTyConRhs -> TupleSort

   ghc	GHC.Core.TyCon

   Is this a boxed, unboxed or constraint tuple?

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

    ghc	GHC.Core.Type

    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

Page 105 of many | Previous | Next