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

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, ScratchData &scratch_data)

size_type	memory_consumption () const

Public Attributes
std::vector< size_type >	entries

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 1006 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,
		ScratchData &	scratch_data
	)

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

Parameters

[in]	begin	Iterator to the beginning of the range.
[in]	end	Iterator to the end of the range.
[in]	indices_are_sorted	Whether or not the indices are both sorted and unique.
[in]	scratch_data	Scratch object containing buffers used to merge the existing indices and the new indices. This is typically the thread-local one stored by DynamicSparsityPattern: this function will reallocate said buffers as needed.