58                            other.getNumInequalities());  in append()
61   for (unsigned r = 0, e = other.getNumInequalities(); r < e; r++) {  in append()
139   for (unsigned i = poly.getNumInequalities(); i > 0; i--)  in removeConstraintsInvolvingVarRange()
145   return {getSpace(), getNumInequalities(), getNumEqualities()};  in getCounts()
164   removeInequalityRange(counts.getNumIneqs(), getNumInequalities());  in truncate()
411   for (unsigned r = 0, e = getNumInequalities(); r < e; r++) {  in getLowerAndUpperBoundIndices()
475   unsigned e = isEq ? getNumEqualities() : getNumInequalities();  in findConstraintWithNonZeroAt()
487   for (unsigned i = 0, e = getNumInequalities(); i < e; ++i)  in normalizeConstraintsByGCD()
495     unsigned numRows = isEq ? getNumEqualities() : getNumInequalities();  in hasInvalidConstraint()
568     for (unsigned r = 0, e = cst.getNumInequalities(); r < e; r++) {  in getBestVarToEliminate()
691   for (unsigned i = 0, e = getNumInequalities(); i < e; ++i) {  in getBoundedDirections()
842   for (unsigned i = 0, e = cone.getNumInequalities(); i < e; ++i) {  in findIntegerSample()
889   for (unsigned i = 0, e = getNumInequalities(); i < e; ++i) {  in containsPoint()
960   for (unsigned i = 0, e = getNumInequalities(); i < e; ++i) {  in gcdTightenInequalities()
1003     for (unsigned i = 0, e = getNumInequalities(); i < e; ++i) {  in gaussianEliminateVars()
1021   SmallVector<bool, 32> redun(getNumInequalities(), false);  in removeRedundantInequalities()
1026   for (unsigned r = 0, e = getNumInequalities(); r < e; r++) {  in removeRedundantInequalities()
1043   for (unsigned r = 0, e = getNumInequalities(); r < e; ++r) {  in removeRedundantInequalities()
1061   unsigned numIneqs = getNumInequalities();  in removeRedundantConstraints()
1248     for (unsigned k = 0, t = getNumInequalities(); k < t; ++k)  in removeRedundantLocalVars()
1440   for (r = 0, e = getNumInequalities(); r < e; r++) {  in getConstantBoundOnDimSize()
1534   for (r = 0, e = getNumInequalities(); r < e; r++) {  in computeConstantLowerOrUpperBound()
1546   for (unsigned r = 0, e = getNumInequalities(); r < e; r++) {  in computeConstantLowerOrUpperBound()
1600   for (unsigned r = 0, e = getNumInequalities(); r < e; r++) {  in isHyperRectangular()
1649   SmallVector<bool, 256> redunIneq(getNumInequalities(), false);  in removeTrivialRedundancy()
1650   for (unsigned r = 0, e = getNumInequalities(); r < e; r++) {  in removeTrivialRedundancy()
1682   for (unsigned r = 0, e = getNumInequalities(); r < e; r++)  in removeTrivialRedundancy()
1777   nbIndices.reserve(getNumInequalities());  in fourierMotzkinEliminate()
1782   for (unsigned r = 0, e = getNumInequalities(); r < e; r++) {  in fourierMotzkinEliminate()
1955   for (unsigned r = 0, e = a.getNumInequalities(); r < e; ++r) {  in getCommonConstraints()
1956     for (unsigned s = 0, f = b.getNumInequalities(); s < f; ++s) {  in getCommonConstraints()
2101   for (unsigned r = 0, e = cst.getNumInequalities(); r < e; r++) {  in getIndependentConstraints()
2251   for (unsigned i = 0, e = getNumInequalities(); i < e; ++i) {  in print()