unsigned int m = 0;
for (unsigned int i=0; i<rows; ++i)
{
- lines[i].flush_cache ();
+ if (lines[i].cache_entries != 0)
+ lines[i].flush_cache ();
m = std::max (m, static_cast<unsigned int>(lines[i].entries.size()));
}
Assert (i<rows, ExcIndexRange(i, 0, rows));
Assert (j<cols, ExcIndexRange(j, 0, cols));
- lines[i].flush_cache();
+ if (lines[i].cache_entries != 0)
+ lines[i].flush_cache();
return std::binary_search (lines[i].entries.begin(),
lines[i].entries.end(),
j);
// already exist without any harm
for (unsigned int row=0; row<rows; ++row)
{
- lines[row].flush_cache ();
+ if (lines[row].cache_entries != 0)
+ lines[row].flush_cache ();
for (std::vector<unsigned int>::const_iterator
j=lines[row].entries.begin();
j != lines[row].entries.end();
{
for (unsigned int row=0; row<rows; ++row)
{
- lines[row].flush_cache ();
+ if (lines[row].cache_entries != 0)
+ lines[row].flush_cache ();
for (std::vector<unsigned int>::const_iterator
j=lines[row].entries.begin();
j != lines[row].entries.end(); ++j)
unsigned int b=0;
for (unsigned int row=0; row<rows; ++row)
{
- lines[row].flush_cache ();
+ if (lines[row].cache_entries != 0)
+ lines[row].flush_cache ();
for (std::vector<unsigned int>::const_iterator
j=lines[row].entries.begin();
unsigned int n=0;
for (unsigned int i=0; i<rows; ++i)
{
- lines[i].flush_cache ();
+ if (lines[i].cache_entries != 0)
+ lines[i].flush_cache ();
n += lines[i].entries.size();
}