for (unsigned r = 0, e = getNumInequalities(); r < e; r++) {
// Change the inequality to its complement.
tmpCst.inequalities.negateRow(r);
- tmpCst.atIneq(r, tmpCst.getNumCols() - 1)--;
+ --tmpCst.atIneq(r, tmpCst.getNumCols() - 1);
if (tmpCst.isEmpty()) {
redun[r] = true;
// Zero fill the redundant inequality.
tmpCst.inequalities.fillRow(r, /*value=*/0);
} else {
// Reverse the change (to avoid recreating tmpCst each time).
- tmpCst.atIneq(r, tmpCst.getNumCols() - 1)++;
+ ++tmpCst.atIneq(r, tmpCst.getNumCols() - 1);
tmpCst.inequalities.negateRow(r);
}
}
// case this has no effect)
rollback(snapshotStack.back());
int64_t nextValue = nextValueStack.back();
- nextValueStack.back()++;
+ ++nextValueStack.back();
if (nextValue > upperBoundStack.back()) {
// We have exhausted the range and found no solution. Pop the stack and
// return up a level.