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. tc_sortByPrevTime :: TestConfig -> Bool

   HTF	Test.Framework.TestTypes

   Sort ascending by previous execution times

2. defsortspec :: SortSpec

   hledger-lib	Hledger.Reports.PostingsReport

   No documentation available.

3. defsortspec :: SortSpec

   hledger-lib	Hledger.Reports.ReportOptions

   No documentation available.

4. class RebuildSortedHList (l :: [Type])

   reflex	Reflex.Dynamic

   This class allows HLists and FHlists to be built from regular lists; they must be contiguous and sorted.

5. rebuildSortedFHList :: forall (f :: Type -> Type) . RebuildSortedHList l => [DSum (HListPtr l) f] -> FHList f l

   reflex	Reflex.Dynamic

   No documentation available.

6. rebuildSortedHList :: RebuildSortedHList l => [DSum (HListPtr l) Identity] -> HList l

   reflex	Reflex.Dynamic

   No documentation available.

7. module FlatParse.Common.Assorted

   No documentation available.

8. typeLitSortTyConKey :: Unique

   ghc-lib-parser	GHC.Builtin.Names

   No documentation available.

9. typeLitSortTyConName :: Name

   ghc-lib-parser	GHC.Builtin.Names

   No documentation available.

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

Page 119 of many | Previous | Next