Hoogle Search

Within LTS Haskell 24.62 (ghc-9.10.3)

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

Exact lookup

1. lookupLT :: Ord k => k -> IntervalMap k v -> Maybe (k, v)

   IntervalMap	Data.IntervalMap.Strict

   O(log n). Find the largest key smaller than the given one and return it along with its value.

2. lookupLast :: Interval k e => IntervalMap k v -> Maybe (k, v)

   IntervalMap	Data.IntervalMap.Strict

   Returns the key with the largest endpoint and its associated value. If there is more than one key with that endpoint, return the rightmost. O(n), since all keys could have the same endpoint. O(log n) average case.

3. lookupMax :: IntervalMap k v -> Maybe (k, v)

   IntervalMap	Data.IntervalMap.Strict

   O(log n). Returns the largest key and its associated value.

4. lookupMin :: IntervalMap k v -> Maybe (k, v)

   IntervalMap	Data.IntervalMap.Strict

   O(log n). Returns the smallest key and its associated value.

5. lookupGE :: Ord k => k -> IntervalSet k -> Maybe k

   IntervalMap	Data.IntervalSet

   O(log n). Find the smallest key equal to or larger than the given one.

6. lookupGT :: Ord k => k -> IntervalSet k -> Maybe k

   IntervalMap	Data.IntervalSet

   O(log n). Find the smallest key larger than the given one.

7. lookupLE :: Ord k => k -> IntervalSet k -> Maybe k

   IntervalMap	Data.IntervalSet

   O(log n). Find the largest key equal to or smaller than the given one.

8. lookupLT :: Ord k => k -> IntervalSet k -> Maybe k

   IntervalMap	Data.IntervalSet

   O(log n). Find the largest key smaller than the given one.

9. lookupAZ :: Ord k => k -> Map k R -> R

   LPFP-core	LPFPCore.Maxwell

   No documentation available.

10. lookupLInput :: Text -> MultipartData tag -> Either String [Text]

    autodocodec-servant-multipart	Autodocodec.Multipart

    No documentation available.

Page 147 of many | Previous | Next