HORIZON HASKELLDocslts/ghc-10.0.x8fef28d2026-11-02Search packagesCtrl K
Theme: |

GHC 10.0.0.20260917 · lts/ghc-10.0.x · 8fef28d · 2026-11-02

Modulematrices-0.5.0Haskell2010

Data.Matrix.Sparse.Generic

Contents
  1. Accessors
  2. length information
  3. Indexing
  4. Construction
  5. Conversions
Synopsis
  • Packagematrices-0.5.0
  • Exports23
  • LanguageHaskell2010
  • LicenceBSD-3-Clause
  • SourceGeneric.hs
classclass Eq a => Zero a where
#

Methods

Instances3Zero
  • Zero DoubleDefined in matrices-0.5.0 · Data.Matrix.Sparse.Generic
  • Zero IntDefined in matrices-0.5.0 · Data.Matrix.Sparse.Generic
  • Eq a => Zero [a]Defined in matrices-0.5.0 · Data.Matrix.Sparse.Generic
datadata CSR (v :: Type -> Type) a

Compressed Sparse Row (CSR) matrix

Constructors

Instances7Matrix, Eq, Read, Show, Generic, Rep, …

Accessors

length information

Indexing

methodtakeDiag :: m v a -> v a

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

Construction

valuematrix
  1. :: Matrix m v a
  2. => Int

    number of columns

  3. -> [a]

    row list

  4. -> m v a

O(m*n) Matrix construction

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

Conversions

methodflatten :: m v a -> v a

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

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

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