Hoogle Search
Within LTS Haskell 24.35 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
lookup :: StaticMap t => Key t -> t -> Maybe (Val t)relude Relude.Extra.Map No documentation available.
lookup :: (Eq k, Hashable k) => k -> InsOrdHashMap k v -> Maybe vinsert-ordered-containers Data.HashMap.Strict.InsOrd No documentation available.
lookup :: (Ord k, Hashable k) => k -> Store k v -> Maybe (v, Store k v)wreq Network.Wreq.Cache.Store No documentation available.
lookup :: CI ByteString -> Headers -> Maybe ByteStringsnap-core Snap.Types.Headers Look up the value of a given HTTP header field. Example:
ghci> :set -XOverloadedStrings ghci> H.lookup "host" $ H.fromList [("Host", "localhost")] Just "localhost" ghci> H.lookup "Accept" $ H.fromList [("Host", "localhost")] Nothing
lookup :: Enum k => k -> EnumMap k a -> Maybe aenummapset Data.EnumMap.Lazy No documentation available.
lookup :: Enum k => k -> EnumMap k a -> Maybe aenummapset Data.EnumMap.Strict No documentation available.
lookup :: Eq a => a -> [(a, b)] -> Maybe bghc-internal GHC.Internal.Data.List lookup key assocs looks up a key in an association list. For the result to be Nothing, the list must be finite.
Examples
>>> lookup 2 [] Nothing
>>> lookup 2 [(1, "first")] Nothing
>>> lookup 2 [(1, "first"), (2, "second"), (3, "third")] Just "second"
lookup :: Eq a => a -> [(a, b)] -> Maybe bghc-internal GHC.Internal.Data.OldList lookup key assocs looks up a key in an association list. For the result to be Nothing, the list must be finite.
Examples
>>> lookup 2 [] Nothing
>>> lookup 2 [(1, "first")] Nothing
>>> lookup 2 [(1, "first"), (2, "second"), (3, "third")] Just "second"
lookup :: Eq a => a -> [(a, b)] -> Maybe bghc-internal GHC.Internal.List lookup key assocs looks up a key in an association list. For the result to be Nothing, the list must be finite.
Examples
>>> lookup 2 [] Nothing
>>> lookup 2 [(1, "first")] Nothing
>>> lookup 2 [(1, "first"), (2, "second"), (3, "third")] Just "second"
lookup :: Eq a => a -> Infinite (a, b) -> binfinite-list Data.List.Infinite Find the first pair, whose first component is equal to the first argument, and return the second component. If there is nothing to be found, this function will hang indefinitely.