Lines Matching refs:Up

169   return direction == Direction::Up ? elem > 0 : elem < 0;  in signMatchesDirection()
173   return direction == Direction::Up ? Direction::Down : Simplex::Direction::Up;  in flippedDirection()
967     Optional<Pivot> maybePivot = findPivot(u.pos, Direction::Up);  in restoreRow()
1163     if (Optional<unsigned> maybeRow = findPivotRow({}, Direction::Up, column)) {  in undoLastConstraint()
1370   return computeOptimum(Direction::Up, con[constraintIndex]).isBounded();  in isBoundedAlongConstraint()
1444     if (computeOptimum(Direction::Up, dir).isUnbounded())  in isUnbounded()
1639         simplex.computeOptimum(Direction::Up, getCoeffsForDirection(dir));  in computeWidth()
1659         simplex.computeRowOptimum(Simplex::Direction::Up, row);  in computeWidthAndDuals()
2074       computeOptimum(Simplex::Direction::Up, coeffs).map(floor));  in computeIntegerBounds()
2149   MaybeOptimum<Fraction> maximum = computeOptimum(Direction::Up, coeffs);  in findIneqType()
2173   MaybeOptimum<Fraction> maximum = computeOptimum(Direction::Up, coeffs);  in isRedundantEquality()