Hoogle Search

Within LTS Haskell 24.51 (ghc-9.10.3)

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

Exact lookup

1. adjustWithKey :: (Int -> a -> a) -> Int -> MonoidalIntMap a -> MonoidalIntMap a

   monoidal-containers	Data.IntMap.Monoidal.Strict

   No documentation available.

2. adjust :: Ord k => (a -> a) -> k -> MonoidalMap k a -> MonoidalMap k a

   monoidal-containers	Data.Map.Monoidal

   No documentation available.

3. adjustWithKey :: Ord k => (k -> a -> a) -> k -> MonoidalMap k a -> MonoidalMap k a

   monoidal-containers	Data.Map.Monoidal

   No documentation available.

4. adjust :: Ord k => (a -> a) -> k -> MonoidalMap k a -> MonoidalMap k a

   monoidal-containers	Data.Map.Monoidal.Strict

   No documentation available.

5. adjustWithKey :: Ord k => (k -> a -> a) -> k -> MonoidalMap k a -> MonoidalMap k a

   monoidal-containers	Data.Map.Monoidal.Strict

   No documentation available.

6. adjust :: (a -> a) -> Key -> NEIntMap a -> NEIntMap a

   nonempty-containers	Data.IntMap.NonEmpty

   O(log n). Update a value at a specific key with the result of the provided function. When the key is not a member of the map, the original map is returned.

   adjust ("new " ++) 5 (fromList ((5,"a") :| [(3,"b")])) == fromList ((3, "b") :| [(5, "new a")])
   adjust ("new " ++) 7 (fromList ((5,"a") :| [(3,"b")])) == fromList ((3, "b") :| [(5, "a")])
   

7. adjustMax :: (a -> a) -> NEIntMap a -> NEIntMap a

   nonempty-containers	Data.IntMap.NonEmpty

   O(log n). A version of updateMax that disallows deletion, allowing us to guarantee that the result is also non-empty.

8. adjustMaxWithKey :: (Key -> a -> a) -> NEIntMap a -> NEIntMap a

   nonempty-containers	Data.IntMap.NonEmpty

   O(log n). A version of updateMaxWithKey that disallows deletion, allowing us to guarantee that the result is also non-empty.

9. adjustMin :: (a -> a) -> NEIntMap a -> NEIntMap a

   nonempty-containers	Data.IntMap.NonEmpty

   O(1). A version of updateMin that disallows deletion, allowing us to guarantee that the result is also non-empty.

10. adjustMinWithKey :: (Key -> a -> a) -> NEIntMap a -> NEIntMap a

    nonempty-containers	Data.IntMap.NonEmpty

    O(1). A version of adjustMaxWithKey that disallows deletion, allowing us to guarantee that the result is also non-empty. Note that it also is able to have better asymptotics than updateMinWithKey in general.

Page 63 of many | Previous | Next