Modulematrices-0.5.0Haskell2010

Data.Matrix.Class

familytype family Mutable (m :: (Type -> Type) -> Type -> Type) :: (Type -> Type -> Type) -> Type -> Type -> Type

Instances3Mutable

type Mutable Matrix = MMatrixDefined in matrices-0.5.0 · Data.Matrix.Generic
type Mutable CSR = MMatrixDefined in matrices-0.5.0 · Data.Matrix.Sparse.Generic
mutable sparse matrix not implemented
type Mutable SymMatrix = SymMMatrixDefined in matrices-0.5.0 · Data.Matrix.Symmetric.Generic

class

class (MMatrix (Mutable m) (Mutable v) a, Vector v a) => Matrix (m :: (Type -> Type) -> Type -> Type) (v :: Type -> Type) a where

dim :: m v a -> (Int, Int)
unsafeIndex :: m v a -> (Int, Int) -> a
unsafeFromVector :: (Int, Int) -> v a -> m v a
flatten :: m v a -> v a
Default algorithm is O((m*n) * O(unsafeIndex)).
unsafeTakeRow :: m v a -> Int -> v a
Extract a row. Default algorithm is O(n * O(unsafeIndex)).
unsafeTakeColumn :: m v a -> Int -> v a
Extract a column. Default algorithm is O(m * O(unsafeIndex)).
takeDiag :: m v a -> v a
Extract the diagonal. Default algorithm is O(min(m,n) * O(unsafeIndex)).
thaw :: PrimMonad s => m v a -> s (Mutable m (Mutable v) (PrimState s) a)
unsafeThaw :: PrimMonad s => m v a -> s (Mutable m (Mutable v) (PrimState s) a)
freeze :: PrimMonad s => Mutable m (Mutable v) (PrimState s) a -> s (m v a)
unsafeFreeze :: PrimMonad s => Mutable m (Mutable v) (PrimState s) a -> s (m v a)

Instances3Matrix

Vector v a => Matrix Matrix v aDefined in matrices-0.5.0 · Data.Matrix.Generic
Vector v a => Matrix SymMatrix v aDefined in matrices-0.5.0 · Data.Matrix.Symmetric.Generic
(Zero a, Vector v a) => Matrix CSR v aDefined in matrices-0.5.0 · Data.Matrix.Sparse.Generic

Derived mothods

16 declarations

valuerows :: Matrix m v a => m v a -> Int

Derived methods

Return the number of rows

valuecols :: Matrix m v a => m v a -> Int

Return the number of columns

value(!) :: Matrix m v a => m v a -> (Int, Int) -> a

Indexing

valuefromVector :: Matrix m v a => (Int, Int) -> v a -> m v a

valuefromList :: Matrix m v a => (Int, Int) -> [a] -> m v a

valueempty :: Matrix m v a => m v a

valuetoList :: Matrix m v a => m v a -> [a]

O(m*n) Create a list by concatenating rows

valuefromLists :: Matrix m v a => [[a]] -> m v a

O(m*n) Create matrix from list of lists, it doesn't check if the list of list is a valid matrix

valuematrix

O(m*n) Matrix construction

valuefromRows :: Matrix m v a => [v a] -> m v a

O(m*n) Create matrix from rows

valuetakeRow :: Matrix m v a => m v a -> Int -> v a

Extract a row.

valuetoRows :: Matrix m v a => m v a -> [v a]

O(m) Return the rows

valuetakeColumn :: Matrix m v a => m v a -> Int -> v a

Extract a row.

valuetoColumns :: Matrix m v a => m v a -> [v a]

O(m*n) Return the columns

valuetoLists :: Matrix m v a => m v a -> [[a]]

O(m*n) List of lists

valuecreate