@@ -19,7 +19,7 @@ QuasiPolynomial::QuasiPolynomial(
19
19
std::vector<std::vector<SmallVector<Fraction>>> aff)
20
20
: PresburgerSpace(/* numDomain=*/ numVars, /* numRange=*/ 1 , /* numSymbols=*/ 0 ,
21
21
/* numLocals=*/ 0 ),
22
- coefficients(coeffs), affine(aff) {
22
+ coefficients(std::move( coeffs)) , affine(std::move( aff) ) {
23
23
#ifndef NDEBUG
24
24
// For each term which involves at least one affine function,
25
25
for (const std::vector<SmallVector<Fraction>> &term : affine) {
@@ -40,7 +40,7 @@ QuasiPolynomial::QuasiPolynomial(
40
40
QuasiPolynomial::QuasiPolynomial (unsigned numVars, Fraction constant)
41
41
: PresburgerSpace(/* numDomain=*/ numVars, /* numRange=*/ 1 , /* numSymbols=*/ 0 ,
42
42
/* numLocals=*/ 0 ),
43
- coefficients({constant}), affine({{}}) {}
43
+ coefficients({std::move ( constant) }), affine({{}}) {}
44
44
45
45
QuasiPolynomial QuasiPolynomial::operator +(const QuasiPolynomial &x) const {
46
46
assert (getNumInputs () == x.getNumInputs () &&
@@ -89,7 +89,7 @@ QuasiPolynomial QuasiPolynomial::operator*(const QuasiPolynomial &x) const {
89
89
return QuasiPolynomial (getNumInputs (), coeffs, aff);
90
90
}
91
91
92
- QuasiPolynomial QuasiPolynomial::operator /(const Fraction x) const {
92
+ QuasiPolynomial QuasiPolynomial::operator /(const Fraction & x) const {
93
93
assert (x != 0 && " division by zero!" );
94
94
QuasiPolynomial qp (*this );
95
95
for (Fraction &coeff : qp.coefficients )
@@ -131,7 +131,7 @@ QuasiPolynomial QuasiPolynomial::simplify() {
131
131
newCoeff = coefficients[i];
132
132
for (ArrayRef<Fraction> term : affine[i]) {
133
133
bool allCoeffsZero = llvm::all_of (
134
- term.slice (0 , numParam), [](const Fraction c) { return c == 0 ; });
134
+ term.slice (0 , numParam), [](const Fraction & c) { return c == 0 ; });
135
135
if (allCoeffsZero)
136
136
newCoeff *= term[numParam];
137
137
else
0 commit comments