X-Git-Url: https://ginac.de/ginac.git//ginac.git?a=blobdiff_plain;f=check%2Ftime_lw_IJKL.cpp;h=7271fe0d8e3b42dc7b70b0437c3b32377b15d728;hb=5d3e2f6201df1363f2ee4a0891376b2fb8a58f1c;hp=41c077025541e8531c5c2057674a7425b44be4bd;hpb=af922d5eb36ed70e4a9e3ffaf4c24492cf89a1a6;p=ginac.git diff --git a/check/time_lw_IJKL.cpp b/check/time_lw_IJKL.cpp index 41c07702..7271fe0d 100644 --- a/check/time_lw_IJKL.cpp +++ b/check/time_lw_IJKL.cpp @@ -4,7 +4,7 @@ * by Robert H. Lewis and Michael Wester. */ /* - * GiNaC Copyright (C) 1999-2000 Johannes Gutenberg University Mainz, Germany + * GiNaC Copyright (C) 1999-2007 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 @@ -18,7 +18,7 @@ * * 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 + * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA */ #include "times.h" @@ -30,9 +30,9 @@ static unsigned test(unsigned n) char name = (n==40?'I':(n==70?'K':'?')); cout << "timing Lewis-Wester test " << name - << " (invert rank " << n << " Hilbert)" << flush; + << " (invert rank " << n << " Hilbert)" << flush; clog << "-------Lewis-Wester test " << name - << " (invert rank " << n << " Hilbert)" << endl; + << " (invert rank " << n << " Hilbert):" << endl; // Create a rank n Hilbert matrix: matrix H(n,n); @@ -45,15 +45,15 @@ static unsigned test(unsigned n) Hinv = H.inverse(); cout << ". passed "; clog << "(no output)" << endl; - cout << int(1000*cartier.read())*0.001 << 's' << endl; + cout << cartier.read() << 's' << endl; // check result: name = (n==40?'J':(n==70?'L':'?')); cout << "timing Lewis-Wester test " << name - << " (check rank " << n << " Hilbert)" << flush; + << " (check rank " << n << " Hilbert)" << flush; clog << "-------Lewis-Wester test " << name - << " (check rank " << n << " Hilbert)" << endl; + << " (check rank " << n << " Hilbert):" << endl; cartier.reset(); matrix identity = H.mul(Hinv); @@ -75,11 +75,11 @@ static unsigned test(unsigned n) cout << ". failed "; ++result; } - cout << int(1000*cartier.read())*0.001 << 's' << endl; + cout << cartier.read() << 's' << endl; return result; } -unsigned time_lw_IJKL(void) +unsigned time_lw_IJKL() { unsigned result = 0;