X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=check%2Ftime_antipode.cpp;h=0dff114fff22b6480d7b1d71214c80f17e075166;hp=f9783c3cd3bc2fb0799c73e505184991741c5c3a;hb=0052e44b34c982b13b08454fd6c9429fe7a90f71;hpb=695f6ae955ec530cded8f21efd5569df39447f76

diff --git a/check/time_antipode.cpp b/check/time_antipode.cpp
index f9783c3c..0dff114f 100644
--- a/check/time_antipode.cpp
+++ b/check/time_antipode.cpp
@@ -16,7 +16,7 @@
  */
 
 /*
- *  GiNaC Copyright (C) 1999-2005 Johannes Gutenberg University Mainz, Germany
+ *  GiNaC Copyright (C) 1999-2016 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
@@ -30,16 +30,20 @@
  *
  *  You should have received a copy of the GNU General Public License
  *  along with this program; if not, write to the Free Software
- *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  */
 
-#include "times.h"
-#include <utility>
-#include <vector>
-#include <set>
+#include "ginac.h"
+#include "timer.h"
+using namespace GiNaC;
+
 #include <map>
-#include <typeinfo>
+#include <set>
 #include <stdexcept>
+#include <typeinfo>
+#include <utility>
+#include <vector>
+using namespace std;
 
 // whether to run this beast or not:
 static const bool do_test = true;
@@ -68,6 +72,7 @@ static ex div_part(const ex &exarg, const symbol &x, unsigned grad)
 /* F_ab(a, i, b, j, "x") is a common pattern in all vertex evaluators. */
 static ex F_ab(int a, int i, int b, int j, const symbol &x)
 {
+	using GiNaC::tgamma;
 	if ((i==0 && a<=0) || (j==0 && b<=0))
 		return 0;
 	else
@@ -146,7 +151,7 @@ class Gamma : public vertex {
 public:
 	Gamma(ijpair ij = ijpair(0,0)) : vertex(ij) { }
 	vertex* copy() const { return new Gamma(*this); }
-  	ijpair get_increment() const { return ijpair(indices.first+indices.second+1, 0); }
+	ijpair get_increment() const { return ijpair(indices.first+indices.second+1, 0); }
 	const ex evaluate(const symbol &x, const unsigned grad) const;
 private:
 };
@@ -445,7 +450,7 @@ static const node tree6(unsigned cuts=0)
 static unsigned test_tree(const node tree_generator(unsigned))
 {
 	const int edges = tree_generator(0).total_edges();
-   	const int vertices = edges+1;
+	const int vertices = edges+1;
 	
 	// fill a vector of all possible 2^edges combinations of cuts...
 	vector<node> counter;
@@ -479,7 +484,6 @@ unsigned time_antipode()
 	timer jaeger_le_coultre;
 	
 	cout << "timing computation of antipodes in Yukawa theory" << flush;
-	clog << "-------computation of antipodes in Yukawa theory:" << endl;
 	
 	if (do_test) {
 		jaeger_le_coultre.start();
@@ -490,17 +494,18 @@ unsigned time_antipode()
 		result += test_tree(tree5);  cout << '.' << flush;
 		result += test_tree(tree6);  cout << '.' << flush;
 		
-		if (!result) {
-			cout << " passed ";
-			clog << "(no output)" << endl;
-		} else {
-			cout << " failed ";
-		}
-		cout << int(1000*jaeger_le_coultre.read())*0.001 << "s (total)" << endl;
+		cout << jaeger_le_coultre.read() << "s (total)" << endl;
 	} else {
 		cout << " disabled" << endl;
-		clog << "(no output)" << endl;
 	}
-	
 	return result;
 }
+
+extern void randomify_symbol_serials();
+
+int main(int argc, char** argv)
+{
+	randomify_symbol_serials();
+	cout << setprecision(2) << showpoint;
+	return time_antipode();
+}