Limbo
|
Compressed sparse row (CSR) matrix. More...
#include <Solvers.h>
Public Types | |
typedef T | value_type |
value type | |
typedef I | index_type |
index type | |
Public Member Functions | |
MatrixCSR () | |
constructor | |
MatrixCSR (MatrixCSR const &rhs) | |
copy constructor | |
MatrixCSR & | operator= (MatrixCSR const &rhs) |
assignment | |
~MatrixCSR () | |
destructor | |
void | initialize (index_type nr, index_type nc, index_type nv) |
Initialize matrix. More... | |
void | reset () |
Destroy matrix and recycle memory. | |
void | copy (MatrixCSR const &rhs) |
copy object More... | |
value_type | at (index_type i, index_type j) const |
get element More... | |
void | set (index_type nr, index_type nc, LinearConstraint< value_type > const *vConstraint) |
Set from array of constraints. More... | |
Public Attributes | |
value_type * | vElement |
Flatten data values. A real or complex array that contains the non-zero elements of A. Values of the non-zero elements of A are mapped into the values array using the row-major storage mapping described above. | |
index_type * | vColumn |
Element i of the integer array columns is the number of the column in A that contains the i-th value in the values array. | |
index_type * | vRowBeginIndex |
Element j of this integer array gives the index of the element in the values array that is first non-zero element in a row j of A. Note that this index is equal to vRowBeginIndex(j) - vRowBeginIndex(1)+StartingIndex. | |
index_type | numRows |
number of rows, not in the CSR format | |
index_type | numColumns |
number of columns, not in the CSR format | |
index_type | numElements |
number of non-zero elements | |
Static Public Attributes | |
static index_type | s_startingIndex = StartingIndex |
starting index, like zero-based indexing or one-based indexing | |
Compressed sparse row (CSR) matrix.
T | value type |
I | index type |
StartingIndex | zero-based indexing or one-based indexing |
|
inline |
|
inline |
|
inline |
|
inline |