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 :: (Eq a, Eq b) => [(a, b)] -> Maybe a <-> Maybe b

   invertible	Data.Invertible.List

   Bi-directional lookup.

2. lookup :: Ord k => Key ph k -> Map ph k v -> v

   justified-containers	Data.Map.Justified

   O(log n). Lookup the value at a key, known to be in the map. The result is a v rather than a Maybe v, because the proof obligation that the key is in the map must already have been discharged to obtain a value of type Key ph k.

3. lookup :: ByteString -> LabelMap a -> Maybe a

   keter	Keter.LabelMap

   No documentation available.

4. lookup :: (Eq a, Monad m) => a -> Stream m (a, b) -> m (Maybe b)

   leveldb-haskell	Data.Stream.Monadic

   No documentation available.

5. lookup :: Eq k => k -> AssociationList k a -> Maybe a

   mockcat	Test.MockCat.AssociationList

   No documentation available.

6. lookup :: MonadCache k v m => k -> m (Maybe v)

   monad-memo	Control.Monad.Memo.Class

   No documentation available.

7. lookup :: MapLike c k v => k -> c -> Maybe v

   monad-memo	Data.MapLike

   No documentation available.

8. lookup :: MapLike c k v => k -> c -> Maybe v

   monad-memo	Data.MapLike.Instances

   No documentation available.

9. lookup :: MultiMap m k v => k -> m k v -> Set v

   monoidmap-examples	Data.MonoidMap.Examples.MultiMap

   Returns the set of values associated with a given key.

   lookup k (fromList kvs) ≡ foldMap snd (filter ((== k) . fst) kvs)
   

10. lookup :: MultiMap m k v => k -> m k v -> Set v

    monoidmap-examples	Data.MonoidMap.Examples.MultiMap.Class

    Returns the set of values associated with a given key.

    lookup k (fromList kvs) ≡ foldMap snd (filter ((== k) . fst) kvs)
    

Page 20 of many | Previous | Next