Count lower/upper entries simpler and faster.

This commit is contained in:
Atgeirr Flø Rasmussen 2018-11-23 21:37:52 +01:00
parent 8a038401ce
commit 48db4062b5

View File

@ -448,12 +448,12 @@ namespace Opm
const auto endi = A.end();
for (auto i = A.begin(); i != endi; ++i) {
const size_type iIndex = i.index();
size_type numLowerRow = 0;
for (auto j = (*i).begin(); j.index() < iIndex; ++j) {
++numLower;
}
for (auto j = (*i).beforeEnd(); j.index() > iIndex; --j) {
++numUpper;
++numLowerRow;
}
numLower += numLowerRow;
numUpper += (*i).size() - numLowerRow - 1;
}
assert(numLower + numUpper + A.N() == A.nonzeroes());