18 using Direction = Simplex::Direction;
59 const Simplex::Unknown &SimplexBase::unknownFromIndex(int index) const {  in unknownFromIndex()
64 const Simplex::Unknown &SimplexBase::unknownFromColumn(unsigned col) const {  in unknownFromColumn()
69 const Simplex::Unknown &SimplexBase::unknownFromRow(unsigned row) const {  in unknownFromRow()
74 Simplex::Unknown &SimplexBase::unknownFromIndex(int index) {  in unknownFromIndex()
79 Simplex::Unknown &SimplexBase::unknownFromColumn(unsigned col) {  in unknownFromColumn()
84 Simplex::Unknown &SimplexBase::unknownFromRow(unsigned row) {  in unknownFromRow()
173   return direction == Direction::Up ? Direction::Down : Simplex::Direction::Up;  in flippedDirection()
855 Optional<SimplexBase::Pivot> Simplex::findPivot(int row,  in findPivot()
962 LogicalResult Simplex::restoreRow(Unknown &u) {  in restoreRow()
1000 Optional<unsigned> Simplex::findPivotRow(Optional<unsigned> skipRow,  in findPivotRow()
1079 void Simplex::addInequality(ArrayRef<int64_t> coeffs) {  in addInequality()
1151 void Simplex::undoLastConstraint() {  in undoLastConstraint()
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()
1365 bool Simplex::isBoundedAlongConstraint(unsigned constraintIndex) {  in isBoundedAlongConstraint()
1375 bool Simplex::isMarkedRedundant(unsigned constraintIndex) const {  in isMarkedRedundant()
1385 void Simplex::markRowRedundant(Unknown &u) {  in markRowRedundant()
1395 void Simplex::detectRedundant(unsigned offset, unsigned count) {  in detectRedundant()
1436 bool Simplex::isUnbounded() {  in isUnbounded()
1464 Simplex Simplex::makeProduct(const Simplex &a, const Simplex &b) {  in makeProduct()
1467   Simplex result(numVar);  in makeProduct()
1536 Optional<SmallVector<Fraction, 8>> Simplex::getRationalSample() const {  in getRationalSample()
1591 Optional<SmallVector<int64_t, 8>> Simplex::getSamplePointIfIntegral() const {  in getSamplePointIfIntegral()
1620   using Orientation = Simplex::Orientation;
1623   GBRSimplex(const Simplex &originalSimplex)  in GBRSimplex()
1624       : simplex(Simplex::makeProduct(originalSimplex, originalSimplex)),  in GBRSimplex()
1659         simplex.computeRowOptimum(Simplex::Direction::Up, row);  in computeWidthAndDuals()
1727   Simplex simplex;
1790 void Simplex::reduceBasis(Matrix &basis, unsigned level) {  in reduceBasis()
1957 Optional<SmallVector<int64_t, 8>> Simplex::findIntegerSample() {  in findIntegerSample()
2070 Simplex::computeIntegerBounds(ArrayRef<int64_t> coeffs) {  in computeIntegerBounds()
2072       computeOptimum(Simplex::Direction::Down, coeffs).map(ceil));  in computeIntegerBounds()
2074       computeOptimum(Simplex::Direction::Up, coeffs).map(floor));  in computeIntegerBounds()
2115 bool Simplex::isRationalSubsetOf(const IntegerRelation &rel) {  in isRationalSubsetOf()
2144 Simplex::IneqType Simplex::findIneqType(ArrayRef<int64_t> coeffs) {  in findIneqType()
2159 bool Simplex::isRedundantInequality(ArrayRef<int64_t> coeffs) {  in isRedundantInequality()
2169 bool Simplex::isRedundantEquality(ArrayRef<int64_t> coeffs) {  in isRedundantEquality()