Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. lookupGE :: Key -> Word64Set -> Maybe Key

    ghc GHC.Data.Word64Set.Internal

    Find smallest element greater or equal to the given one. 

    lookupGE 3 (fromList [3, 5]) == Just 3
lookupGE 4 (fromList [3, 5]) == Just 5
lookupGE 6 (fromList [3, 5]) == Nothing

  2. lookupGT :: Key -> Word64Set -> Maybe Key

    ghc GHC.Data.Word64Set.Internal

    Find smallest element greater than the given one. 

    lookupGT 4 (fromList [3, 5]) == Just 5
lookupGT 5 (fromList [3, 5]) == Nothing

  3. lookupLE :: Key -> Word64Set -> Maybe Key

    ghc GHC.Data.Word64Set.Internal

    Find largest element smaller or equal to the given one. 

    lookupLE 2 (fromList [3, 5]) == Nothing
lookupLE 4 (fromList [3, 5]) == Just 3
lookupLE 5 (fromList [3, 5]) == Just 5

  4. lookupLT :: Key -> Word64Set -> Maybe Key

    ghc GHC.Data.Word64Set.Internal

    Find largest element smaller than the given one. 

    lookupLT 3 (fromList [3, 5]) == Nothing
lookupLT 5 (fromList [3, 5]) == Just 3

  5. lookupIfaceByModule :: HomeUnitGraph -> PackageIfaceTable -> Module -> Maybe ModIface

    ghc GHC.Driver.Env

    Find the ModIface for a Module, searching in both the loaded home and external package module information

  6. lookupType :: HscEnv -> Name -> IO (Maybe TyThing)

    ghc GHC.Driver.Env

    Find the TyThing for the given Name by using all the resources at our disposal: the compiled modules in the HomePackageTable and the compiled modules in other packages that live in PackageTypeEnv. Note that this does NOT look up the TyThing in the module being compiled: you have to do that yourself, if desired

  7. lookupKnotVars :: KnotVars a -> Module -> Maybe a

    ghc GHC.Driver.Env.KnotVars

    No documentation available.

  8. lookupEstimatedTicks :: HscEnv -> Map CmmInfoTable (Maybe IpeSourceLocation) -> IPEStats -> CmmGroupSRTs -> IO (Map CmmInfoTable (Maybe IpeSourceLocation), IPEStats)

    ghc GHC.Driver.GenerateCgIPEStub

    Given: * an initial mapping from info tables to possible source locations, * initial IPEStats, * a CmmGroupSRTs, map every info table listed in the CmmProcs of the group to their possible source locations and update IPEStats for skipped stack info tables (in case both -finfo-table-map and -fno-info-table-map-with-stack were given). See: Note [Stacktraces from Info Table Provenance Entries (IPE based stack unwinding)] Note: While it would be cleaner if we could keep the recursion and accumulation internal to this function, this cannot be done without separately traversing stream of CmmGroupSRTs in Main. The initial implementation of this logic did such a thing, and code generation performance suffered considerably as a result (see #23103).

  9. lookupRefuts :: Nabla -> Id -> [PmAltCon]

    ghc GHC.HsToCore.Pmc.Solver.Types

    No documentation available.

  10. lookupSolution :: Nabla -> Id -> Maybe PmAltConApp

    ghc GHC.HsToCore.Pmc.Solver.Types

    No documentation available.

Page 49 of many | Previous | Next