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.

  1. tryLookup :: (Eq k, Hashable k) => TMapMVar k a -> k -> STM (Maybe a)

    tmapmvar Control.Concurrent.STM.TMapMVar.Hash

    No documentation available.

  2. phantomLookup :: (Eq k, Hashable k) => k -> Map k v -> STM (Maybe v)

    ttrie Control.Concurrent.STM.Map

    O(log n). Return the value associated with the given key, or Nothing. In contrast to lookup, this will never increase the map's memory consumption. However, it might allow phantom reads to occur. Consider the following situation: 

    f = atomically $ do v1 <- phantomLookup k m
v2 <- phantomLookup k m
return (v1 == v2)
    Under certain circumstances f might actually return False, in particular if the first phantomLookup happens on an empty map and some other transaction inserts a value for k before the second call to phantomLookup.

  3. insertLookupWithKey' :: Ord k => (Interval k -> a -> a -> a) -> Interval k -> a -> IntervalMap k a -> (Maybe a, IntervalMap k a)

    IntervalMap Data.IntervalMap

    Deprecated. As of version 0.3, replaced by insertLookupWithKey. O(log n). A strict version of insertLookupWithKey.

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

    IntervalMap Data.IntervalMap.Generic.Lazy

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

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

    IntervalMap Data.IntervalMap.Generic.Lazy

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

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

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

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

    IntervalMap Data.IntervalMap.Generic.Strict

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

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

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

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

Page 232 of many | Previous | Next