216 MaybeOptimum<SmallVector<Fraction, 8>> LexSimplex::findRationalLexMin() {  in findRationalLexMin()
287 MaybeOptimum<SmallVector<int64_t, 8>> LexSimplex::findIntegerLexMin() {  in findIntegerLexMin()
310   MaybeOptimum<SmallVector<Fraction, 8>> sample = getRationalSample();  in findIntegerLexMin()
1311 MaybeOptimum<Fraction> Simplex::computeRowOptimum(Direction direction,  in computeRowOptimum()
1330 MaybeOptimum<Fraction> Simplex::computeOptimum(Direction direction,  in computeOptimum()
1341 MaybeOptimum<Fraction> Simplex::computeOptimum(Direction direction,  in computeOptimum()
1356   MaybeOptimum<Fraction> optimum = computeRowOptimum(direction, row);  in computeOptimum()
1423     MaybeOptimum<Fraction> minimum = computeRowOptimum(Direction::Down, row);  in detectRedundant()
1561 MaybeOptimum<SmallVector<Fraction, 8>> LexSimplex::getRationalSample() const {  in getRationalSample()
1638     MaybeOptimum<Fraction> maybeWidth =  in computeWidth()
1658     MaybeOptimum<Fraction> maybeWidth =  in computeWidthAndDuals()
1994       MaybeOptimum<int64_t> minRoundedUp, maxRoundedDown;  in findIntegerSample()
2069 std::pair<MaybeOptimum<int64_t>, MaybeOptimum<int64_t>>
2071   MaybeOptimum<int64_t> minRoundedUp(  in computeIntegerBounds()
2073   MaybeOptimum<int64_t> maxRoundedDown(  in computeIntegerBounds()
2145   MaybeOptimum<Fraction> minimum = computeOptimum(Direction::Down, coeffs);  in findIneqType()
2149   MaybeOptimum<Fraction> maximum = computeOptimum(Direction::Up, coeffs);  in findIneqType()
2172   MaybeOptimum<Fraction> minimum = computeOptimum(Direction::Down, coeffs);  in isRedundantEquality()
2173   MaybeOptimum<Fraction> maximum = computeOptimum(Direction::Up, coeffs);  in isRedundantEquality()