Hoogle Search
Within LTS Haskell 24.4 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapVectorM_ :: (Storable a, Monad m) => (a -> m ()) -> Vector a -> m ()hmatrix Numeric.LinearAlgebra.Devel monadic map over Vectors
mapVectorWithIndex :: (Storable a, Storable b) => (Int -> a -> b) -> Vector a -> Vector bhmatrix Numeric.LinearAlgebra.Devel No documentation available.
-
hmatrix Numeric.LinearAlgebra.Devel monadic map over Vectors with the zero-indexed index passed to the mapping function the monad m must be strict
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
matrixFromVector :: Storable t => MatrixOrder -> Int -> Int -> Vector t -> Matrix thmatrix Numeric.LinearAlgebra.Devel No documentation available.
modifyVector :: Storable t => STVector s t -> Int -> (t -> t) -> ST s ()hmatrix Numeric.LinearAlgebra.Devel No documentation available.
newUndefinedVector :: Storable t => Int -> ST s (STVector s t)hmatrix Numeric.LinearAlgebra.Devel No documentation available.
newVector :: Storable t => t -> Int -> ST s (STVector s t)hmatrix Numeric.LinearAlgebra.Devel No documentation available.
readVector :: Storable t => STVector s t -> Int -> ST s thmatrix Numeric.LinearAlgebra.Devel No documentation available.
reorderVector :: Element a => Vector CInt -> Vector CInt -> Vector a -> Vector ahmatrix Numeric.LinearAlgebra.Devel Transpose an array with dimensions dims by making a copy using strides. For example, for an array with 3 indices, (reorderVector strides dims v) ! ((i * dims ! 1 + j) * dims ! 2 + k) == v ! (i * strides ! 0 + j * strides ! 1 + k * strides ! 2) This function is intended to be used internally by tensor libraries.