X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=check%2Ftime_lw_Q.cpp;h=cc63946a7b28848fc1a358ce73fca416955130cd;hp=c8d586b1ffe69e15a574d35f0c93d82698b1fcc3;hb=3ab7092e925aba28498d7508f50da9f913dcffd2;hpb=d6dd9e5350d479533b319dd1dfedaa2467627fe3

diff --git a/check/time_lw_Q.cpp b/check/time_lw_Q.cpp
index c8d586b1..cc63946a 100644
--- a/check/time_lw_Q.cpp
+++ b/check/time_lw_Q.cpp
@@ -4,7 +4,7 @@
  *  Lewis and Michael Wester. */
 
 /*
- *  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
@@ -23,60 +23,67 @@
 
 #include "times.h"
 
+static const bool do_test = false;  // set to true in order to run this beast
+
 static unsigned test(void)
 {
-    // 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);
-    
-    symbol lambda("lambda");
-    ex cp = m.charpoly(lambda);
-    
-    if (cp.coeff(lambda,96) != numeric("75287520")) {
-        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);
+	
+	symbol lambda("lambda");
+	ex cp = m.charpoly(lambda);
+	
+	if (cp.coeff(lambda,96) != numeric("75287520")) {
+		clog << "characteristic polynomial miscalculated as " << cp << endl;
+		return 1;
+	}
+	return 0;
 }
 
 unsigned time_lw_Q(void)
 {
-    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;
 }