X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=check%2Fpoly_gcd.cpp;h=12de267c89548e2f463c127686e3e0213523ca49;hp=484254487590d4dba3cd610d5a82fa3411bb635e;hb=68acc9698d0f6cdff0c2c6d1ea3b622916009f71;hpb=6b3768e8c544739ae53321539cb4d1e3112ded1b diff --git a/check/poly_gcd.cpp b/check/poly_gcd.cpp index 48425448..12de267c 100644 --- a/check/poly_gcd.cpp +++ b/check/poly_gcd.cpp @@ -1,10 +1,32 @@ -// 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 +#ifndef NO_GINAC_NAMESPACE +using namespace GiNaC; +#endif // ndef NO_GINAC_NAMESPACE + const int MAX_VARIABLES = 5; static symbol x("x"), z("z"); @@ -24,7 +46,7 @@ static unsigned poly_gcd1(void) 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; } @@ -47,10 +69,7 @@ static unsigned poly_gcd2(void) 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; } @@ -70,7 +89,7 @@ static unsigned poly_gcd3(void) 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; } @@ -93,7 +112,7 @@ static unsigned poly_gcd3p(void) 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; } @@ -118,7 +137,7 @@ static unsigned poly_gcd4(void) 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; } @@ -143,7 +162,7 @@ static unsigned poly_gcd5(void) 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; } @@ -163,7 +182,7 @@ static unsigned poly_gcd5p(void) 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; } @@ -181,7 +200,7 @@ static unsigned poly_gcd6(void) 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; } @@ -202,7 +221,7 @@ static unsigned poly_gcd7(void) 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; }