Hoogle Search
Within LTS Haskell 24.60 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
lookupDefault :: Hashable k => v -> k -> HashMap k v -> vunordered-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.
lookupKey :: Hashable k => k -> HashMap k v -> Maybe kunordered-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.
lookupRecordCollision :: Eq k => Hash -> k -> HashMap k v -> LookupRes vunordered-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
lookupResToMaybe :: LookupRes a -> Maybe aunordered-containers Data.HashMap.Internal No documentation available.
lookupDefault :: Hashable k => v -> k -> HashMap k v -> vunordered-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.
lookupKey :: Hashable k => k -> HashMap k v -> Maybe kunordered-containers Data.HashMap.Internal.Strict 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.
lookupDefault :: Hashable k => v -> k -> HashMap k v -> vunordered-containers Data.HashMap.Lazy 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.
lookupKey :: Hashable k => k -> HashMap k v -> Maybe kunordered-containers Data.HashMap.Lazy 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.
lookupDefault :: Hashable k => v -> k -> HashMap k v -> vunordered-containers Data.HashMap.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.
lookupKey :: Hashable k => k -> HashMap k v -> Maybe kunordered-containers Data.HashMap.Strict 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.