X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=check%2Ftime_antipode.cpp;h=2358db3e05d70b787f1c72f4823c1d24adb315dc;hp=4f678382dbb77abacb2581d44fd3f3f998536259;hb=acae7ab5a4dc94d1f54ba794f32f5764cdb4d704;hpb=93d02d3b90587f38cbc33cf25ee89795c415574c

diff --git a/check/time_antipode.cpp b/check/time_antipode.cpp
index 4f678382..2358db3e 100644
--- a/check/time_antipode.cpp
+++ b/check/time_antipode.cpp
@@ -16,7 +16,7 @@
  */
 
 /*
- *  GiNaC Copyright (C) 1999-2010 Johannes Gutenberg University Mainz, Germany
+ *  GiNaC Copyright (C) 1999-2015 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
@@ -151,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:
 };
@@ -450,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;