X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=check%2Ftime_lw_Qprime.cpp;h=b69cb91eca5590af79fc367137b51ce939a1b6e4;hp=139b09b11e833a2e2ad87195916d407635e10fa0;hb=c8feefe95a6c219195aea22050f17e2294656f32;hpb=d6dd9e5350d479533b319dd1dfedaa2467627fe3

diff --git a/check/time_lw_Qprime.cpp b/check/time_lw_Qprime.cpp
index 139b09b1..b69cb91e 100644
--- a/check/time_lw_Qprime.cpp
+++ b/check/time_lw_Qprime.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,79 @@
 
 #include "times.h"
 
-static unsigned test(void)
+static const bool do_test = true;  // set to true in order to run this beast
+
+static unsigned test()
 {
-    // same matrix as in 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);
-    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));
-    
-    symbol lambda("lambda");
-    ex cp = m2.charpoly(lambda);
-    
-    if (cp.coeff(lambda,0) != numeric("140816284877507872414776")) {
-        clog << "characteristic polynomial miscalculated as " << cp << endl;
-        return 1;
-    }
-    return 0;
+	// same matrix as in 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);
+	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));
+	
+	symbol lambda("lambda");
+	ex cp = m2.charpoly(lambda);
+	
+	if (cp.coeff(lambda,0) != numeric("140816284877507872414776")) {
+		clog << "characteristic polynomial miscalculated as " << cp << endl;
+		return 1;
+	}
+	return 0;
 }
 
-unsigned time_lw_Qprime(void)
+unsigned time_lw_Qprime()
 {
-    unsigned result = 0;
-    unsigned count = 0;
-    timer rolex;
-    double time = .0;
-    
-    cout << "timing Lewis-Wester test Q' (charpoly(P'))" << flush;
-    clog << "-------Lewis-Wester test Q' (charpoly(P'))" << 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 Q' (charpoly(P'))" << flush;
+	clog << "-------Lewis-Wester test Q' (charpoly(P')):" << endl;
+	
+	if (do_test) {
+		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;
+	} else {
+		cout << " disabled" << endl;
+		clog << "(no output)" << endl;
+	}
+	
+	return result;
 }