CompressedSimpleSparsityPattern::Line Struct Reference

List of all members.

Public Member Functions
	Line ()
void	add (const unsigned int col_num)
template<typename ForwardIterator >
void	add_entries (ForwardIterator begin, ForwardIterator end, const bool indices_are_sorted)
Public Attributes
std::vector< unsigned int >	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.

---

Constructor & Destructor Documentation

CompressedSimpleSparsityPattern::Line::Line

(

)

[inline]

Constructor.

---

Member Function Documentation

void CompressedSimpleSparsityPattern::Line::add

(

const unsigned int

col_num

)

[inline]

Add the given column number to this line.

References entries.

template<typename ForwardIterator >

void CompressedSimpleSparsityPattern::Line::add_entries	(	ForwardIterator	begin,
		ForwardIterator	end,
		const bool	indices_are_sorted
	)			[inline]

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

---

Member Data Documentation

std::vector<unsigned int> CompressedSimpleSparsityPattern::Line::entries

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

Referenced by add().

---

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

• lac/include/lac/compressed_simple_sparsity_pattern.h