Hoogle Search

Within LTS Haskell 24.26 (ghc-9.10.3)

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

Exact lookup

1. mapMatrixWithIndexM :: (Element a, Storable b, Monad m) => ((Int, Int) -> a -> m b) -> Matrix a -> m (Matrix b)

   hmatrix	Numeric.LinearAlgebra.Devel

   >>> mapMatrixWithIndexM (\(i,j) v -> Just $ 100*v + 10*fromIntegral i + fromIntegral j) (ident 3:: Matrix Double)
   Just (3><3)
   [ 100.0,   1.0,   2.0
   ,  10.0, 111.0,  12.0
   ,  20.0,  21.0, 122.0 ]
   

2. mapMatrixWithIndexM_ :: (Element a, Num a, Monad m) => ((Int, Int) -> a -> m ()) -> Matrix a -> m ()

   hmatrix	Numeric.LinearAlgebra.Devel

   >>> mapMatrixWithIndexM_ (\(i,j) v -> printf "m[%d,%d] = %.f\n" i j v :: IO()) ((2><3)[1 :: Double ..])
   m[0,0] = 1
   m[0,1] = 2
   m[0,2] = 3
   m[1,0] = 4
   m[1,1] = 5
   m[1,2] = 6
   

3. mapVectorM :: (Storable a, Storable b, Monad m) => (a -> m b) -> Vector a -> m (Vector b)

   hmatrix	Numeric.LinearAlgebra.Devel

   monadic map over Vectors the monad m must be strict

4. mapVectorM_ :: (Storable a, Monad m) => (a -> m ()) -> Vector a -> m ()

   hmatrix	Numeric.LinearAlgebra.Devel

   monadic map over Vectors

5. mapVectorWithIndex :: (Storable a, Storable b) => (Int -> a -> b) -> Vector a -> Vector b

   hmatrix	Numeric.LinearAlgebra.Devel

   No documentation available.

6. mapVectorWithIndexM :: (Storable a, Storable b, Monad m) => (Int -> a -> m b) -> Vector a -> m (Vector b)

   hmatrix	Numeric.LinearAlgebra.Devel

   monadic map over Vectors with the zero-indexed index passed to the mapping function the monad m must be strict

7. mapVectorWithIndexM_ :: (Storable a, Monad m) => (Int -> a -> m ()) -> Vector a -> m ()

   hmatrix	Numeric.LinearAlgebra.Devel

   monadic map over Vectors with the zero-indexed index passed to the mapping function

8. mapM :: (a -> IO b) -> InputStream a -> IO (InputStream b)

   io-streams	System.IO.Streams.Combinators

   Maps an impure function over an InputStream. mapM f s passes all output from s through the IO action f. Satisfies the following laws:

   Streams.mapM (f >=> g) === Streams.mapM f >=> Streams.mapM g
   Streams.mapM return === Streams.makeInputStream . Streams.read
   

9. mapM_ :: (a -> IO b) -> InputStream a -> IO (InputStream a)

   io-streams	System.IO.Streams.Combinators

   Maps a side effect over an InputStream. mapM_ f s produces a new input stream that passes all output from s through the side-effecting IO action f. Example:

   ghci> Streams.fromList [1,2,3] >>=
   Streams.mapM_ (putStrLn . show . (*2)) >>=
   Streams.toList
   2
   4
   6
   [1,2,3]
   

10. mapMaybe :: (a -> Maybe b) -> InputStream a -> IO (InputStream b)

    io-streams	System.IO.Streams.Combinators

    A version of map that discards elements mapMaybe f s passes all output from s through the function f and discards elements for which f s evaluates to Nothing. Example:

    ghci> Streams.fromList [Just 1, None, Just 3] >>=
    Streams.mapMaybe id >>=
    Streams.toList
    [1,3]
    

    Since: 1.2.1.0

Page 120 of many | Previous | Next