X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=check%2Ftime_lw_Pprime.cpp;h=69e07800dc26bc465bdf8d1539c0d3bb6a1ec079;hp=7860e4acc5c8431aae6c41ff7ffc014a3084023c;hb=fa048d7e0e3c7bcde12f0c7d3d3c428fc9782884;hpb=d6dd9e5350d479533b319dd1dfedaa2467627fe3

diff --git a/check/time_lw_Pprime.cpp b/check/time_lw_Pprime.cpp
index 7860e4ac..69e07800 100644
--- a/check/time_lw_Pprime.cpp
+++ b/check/time_lw_Pprime.cpp
@@ -4,7 +4,7 @@
  *  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
@@ -23,72 +23,72 @@
 
 #include "times.h"
 
-static unsigned test(void)
+static unsigned test()
 {
-    // create the matrix from test P...
-    const unsigned n = 10;
-    matrix m(n*n+1,n*n+1);
-    for (unsigned i=1; i<=n*n; ++i)
-        m.set(i-1,i-1,1);
-    for (unsigned i=1; i<=n*n; ++i)
-        if (!(i%n))
-            m.set(i-1,n*n,1);
-    for (unsigned i=1; i<=n*n; ++i)
-        if (!((i-1)%n))
-            m.set(n*n,i-1,n-(i-1)/n);
-    for(unsigned i=1; i<=n; ++i)
-        for (unsigned j=1; j<=n; ++j)
-            if (i-j)
-                for (unsigned k=1; k<n; ++k)
-                    m.set((i-1)*n+k-1,(j-1)*n+k,n+1-j);
-    // ...and then another, more dense one:
-    matrix m2(m);
-    ex a;
-    for (unsigned r=0; r<=n*n; ++r) {
-        a = m2(r,0);
-        for (unsigned c=0; c<n*n; ++c)
-            m2.set(r,c,m2(r,c+1));
-        m2.set(r,100,a);
-    }
-    for (unsigned r=0; r<=n*n; ++r)
-        for (unsigned c=0; c<=n*n; ++c)
-            if (!m(r,c).is_zero())
-                m2.set(r,c,m(r,c));
-    
-    ex det = m2.determinant();
-    
-    if (det!=numeric("140816284877507872414776")) {
-        clog << "det of less sparse rank 101 matrix erroneously returned " << det << endl;
-        return 1;
-    }
-    return 0;
+	// create the matrix from test P...
+	const unsigned n = 10;
+	matrix m(n*n+1,n*n+1);
+	for (unsigned i=1; i<=n*n; ++i)
+		m.set(i-1,i-1,1);
+	for (unsigned i=1; i<=n*n; ++i)
+		if (!(i%n))
+			m.set(i-1,n*n,1);
+	for (unsigned i=1; i<=n*n; ++i)
+		if (!((i-1)%n))
+			m.set(n*n,i-1,n-(i-1)/n);
+	for(unsigned i=1; i<=n; ++i)
+		for (unsigned j=1; j<=n; ++j)
+			if (i-j)
+				for (unsigned k=1; k<n; ++k)
+					m.set((i-1)*n+k-1,(j-1)*n+k,n+1-j);
+	// ...and then another, more dense one:
+	matrix m2(m);
+	ex a;
+	for (unsigned r=0; r<=n*n; ++r) {
+		a = m2(r,0);
+		for (unsigned c=0; c<n*n; ++c)
+			m2.set(r,c,m2(r,c+1));
+		m2.set(r,100,a);
+	}
+	for (unsigned r=0; r<=n*n; ++r)
+		for (unsigned c=0; c<=n*n; ++c)
+			if (!m(r,c).is_zero())
+				m2.set(r,c,m(r,c));
+	
+	ex det = m2.determinant();
+	
+	if (det!=numeric("140816284877507872414776")) {
+		clog << "det of less sparse rank 101 matrix erroneously returned " << det << endl;
+		return 1;
+	}
+	return 0;
 }
 
-unsigned time_lw_Pprime(void)
+unsigned time_lw_Pprime()
 {
-    unsigned result = 0;
-    unsigned count = 0;
-    timer rolex;
-    double time = .0;
-    
-    cout << "timing Lewis-Wester test P' (det of less sparse rank 101)" << flush;
-    clog << "-------Lewis-Wester test P' (det of less sparse rank 101)" << endl;
-    
-    rolex.start();
-    // correct for very small times:
-    do {
-        result = test();
-        ++count;
-    } while ((time=rolex.read())<0.1 && !result);
-    cout << '.' << flush;
-    
-    if (!result) {
-        cout << " passed ";
-        clog << "(no output)" << endl;
-    } else {
-        cout << " failed ";
-    }
-    cout << int(1000*(time/count))*0.001 << 's' << endl;
-    
-    return result;
+	unsigned result = 0;
+	unsigned count = 0;
+	timer rolex;
+	double time = .0;
+	
+	cout << "timing Lewis-Wester test P' (det of less sparse rank 101)" << flush;
+	clog << "-------Lewis-Wester test P' (det of less sparse rank 101):" << endl;
+	
+	rolex.start();
+	// correct for very small times:
+	do {
+		result = test();
+		++count;
+	} while ((time=rolex.read())<0.1 && !result);
+	cout << '.' << flush;
+	
+	if (!result) {
+		cout << " passed ";
+		clog << "(no output)" << endl;
+	} else {
+		cout << " failed ";
+	}
+	cout << int(1000*(time/count))*0.001 << 's' << endl;
+	
+	return result;
 }