Hoogle Search
Within LTS Haskell 24.51 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
tidyForAllTyBinder :: TidyEnv -> VarBndr TyCoVar vis -> (TidyEnv, VarBndr TyCoVar vis)ghc GHC.Core.Type No documentation available.
tidyForAllTyBinders :: TidyEnv -> [VarBndr TyCoVar vis] -> (TidyEnv, [VarBndr TyCoVar vis])ghc GHC.Core.Type No documentation available.
tyConForAllTyFlags :: TyCon -> [Type] -> [ForAllTyFlag]ghc GHC.Core.Type Given a TyCon and a list of argument types to which the TyCon is applied, determine each argument's visibility (Inferred, Specified, or Required). Wrinkle: consider the following scenario:
T :: forall k. k -> k tyConForAllTyFlags T [forall m. m -> m -> m, S, R, Q]
After substituting, we getT (forall m. m -> m -> m) :: (forall m. m -> m -> m) -> forall n. n -> n -> n
Thus, the first argument is invisible, S is visible, R is invisible again, and Q is visible.-
ghc GHC.Core.Unfold No documentation available.
toIfaceForAllBndr :: VarBndr TyCoVar flag -> VarBndr IfaceBndr flagghc GHC.CoreToIface No documentation available.
toIfaceForAllBndrs :: [VarBndr TyCoVar vis] -> [VarBndr IfaceBndr vis]ghc GHC.CoreToIface No documentation available.
mAX_SMALL_BITMAP_SIZE :: Platform -> Intghc GHC.Data.Bitmap Magic number, must agree with BITMAP_BITS_SHIFT in InfoTables.h. Some kinds of bitmap pack a size/bitmap into a single word if possible, or fall back to an external pointer when the bitmap is too large. This value represents the largest size of bitmap that can be packed into a single word.
delAllLEdge :: (DynGraph gr, Eq b) => LEdge b -> gr a b -> gr a bghc GHC.Data.Graph.Inductive.Graph Remove all edges equal to the one specified.
freezeAllInGraph :: Uniquable k => Graph k cls color -> Graph k cls colorghc GHC.Data.Graph.Ops Freeze all the nodes in the graph for debugging the iterative allocator.
tryAllM :: IOEnv env r -> IOEnv env (Either SomeException r)ghc GHC.Data.IOEnv No documentation available.