Searched refs:isBounded (Results 1 – 5 of 5) sorted by relevance
1370 return computeOptimum(Direction::Up, con[constraintIndex]).isBounded(); in isBoundedAlongConstraint()1640 assert(maybeWidth.isBounded() && "Width should be bounded!"); in computeWidth()1660 assert(maybeWidth.isBounded() && "Width should be bounded!"); in computeWidthAndDuals()2011 assert((minRoundedUp.isBounded() && maxRoundedDown.isBounded()) && in findIntegerSample()2146 if (minimum.isBounded() && *minimum >= Fraction(0, 1)) { in findIneqType()2150 if ((!minimum.isBounded() || *minimum <= Fraction(0, 1)) && in findIneqType()2151 (!maximum.isBounded() || *maximum >= Fraction(0, 1))) { in findIneqType()2176 return minimum.isBounded() && maximum.isBounded() && in isRedundantEquality()
92 if (!maybeLexMin.isBounded()) in findRationalLexMin()112 if (!maybeLexMin.isBounded()) in findIntegerLexMin()
76 if (maybeLexMin.isBounded()) { in checkSample()88 if (maybeLexMin.isBounded()) { in checkSample()1068 ASSERT_TRUE(lexMin.isBounded()); in expectRationalLexMin()1140 ASSERT_TRUE(lexMin.isBounded()); in expectIntegerLexMin()
412 EXPECT_TRUE(maxX.isBounded() && *maxX == Fraction(-1, 1)); in TEST()
51 bool isBounded() const { return kind == OptimumKind::Bounded; } in isBounded() function