|
| SparseMatrix (bool is_symetrical=false) |
|
void | set_element (index_t i, index_t j, const T &value) |
|
T | get_element (index_t i, index_t j) const |
|
T | get_element_in_line (index_t i, index_t e) const |
|
| SparseMatrixImpl (bool is_symmetrical=false) |
|
| ~SparseMatrixImpl ()=default |
|
bool | exist (index_t i, index_t j) const |
|
index_t | get_nb_elements_in_line (index_t i) const |
| gets number of elements within a row More...
|
|
index_t | get_column_in_line (index_t i, index_t e) const |
| gets the j that correspond to the given index within the row More...
|
|
std::tuple< bool, index_t > | get_index_in_line (index_t i, index_t j) const |
| gets the rows_ index corresponding to a given i-j couple More...
|
|
index_t | ni () const |
|
index_t | nj () const |
|
bool | is_symmetrical () const |
|
void | build_matrix (index_t ni, index_t nj) |
|
T | get_element_in_line (index_t i, index_t e) const |
|
template<typename T>
class RINGMesh::SparseMatrix< T, heavy >
specialization of SparseMatrix for MatrixType "heavy" , the main difference with light is that here we store only one copy of the data in the case of a symmetrical matrix. The data are stored in a std::deque and the rows contains the ids of the values within the deque.
Definition at line 415 of file matrix.h.