matrices-0.4.5: native matrix based on vector

Safe HaskellNone
LanguageHaskell2010

Data.Matrix.Storable

Synopsis

Documentation

type Matrix a = Matrix Vector a #

freeze :: (Matrix m v a, PrimMonad s) => Mutable m (Mutable v) (PrimState s) a -> s (m v a) #

unsafeFreeze :: (Matrix m v a, PrimMonad s) => Mutable m (Mutable v) (PrimState s) a -> s (m v a) #

thaw :: (Matrix m v a, PrimMonad s) => m v a -> s (Mutable m (Mutable v) (PrimState s) a) #

unsafeThaw :: (Matrix m v a, PrimMonad s) => m v a -> s (Mutable m (Mutable v) (PrimState s) a) #

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

flatten :: Matrix m v a => m v a -> v a #

Default algorithm is O((m*n) * O(unsafeIndex)).

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

takeDiag :: Matrix m v a => m v a -> v a #

Extract the diagonal. Default algorithm is O(min(m,n) * O(unsafeIndex)).

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

rows :: Matrix m v a => m v a -> Int #

Derived methods

Return the number of rows

cols :: Matrix m v a => m v a -> Int #

Return the number of columns

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

Indexing

toList :: Matrix m v a => m v a -> [a] #

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

empty :: Matrix m v a => m v a #

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

matrix #

Arguments

:: Matrix m v a 
=> Int

number of columns

-> [a]

row list

-> m v a 

O(m*n) Matrix construction

fromLists :: 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

fromRows :: Matrix m v a => [v a] -> m v a #

O(m*n) Create matrix from rows

takeRow :: Matrix m v a => m v a -> Int -> v a #

Extract a row.

toRows :: Matrix m v a => m v a -> [v a] #

O(m) Return the rows

takeColumn :: Matrix m v a => m v a -> Int -> v a #

Extract a row.

toColumns :: Matrix m v a => m v a -> [v a] #

O(m*n) Return the columns

toLists :: Matrix m v a => m v a -> [[a]] #

O(m*n) List of lists

create :: Matrix m v a => (forall s. ST s (Mutable m (Mutable v) s a)) -> m v a #

fromColumns :: Vector v a => [v a] -> Matrix v a #

O(m*n) Create matrix from columns

convert :: (Vector v a, Vector w a) => Matrix v a -> Matrix w a #

O(m*n) Convert different matrix type

subMatrix #

Arguments

:: Vector v a 
=> (Int, Int)

upper left corner of the submatrix

-> (Int, Int)

bottom right corner of the submatrix

-> Matrix v a 
-> Matrix v a 

O(1) Extract sub matrix

tr :: Vector v a => Matrix v a -> Matrix v a #

O(m*n) Matrix transpose

ident :: (Num a, Vector v a) => Int -> Matrix v a #

O(m*n) Create an identity matrix

diag #

Arguments

:: (Num a, Vector v a, Foldable t) 
=> t a

diagonal

-> Matrix v a 

O(m*n) Create a square matrix with given diagonal, other entries default to 0

diagRect #

Arguments

:: (Vector v a, Foldable t) 
=> a

default value

-> (Int, Int) 
-> t a

diagonal

-> Matrix v a 

O(m*n) Create a rectangular matrix with default values and given diagonal

fromBlocks #

Arguments

:: Vector v a 
=> a

default value

-> [[Matrix v a]] 
-> Matrix v a 

isSymmetric :: (Eq a, Vector v a) => Matrix v a -> Bool #

force :: Vector v a => Matrix v a -> Matrix v a #

map :: (Vector v a, Vector v b) => (a -> b) -> Matrix v a -> Matrix v b #

imap :: (Vector v a, Vector v b) => ((Int, Int) -> a -> b) -> Matrix v a -> Matrix v b #

foldl :: Vector v b => (a -> b -> a) -> a -> Matrix v b -> a #

mapM :: (Vector v a, Vector v b, Monad m) => (a -> m b) -> Matrix v a -> m (Matrix v b) #

imapM :: (Vector v a, Vector v b, Monad m) => ((Int, Int) -> a -> m b) -> Matrix v a -> m (Matrix v b) #

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

mapM_ :: (Vector v a, Monad m) => (a -> m b) -> Matrix v a -> m () #

imapM_ :: (Vector v a, Monad m) => ((Int, Int) -> a -> m b) -> Matrix v a -> m () #

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

forM :: (Vector v a, Vector v b, Monad m) => Matrix v a -> (a -> m b) -> m (Matrix v b) #

