Hoogle Search
Within LTS Haskell 24.39 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
adjustMinWithKey :: (Key -> a -> a) -> NEIntMap a -> NEIntMap anonempty-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.
adjustMax :: (a -> a) -> NEMap k a -> NEMap k anonempty-containers Data.Map.NonEmpty O(log n). A version of updateMax that disallows deletion, allowing us to guarantee that the result is also non-empty.
adjustMaxWithKey :: (k -> a -> a) -> NEMap k a -> NEMap k anonempty-containers Data.Map.NonEmpty O(log n). A version of updateMaxWithKey that disallows deletion, allowing us to guarantee that the result is also non-empty.
adjustMin :: (a -> a) -> NEMap k a -> NEMap k anonempty-containers Data.Map.NonEmpty O(1). A version of updateMin that disallows deletion, allowing us to guarantee that the result is also non-empty.
adjustMinWithKey :: (k -> a -> a) -> NEMap k a -> NEMap k anonempty-containers Data.Map.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.
lastM :: Monad m => Vector a -> m arebase Rebase.Data.Vector No documentation available.
unsafeLastM :: Monad m => Vector a -> m arebase Rebase.Data.Vector No documentation available.
lastM :: (Vector v a, Monad m) => v a -> m arebase Rebase.Data.Vector.Generic No documentation available.
unsafeLastM :: (Vector v a, Monad m) => v a -> m arebase Rebase.Data.Vector.Generic No documentation available.
lastM :: (Prim a, Monad m) => Vector a -> m arebase Rebase.Data.Vector.Primitive No documentation available.