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.
rebuildSortedHList :: RebuildSortedHList l => [DSum (HListPtr l) Identity] -> HList lreflex Reflex.Dynamic No documentation available.
module FlatParse.Common.
Assorted No documentation available.
-
ghc-lib-parser GHC.Builtin.Names No documentation available.
-
ghc-lib-parser GHC.Builtin.Names No documentation available.
scopedSort :: [TyCoVar] -> [TyCoVar]ghc-lib-parser 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
tup_sort :: AlgTyConRhs -> TupleSortghc-lib-parser GHC.Core.TyCon Is this a boxed, unboxed or constraint tuple?
scopedSort :: [TyCoVar] -> [TyCoVar]ghc-lib-parser 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
topologicalSortG :: Graph node -> [node]ghc-lib-parser GHC.Data.Graph.Directed No documentation available.
Opt_SortBySizeHoleFits :: GeneralFlagghc-lib-parser GHC.Driver.DynFlags No documentation available.
Opt_SortBySubsumHoleFits :: GeneralFlagghc-lib-parser GHC.Driver.DynFlags No documentation available.