#include <alpaqa/problem/sparsity.hpp>
Sparse compressed-column structure (CCS or CSC).
Definition at line 28 of file sparsity.hpp.
Public Types | |
enum | Order { Unsorted = 0 , SortedRows = 1 } |
using | storage_index_t = StorageIndex |
using | index_vector_t = Eigen::VectorX< storage_index_t > |
using | index_vector_view_t = Eigen::Ref< const index_vector_t > |
using | index_vector_map_t = Eigen::Map< const index_vector_t > |
Public Member Functions | |
length_t | nnz () const |
Get the number of structurally nonzero elements. | |
Public Attributes | |
length_t | rows = 0 |
length_t | cols = 0 |
Symmetry | symmetry = Symmetry::Unsymmetric |
index_vector_view_t | inner_idx = index_vector_map_t{nullptr, 0} |
index_vector_view_t | outer_ptr = index_vector_map_t{nullptr, 0} |
Order | order = Unsorted |
using storage_index_t = StorageIndex |
Definition at line 30 of file sparsity.hpp.
using index_vector_t = Eigen::VectorX<storage_index_t> |
Definition at line 31 of file sparsity.hpp.
using index_vector_view_t = Eigen::Ref<const index_vector_t> |
Definition at line 32 of file sparsity.hpp.
using index_vector_map_t = Eigen::Map<const index_vector_t> |
Definition at line 33 of file sparsity.hpp.
enum Order |
Enumerator | |
---|---|
Unsorted | The row indices are not sorted. |
SortedRows | Within each column, all row indices are sorted in ascending order. |
Definition at line 38 of file sparsity.hpp.
|
inline |
Get the number of structurally nonzero elements.
Definition at line 47 of file sparsity.hpp.
length_t rows = 0 |
Definition at line 34 of file sparsity.hpp.
length_t cols = 0 |
Definition at line 34 of file sparsity.hpp.
Symmetry symmetry = Symmetry::Unsymmetric |
Definition at line 35 of file sparsity.hpp.
index_vector_view_t inner_idx = index_vector_map_t{nullptr, 0} |
Definition at line 36 of file sparsity.hpp.
index_vector_view_t outer_ptr = index_vector_map_t{nullptr, 0} |
Definition at line 37 of file sparsity.hpp.
Order order = Unsorted |
Definition at line 44 of file sparsity.hpp.