ex e1, e2;
e1 = (1+x)*pow((2+x),2)*pow((3+x),3)*pow((4+x),4);
- e2 = sqrfree(expand(e1),lst(x));
+ e2 = sqrfree(expand(e1),lst{x});
if (e1 != e2) {
clog << "sqrfree(expand(" << e1 << ")) erroneously returned "
<< e2 << endl;
<< e2 << endl;
++result;
}
- e2 = sqrfree(expand(e1),lst(x));
+ e2 = sqrfree(expand(e1),lst{x});
if (e1 != e2) {
clog << "sqrfree(expand(" << e1 << "),[x]) erroneously returned "
<< e2 << endl;
++result;
}
- e2 = sqrfree(expand(e1),lst(y));
+ e2 = sqrfree(expand(e1),lst{y});
if (e1 != e2) {
clog << "sqrfree(expand(" << e1 << "),[y]) erroneously returned "
<< e2 << endl;
++result;
}
- e2 = sqrfree(expand(e1),lst(x,y));
+ e2 = sqrfree(expand(e1),lst{x,y});
if (e1 != e2) {
clog << "sqrfree(expand(" << e1 << "),[x,y]) erroneously returned "
<< e2 << endl;
}
// And this used to fail in GiNaC 1.5.8 because it first substituted
- // exp(x) -> exp(log(x)) -> x, and then substitued again x -> log(x)
+ // exp(x) -> exp(log(x)) -> x, and then substituted again x -> log(x)
e1 = exp(x);
e2 = e1.subs(x == log(x));
if (!e2.is_equal(x)) {