Hoogle Search

Within LTS Haskell 24.36 (ghc-9.10.3)

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

Exact lookup

1. imapM_ :: (FoldableWithIndex i t, Monad m) => (i -> a -> m b) -> t a -> m ()

   diagrams-lib	Diagrams.Prelude

   Run monadic actions for each target of an IndexedFold or IndexedTraversal with access to the index, discarding the results. When you don't need access to the index then mapMOf_ is more flexible in what it accepts.

   mapM_ ≡ imapM . const
   

2. sMapM_ :: forall a (m :: Type -> Type) b (t1 :: Type -> Type) (t2 :: a ~> m b) (t3 :: t1 a) . (SFoldable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing (Apply (Apply (MapM_Sym0 :: TyFun (a ~> m b) (t1 a ~> m ()) -> Type) t2) t3)

   singletons-base	Control.Monad.Singletons

   No documentation available.

3. sMapM_ :: forall a (m :: Type -> Type) b (t1 :: Type -> Type) (t2 :: a ~> m b) (t3 :: t1 a) . (SFoldable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing (Apply (Apply (MapM_Sym0 :: TyFun (a ~> m b) (t1 a ~> m ()) -> Type) t2) t3)

   singletons-base	Data.Foldable.Singletons

   No documentation available.

4. sMapM_ :: forall a (m :: Type -> Type) b (t1 :: Type -> Type) (t2 :: a ~> m b) (t3 :: t1 a) . (SFoldable t1, SMonad m) => Sing t2 -> Sing t3 -> Sing (Apply (Apply (MapM_Sym0 :: TyFun (a ~> m b) (t1 a ~> m ()) -> Type) t2) t3)

   singletons-base	Prelude.Singletons

   No documentation available.

5. imapM_ :: forall m (v :: Type -> Type) a (n :: Nat) b . (Monad m, Vector v a) => (Finite n -> a -> m b) -> Vector v n a -> m ()

   vector-sized	Data.Vector.Generic.Sized

   O(n) Apply the monadic action to every element of a vector and its index, ignoring the results.

6. imapM_ :: forall m a (n :: Nat) b . (Monad m, Prim a) => (Finite n -> a -> m b) -> Vector n a -> m ()

   vector-sized	Data.Vector.Primitive.Sized

   O(n) Apply the monadic action to every element of a vector and its index, ignoring the results.

7. imapM_ :: forall m (n :: Nat) a b . Monad m => (Finite n -> a -> m b) -> Vector n a -> m ()

   vector-sized	Data.Vector.Sized

   O(n) Apply the monadic action to every element of a vector and its index, ignoring the results.

8. imapM_ :: forall m a (n :: Nat) b . (Monad m, Storable a) => (Finite n -> a -> m b) -> Vector n a -> m ()

   vector-sized	Data.Vector.Storable.Sized

   O(n) Apply the monadic action to every element of a vector and its index, ignoring the results.

9. imapM_ :: forall m a (n :: Nat) b . (Monad m, Unbox a) => (Finite n -> a -> m b) -> Vector n a -> m ()

   vector-sized	Data.Vector.Unboxed.Sized

   O(n) Apply the monadic action to every element of a vector and its index, ignoring the results.

10. imapM_ :: (Index ix, Source r a, Monad m) => (ix -> a -> m b) -> Array r ix a -> m ()

    massiv	Data.Massiv.Array

    Map a monadic index aware function over an array sequentially, while discarding the result.

    Examples

    >>> import Data.Massiv.Array
    
    >>> imapM_ (curry print) $ range Seq (Ix1 10) 15
    (0,10)
    (1,11)
    (2,12)
    (3,13)
    (4,14)
    

Page 14 of many | Previous | Next