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. splitLookup :: (Interval i k, Ord i) => i -> IntervalMap i a -> (IntervalMap i a, Maybe a, IntervalMap i a)

   IntervalMap	Data.IntervalMap.Generic.Strict

   O(n). The expression (splitLookup k map) splits a map just like split but also returns lookup k map.

2. updateLookupWithKey :: (Interval k e, Ord k) => (k -> a -> Maybe a) -> k -> IntervalMap k a -> (Maybe a, IntervalMap k a)

   IntervalMap	Data.IntervalMap.Generic.Strict

   O(log n). Lookup and update. See also updateWithKey. The function returns changed value, if it is updated. Returns the original key value if the map entry is deleted.

3. insertLookupWithKey :: (Interval k e, Ord k) => (k -> v -> v -> v) -> k -> v -> IntervalMap k v -> (Maybe v, IntervalMap k v)

   IntervalMap	Data.IntervalMap.Lazy

   O(log n). Combine insert with old values retrieval.

4. splitLookup :: (Interval i k, Ord i) => i -> IntervalMap i a -> (IntervalMap i a, Maybe a, IntervalMap i a)

   IntervalMap	Data.IntervalMap.Lazy

   O(n). The expression (splitLookup k map) splits a map just like split but also returns lookup k map.

5. updateLookupWithKey :: (Interval k e, Ord k) => (k -> a -> Maybe a) -> k -> IntervalMap k a -> (Maybe a, IntervalMap k a)

   IntervalMap	Data.IntervalMap.Lazy

   O(log n). Lookup and update. See also updateWithKey. The function returns changed value, if it is updated. Returns the original key value if the map entry is deleted.

6. insertLookupWithKey :: (Interval k e, Ord k) => (k -> v -> v -> v) -> k -> v -> IntervalMap k v -> (Maybe v, IntervalMap k v)

   IntervalMap	Data.IntervalMap.Strict

   O(log n). Combine insert with old values retrieval.

7. splitLookup :: (Interval i k, Ord i) => i -> IntervalMap i a -> (IntervalMap i a, Maybe a, IntervalMap i a)

   IntervalMap	Data.IntervalMap.Strict

   O(n). The expression (splitLookup k map) splits a map just like split but also returns lookup k map.

8. updateLookupWithKey :: (Interval k e, Ord k) => (k -> a -> Maybe a) -> k -> IntervalMap k a -> (Maybe a, IntervalMap k a)

   IntervalMap	Data.IntervalMap.Strict

   O(log n). Lookup and update. See also updateWithKey. The function returns changed value, if it is updated. Returns the original key value if the map entry is deleted.

9. unsafeLookupBit :: BitArray -> Int -> Bool

   bitarray	Data.BitArray

   No documentation available.

10. insertLookupWithKey :: IsMap map => (ContainerKey map -> MapValue map -> MapValue map -> MapValue map) -> ContainerKey map -> MapValue map -> map -> (Maybe (MapValue map), map)

    classy-prelude-yesod	ClassyPrelude.Yesod

    Insert a key-value pair into a map, return the previous key's value if it existed. Inserts the value directly if the key does not exist in the map. Otherwise, apply a supplied function that accepts the key, the new value, and the previous value and insert that result into the map.

Page 232 of many | Previous | Next