-// check/poly_gcd.cpp
+/** @file poly_gcd.cpp
+ *
+ * Some test with polynomial GCD calculations. See also the checks for
+ * rational function normalization in normalization.cpp. */
-/* Some test with polynomial GCD calculations. See also the checks for
- * rational function normalization in normalization.cpp. */
+/*
+ * GiNaC Copyright (C) 1999 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
+ * the Free Software Foundation; either version 2 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ */
-#include <GiNaC/ginac.h>
+#include <ginac/ginac.h>
+
+#ifndef NO_GINAC_NAMESPACE
+using namespace GiNaC;
+#endif // ndef NO_GINAC_NAMESPACE
const int MAX_VARIABLES = 5;
ex f = (e1 + 1) * (e1 + 2);
ex g = e2 * (-pow(x, 2) * y[0] * 3 + pow(y[0], 2) - 1);
ex r = gcd(f, g);
- if (r != exONE()) {
+ if (r != 1) {
clog << "case 1, gcd(" << f << "," << g << ") = " << r << " (should be 1)" << endl;
return 1;
}
ex f = d * pow(e2 - 2, 2);
ex g = d * pow(e1 + 2, 2);
ex r = gcd(f, g);
- ex re=r.expand();
- ex df1=r-d;
- ex df=(r-d).expand();
- if ((r - d).expand().compare(exZERO()) != 0) {
+ if (!(r - d).expand().is_zero()) {
clog << "case 2, gcd(" << f << "," << g << ") = " << r << " (should be " << d << ")" << endl;
return 1;
}
ex f = d * (e1 - 2);
ex g = d * (e1 + 2);
ex r = gcd(f, g);
- if ((r - d).expand().compare(exZERO()) != 0) {
+ if (!(r - d).expand().is_zero()) {
clog << "case 3, gcd(" << f << "," << g << ") = " << r << " (should be " << d << ")" << endl;
return 1;
}
ex f = d * (e1 - 2);
ex g = d * (e2 + 2);
ex r = gcd(f, g);
- if ((r - d).expand().compare(exZERO()) != 0) {
+ if (!(r - d).expand().is_zero()) {
clog << "case 3p, gcd(" << f << "," << g << ") = " << r << " (should be " << d << ")" << endl;
return 1;
}
ex f = d * (e2 - 1);
ex g = d * pow(e3 + 2, 2);
ex r = gcd(f, g);
- if ((r - d).expand().compare(exZERO()) != 0) {
+ if (!(r - d).expand().is_zero()) {
clog << "case 4, gcd(" << f << "," << g << ") = " << r << " (should be " << d << ")" << endl;
return 1;
}
ex f = d * (e2 + 3);
ex g = d * (e3 - 3);
ex r = gcd(f, g);
- if ((r - d).expand().compare(exZERO()) != 0) {
+ if (!(r - d).expand().is_zero()) {
clog << "case 5, gcd(" << f << "," << g << ") = " << r << " (should be " << d << ")" << endl;
return 1;
}
ex f = d * (e1 + 3);
ex g = d * (e1 - 3);
ex r = gcd(f, g);
- if ((r - d).expand().compare(exZERO()) != 0) {
+ if (!(r - d).expand().is_zero()) {
clog << "case 5p, gcd(" << f << "," << g << ") = " << r << " (should be " << d << ")" << endl;
return 1;
}
ex f = d * (pow(x, j) + pow(y, j + 1) * pow(z, j) + 1);
ex g = d * (pow(x, j + 1) + pow(y, j) * pow(z, j + 1) - 7);
ex r = gcd(f, g);
- if ((r - d).expand().compare(exZERO()) != 0) {
+ if (!(r - d).expand().is_zero()) {
clog << "case 6, gcd(" << f << "," << g << ") = " << r << " (should be " << d << ")" << endl;
return 1;
}
ex f = pow(p, j) * pow(q, k);
ex g = pow(p, k) * pow(q, j);
ex r = gcd(f, g);
- if ((r - d).expand().compare(exZERO()) != 0 && (r + d).expand().compare(exZERO()) != 0) {
+ if (!(r - d).expand().is_zero() && !(r + d).expand().is_zero()) {
clog << "case 7, gcd(" << f << "," << g << ") = " << r << " (should be " << d << ")" << endl;
return 1;
}