Hoogle Search
Within LTS Haskell 24.10 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
ghc GHC.CmmToAsm.X86.Instr No documentation available.
allArgRegs :: Platform -> [(Reg, Reg)]ghc GHC.CmmToAsm.X86.Regs No documentation available.
allFPArgRegs :: Platform -> [Reg]ghc GHC.CmmToAsm.X86.Regs on 64bit platforms we pass the first 8 float/double arguments in the xmm registers.
allIntArgRegs :: Platform -> [Reg]ghc GHC.CmmToAsm.X86.Regs No documentation available.
allMachRegNos :: Platform -> [RegNo]ghc GHC.CmmToAsm.X86.Regs The complete set of machine registers.
allocatableRegs :: Platform -> [RealReg]ghc GHC.CmmToAsm.X86.Regs No documentation available.
allBag :: (a -> Bool) -> Bag a -> Boolghc GHC.Data.Bag No documentation available.
allReachable :: Ord key => Graph node -> (node -> key) -> Map key (Set key)ghc GHC.Data.Graph.Directed Efficiently construct a map which maps each key to it's set of transitive dependencies. Only works on acyclic input.
allReachableCyclic :: Ord key => Graph node -> (node -> key) -> Map key (Set key)ghc GHC.Data.Graph.Directed Efficiently construct a map which maps each key to it's set of transitive dependencies. Less efficient than allReachable, but works on cyclic input as well.
allListsOf :: [a] -> Infinite [a]ghc GHC.Data.List.Infinite Compute all lists of the given alphabet. For example: allListsOf "ab" = ["a", "b", "aa", "ba", "ab", "bb", "aaa", "baa", "aba", ...]