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_ :: forall m (v :: Type -> Type) a b (n :: Nat) . (Monad m, Vector v a) => (a -> m b) -> Vector v n a -> m ()

    vector-sized Data.Vector.Generic.Sized

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

  2. mapM_ :: forall m a b (n :: Nat) . (Monad m, Prim a) => (a -> m b) -> Vector n a -> m ()

    vector-sized Data.Vector.Primitive.Sized

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

  3. mapM_ :: forall m a b (n :: Nat) . Monad m => (a -> m b) -> Vector n a -> m ()

    vector-sized Data.Vector.Sized

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

  4. mapM_ :: forall m a b (n :: Nat) . (Monad m, Storable a) => (a -> m b) -> Vector n a -> m ()

    vector-sized Data.Vector.Storable.Sized

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

  5. mapM_ :: forall m a b (n :: Nat) . (Monad m, Unbox a) => (a -> m b) -> Vector n a -> m ()

    vector-sized Data.Vector.Unboxed.Sized

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

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

    base-compat-batteries Control.Monad.Compat

    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.

  7. mapMaybe :: (a -> Maybe b) -> Infinite a -> Infinite b

    infinite-list Data.List.Infinite

    Apply a function to every element of an infinite list and collect Just results. This function isn't productive (e. g., head . mapMaybe f won't terminate), if no elements of the input list result in Just.

  8. mapMonotonic :: (a -> c) -> Bimap a b -> Bimap c b

    bimap Data.Bimap

    O(n). Map a strictly increasing function over all left keys in the map. The precondition is not checked. Version 0.3

  9. mapMonotonicR :: (b -> c) -> Bimap a b -> Bimap a c

    bimap Data.Bimap

    O(n). Map a strictly increasing function over all right keys in the map. The precondition is not checked. Version 0.3

  10. mapMaybe :: (a -> Maybe b) -> EnumMap k a -> EnumMap k b

    enummapset Data.EnumMap.Lazy

    No documentation available.

Page 22 of many | Previous | Next