print_tree: only print the "nops=" line when nops() > 0

[ginac.git] / check / time_lw_P.cpp

diff --git a/check/time_lw_P.cpp b/check/time_lw_P.cpp
index 2f7569f0cb52a007944940f10a342309d38fd6b0..279327be1c6ae12db7cdd5b56bec3868de385299 100644 (file)
--- a/check/time_lw_P.cpp
+++ b/check/time_lw_P.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,59 +23,59 @@
 
 #include "times.h"
 
-static unsigned test(void)
+static unsigned test()
 {
-    // This is a pattern that comes up in graph theory:
-    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);
-    
-    ex det = m.determinant();
-    
-    if (det!=numeric("75810815066186520")) {
-        clog << "det of sparse rank 101 matrix erroneously returned " << det << endl;
-        return 1;
-    }
-    return 0;
+       // This is a pattern that comes up in graph theory:
+       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);
+       
+       ex det = m.determinant();
+       
+       if (det!=numeric("75810815066186520")) {
+               clog << "det of sparse rank 101 matrix erroneously returned " << det << endl;
+               return 1;
+       }
+       return 0;
 }
 
-unsigned time_lw_P(void)
+unsigned time_lw_P()
 {
-    unsigned result = 0;
-    unsigned count = 0;
-    timer rolex;
-    double time = .0;
-    
-    cout << "timing Lewis-Wester test P (det of sparse rank 101)" << flush;
-    clog << "-------Lewis-Wester test P (det of 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 sparse rank 101)" << flush;
+       clog << "-------Lewis-Wester test P (det of 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;
 }