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) |
| std::size_t | memory_consumption () const |
Public Attributes | |
| std::vector< unsigned int > | entries |
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 404 of file compressed_simple_sparsity_pattern.h.
| CompressedSimpleSparsityPattern::Line::Line | ( | ) | [inline] |
Constructor.
Definition at line 542 of file compressed_simple_sparsity_pattern.h.
| void CompressedSimpleSparsityPattern::Line::add | ( | const unsigned int | col_num | ) | [inline] |
Add the given column number to this line.
Definition at line 455 of file compressed_simple_sparsity_pattern.h.
References entries, and Utilities::lower_bound().
| 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.
| std::size_t CompressedSimpleSparsityPattern::Line::memory_consumption | ( | ) | const |
estimates memory consumption.
| std::vector<unsigned int> CompressedSimpleSparsityPattern::Line::entries |
Storage for the column indices of this row. This array is always kept sorted.
Definition at line 412 of file compressed_simple_sparsity_pattern.h.
Referenced by add().
documentation generated on Wed May 23 2012 06:08:26 by
doxygen
1.7.3