Data.Matrix.Sparse.Generic

Documentation

class Eq a => Zero a where

Methods

zero :: a

Instances

Zero Double

Defined in Data.Matrix.Sparse.Generic

Methods

zero :: Double

Zero Int

Defined in Data.Matrix.Sparse.Generic

Methods

zero :: Int

Eq a => Zero [a]

Defined in Data.Matrix.Sparse.Generic

Methods

zero :: [a]

data CSR v a

Compressed Sparse Row (CSR) matrix

Constructors

CSR !Int !Int !(v a) !(Vector Int) !(Vector Int)

Instances

(Zero a, Vector v a) => Matrix CSR v a

Defined in Data.Matrix.Sparse.Generic

Methods

dim :: CSR v a -> (Int, Int)

unsafeIndex :: CSR v a -> (Int, Int) -> a

unsafeFromVector :: (Int, Int) -> v a -> CSR v a

flatten :: CSR v a -> v a

unsafeTakeRow :: CSR v a -> Int -> v a

unsafeTakeColumn :: CSR v a -> Int -> v a

takeDiag :: CSR v a -> v a

thaw :: PrimMonad s => CSR v a -> s (Mutable CSR (Mutable v) (PrimState s) a)

unsafeThaw :: PrimMonad s => CSR v a -> s (Mutable CSR (Mutable v) (PrimState s) a)

freeze :: PrimMonad s => Mutable CSR (Mutable v) (PrimState s) a -> s (CSR v a)

unsafeFreeze :: PrimMonad s => Mutable CSR (Mutable v) (PrimState s) a -> s (CSR v a)

Eq (v a) => Eq (CSR v a)

Defined in Data.Matrix.Sparse.Generic

Methods

(==) :: CSR v a -> CSR v a -> Bool

(/=) :: CSR v a -> CSR v a -> Bool

Read (v a) => Read (CSR v a)

Defined in Data.Matrix.Sparse.Generic

Methods

readsPrec :: Int -> ReadS (CSR v a)

readList :: ReadS [CSR v a]

readPrec :: ReadPrec (CSR v a)

readListPrec :: ReadPrec [CSR v a]

Show (v a) => Show (CSR v a)

Defined in Data.Matrix.Sparse.Generic

Methods

showsPrec :: Int -> CSR v a -> ShowS

show :: CSR v a -> String

showList :: [CSR v a] -> ShowS

Generic (CSR v a)

Defined in Data.Matrix.Sparse.Generic

Associated Types

type Rep (CSR v a) :: Type -> Type

Methods

from :: CSR v a -> Rep (CSR v a) x

to :: Rep (CSR v a) x -> CSR v a

type Mutable CSR

mutable sparse matrix not implemented

Defined in Data.Matrix.Sparse.Generic

type Mutable CSR = MMatrix

type Rep (CSR v a)

Defined in Data.Matrix.Sparse.Generic

type Rep (CSR v a) = D1 (MetaData "CSR" "Data.Matrix.Sparse.Generic" "matrices-0.5.0-FMMu8pFXACi4pkCcGE7sA2" False) (C1 (MetaCons "CSR" PrefixI False) ((S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 Int) :*: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 Int)) :*: (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 (v a)) :*: (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 (Vector Int)) :*: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 (Vector Int))))))

type AssocList a = [((Int, Int), a)]

Accessors

length information

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

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

Indexing

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

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

Indexing

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

Extract a row.

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

Extract a row.

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

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

Construction

fromAscAL :: Vector v a => (Int, Int) -> Int -> AssocList a -> CSR v a

Construct CSR from ascending association list. Items must be sorted first by row index, and then by column index.

unsafeFromVector :: Matrix m v a => (Int, Int) -> 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

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

Conversions

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

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

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

O(m) Return the rows

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

O(m*n) Return the columns

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

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

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

O(m*n) List of lists