* This program is based on work by
* Isabella Bierenbaum <bierenbaum@thep.physik.uni-mainz.de> and
* Dirk Kreimer <dkreimer@bu.edu>.
- * For details, please see <http://www.arXiv.org/abs/hep-th/0111192>.
+ * For details, please see <https://www.arXiv.org/abs/hep-th/0111192>.
*/
/*
- * GiNaC Copyright (C) 1999-2007 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2024 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
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
-#include <utility>
-#include <vector>
-#include <set>
+#include "ginac.h"
+#include "timer.h"
+using namespace GiNaC;
+
#include <map>
-#include <typeinfo>
+#include <set>
#include <stdexcept>
-#include "timer.h"
-#include "ginac.h"
+#include <typeinfo>
+#include <utility>
+#include <vector>
using namespace std;
-using namespace GiNaC;
// whether to run this beast or not:
-static const bool do_test = true;
+constexpr bool do_test = true;
// regularization parameter:
static const symbol x("x");
/* 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
class Sigma : public vertex {
public:
Sigma(ijpair ij = ijpair(0,0)) : vertex(ij) { }
- vertex* copy() const { return new Sigma(*this); }
- ijpair get_increment() const { return ijpair(indices.first+indices.second+1, 0); }
- const ex evaluate(const symbol &x, const unsigned grad) const;
+ vertex* copy() const override { return new Sigma(*this); }
+ ijpair get_increment() const override { return ijpair(indices.first+indices.second+1, 0); }
+ const ex evaluate(const symbol &x, const unsigned grad) const override;
private:
};
}
-/** Class of vertices of type Sigma_flipped, sitting in the upper fermionline of Vacuum; no consequences for Gamma. */
+/** Class of vertices of type Sigma_flipped, sitting in the upper fermion line of Vacuum; no consequences for Gamma. */
class Sigma_flipped : public Sigma {
public:
Sigma_flipped(ijpair ij = ijpair(0,0)) : Sigma(ij) { }
- vertex* copy() const { return new Sigma_flipped(*this); }
- ijpair get_increment() const { return ijpair(0, indices.first+indices.second+1); }
- const ex evaluate(const symbol &x, const unsigned grad) const { return Sigma::evaluate(x, grad); }
+ vertex* copy() const override { return new Sigma_flipped(*this); }
+ ijpair get_increment() const override { return ijpair(0, indices.first+indices.second+1); }
+ const ex evaluate(const symbol &x, const unsigned grad) const override { return Sigma::evaluate(x, grad); }
private:
};
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); }
- const ex evaluate(const symbol &x, const unsigned grad) const;
+ vertex* copy() const override { return new Gamma(*this); }
+ ijpair get_increment() const override { return ijpair(indices.first+indices.second+1, 0); }
+ const ex evaluate(const symbol &x, const unsigned grad) const override;
private:
};
class Vacuum : public vertex {
public:
Vacuum(ijpair ij = ijpair(0,0)) : vertex(ij) { }
- vertex* copy() const { return new Vacuum(*this); }
- ijpair get_increment() const { return ijpair(0, indices.first+indices.second+1); }
- const ex evaluate(const symbol &x, const unsigned grad) const;
+ vertex* copy() const override { return new Vacuum(*this); }
+ ijpair get_increment() const override { return ijpair(0, indices.first+indices.second+1); }
+ const ex evaluate(const symbol &x, const unsigned grad) const override;
private:
};
return typeid(*vert).before(typeid(*n.vert));
// Are the indices of the top-level nodes different?
if (!(*vert==*n.vert))
- return (vert<n.vert);
+ return (*vert<*n.vert);
// Are the sets of children different, one by one?
return (children<n.children);
}
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;