Hoogle Search

Within LTS Haskell 24.10 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. class Lookup (xs :: [Assoc k v]) (k1 :: k) (v1 :: v) | k1 xs -> v1

   membership	Type.Membership

   Lookup xs k v is essentially identical to (k :> v) ∈ xs , but the type v is inferred from k and xs.

2. class Lookup (xs :: [Assoc k v]) (k1 :: k) (v1 :: v) | k1 xs -> v1

   membership	Type.Membership.Internal

   Lookup xs k v is essentially identical to (k :> v) ∈ xs , but the type v is inferred from k and xs.

3. lookupEnv :: String -> IO (Maybe String)

   base	System.Environment

   Return the value of the environment variable var, or Nothing if there is no such value. For POSIX users, this is equivalent to getEnv.

4. lookupGE :: Key -> IntMap a -> Maybe (Key, a)

   containers	Data.IntMap.Internal

   Find smallest key greater or equal to the given one and return the corresponding (key, value) pair.

   lookupGE 3 (fromList [(3,'a'), (5,'b')]) == Just (3, 'a')
   lookupGE 4 (fromList [(3,'a'), (5,'b')]) == Just (5, 'b')
   lookupGE 6 (fromList [(3,'a'), (5,'b')]) == Nothing
   

5. lookupGT :: Key -> IntMap a -> Maybe (Key, a)

   containers	Data.IntMap.Internal

   Find smallest key greater than the given one and return the corresponding (key, value) pair.

   lookupGT 4 (fromList [(3,'a'), (5,'b')]) == Just (5, 'b')
   lookupGT 5 (fromList [(3,'a'), (5,'b')]) == Nothing
   

6. lookupLE :: Key -> IntMap a -> Maybe (Key, a)

   containers	Data.IntMap.Internal

   Find largest key smaller or equal to the given one and return the corresponding (key, value) pair.

   lookupLE 2 (fromList [(3,'a'), (5,'b')]) == Nothing
   lookupLE 4 (fromList [(3,'a'), (5,'b')]) == Just (3, 'a')
   lookupLE 5 (fromList [(3,'a'), (5,'b')]) == Just (5, 'b')
   

7. lookupLT :: Key -> IntMap a -> Maybe (Key, a)

   containers	Data.IntMap.Internal

   Find largest key smaller than the given one and return the corresponding (key, value) pair.

   lookupLT 3 (fromList [(3,'a'), (5,'b')]) == Nothing
   lookupLT 4 (fromList [(3,'a'), (5,'b')]) == Just (3, 'a')
   

8. lookupMax :: IntMap a -> Maybe (Key, a)

   containers	Data.IntMap.Internal

   The maximal key of the map. Returns Nothing if the map is empty.

9. lookupMin :: IntMap a -> Maybe (Key, a)

   containers	Data.IntMap.Internal

   The minimal key of the map. Returns Nothing if the map is empty.

10. lookupGE :: Key -> IntMap a -> Maybe (Key, a)

    containers	Data.IntMap.Lazy

    Find smallest key greater or equal to the given one and return the corresponding (key, value) pair.

    lookupGE 3 (fromList [(3,'a'), (5,'b')]) == Just (3, 'a')
    lookupGE 4 (fromList [(3,'a'), (5,'b')]) == Just (5, 'b')
    lookupGE 6 (fromList [(3,'a'), (5,'b')]) == Nothing
    

Page 30 of many | Previous | Next