/// non-empty lexmin.
///
/// If hasSample is false, check that findIntegerSample returns None and
-/// getIntegerLexMin returns Empty.
+/// findIntegerLexMin returns Empty.
///
/// If fn is TestFunction::Empty, check that isIntegerEmpty returns the
/// opposite of hasSample.
EXPECT_TRUE(maybeLexMin.isEmpty());
if (maybeLexMin.isBounded()) {
- llvm::errs() << "getIntegerLexMin gave sample: ";
+ llvm::errs() << "findIntegerLexMin gave sample: ";
dump(*maybeLexMin);
}
} else {
EXPECT_EQ(poly.findRationalLexMin().getKind(), kind);
}
-TEST(IntegerPolyhedronTest, getRationalLexMin) {
+TEST(IntegerPolyhedronTest, findRationalLexMin) {
expectRationalLexMin(
parsePoly("(x, y, z) : (x + 10 >= 0, y + 40 >= 0, z + 30 >= 0)"),
{{-10, 1}, {-40, 1}, {-30, 1}});
EXPECT_EQ(poly.findRationalLexMin().getKind(), kind);
}
-TEST(IntegerPolyhedronTest, getIntegerLexMin) {
+TEST(IntegerPolyhedronTest, findIntegerLexMin) {
expectIntegerLexMin(parsePoly("(x, y, z) : (2*x + 13 >= 0, 4*y - 3*x - 2 >= "
"0, 11*z + 5*y - 3*x + 7 >= 0)"),
{-6, -4, 0});
EXPECT_FALSE(simplex.isMarkedRedundant(5));
}
-TEST(Simplextest, pivotRedundantRegressionTest) {
+TEST(SimplexTest, pivotRedundantRegressionTest) {
Simplex simplex(2);
simplex.addInequality({-1, 0, -1}); // x <= -1.
unsigned snapshot = simplex.getSnapshot();