Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

Exact lookup

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

   IntervalMap	Data.IntervalMap.Generic.Lazy

   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.

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

   IntervalMap	Data.IntervalMap.Generic.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. lookupLast :: Interval k e => IntervalMap k v -> Maybe (k, v)

   IntervalMap	Data.IntervalMap.Generic.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.

4. findLast :: Interval k e => IntervalMap k v -> (k, v)

   IntervalMap	Data.IntervalMap.Lazy

   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.

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

   IntervalMap	Data.IntervalMap.Lazy

   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.

6. findLast :: Interval k e => IntervalMap k v -> (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.

7. 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.

8. findLast :: Interval k e => IntervalSet k -> Maybe k

   IntervalMap	Data.IntervalSet

   Returns the interval with the largest endpoint. If there is more than one interval with that endpoint, return the rightmost. O(n), since all intervals could have the same endpoint. O(log n) average case.

9. unsafeLast :: MonoFoldable mono => mono -> Element mono

   classy-prelude-yesod	ClassyPrelude.Yesod

   Equivalent to lastEx.

10. nthLastChild :: Text -> Refinement

    clay	Clay

    No documentation available.

Page 222 of many | Previous | Next