Hoogle Search
Within LTS Haskell 24.55 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
zonkAndScopedSort :: [TcTyVar] -> TcM [TcTyVar]ghc GHC.Tc.Gen.HsType No documentation available.
-
ghc GHC.Tc.Types.Constraint Used to indicate which sort of hole we have.
-
ghc GHC.Tc.Types.Constraint What flavour of hole is this?
scopedSort :: [TyCoVar] -> [TyCoVar]ghc GHC.Tc.Utils.TcType 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
-
ghc GHC.Types.Basic No documentation available.
boxityTupleSort :: Boxity -> TupleSortghc GHC.Types.Basic No documentation available.
tupleSortBoxity :: TupleSort -> Boxityghc GHC.Types.Basic No documentation available.
filterToposortToModules :: [SCC ModuleGraphNode] -> [SCC ModSummary]ghc GHC.Unit.Module.Graph This function filters out all the instantiation nodes from each SCC of a topological sort. Use this with care, as the resulting "strongly connected components" may not really be strongly connected in a direct way, as instantiations have been removed. It would probably be best to eliminate uses of this function where possible.
isSortedBy :: (a -> a -> Ordering) -> [a] -> Boolghc GHC.Utils.Misc No documentation available.
nubSort :: Ord a => [a] -> [a]ghc GHC.Utils.Misc No documentation available.