X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=check%2Ftime_lw_IJKL.cpp;h=cc8641773d08bc7a96a9f8227315f928115d030c;hp=62f69b662ba98a2d93c5775174e3c2b7c21488da;hb=df27e9de2a3f09aa315d1fe9fb90a3e5a5751989;hpb=8b0c2741cf5b9b17025302f96ee7d1a451bbfbb0

diff --git a/check/time_lw_IJKL.cpp b/check/time_lw_IJKL.cpp
index 62f69b66..cc864177 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-2003 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
@@ -25,68 +25,68 @@
 
 static unsigned test(unsigned n)
 {
-    unsigned result = 0;
-    timer cartier;
-    char name = (n==40?'I':(n==70?'K':'?'));
-    
-    cout << "timing Lewis-Wester test " << name
-         << " (invert rank " << n << " Hilbert)" << flush;
-    clog << "-------Lewis-Wester test " << name
-         << " (invert rank " << n << " Hilbert)" << endl;
-    
-    // Create a rank n Hilbert matrix:
-    matrix H(n,n);
-    for (unsigned r=0; r<n; ++r)
-        for (unsigned c=0; c<n; ++c)
-            H.set(r,c,numeric(1,r+c+1));
-    // invert it:
-    cartier.start();
-    matrix Hinv(n,n);
-    Hinv = H.inverse();
-    cout << ". passed ";
-    clog << "(no output)" << endl;
-    cout << int(1000*cartier.read())*0.001 << 's' << endl;
-    
-    // check result:
-    name = (n==40?'J':(n==70?'L':'?'));
-    
-    cout << "timing Lewis-Wester test " << name
-         << " (check rank " << n << " Hilbert)" << flush;
-    clog << "-------Lewis-Wester test " << name
-         << " (check rank " << n << " Hilbert)" << endl;
-    
-    cartier.reset();
-    matrix identity = H.mul(Hinv);
-    bool correct = true;
-    for (unsigned r=0; r<n; ++r)
-        for (unsigned c=0; c<n; ++c) {
-            if (r==c) {
-                if (identity(r,c)!=1)
-                    correct = false;
-            } else {
-                if (identity(r,c)!=0)
-                    correct = false;
-            }
-        }
-    if (correct) {
-        cout << ". passed ";
-        clog << "(no output)" << endl;
-    } else {
-        cout << ". failed ";
-        ++result;
-    }
-    cout << int(1000*cartier.read())*0.001 << 's' << endl;
-    return result;
+	unsigned result = 0;
+	timer cartier;
+	char name = (n==40?'I':(n==70?'K':'?'));
+	
+	cout << "timing Lewis-Wester test " << name
+	     << " (invert rank " << n << " Hilbert)" << flush;
+	clog << "-------Lewis-Wester test " << name
+	     << " (invert rank " << n << " Hilbert):" << endl;
+	
+	// Create a rank n Hilbert matrix:
+	matrix H(n,n);
+	for (unsigned r=0; r<n; ++r)
+		for (unsigned c=0; c<n; ++c)
+			H.set(r,c,numeric(1,r+c+1));
+	// invert it:
+	cartier.start();
+	matrix Hinv(n,n);
+	Hinv = H.inverse();
+	cout << ". passed ";
+	clog << "(no output)" << endl;
+	cout << int(1000*cartier.read())*0.001 << 's' << endl;
+	
+	// check result:
+	name = (n==40?'J':(n==70?'L':'?'));
+	
+	cout << "timing Lewis-Wester test " << name
+	     << " (check rank " << n << " Hilbert)" << flush;
+	clog << "-------Lewis-Wester test " << name
+	     << " (check rank " << n << " Hilbert):" << endl;
+	
+	cartier.reset();
+	matrix identity = H.mul(Hinv);
+	bool correct = true;
+	for (unsigned r=0; r<n; ++r)
+		for (unsigned c=0; c<n; ++c) {
+			if (r==c) {
+				if (identity(r,c)!=1)
+					correct = false;
+			} else {
+				if (identity(r,c)!=0)
+					correct = false;
+			}
+		}
+	if (correct) {
+		cout << ". passed ";
+		clog << "(no output)" << endl;
+	} else {
+		cout << ". failed ";
+		++result;
+	}
+	cout << int(1000*cartier.read())*0.001 << 's' << endl;
+	return result;
 }
 
-unsigned time_lw_IJKL(void)
+unsigned time_lw_IJKL()
 {
-    unsigned result = 0;
-    
-    // Tests I and J:
-    result += test(40);
-    // Tests K and L:
-    result += test(70);
-    
-    return result;
+	unsigned result = 0;
+	
+	// Tests I and J:
+	result += test(40);
+	// Tests K and L:
+	result += test(70);
+	
+	return result;
 }