* these oopses for good, so we run those stupid tests... */
/*
- * GiNaC Copyright (C) 1999-2017 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2021 Johannes Gutenberg University Mainz, Germany
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
return result;
}
+static unsigned exam_mul_info()
+{
+ symbol x("x"), y("y");
+ ex e = x*y;
+ if (!e.info(info_flags::indefinite)) {
+ clog << "eek, product of two symbols is NOT indefinite\n";
+ return 1;
+ }
+ return 0;
+}
+
static unsigned is_polynomial_false_positive()
{
unsigned result = 0;
return result;
}
-// Bug in sqrfree_yun (fixed 2016-02-02).
-static unsigned exam_paranoia24()
+// Bug in add ctor
+unsigned exam_paranoia24()
{
- unsigned result = 0;
- symbol x("x");
- ex e;
+ symbol a("a"), b("b"), c("c");
+ ex e = -a + 2*b + c;
- e = (x-1)*(x+1) - x*x + 1; // an unexpanded 0...
- try {
- ex f = sqrfree(e);
- if (!f.is_zero()) {
- clog << "sqrfree(" << e << ") returns " << f << " instead of 0\n";
- ++result;
- }
- } catch (const exception &err) {
- clog << "sqrfree(" << e << ") throws " << err.what() << endl;
- ++result;
+ if (e.diff(c).nops() > 1) {
+ clog << "diff(" << e << ",c) was not fully evaluated.\n";
+ return 1;
}
+ return 0;
+}
- e = pow(x-1,3) - expand(pow(x-1,3)); // ...still after differentiating...
- try {
- ex f = sqrfree(e);
- if (!f.is_zero()) {
- clog << "sqrfree(" << e << ") returns " << f << " instead of 0\n";
- ++result;
- }
- } catch (const exception &err) {
- clog << "sqrfree(" << e << ") throws " << err.what() << endl;
- ++result;
+// Bug in partial fraction expansion
+unsigned exam_paranoia25()
+{
+ symbol x("x");
+ ex ex1=pow(x,4)/(x-1)/4;
+ ex ex2=sqrfree_parfrac(ex1,x);
+ ex e = (ex1-ex2).normal();
+
+ if (! e.is_zero()) {
+ clog << "partial fraction expansion of " << ex1 << " produces error.\n";
+ return 1;
}
+ return 0;
+}
- e = pow(x-1,4) - expand(pow(x-1,4)); // ...and after differentiating twice.
- try {
- ex f = sqrfree(e);
- if (!f.is_zero()) {
- clog << "sqrfree(" << e << ") returns " << f << " instead of 0\n";
+// Bug in power expansion
+unsigned exam_paranoia26()
+{
+ unsigned result = 0;
+ symbol x("x"), y("y"), a("a");
+ possymbol s("s"), t("t");
+ exmap pwrs =
+ { {pow((x+1)*(y-2)*(s-3)*(t+4), a), pow((x+1)*(y-2)*(s-3), a)*pow(t+4, a)},
+ {pow(2*(x+1)*(y-2)*(s-3)*(t+4), a), pow(2,a)*pow((x+1)*(y-2)*(s-3), a)*pow(t+4, a)},
+ {pow(-(x+1)*(y-2)*(s-3)*(t+4), a), pow(-(x+1)*(y-2)*(s-3), a)*pow(t+4, a)},
+ {pow(-2*(x+1)*(y-2)*(s-3)*(t+4), a), pow(2,a)*pow(-(x+1)*(y-2)*(s-3), a)*pow(t+4, a)} };
+
+ for (auto e : pwrs) {
+ if (! (e.first.expand()).is_equal(e.second) ) {
+ clog << "power expansion of " << e.first << " produces error.\n";
++result;
}
- } catch (const exception &err) {
- clog << "sqrfree(" << e << ") throws " << err.what() << endl;
- ++result;
}
return result;
}
+// Bug in collect()
+// cf. https://www.ginac.de/pipermail/ginac-list/2021-March/002337.html
+static unsigned exam_collect_multiply_referenced_lst()
+{
+ unsigned result = 0;
+ symbol x("x"), y("y");
+ ex a = x + y;
+ ex l = lst{x, y};
+ ex l2 = l; // make l a multiply referenced object
+
+ try {
+ ex b = collect(a, l);
+ } catch (const std::runtime_error & e) {
+ clog << "collect(" << ", " << l << ") threw a runtime_error("
+ << e.what() << ")" << endl;
+ ++result;
+ }
+
+ return result;
+}
+
unsigned exam_paranoia()
{
unsigned result = 0;
result += exam_paranoia18(); cout << '.' << flush;
result += exam_paranoia19(); cout << '.' << flush;
result += exam_paranoia20(); cout << '.' << flush;
+ result += exam_mul_info(); cout << '.' << flush;
result += is_polynomial_false_positive(); cout << '.' << flush;
result += exam_paranoia21(); cout << '.' << flush;
result += exam_paranoia22(); cout << '.' << flush;
result += exam_paranoia23(); cout << '.' << flush;
result += exam_paranoia24(); cout << '.' << flush;
+ result += exam_paranoia25(); cout << '.' << flush;
+ result += exam_paranoia26(); cout << '.' << flush;
+ result += exam_collect_multiply_referenced_lst(); cout << '.' << flush;
return result;
}