15 using namespace presburger;
22 coefficients(coeffs), affine(aff) {
32 "dimensionality of affine functions does not match number of "
43 coefficients({constant}), affine({{}}) {}
47 "two quasi-polynomials with different numbers of symbols cannot "
50 sumCoeffs.append(x.coefficients);
51 std::vector<std::vector<SmallVector<Fraction>>> sumAff = affine;
52 sumAff.insert(sumAff.end(), x.affine.begin(), x.affine.end());
58 "two quasi-polynomials with different numbers of symbols cannot "
61 for (
Fraction &coeff : qp.coefficients)
68 "two quasi-polynomials with different numbers of "
69 "symbols cannot be multiplied!");
72 coeffs.reserve(coefficients.size() * x.coefficients.size());
73 for (
const Fraction &coeff : coefficients)
74 for (
const Fraction &xcoeff : x.coefficients)
75 coeffs.push_back(coeff * xcoeff);
77 std::vector<SmallVector<Fraction>>
product;
78 std::vector<std::vector<SmallVector<Fraction>>> aff;
79 aff.reserve(affine.size() * x.affine.size());
93 assert(x != 0 &&
"division by zero!");
95 for (
Fraction &coeff : qp.coefficients)
107 std::vector<SmallVector<Fraction>> newAffineTerm({});
108 std::vector<std::vector<SmallVector<Fraction>>> newAffine({});
112 for (
unsigned i = 0, e = coefficients.size(); i < e; i++) {
114 if (coefficients[i] ==
Fraction(0, 1))
116 bool product_is_zero =
120 return llvm::all_of(affine_ij,
121 [](
const Fraction &f) {
return f == 0; });
131 newCoeff = coefficients[i];
133 bool allCoeffsZero = llvm::all_of(
134 term.slice(0, numParam), [](
const Fraction c) { return c == 0; });
136 newCoeff *= term[numParam];
141 newCoeffs.push_back(newCoeff);
142 newAffine.push_back(newAffineTerm);
149 std::vector<std::vector<SmallVector<Fraction>>> newAffine({});
151 for (
unsigned i = 0, e = affine.size(); i < e; i++) {
152 bool alreadyPresent =
false;
153 for (
unsigned j = 0, f = newAffine.size();
j < f;
j++) {
154 if (affine[i] == newAffine[
j]) {
155 newCoeffs[
j] += coefficients[i];
156 alreadyPresent =
true;
161 newCoeffs.push_back(coefficients[i]);
162 newAffine.push_back(affine[i]);
170 for (
unsigned i = 0, e = coefficients.size(); i < e; ++i)
171 if (affine[i].size() == 0)
172 constTerm += coefficients[i];
static int64_t product(ArrayRef< int64_t > vals)
PresburgerSpace is the space of all possible values of a tuple of integer valued variables/variables.
QuasiPolynomial operator-(const QuasiPolynomial &x) const
Fraction getConstantTerm()
QuasiPolynomial operator+(const QuasiPolynomial &x) const
QuasiPolynomial operator/(const Fraction x) const
QuasiPolynomial simplify()
QuasiPolynomial collectTerms()
QuasiPolynomial operator*(const QuasiPolynomial &x) const
QuasiPolynomial(unsigned numVars, SmallVector< Fraction > coeffs={}, std::vector< std::vector< SmallVector< Fraction >>> aff={})
unsigned getNumInputs() const
Include the generated interface declarations.
A class to represent fractions.
Eliminates variable at the specified position using Fourier-Motzkin variable elimination.