Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

  1. adjust :: forall s a . (a -> a) -> Key s -> IntMap s a -> IntMap s a

    refined-containers Data.IntMap.Refined

    Update the value at a specific key known the be in the map using the given function. The set of keys remains the same. 

    reinsert k v = 'adjust (const v) k'

  2. adjust' :: forall s a . (a -> a) -> Int -> IntMap s a -> IntMap s a

    refined-containers Data.IntMap.Refined

    If the given key is in the map, update the value at that key using the given function. In any case, the set of keys remains the same.

  3. adjustMaxWithKey :: (Key s -> a -> a) -> IntMap s a -> IntMap s a

    refined-containers Data.IntMap.Refined

    Adjust the value at the greatest key. The set of keys remains unchanged.

  4. adjustMinWithKey :: (Key s -> a -> a) -> IntMap s a -> IntMap s a

    refined-containers Data.IntMap.Refined

    Adjust the value at the smallest key. The set of keys remains unchanged.

  5. adjustWithKey :: (Key s -> a -> a) -> Int -> IntMap s a -> IntMap s a

    refined-containers Data.IntMap.Refined

    If the given key is in the map, update the associated value using the given function with a proof that the key was in the map; otherwise return the map unchanged. In any case the set of keys remains the same.

  6. adjust :: forall s a . (a -> a) -> Key s -> IntMap s a -> IntMap s a

    refined-containers Data.IntMap.Strict.Refined

    Update the value at a specific key known the be in the map using the given function. The set of keys remains the same.

  7. adjust' :: forall s a . (a -> a) -> Int -> IntMap s a -> IntMap s a

    refined-containers Data.IntMap.Strict.Refined

    If the given key is in the map, update the value at that key using the given function. In any case, the set of keys remains the same.

  8. adjustMaxWithKey :: (Key s -> a -> a) -> IntMap s a -> IntMap s a

    refined-containers Data.IntMap.Strict.Refined

    Adjust the value at the greatest key. The set of keys remains unchanged.

  9. adjustMinWithKey :: (Key s -> a -> a) -> IntMap s a -> IntMap s a

    refined-containers Data.IntMap.Strict.Refined

    Adjust the value at the smallest key. The set of keys remains unchanged.

  10. adjustWithKey :: (Key s -> a -> a) -> Int -> IntMap s a -> IntMap s a

    refined-containers Data.IntMap.Strict.Refined

    If the given key is in the map, update the associated value using the given function with a proof that the key was in the map; otherwise return the map unchanged. In any case the set of keys remains the same.

Page 163 of many | Previous | Next