Lines Matching refs:Direction

33 using Direction = Simplex::Direction;
186 bool signMatchesDirection(const DynamicAPInt &elem, Direction direction) {
188   return direction == Direction::Up ? elem > 0 : elem < 0;
191 Direction flippedDirection(Direction direction) {
192   return direction == Direction::Up ? Direction::Down : Simplex::Direction::Up;
887 Simplex::findPivot(int row, Direction direction) const {
904   Direction newDirection =
998     std::optional<Pivot> maybePivot = findPivot(u.pos, Direction::Up);
1032                                               Direction direction,
1197             findPivotRow({}, Direction::Up, column)) {
1200                    findPivotRow({}, Direction::Down, column)) {
1345 MaybeOptimum<Fraction> Simplex::computeRowOptimum(Direction direction,
1364 MaybeOptimum<Fraction> Simplex::computeOptimum(Direction direction,
1375 MaybeOptimum<Fraction> Simplex::computeOptimum(Direction direction,
1391   if (u.restricted && direction == Direction::Down &&
1404   return computeOptimum(Direction::Up, con[constraintIndex]).isBounded();
1449           findPivotRow({}, Direction::Down, column);
1458     MaybeOptimum<Fraction> minimum = computeRowOptimum(Direction::Down, row);
1479     if (computeOptimum(Direction::Up, dir).isUnbounded())
1482     if (computeOptimum(Direction::Down, dir).isUnbounded())
1668            "Direction passed is the zero vector!");
1675         simplex.computeOptimum(Direction::Up, getCoeffsForDirection(dir));
1695         simplex.computeRowOptimum(Simplex::Direction::Up, row);
1756            "Direction vector has wrong dimensionality");
2110       computeOptimum(Simplex::Direction::Down, coeffs).map(ceil));
2112       computeOptimum(Simplex::Direction::Up, coeffs).map(floor));
2118   auto upOpt = computeOptimum(Simplex::Direction::Up, coeffs);
2119   auto downOpt = computeOptimum(Simplex::Direction::Down, coeffs);
2203   MaybeOptimum<Fraction> minimum = computeOptimum(Direction::Down, coeffs);
2207   MaybeOptimum<Fraction> maximum = computeOptimum(Direction::Up, coeffs);
2230   MaybeOptimum<Fraction> minimum = computeOptimum(Direction::Down, coeffs);
2231   MaybeOptimum<Fraction> maximum = computeOptimum(Direction::Up, coeffs);