Hoogle Search

Within LTS Haskell 24.65 (ghc-9.10.3)

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

Exact lookup

1. lookupKey' :: FromJSON a => Text -> Object -> a

   pagure	Fedora.Pagure

   Like lookupKey but raises an error if no key found

2. lookupKey :: FromJSON a => Text -> Object -> Maybe a

   pdc	Fedora.PDC

   Look up key in object

3. lookupKey' :: FromJSON a => Text -> Object -> a

   pdc	Fedora.PDC

   Like lookupKey but raises an error if no key found

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

   refined-containers	Data.IntMap.Refined

   Find the smallest key greater or equal to the given one, and return the associated key-value pair.

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

   refined-containers	Data.IntMap.Refined

   Find the smallest key greater than the given one, and return the associated key-value pair.

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

   refined-containers	Data.IntMap.Refined

   Find the largest key smaller or equal to the given one, and return the associated key-value pair.

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

   refined-containers	Data.IntMap.Refined

   Find the largest key smaller than the given one, and return the associated key-value pair.

8. lookupGE :: Int -> IntMap s a -> Maybe (Key s, a)

   refined-containers	Data.IntMap.Strict.Refined

   Find the smallest key greater or equal to the given one, and return the associated key-value pair.

9. lookupGT :: Int -> IntMap s a -> Maybe (Key s, a)

   refined-containers	Data.IntMap.Strict.Refined

   Find the smallest key greater than the given one, and return the associated key-value pair.

10. lookupLE :: Int -> IntMap s a -> Maybe (Key s, a)

    refined-containers	Data.IntMap.Strict.Refined

    Find the largest key smaller or equal to the given one, and return the associated key-value pair.

Page 163 of many | Previous | Next