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.
-
IntervalMap Data.IntervalMap.Lazy O(n). The expression (splitLookup k map) splits a map just like split but also returns lookup k map.
-
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.
-
IntervalMap Data.IntervalMap.Strict O(log n). Combine insert with old values retrieval.
-
IntervalMap Data.IntervalMap.Strict O(n). The expression (splitLookup k map) splits a map just like split but also returns lookup k map.
-
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.
unsafeLookupBit :: BitArray -> Int -> Boolbitarray Data.BitArray No documentation available.
-
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.
-
classy-prelude-yesod ClassyPrelude.Yesod Apply a function to the value of a given key. If the map does not contain the key this returns Nothing and the input map. If the map does contain the key but the function returns Nothing, this returns the previous value and the map with the key-value pair removed. If the map contains the key and the function returns a value, this returns the new value and the map with the key-value pair with the new value.
class
OverloadedLookup t k v | t -> k, t -> verror-or-utils Data.ErrorOr.Utils overloadedLookup :: OverloadedLookup t k v => k -> t -> Maybe verror-or-utils Data.ErrorOr.Utils No documentation available.