Reference documentation for deal.II version 9.2.0
\(\newcommand{\dealvcentcolon}{\mathrel{\mathop{:}}}\) \(\newcommand{\dealcoloneq}{\dealvcentcolon\mathrel{\mkern-1.2mu}=}\) \(\newcommand{\jump}[1]{\left[\!\left[ #1 \right]\!\right]}\) \(\newcommand{\average}[1]{\left\{\!\left\{ #1 \right\}\!\right\}}\)
Public Member Functions | Public Attributes | List of all members
DynamicSparsityPattern::Line Struct Reference
Linear algebra classes » Sparsity patterns

Public Member Functions

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
 

Detailed Description

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 701 of file dynamic_sparsity_pattern.h.

The documentation for this struct was generated from the following files:
Generated by   doxygen 1.8.17