return;
const unsigned int rowindex =
- rowset.size()==0 ? i : rowset.nth_index_in_set(i);
+ rowset.size()==0 ? i : rowset.index_within_set(i);
lines[rowindex].add (j);
}
return;
const unsigned int rowindex =
- rowset.size()==0 ? row : rowset.nth_index_in_set(row);
+ rowset.size()==0 ? row : rowset.index_within_set(row);
lines[rowindex].add_entries (begin, end, indices_are_sorted);
}
return 0;
const unsigned int rowindex =
- rowset.size()==0 ? row : rowset.nth_index_in_set(row);
+ rowset.size()==0 ? row : rowset.index_within_set(row);
return lines[rowindex].entries.size();
}
void
CompressedSimpleSparsityPattern::print_gnuplot (std::ostream &out) const
{
- for (unsigned int row=0; row<rows; ++row)
+ for (unsigned int row=0; row<lines.size(); ++row)
{
const unsigned int rowindex =
rowset.size()==0 ? row : rowset.nth_index_in_set(row);
CompressedSimpleSparsityPattern::bandwidth () const
{
unsigned int b=0;
- for (unsigned int row=0; row<rows; ++row)
+ for (unsigned int row=0; row<lines.size(); ++row)
{
const unsigned int rowindex =
rowset.size()==0 ? row : rowset.nth_index_in_set(row);
CompressedSimpleSparsityPattern::n_nonzero_elements () const
{
unsigned int n=0;
- for (unsigned int i=0; i<rows; ++i)
+ for (unsigned int i=0; i<lines.size(); ++i)
{
n += lines[i].entries.size();
}