Hoogle Search

Within LTS Haskell 24.62 (ghc-9.10.3)

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

  1. varLookup :: Uniquable key => key -> LlvmM (Maybe LlvmType)

    ghc GHC.CmmToLlvm.Base

    Lookup variables or functions in the environment.

  2. lcLookupCoVar :: LiftingContext -> CoVar -> Maybe Coercion

    ghc GHC.Core.Coercion

    Lookup a CoVar in the substitution in a LiftingContext

  3. type ClsInstLookupResult = ([InstMatch], PotentialUnifiers, [InstMatch])

    ghc GHC.Core.InstEnv

    No documentation available.

  4. data RoughMatchLookupTc

    ghc GHC.Core.RoughMap

    No documentation available.

  5. roughMatchTcToLookup :: RoughMatchTc -> RoughMatchLookupTc

    ghc GHC.Core.RoughMap

    No documentation available.

  6. roughMatchTcsLookup :: [Type] -> [RoughMatchLookupTc]

    ghc GHC.Core.RoughMap

    No documentation available.

  7. typeToRoughMatchLookupTc :: Type -> RoughMatchLookupTc

    ghc GHC.Core.RoughMap

    No documentation available.

  8. insertLookupWithKey :: (Key -> a -> a -> a) -> Key -> a -> Word64Map a -> (Maybe a, Word64Map a)

    ghc GHC.Data.Word64Map.Internal

    The expression (insertLookupWithKey f k x map) is a pair where the first element is equal to (lookup k map) and the second element equal to (insertWithKey f k x map). 

    let f key new_value old_value = (show key) ++ ":" ++ new_value ++ "|" ++ old_value
insertLookupWithKey f 5 "xxx" (fromList [(5,"a"), (3,"b")]) == (Just "a", fromList [(3, "b"), (5, "5:xxx|a")])
insertLookupWithKey f 7 "xxx" (fromList [(5,"a"), (3,"b")]) == (Nothing,  fromList [(3, "b"), (5, "a"), (7, "xxx")])
insertLookupWithKey f 5 "xxx" empty                         == (Nothing,  singleton 5 "xxx")
    This is how to define insertLookup using insertLookupWithKey: 
    let insertLookup kx x t = insertLookupWithKey (\_ a _ -> a) kx x t
insertLookup 5 "x" (fromList [(5,"a"), (3,"b")]) == (Just "a", fromList [(3, "b"), (5, "x")])
insertLookup 7 "x" (fromList [(5,"a"), (3,"b")]) == (Nothing,  fromList [(3, "b"), (5, "a"), (7, "x")])

  9. splitLookup :: Key -> Word64Map a -> (Word64Map a, Maybe a, Word64Map a)

    ghc GHC.Data.Word64Map.Internal

    Performs a split but also returns whether the pivot key was found in the original map. 

    splitLookup 2 (fromList [(5,"a"), (3,"b")]) == (empty, Nothing, fromList [(3,"b"), (5,"a")])
splitLookup 3 (fromList [(5,"a"), (3,"b")]) == (empty, Just "b", singleton 5 "a")
splitLookup 4 (fromList [(5,"a"), (3,"b")]) == (singleton 3 "b", Nothing, singleton 5 "a")
splitLookup 5 (fromList [(5,"a"), (3,"b")]) == (singleton 3 "b", Just "a", empty)
splitLookup 6 (fromList [(5,"a"), (3,"b")]) == (fromList [(3,"b"), (5,"a")], Nothing, empty)

  10. updateLookupWithKey :: (Key -> a -> Maybe a) -> Key -> Word64Map a -> (Maybe a, Word64Map a)

    ghc GHC.Data.Word64Map.Internal

    Lookup and update. The function returns original value, if it is updated. This is different behavior than updateLookupWithKey. Returns the original key value if the map entry is deleted. 

    let f k x = if x == "a" then Just ((show k) ++ ":new a") else Nothing
updateLookupWithKey f 5 (fromList [(5,"a"), (3,"b")]) == (Just "a", fromList [(3, "b"), (5, "5:new a")])
updateLookupWithKey f 7 (fromList [(5,"a"), (3,"b")]) == (Nothing,  fromList [(3, "b"), (5, "a")])
updateLookupWithKey f 3 (fromList [(5,"a"), (3,"b")]) == (Just "b", singleton 5 "a")

Page 180 of many | Previous | Next