CompressedSimpleSparsityPattern::Line Struct Reference

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

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 420 of file compressed_simple_sparsity_pattern.h.

Constructor & Destructor Documentation

CompressedSimpleSparsityPattern::Line::Line ( )

inline

Constructor.

Definition at line 558 of file compressed_simple_sparsity_pattern.h.

Member Function Documentation

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

inline

Add the given column number to this line.

Definition at line 471 of file compressed_simple_sparsity_pattern.h.

template<typename ForwardIterator >

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.

Member Data Documentation

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.

---

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

• include/deal.II/lac/compressed_simple_sparsity_pattern.h