Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

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

  1. mapM' :: (MapM' f ss, Applicative m) => (forall (s :: k) . () => t s -> m (t' (f s))) -> PL t ss -> m (PL t' (Ss' f ss))

    hetero-parameter-list Data.HeteroParList

    No documentation available.

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

    mixed-types-num Numeric.MixedTypes.PreludeHiding

    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.

  3. mapM_ :: Monad m => (a -> m b) -> NonEmptyVector a -> m ()

    nonempty-vector Data.Vector.NonEmpty

    O(n) Apply the monadic action to all elements of a non-empty vector and ignore the results.

    >>> mapM_ (const $ Just ()) (unsafeFromList [1..3])
    Just ()
    
    >>> mapM_ (const Nothing) (unsafeFromList [1..3])
    Nothing
    

  4. mapMaybe :: (a -> Maybe b) -> NonEmptyVector a -> Vector b

    nonempty-vector Data.Vector.NonEmpty

    O(n) Drop elements when predicate returns Nothing If no elements satisfy the predicate, the resulting vector may be empty.

    >>> mapMaybe (\a -> if a == 2 then Nothing else Just a) (unsafeFromList [1..3])
    [1,3]
    

  5. mapMLazy :: PrimBase m => (a -> m b) -> [a] -> m [b]

    simple-cairo Graphics.Cairo.Drawing.CairoPatternT.Mesh

    No documentation available.

  6. mapMaybeReversed :: (a -> Maybe b) -> List a -> List b

    strict-list StrictList

    Map and filter elements producing results in reversed order.

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

    LambdaHack Game.LambdaHack.Core.Prelude

    This has a more specific type (unit result) than normally, to catch errors.

  8. mapMaybe :: List l => (a -> Maybe b) -> l a -> l b

    List Data.List.Class

    No documentation available.

  9. mapMaybe :: (a -> Maybe b) -> Trie a -> Maybe (Trie b)

    bcp47 Data.BCP47.Trie

    No documentation available.

  10. mapMaybe :: (a -> Maybe b) -> Trie a -> Maybe (Trie b)

    bcp47 Data.BCP47.Trie.Internal

    No documentation available.

Page 45 of many | Previous | Next