Reference documentation for deal.II version Git 44f8b89d8e 2019-09-19 12:50:43 +0200
\(\newcommand{\dealcoloneq}{\mathrel{\vcenter{:}}=}\)
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 701 of file dynamic_sparsity_pattern.h.

Member Function Documentation

◆ add()

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

Add the given column number to this line.

Definition at line 991 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 dynamic_sparsity_pattern.cc.

◆ memory_consumption()

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

estimates memory consumption.

Definition at line 216 of file dynamic_sparsity_pattern.cc.

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


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