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.

Exact lookup

1. sortVector :: (Ord t, Element t) => Vector t -> Vector t

   hmatrix	Numeric.LinearAlgebra.Data

   No documentation available.

2. subVector :: Storable t => Int -> Int -> Vector t -> Vector t

   hmatrix	Numeric.LinearAlgebra.Data

   takes a number of consecutive elements from a Vector

   >>> subVector 2 3 (fromList [1..10])
   [3.0,4.0,5.0]
   it :: (Enum t, Num t, Foreign.Storable.Storable t) => Vector t
   

3. data STVector s t

   hmatrix	Numeric.LinearAlgebra.Devel

   No documentation available.

4. createVector :: Storable a => Int -> IO (Vector a)

   hmatrix	Numeric.LinearAlgebra.Devel

   No documentation available.

5. foldVector :: Storable a => (a -> b -> b) -> b -> Vector a -> b

   hmatrix	Numeric.LinearAlgebra.Devel

   No documentation available.

6. foldVectorG :: Storable t1 => (Int -> (Int -> t1) -> t -> t) -> t -> Vector t1 -> t

   hmatrix	Numeric.LinearAlgebra.Devel

   No documentation available.

7. foldVectorWithIndex :: Storable a => (Int -> a -> b -> b) -> b -> Vector a -> b

   hmatrix	Numeric.LinearAlgebra.Devel

   No documentation available.

8. freezeVector :: Storable t => STVector s t -> ST s (Vector t)

   hmatrix	Numeric.LinearAlgebra.Devel

   No documentation available.

9. liftSTVector :: Storable t => (Vector t -> a) -> STVector s t -> ST s a

   hmatrix	Numeric.LinearAlgebra.Devel

   No documentation available.

10. 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

Page 43 of many | Previous | Next