Reference documentation for deal.II version Git e7bb9ce7b3 2020-09-18 12:07:32 -0400
\(\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

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_typeentries

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

Member Function Documentation

◆ add()

void DynamicSparsityPattern::Line::add ( const size_type  col_num)

Add the given column number to this line.

Definition at line 986 of file dynamic_sparsity_pattern.h.

◆ add_entries()

template<typename ForwardIterator >
template void DynamicSparsityPattern::Line::add_entries ( ForwardIterator  begin,
ForwardIterator  end,
const bool  indices_are_sorted 

Add the columns specified by the iterator range to this line.

Definition at line 34 of file

◆ memory_consumption()

DynamicSparsityPattern::size_type DynamicSparsityPattern::Line::memory_consumption ( ) const

estimates memory consumption.

Definition at line 216 of file

Member Data Documentation

◆ entries

std::vector<size_type> DynamicSparsityPattern::Line::entries

Storage for the column indices of this row. This array is always kept sorted.

Definition at line 703 of file dynamic_sparsity_pattern.h.

The documentation for this struct was generated from the following files: