Hoogle Search

Within LTS Haskell 24.64 (ghc-9.10.3)

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

  1. mapM_ :: ((k, v) -> ST s b) -> HashTable s k v -> ST s ()

    hashtables Data.HashTable.ST.Basic

    See the documentation for this function in mapM_.

  2. mapM_ :: ((k, v) -> ST s a) -> HashTable s k v -> ST s ()

    hashtables Data.HashTable.ST.Cuckoo

    See the documentation for this function in mapM_.

  3. mapM_ :: ((k, v) -> ST s b) -> HashTable s k v -> ST s ()

    hashtables Data.HashTable.ST.Linear

    See the documentation for this function in Data.HashTable.Class#v:mapM_.

  4. mapMOf :: LensLike (WrappedMonad m) s t a b -> (a -> m b) -> s -> m t

    diagrams-lib Diagrams.Prelude

    Map each element of a structure targeted by a Lens to a monadic action, evaluate these actions from left to right, and collect the results. 

    >>> mapMOf both (\x -> [x, x + 1]) (1,3)
[(1,3),(1,4),(2,3),(2,4)]

    mapM ≡ mapMOf traverse
imapMOf l ≡ forM l . Indexed

    mapMOf :: Monad m => Iso s t a b       -> (a -> m b) -> s -> m t
mapMOf :: Monad m => Lens s t a b      -> (a -> m b) -> s -> m t
mapMOf :: Monad m => Traversal s t a b -> (a -> m b) -> s -> m t

  5. mapMOf_ :: Monad m => Getting (Sequenced r m) s a -> (a -> m r) -> s -> m ()

    diagrams-lib Diagrams.Prelude

    Map each target of a Fold on a structure to a monadic action, evaluate these actions from left to right, and ignore the results. 

    >>> mapMOf_ both putStrLn ("hello","world")
hello
world

    mapM_ ≡ mapMOf_ folded

    mapMOf_ :: Monad m => Getter s a     -> (a -> m r) -> s -> m ()
mapMOf_ :: Monad m => Fold s a       -> (a -> m r) -> s -> m ()
mapMOf_ :: Monad m => Lens' s a      -> (a -> m r) -> s -> m ()
mapMOf_ :: Monad m => Iso' s a       -> (a -> m r) -> s -> m ()
mapMOf_ :: Monad m => Traversal' s a -> (a -> m r) -> s -> m ()
mapMOf_ :: Monad m => Prism' s a     -> (a -> m r) -> s -> m ()

  6. mapM_ :: (Factorial a, Applicative m) => (a -> m b) -> a -> m ()

    monoid-subclasses Data.Semigroup.Factorial

    A mapM_ equivalent.

  7. mapMaybeWithKey :: GCompare k2 => (forall (v :: k1) . () => k2 v -> f v -> Maybe (g v)) -> DMap k2 f -> DMap k2 g

    dependent-map Data.Dependent.Map

    O(n). Map keys/values and collect the Just results.

  8. mapMaybeT :: (a -> Maybe b) -> [[a]] -> [[b]]

    leancheck Test.LeanCheck.Tiers

    Like mapMaybe but for tiers.

  9. mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()

    relude Relude.Foldable.Reexport

    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.

  10. mapMaybeM :: Monad m => (a -> m (Maybe b)) -> [a] -> m [b]

    relude Relude.Monad.Maybe

    The monadic version of the mapMaybe function. 

    >>> :{
evenInHalf :: Int -> IO (Maybe Int)
evenInHalf n
| even n = pure $ Just $ n `div` 2
| otherwise = pure Nothing
:}

    >>> mapMaybeM evenInHalf [1..10]
[1,2,3,4,5]

Page 19 of many | Previous | Next