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.
lookup :: Eq a => a -> [(a, b)] -> Maybe bCabal-syntax Distribution.Compat.Prelude No documentation available.
lookup :: StaticMap t => Key t -> t -> Maybe (Val t)relude Relude.Extra.Map No documentation available.
lookup :: Key a -> Context -> Maybe ahs-opentelemetry-api OpenTelemetry.Context 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 :: 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.
lookup :: (Ord a, Ord b, MonadThrow m) => a -> Bimap a b -> m bbimap Data.Bimap O(log n). Lookup a left key in the bimap, returning the associated right key. This function will return the result in the monad, or fail if the value isn't in the bimap. Note that the signature differs slightly from Data.Map's lookup. This one is more general - it functions the same way as the "original" if m is cast (or inferred) to Maybe. Version: 0.2
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.