Hoogle Search
Within LTS Haskell 24.49 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
simapMaybe :: Stream r ix a => (ix -> a -> Maybe b) -> Array r ix a -> Vector DS bmassiv Data.Massiv.Vector Similar to smapMaybe, but map with an index aware function.
Examples
-
massiv Data.Massiv.Vector Similar to smapMaybeM, but map with an index aware function.
Examples
-
massiv Data.Massiv.Vector Traverse a stream vector with a monadic function.
Examples
smapM_ :: forall r ix a b m . (Stream r ix a, Monad m) => (a -> m b) -> Array r ix a -> m ()massiv Data.Massiv.Vector Traverse a stream vector with a monadic function, while discarding the result
Examples
smapMaybe :: Stream r ix a => (a -> Maybe b) -> Array r ix a -> Vector DS bmassiv Data.Massiv.Vector Apply a function to each element of the array, while discarding Nothing and keeping the Maybe result.
Examples
-
massiv Data.Massiv.Vector Similar to smapMaybe, but with the Applicative function. Similar to mapMaybe id $ mapM f arr
Examples
concatMapM :: Monad m => (a -> m [b]) -> [a] -> m [b]protolude Protolude.Monad No documentation available.
fmapMaybe :: Filterable f => (a -> Maybe b) -> f a -> f breflex Reflex.Class Alias for mapMaybe
fmapMaybe :: FunctorMaybe f => (a -> Maybe b) -> f a -> f breflex Reflex.FunctorMaybe Combined mapping and filtering function.
lazyMapM :: (a -> IO b) -> [a] -> IO [b]MissingH System.IO.Utils Applies a given function to every item in a list, and returns the new list. Unlike the system's mapM, items are evaluated lazily.