Hoogle Search

Within LTS Haskell 24.26 (ghc-9.10.3)

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

Exact lookup

1. lookupValueName :: String -> Q (Maybe Name)

   template-haskell	Language.Haskell.TH

   Look up the given name in the (value namespace of the) current splice's scope. See Language.Haskell.TH.Syntax#namelookup for more details.

2. lookupName :: Bool -> String -> Q (Maybe Name)

   template-haskell	Language.Haskell.TH.Syntax

   No documentation available.

3. lookupTypeName :: String -> Q (Maybe Name)

   template-haskell	Language.Haskell.TH.Syntax

   Look up the given name in the (type namespace of the) current splice's scope. See Language.Haskell.TH.Syntax#namelookup for more details.

4. lookupValueName :: String -> Q (Maybe Name)

   template-haskell	Language.Haskell.TH.Syntax

   Look up the given name in the (value namespace of the) current splice's scope. See Language.Haskell.TH.Syntax#namelookup for more details.

5. lookup' :: Eq k => Hash -> k -> HashMap k v -> Maybe v

   unordered-containers	Data.HashMap.Internal

   lookup' is a version of lookup that takes the hash separately. It is used to implement alterF.

6. lookupDefault :: Hashable k => v -> k -> HashMap k v -> v

   unordered-containers	Data.HashMap.Internal

   Return the value to which the specified key is mapped, or the default value if this map contains no mapping for the key. DEPRECATED: lookupDefault is deprecated as of version 0.2.11, replaced by findWithDefault.

7. lookupKey :: Hashable k => k -> HashMap k v -> Maybe k

   unordered-containers	Data.HashMap.Internal

   For a given key, return the equal key stored in the map, if present, otherwise return Nothing. This function can be used for interning, i.e. to reduce memory usage.

8. lookupRecordCollision :: Eq k => Hash -> k -> HashMap k v -> LookupRes v

   unordered-containers	Data.HashMap.Internal

   Internal helper for lookup. This version takes the precomputed hash so that functions that make multiple calls to lookup and related functions (insert, delete) only need to calculate the hash once. It is used by alterF so that hash computation and key comparison only needs to be performed once. With this information you can use the more optimized versions of insert (insertNewKey, insertKeyExists) and delete (deleteKeyExists) Outcomes: Key not in map => Absent Key in map, no collision => Present v (-1) Key in map, collision => Present v position

9. lookupResToMaybe :: LookupRes a -> Maybe a

   unordered-containers	Data.HashMap.Internal

   No documentation available.

10. lookupDefault :: Hashable k => v -> k -> HashMap k v -> v

    unordered-containers	Data.HashMap.Internal.Strict

    Return the value to which the specified key is mapped, or the default value if this map contains no mapping for the key. DEPRECATED: lookupDefault is deprecated as of version 0.2.11, replaced by findWithDefault.

Page 38 of many | Previous | Next