Lines Matching defs:simplex

339 /// As a heuristic, we try adding all the constraints and check if simplex
360   Simplex simplex(b);
367     // A snapshot of the simplex state to rollback to.
414       // Similarly, we also want to rollback simplex to its original state.
415       unsigned initialSnapshot = simplex.getSnapshot();
482       unsigned offset = simplex.getNumConstraints();
485       simplex.appendVariable(numLocalsAdded);
487       unsigned snapshotBeforeIntersect = simplex.getSnapshot();
488       simplex.intersectIntegerRelation(sI);
490       if (simplex.isEmpty()) {
495         simplex.rollback(initialSnapshot);
506       // Equalities are added to simplex as a pair of inequalities.
512       // When there are two copies of a constraint in `simplex`, i.e., among the
522       simplex.detectRedundant(offset, totalNewSimplexInequalities);
524         canIgnoreIneq[j] = simplex.isMarkedRedundant(offset + j);
525       simplex.rollback(snapshotBeforeIntersect);
539       unsigned simplexSnapshot = simplex.getSnapshot();
547     // is not satisfied, and then add ineq to b and simplex because
559         simplex.rollback(frame.simplexSnapshot);
564         simplex.addInequality(ineq);
576       frame.simplexSnapshot = simplex.getSnapshot();
582       simplex.addInequality(ineq);