X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=check%2Ftime_antipode.cpp;h=d9ca681d564756dd53ae85dc4e9b6298701b0a19;hp=d618fabed94b1da3634ef2df1b4dc48e7c583f2f;hb=ab00a3f70e343eaf5ed242e20bd01da75849bc78;hpb=e31f4ca5848e18328d5263cea5a5a640d27a247d diff --git a/check/time_antipode.cpp b/check/time_antipode.cpp index d618fabe..d9ca681d 100644 --- a/check/time_antipode.cpp +++ b/check/time_antipode.cpp @@ -12,11 +12,11 @@ * This program is based on work by * Isabella Bierenbaum and * Dirk Kreimer . - * For details, please see . + * For details, please see . */ /* - * GiNaC Copyright (C) 1999-2004 Johannes Gutenberg University Mainz, Germany + * GiNaC Copyright (C) 1999-2021 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,19 +30,23 @@ * * 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 -#include -#include +#include "ginac.h" +#include "timer.h" +using namespace GiNaC; + #include -#include +#include #include +#include +#include +#include +using namespace std; // 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"); @@ -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 @@ -100,9 +105,9 @@ protected: 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: }; @@ -128,13 +133,13 @@ const ex Sigma::evaluate(const symbol &x, const unsigned grad) const } -/** 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: }; @@ -145,9 +150,9 @@ 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: }; @@ -179,9 +184,9 @@ const ex Gamma::evaluate(const symbol &x, const unsigned grad) const 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: }; @@ -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 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(); +}