Searched refs:maybeLexMin (Results 1 – 2 of 2) sorted by relevance
62 MaybeOptimum<SmallVector<int64_t, 8>> maybeLexMin; in checkSample() local66 maybeLexMin = poly.findIntegerLexMin(); in checkSample()75 EXPECT_TRUE(maybeLexMin.isEmpty()); in checkSample()76 if (maybeLexMin.isBounded()) { in checkSample()78 dump(*maybeLexMin); in checkSample()84 ASSERT_FALSE(maybeLexMin.isEmpty()); in checkSample()85 if (maybeLexMin.isUnbounded()) { in checkSample()88 if (maybeLexMin.isBounded()) { in checkSample()89 EXPECT_TRUE(poly.containsPoint(*maybeLexMin)); in checkSample()
92 if (!maybeLexMin.isBounded()) in findRationalLexMin()93 return maybeLexMin; in findRationalLexMin()100 assert(maybeLexMin->size() == getNumVars() && in findRationalLexMin()102 maybeLexMin->resize(getNumDimAndSymbolVars()); in findRationalLexMin()103 return maybeLexMin; in findRationalLexMin()109 MaybeOptimum<SmallVector<int64_t, 8>> maybeLexMin = in findIntegerLexMin() local112 if (!maybeLexMin.isBounded()) in findIntegerLexMin()113 return maybeLexMin.getKind(); in findIntegerLexMin()120 assert(maybeLexMin->size() == getNumVars() && in findIntegerLexMin()122 maybeLexMin->resize(getNumDimAndSymbolVars()); in findIntegerLexMin()[all …]