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.

Exact lookup

1. lookup :: Ord k => k -> Map k v -> Maybe v

   dhall	Dhall.Map

   Retrieve a key from a Map

   lookup k mempty = empty
   
   lookup k (x <> y) = lookup k y <|> lookup k x
   

   >>> lookup "A" (fromList [("B",1),("A",2)])
   Just 2
   
   >>> lookup "C" (fromList [("B",1),("A",2)])
   Nothing
   

2. lookup :: Insertable k => k -> MultiMap k v -> Maybe [v]

   distributed-process-extras	Control.Distributed.Process.Extras.Internal.Containers.MultiMap

   No documentation available.

3. lookup :: Expr -> Triexpr a -> [(Expr, [(Expr, Expr)], a)]

   express	Data.Express.Triexpr

   Performs a lookup in a Triexpr.

4. lookup :: KeyedCollection c => Key c -> c -> Maybe (Value c)

   foundation	Foundation.Collection

   No documentation available.

5. lookup :: Lookup f => Key f -> f a -> Maybe a

   keys	Data.Key

   No documentation available.

6. lookup :: (Eq k, Hashable k) => k -> MonoidalHashMap k v -> Maybe v

   monoidal-containers	Data.HashMap.Monoidal

   O(log n) Return the value to which the specified key is mapped, or Nothing if this map contains no mapping for the key.

7. lookup :: Int -> MonoidalIntMap a -> Maybe a

   monoidal-containers	Data.IntMap.Monoidal

   No documentation available.

8. lookup :: Int -> MonoidalIntMap a -> Maybe a

   monoidal-containers	Data.IntMap.Monoidal.Strict

   No documentation available.

9. lookup :: Ord k => k -> MonoidalMap k a -> Maybe a

   monoidal-containers	Data.Map.Monoidal

   No documentation available.

10. lookup :: Ord k => k -> MonoidalMap k a -> Maybe a

    monoidal-containers	Data.Map.Monoidal.Strict

    No documentation available.

Page 10 of many | Previous | Next