forM_ :: (Vector v a, Monad m) => Matrix v a -> (a -> m b) -> m () #

zipWith :: (Vector v a, Vector v b, Vector v c) => (a -> b -> c) -> Matrix v a -> Matrix v b -> Matrix v c #

zipWith3 :: (Vector v a, Vector v b, Vector v c, Vector v d) => (a -> b -> c -> d) -> Matrix v a -> Matrix v b -> Matrix v c -> Matrix v d #

zipWith4 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e) => (a -> b -> c -> d -> e) -> Matrix v a -> Matrix v b -> Matrix v c -> Matrix v d -> Matrix v e #

zipWith5 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f) => (a -> b -> c -> d -> e -> f) -> Matrix v a -> Matrix v b -> Matrix v c -> Matrix v d -> Matrix v e -> Matrix v f #

zipWith6 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v g) => (a -> b -> c -> d -> e -> f -> g) -> Matrix v a -> Matrix v b -> Matrix v c -> Matrix v d -> Matrix v e -> Matrix v f -> Matrix v g #

izipWith :: (Vector v a, Vector v b, Vector v c) => ((Int, Int) -> a -> b -> c) -> Matrix v a -> Matrix v b -> Matrix v c #

izipWith3 :: (Vector v a, Vector v b, Vector v c, Vector v d) => ((Int, Int) -> a -> b -> c -> d) -> Matrix v a -> Matrix v b -> Matrix v c -> Matrix v d #

izipWith4 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e) => ((Int, Int) -> a -> b -> c -> d -> e) -> Matrix v a -> Matrix v b -> Matrix v c -> Matrix v d -> Matrix v e #

izipWith5 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f) => ((Int, Int) -> a -> b -> c -> d -> e -> f) -> Matrix v a -> Matrix v b -> Matrix v c -> Matrix v d -> Matrix v e -> Matrix v f #

izipWith6 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v g) => ((Int, Int) -> a -> b -> c -> d -> e -> f -> g) -> Matrix v a -> Matrix v b -> Matrix v c -> Matrix v d -> Matrix v e -> Matrix v f -> Matrix v g #

zip :: (Vector v a, Vector v b, Vector v (a, b)) => Matrix v a -> Matrix v b -> Matrix v (a, b) #

zip3 :: (Vector v a, Vector v b, Vector v c, Vector v (a, b, c)) => Matrix v a -> Matrix v b -> Matrix v c -> Matrix v (a, b, c) #

zip4 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v (a, b, c, d)) => Matrix v a -> Matrix v b -> Matrix v c -> Matrix v d -> Matrix v (a, b, c, d) #

zip5 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v (a, b, c, d, e)) => Matrix v a -> Matrix v b -> Matrix v c -> Matrix v d -> Matrix v e -> Matrix v (a, b, c, d, e) #

zip6 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v (a, b, c, d, e, f)) => Matrix v a -> Matrix v b -> Matrix v c -> Matrix v d -> Matrix v e -> Matrix v f -> Matrix v (a, b, c, d, e, f) #

zipWithM :: (Monad m, Vector v a, Vector v b, Vector v c) => (a -> b -> m c) -> Matrix v a -> Matrix v b -> m (Matrix v c) #

zipWithM_ :: (Monad m, Vector v a, Vector v b) => (a -> b -> m c) -> Matrix v a -> Matrix v b -> m () #

unzip :: (Vector v a, Vector v b, Vector v (a, b)) => Matrix v (a, b) -> (Matrix v a, Matrix v b) #

unzip3 :: (Vector v a, Vector v b, Vector v c, Vector v (a, b, c)) => Matrix v (a, b, c) -> (Matrix v a, Matrix v b, Matrix v c) #

unzip4 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v (a, b, c, d)) => Matrix v (a, b, c, d) -> (Matrix v a, Matrix v b, Matrix v c, Matrix v d) #

unzip5 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v (a, b, c, d, e)) => Matrix v (a, b, c, d, e) -> (Matrix v a, Matrix v b, Matrix v c, Matrix v d, Matrix v e) #

unzip6 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v (a, b, c, d, e, f)) => Matrix v (a, b, c, d, e, f) -> (Matrix v a, Matrix v b, Matrix v c, Matrix v d, Matrix v e, Matrix v f) #

sequence :: (Vector v a, Vector v (m a), Monad m) => Matrix v (m a) -> m (Matrix v a) #

sequence_ :: (Vector v (m a), Monad m) => Matrix v (m a) -> m () #

generate :: Vector v a => (Int, Int) -> ((Int, Int) -> a) -> Matrix v a #