Hoogle Search
Within LTS Haskell 24.6 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapMonotonic :: (a -> b) -> NESet a -> NESet bnonempty-containers Data.Set.NonEmpty O(n). mapMonotonic f s == map f s, but works only when f is strictly increasing. The precondition is not checked. Semi-formally, we have:
and [x < y ==> f x < f y | x <- ls, y <- ls] ==> mapMonotonic f s == map f s where ls = Data.Foldable.toList s
mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()prelude-compat Prelude2010 Map each element of a structure to a monadic action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see mapM. mapM_ is just like traverse_, but specialised to monadic actions.
mapM_ :: Monad m => (a -> m b) -> Vector a -> m ()rebase Rebase.Data.Vector No documentation available.
mapMaybe :: (a -> Maybe b) -> Vector a -> Vector brebase Rebase.Data.Vector No documentation available.
mapMaybeM :: Monad m => (a -> m (Maybe b)) -> Vector a -> m (Vector b)rebase Rebase.Data.Vector No documentation available.
mapM_ :: Monad m => (a -> m b) -> Stream m a -> m ()rebase Rebase.Data.Vector.Fusion.Stream.Monadic Execute a monadic action for each element of the Stream
mapMaybe :: forall (m :: Type -> Type) a b . Monad m => (a -> Maybe b) -> Stream m a -> Stream m brebase Rebase.Data.Vector.Fusion.Stream.Monadic No documentation available.
mapMaybeM :: Monad m => (a -> m (Maybe b)) -> Stream m a -> Stream m brebase Rebase.Data.Vector.Fusion.Stream.Monadic Apply monadic function to each element and drop all Nothings
mapM_ :: (Monad m, Vector v a) => (a -> m b) -> v a -> m ()rebase Rebase.Data.Vector.Generic No documentation available.
mapMaybe :: (Vector v a, Vector v b) => (a -> Maybe b) -> v a -> v brebase Rebase.Data.Vector.Generic No documentation available.