Searched refs:getInequality (Results 1 – 6 of 6) sorted by relevance
288 EXPECT_THAT(fac2.getInequality(0), testing::ElementsAre(1, 0, -3)); in TEST()372 EXPECT_NE(fac5.getInequality(i), ArrayRef<int64_t>(redundantConstraint)); in TEST()
163 addInequality(other.getInequality(r)); in FlatAffineConstraints()253 addInequality(other.getInequality(r)); in append()1080 if (valueAt(getInequality(i), point) < 0) in containsPoint()1265 auto cst = isEq ? getEquality(r) : getInequality(r); in getLowerAndUpperBoundIndices()1511 auto ineq = getInequality(idx); in getLowerAndUpperBound()1529 auto ineq = getInequality(idx); in getLowerAndUpperBound()2770 if (A.getInequality(r) == B.getInequality(s)) { in getCommonConstraints()2771 C.addInequality(A.getInequality(r)); in getCommonConstraints()2963 ArrayRef<int64_t> inequality = getInequality(ineqPos); in getIneqAsAffineValueMap()3039 exprs.push_back(getAffineExprFromFlatForm(getInequality(i), numDims, in getAsIntegerSet()
225 processInequality(sI.getInequality(j)); in subtractRecursively()
213 inline ArrayRef<int64_t> getInequality(unsigned idx) const { in getInequality() function
34 addInequality(constraints.getInequality(i)); in Simplex()459 addInequality(fac.getInequality(i)); in intersectFlatAffineConstraints()
2969 auto fLb = cst.getInequality(fullTileLbPos); in createSeparationCondition()2970 auto fUb = cst.getInequality(fullTileUbPos); in createSeparationCondition()