![]() |
Reference documentation for deal.II version 8.1.0
|
Public Member Functions | |
Line () | |
void | add (const size_type col_num) |
template<typename ForwardIterator > | |
void | add_entries (ForwardIterator begin, ForwardIterator end, const bool indices_are_sorted) |
size_type | memory_consumption () const |
Public Attributes | |
std::vector< size_type > | entries |
Store some data for each row describing which entries of this row are nonzero. Data is stored sorted in the entries
std::vector. The vector per row is dynamically growing upon insertion doubling its memory each time.
Definition at line 420 of file compressed_simple_sparsity_pattern.h.
|
inline |
Constructor.
Definition at line 558 of file compressed_simple_sparsity_pattern.h.
|
inline |
Add the given column number to this line.
Definition at line 471 of file compressed_simple_sparsity_pattern.h.
void CompressedSimpleSparsityPattern::Line::add_entries | ( | ForwardIterator | begin, |
ForwardIterator | end, | ||
const bool | indices_are_sorted | ||
) |
Add the columns specified by the iterator range to this line.
size_type CompressedSimpleSparsityPattern::Line::memory_consumption | ( | ) | const |
estimates memory consumption.
std::vector<size_type> CompressedSimpleSparsityPattern::Line::entries |
Storage for the column indices of this row. This array is always kept sorted.
Definition at line 428 of file compressed_simple_sparsity_pattern.h.