X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=check%2Fexam_polygcd.cpp;h=2132d765068cd349520eaf36b89b886d1a0e8f41;hp=34aea62abf03e112b3dc0cf88c78fb64962b8825;hb=3ab7092e925aba28498d7508f50da9f913dcffd2;hpb=f4ea690a3f118bf364190f0ef3c3f6d2ccdf6206 diff --git a/check/exam_polygcd.cpp b/check/exam_polygcd.cpp index 34aea62a..2132d765 100644 --- a/check/exam_polygcd.cpp +++ b/check/exam_polygcd.cpp @@ -4,7 +4,7 @@ * rational function normalization in normalization.cpp. */ /* - * GiNaC Copyright (C) 1999-2000 Johannes Gutenberg University Mainz, Germany + * GiNaC Copyright (C) 1999-2001 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 @@ -228,27 +228,27 @@ static unsigned poly_gcd7(void) unsigned exam_polygcd(void) { - unsigned result = 0; - + unsigned result = 0; + cout << "examining polynomial GCD computation" << flush; clog << "----------polynomial GCD computation:" << endl; - + result += poly_gcd1(); cout << '.' << flush; result += poly_gcd2(); cout << '.' << flush; result += poly_gcd3(); cout << '.' << flush; - result += poly_gcd3p(); cout << '.' << flush; // takes extremely long (PRS "worst" case) + result += poly_gcd3p(); cout << '.' << flush; // PRS "worst" case result += poly_gcd4(); cout << '.' << flush; result += poly_gcd5(); cout << '.' << flush; result += poly_gcd5p(); cout << '.' << flush; result += poly_gcd6(); cout << '.' << flush; result += poly_gcd7(); cout << '.' << flush; - + if (!result) { cout << " passed " << endl; - clog << "(no output)" << endl; - } else { + clog << "(no output)" << endl; + } else { cout << " failed " << endl; - } - + } + return result; }