Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

1. imapM :: (Context a, Context b, Monad m) => ((Int, Int) -> a -> m b) -> Matrix a -> m (Matrix b)

   matrices	Data.Matrix.Storable

   O(m*n) Apply the monadic action to every element and its index, yielding a matrix of results.

2. imapM_ :: (Context a, Monad m) => ((Int, Int) -> a -> m b) -> Matrix a -> m ()

   matrices	Data.Matrix.Storable

   O(m*n) Apply the monadic action to every element and its index, ignoring the results.

3. imap :: forall (v :: Type -> Type) a b . (Vector v a, Vector v b) => ((Int, Int) -> a -> b) -> SymMatrix v a -> SymMatrix v b

   matrices	Data.Matrix.Symmetric.Generic

   Upper triangular imap, i.e., i <= j

4. imap :: (Context a, Context b) => ((Int, Int) -> a -> b) -> Matrix a -> Matrix b

   matrices	Data.Matrix.Unboxed

   No documentation available.

5. imapM :: (Context a, Context b, Monad m) => ((Int, Int) -> a -> m b) -> Matrix a -> m (Matrix b)

   matrices	Data.Matrix.Unboxed

   O(m*n) Apply the monadic action to every element and its index, yielding a matrix of results.

6. imapM_ :: (Context a, Monad m) => ((Int, Int) -> a -> m b) -> Matrix a -> m ()

   matrices	Data.Matrix.Unboxed

   O(m*n) Apply the monadic action to every element and its index, ignoring the results.

7. rMap :: MapReduce -> MapFun

   mongoDB	Database.MongoDB.Query

   No documentation available.

8. newtype MonoidalHashMap k a

   monoidal-containers	Data.HashMap.Monoidal

   A HashMap with monoidal accumulation

9. MonoidalHashMap :: HashMap k a -> MonoidalHashMap k a

   monoidal-containers	Data.HashMap.Monoidal

   No documentation available.

10. getMonoidalHashMap :: MonoidalHashMap k a -> HashMap k a

    monoidal-containers	Data.HashMap.Monoidal

    No documentation available.

Page 949 of many | Previous | Next