Hoogle Search
Within LTS Haskell 24.61 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
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.
lookupMax :: IntervalMap k v -> Maybe (k, v)IntervalMap Data.IntervalMap.Generic.Lazy O(log n). Returns the largest key and its associated value.
lookupMin :: IntervalMap k v -> Maybe (k, v)IntervalMap Data.IntervalMap.Generic.Lazy O(log n). Returns the smallest key and its associated value.
lookupGE :: Ord k => k -> IntervalMap k v -> Maybe (k, v)IntervalMap Data.IntervalMap.Generic.Strict O(log n). Find the smallest key equal to or larger than the given one and return it along with its value.
lookupGT :: Ord k => k -> IntervalMap k v -> Maybe (k, v)IntervalMap Data.IntervalMap.Generic.Strict O(log n). Find the smallest key larger than the given one and return it along with its value.
lookupLE :: Ord k => k -> IntervalMap k v -> Maybe (k, v)IntervalMap Data.IntervalMap.Generic.Strict O(log n). Find the largest key equal to or smaller than the given one and return it along with its value.
lookupLT :: Ord k => k -> IntervalMap k v -> Maybe (k, v)IntervalMap Data.IntervalMap.Generic.Strict O(log n). Find the largest key smaller than the given one and return it along with its value.
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.
lookupMax :: IntervalMap k v -> Maybe (k, v)IntervalMap Data.IntervalMap.Generic.Strict O(log n). Returns the largest key and its associated value.
lookupMin :: IntervalMap k v -> Maybe (k, v)IntervalMap Data.IntervalMap.Generic.Strict O(log n). Returns the smallest key and its associated value.