X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?a=blobdiff_plain;f=ginac%2Finifcns_nstdsums.cpp;h=6c17e32e729bedea127eb09573dbb8ff400f2138;hb=cd22e73d44e3320898f62a0accdbbe005b33d3e5;hp=eb98d7a9750e5ba257f6f6f960685f30527353e6;hpb=ac8c33efafa1c9f62db040db0d974f47229960b8;p=ginac.git diff --git a/ginac/inifcns_nstdsums.cpp b/ginac/inifcns_nstdsums.cpp index eb98d7a9..6c17e32e 100644 --- a/ginac/inifcns_nstdsums.cpp +++ b/ginac/inifcns_nstdsums.cpp @@ -4,12 +4,12 @@ * * The functions are: * classical polylogarithm Li(n,x) - * multiple polylogarithm Li(lst(m_1,...,m_k),lst(x_1,...,x_k)) - * G(lst(a_1,...,a_k),y) or G(lst(a_1,...,a_k),lst(s_1,...,s_k),y) + * multiple polylogarithm Li(lst{m_1,...,m_k},lst{x_1,...,x_k}) + * G(lst{a_1,...,a_k},y) or G(lst{a_1,...,a_k},lst{s_1,...,s_k},y) * Nielsen's generalized polylogarithm S(n,p,x) - * harmonic polylogarithm H(m,x) or H(lst(m_1,...,m_k),x) - * multiple zeta value zeta(m) or zeta(lst(m_1,...,m_k)) - * alternating Euler sum zeta(m,s) or zeta(lst(m_1,...,m_k),lst(s_1,...,s_k)) + * harmonic polylogarithm H(m,x) or H(lst{m_1,...,m_k},x) + * multiple zeta value zeta(m) or zeta(lst{m_1,...,m_k}) + * alternating Euler sum zeta(m,s) or zeta(lst{m_1,...,m_k},lst{s_1,...,s_k}) * * Some remarks: * @@ -47,7 +47,7 @@ */ /* - * GiNaC Copyright (C) 1999-2015 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 @@ -102,7 +102,7 @@ namespace { // lookup table for factors built from Bernoulli numbers // see fill_Xn() -std::vector > Xn; +std::vector> Xn; // initial size of Xn that should suffice for 32bit machines (must be even) const int xninitsizestep = 26; int xninitsize = xninitsizestep; @@ -1136,7 +1136,7 @@ G_do_trafo(const std::vector& x, const std::vector& s, Gparameter pendint; ex result = G_transform(pendint, a, scale, gsyms, flag_trailing_zeros_only); // replace dummy symbols with their values - result = result.eval().expand(); + result = result.expand(); result = result.subs(subslst).evalf(); if (!is_a(result)) throw std::logic_error("G_do_trafo: G_transform returned non-numeric result"); @@ -1252,7 +1252,7 @@ static ex G2_evalf(const ex& x_, const ex& y) if ((!y.info(info_flags::numeric)) || (!y.info(info_flags::positive))) { return G(x_, y).hold(); } - lst x = is_a(x_) ? ex_to(x_) : lst(x_); + lst x = is_a(x_) ? ex_to(x_) : lst{x_}; if (x.nops() == 0) { return _ex1; } @@ -1295,7 +1295,7 @@ static ex G2_eval(const ex& x_, const ex& y) if ((!y.info(info_flags::numeric)) || (!y.info(info_flags::positive))) { return G(x_, y).hold(); } - lst x = is_a(x_) ? ex_to(x_) : lst(x_); + lst x = is_a(x_) ? ex_to(x_) : lst{x_}; if (x.nops() == 0) { return _ex1; } @@ -1356,8 +1356,8 @@ static ex G3_evalf(const ex& x_, const ex& s_, const ex& y) if ((!y.info(info_flags::numeric)) || (!y.info(info_flags::positive))) { return G(x_, s_, y).hold(); } - lst x = is_a(x_) ? ex_to(x_) : lst(x_); - lst s = is_a(s_) ? ex_to(s_) : lst(s_); + lst x = is_a(x_) ? ex_to(x_) : lst{x_}; + lst s = is_a(s_) ? ex_to(s_) : lst{s_}; if (x.nops() != s.nops()) { return G(x_, s_, y).hold(); } @@ -1420,8 +1420,8 @@ static ex G3_eval(const ex& x_, const ex& s_, const ex& y) if ((!y.info(info_flags::numeric)) || (!y.info(info_flags::positive))) { return G(x_, s_, y).hold(); } - lst x = is_a(x_) ? ex_to(x_) : lst(x_); - lst s = is_a(s_) ? ex_to(s_) : lst(s_); + lst x = is_a(x_) ? ex_to(x_) : lst{x_}; + lst s = is_a(s_) ? ex_to(s_) : lst{s_}; if (x.nops() != s.nops()) { return G(x_, s_, y).hold(); } @@ -1727,13 +1727,13 @@ static void Li_print_latex(const ex& m_, const ex& x_, const print_context& c) if (is_a(m_)) { m = ex_to(m_); } else { - m = lst(m_); + m = lst{m_}; } lst x; if (is_a(x_)) { x = ex_to(x_); } else { - x = lst(x_); + x = lst{x_}; } c.s << "\\mathrm{Li}_{"; lst::const_iterator itm = m.begin(); @@ -1779,7 +1779,7 @@ namespace { // lookup table for special Euler-Zagier-Sums (used for S_n,p(x)) // see fill_Yn() -std::vector > Yn; +std::vector> Yn; int ynsize = 0; // number of Yn[] int ynlength = 100; // initial length of all Yn[i] @@ -2175,7 +2175,7 @@ static ex S_eval(const ex& n, const ex& p, const ex& x) return _ex0; } if (x == 1) { - lst m(n+1); + lst m{n+1}; for (int i=ex_to(p).to_int()-1; i>0; i--) { m.append(1); } @@ -2360,7 +2360,7 @@ bool convert_parameter_H_to_Li(const lst& l, lst& m, lst& s, ex& pf) // recursivly transforms H to corresponding multiple polylogarithms struct map_trafo_H_convert_to_Li : public map_function { - ex operator()(const ex& e) + ex operator()(const ex& e) override { if (is_a(e) || is_a(e)) { return e.map(*this); @@ -2372,7 +2372,7 @@ struct map_trafo_H_convert_to_Li : public map_function if (is_a(e.op(0))) { parameter = ex_to(e.op(0)); } else { - parameter = lst(e.op(0)); + parameter = lst{e.op(0)}; } ex arg = e.op(1); @@ -2399,7 +2399,7 @@ struct map_trafo_H_convert_to_Li : public map_function // recursivly transforms H to corresponding zetas struct map_trafo_H_convert_to_zeta : public map_function { - ex operator()(const ex& e) + ex operator()(const ex& e) override { if (is_a(e) || is_a(e)) { return e.map(*this); @@ -2411,7 +2411,7 @@ struct map_trafo_H_convert_to_zeta : public map_function if (is_a(e.op(0))) { parameter = ex_to(e.op(0)); } else { - parameter = lst(e.op(0)); + parameter = lst{e.op(0)}; } lst m; @@ -2432,7 +2432,7 @@ struct map_trafo_H_convert_to_zeta : public map_function // remove trailing zeros from H-parameters struct map_trafo_H_reduce_trailing_zeros : public map_function { - ex operator()(const ex& e) + ex operator()(const ex& e) override { if (is_a(e) || is_a(e)) { return e.map(*this); @@ -2444,7 +2444,7 @@ struct map_trafo_H_reduce_trailing_zeros : public map_function if (is_a(e.op(0))) { parameter = ex_to(e.op(0)); } else { - parameter = lst(e.op(0)); + parameter = lst{e.op(0)}; } ex arg = e.op(1); if (parameter.op(parameter.nops()-1) == 0) { @@ -2556,7 +2556,7 @@ ex trafo_H_mult(const ex& h1, const ex& h2) if (h2nops > 1) { hlong = ex_to(h2.op(0)); } else { - hlong = h2.op(0).op(0); + hlong = lst{h2.op(0).op(0)}; } } for (std::size_t i=0; i<=hlong.nops(); i++) { @@ -2578,7 +2578,7 @@ ex trafo_H_mult(const ex& h1, const ex& h2) // applies trafo_H_mult recursively on expressions struct map_trafo_H_mult : public map_function { - ex operator()(const ex& e) + ex operator()(const ex& e) override { if (is_a(e)) { return e.map(*this); @@ -2666,7 +2666,7 @@ ex trafo_H_1tx_prepend_zero(const ex& e, const ex& arg) ex addzeta = convert_H_to_zeta(newparameter); return e.subs(h == (addzeta-H(newparameter, h.op(1)).hold())).expand(); } else { - return e * (-H(lst(ex(0)),1/arg).hold()); + return e * (-H(lst{ex(0)},1/arg).hold()); } } @@ -2697,7 +2697,7 @@ ex trafo_H_prepend_one(const ex& e, const ex& arg) newparameter.prepend(1); return e.subs(h == H(newparameter, h.op(1)).hold()); } else { - return e * H(lst(ex(1)),1-arg).hold(); + return e * H(lst{ex(1)},1-arg).hold(); } } @@ -2729,8 +2729,8 @@ ex trafo_H_1tx_prepend_minusone(const ex& e, const ex& arg) ex addzeta = convert_H_to_zeta(newparameter); return e.subs(h == (addzeta-H(newparameter, h.op(1)).hold())).expand(); } else { - ex addzeta = convert_H_to_zeta(lst(ex(-1))); - return (e * (addzeta - H(lst(ex(-1)),1/arg).hold())).expand(); + ex addzeta = convert_H_to_zeta(lst{ex(-1)}); + return (e * (addzeta - H(lst{ex(-1)},1/arg).hold())).expand(); } } @@ -2761,7 +2761,7 @@ ex trafo_H_1mxt1px_prepend_minusone(const ex& e, const ex& arg) newparameter.prepend(-1); return e.subs(h == H(newparameter, h.op(1)).hold()).expand(); } else { - return (e * H(lst(ex(-1)),(1-arg)/(1+arg)).hold()).expand(); + return (e * H(lst{ex(-1)},(1-arg)/(1+arg)).hold()).expand(); } } @@ -2792,7 +2792,7 @@ ex trafo_H_1mxt1px_prepend_one(const ex& e, const ex& arg) newparameter.prepend(1); return e.subs(h == H(newparameter, h.op(1)).hold()).expand(); } else { - return (e * H(lst(ex(1)),(1-arg)/(1+arg)).hold()).expand(); + return (e * H(lst{ex(1)},(1-arg)/(1+arg)).hold()).expand(); } } @@ -2800,7 +2800,7 @@ ex trafo_H_1mxt1px_prepend_one(const ex& e, const ex& arg) // do x -> 1-x transformation struct map_trafo_H_1mx : public map_function { - ex operator()(const ex& e) + ex operator()(const ex& e) override { if (is_a(e) || is_a(e)) { return e.map(*this); @@ -2871,7 +2871,7 @@ struct map_trafo_H_1mx : public map_function // leading one map_trafo_H_1mx recursion; map_trafo_H_mult unify; - ex res = H(lst(ex(1)), arg).hold() * H(newparameter, arg).hold(); + ex res = H(lst{ex(1)}, arg).hold() * H(newparameter, arg).hold(); std::size_t firstzero = 0; while (parameter.op(firstzero) == 1) { firstzero++; @@ -2901,7 +2901,7 @@ struct map_trafo_H_1mx : public map_function // do x -> 1/x transformation struct map_trafo_H_1overx : public map_function { - ex operator()(const ex& e) + ex operator()(const ex& e) override { if (is_a(e) || is_a(e)) { return e.map(*this); @@ -2935,7 +2935,7 @@ struct map_trafo_H_1overx : public map_function } if (allthesame) { map_trafo_H_mult unify; - return unify((pow(H(lst(ex(-1)),1/arg).hold() - H(lst(ex(0)),1/arg).hold(), parameter.nops()) + return unify((pow(H(lst{ex(-1)},1/arg).hold() - H(lst{ex(0)},1/arg).hold(), parameter.nops()) / factorial(parameter.nops())).expand()); } } else { @@ -2947,7 +2947,7 @@ struct map_trafo_H_1overx : public map_function } if (allthesame) { map_trafo_H_mult unify; - return unify((pow(H(lst(ex(1)),1/arg).hold() + H(lst(ex(0)),1/arg).hold() + H_polesign, parameter.nops()) + return unify((pow(H(lst{ex(1)},1/arg).hold() + H(lst{ex(0)},1/arg).hold() + H_polesign, parameter.nops()) / factorial(parameter.nops())).expand()); } } @@ -2990,7 +2990,7 @@ struct map_trafo_H_1overx : public map_function // leading one map_trafo_H_1overx recursion; map_trafo_H_mult unify; - ex res = H(lst(ex(1)), arg).hold() * H(newparameter, arg).hold(); + ex res = H(lst{ex(1)}, arg).hold() * H(newparameter, arg).hold(); std::size_t firstzero = 0; while (parameter.op(firstzero) == 1) { firstzero++; @@ -3022,7 +3022,7 @@ struct map_trafo_H_1overx : public map_function // do x -> (1-x)/(1+x) transformation struct map_trafo_H_1mxt1px : public map_function { - ex operator()(const ex& e) + ex operator()(const ex& e) override { if (is_a(e) || is_a(e)) { return e.map(*this); @@ -3046,7 +3046,7 @@ struct map_trafo_H_1mxt1px : public map_function } if (allthesame) { map_trafo_H_mult unify; - return unify((pow(-H(lst(ex(1)),(1-arg)/(1+arg)).hold() - H(lst(ex(-1)),(1-arg)/(1+arg)).hold(), parameter.nops()) + return unify((pow(-H(lst{ex(1)},(1-arg)/(1+arg)).hold() - H(lst{ex(-1)},(1-arg)/(1+arg)).hold(), parameter.nops()) / factorial(parameter.nops())).expand()); } } else if (parameter.op(0) == -1) { @@ -3058,7 +3058,7 @@ struct map_trafo_H_1mxt1px : public map_function } if (allthesame) { map_trafo_H_mult unify; - return unify((pow(log(2) - H(lst(ex(-1)),(1-arg)/(1+arg)).hold(), parameter.nops()) + return unify((pow(log(2) - H(lst{ex(-1)},(1-arg)/(1+arg)).hold(), parameter.nops()) / factorial(parameter.nops())).expand()); } } else { @@ -3070,7 +3070,7 @@ struct map_trafo_H_1mxt1px : public map_function } if (allthesame) { map_trafo_H_mult unify; - return unify((pow(-log(2) - H(lst(ex(0)),(1-arg)/(1+arg)).hold() + H(lst(ex(-1)),(1-arg)/(1+arg)).hold(), parameter.nops()) + return unify((pow(-log(2) - H(lst{ex(0)},(1-arg)/(1+arg)).hold() + H(lst{ex(-1)},(1-arg)/(1+arg)).hold(), parameter.nops()) / factorial(parameter.nops())).expand()); } } @@ -3113,7 +3113,7 @@ struct map_trafo_H_1mxt1px : public map_function // leading one map_trafo_H_1mxt1px recursion; map_trafo_H_mult unify; - ex res = H(lst(ex(1)), arg).hold() * H(newparameter, arg).hold(); + ex res = H(lst{ex(1)}, arg).hold() * H(newparameter, arg).hold(); std::size_t firstzero = 0; while (parameter.op(firstzero) == 1) { firstzero++; @@ -3316,7 +3316,7 @@ static ex H_eval(const ex& m_, const ex& x) if (is_a(m_)) { m = ex_to(m_); } else { - m = lst(m_); + m = lst{m_}; } if (m.nops() == 0) { return _ex1; @@ -3442,7 +3442,7 @@ static ex H_deriv(const ex& m_, const ex& x, unsigned deriv_param) if (is_a(m_)) { m = ex_to(m_); } else { - m = lst(m_); + m = lst{m_}; } ex mb = *m.begin(); if (mb > _ex1) { @@ -3470,7 +3470,7 @@ static void H_print_latex(const ex& m_, const ex& x, const print_context& c) if (is_a(m_)) { m = ex_to(m_); } else { - m = lst(m_); + m = lst{m_}; } c.s << "\\mathrm{H}_{"; lst::const_iterator itm = m.begin(); @@ -3503,7 +3503,7 @@ ex convert_H_to_Li(const ex& m, const ex& x) if (is_a(m)) { return filter2(filter(H(m, x).hold())); } else { - return filter2(filter(H(lst(m), x).hold())); + return filter2(filter(H(lst{m}, x).hold())); } } @@ -3547,7 +3547,7 @@ static void initcX(std::vector& crX, int Sm = 0; int Smp1 = 0; - std::vector > crG(s.size() - 1, std::vector(L2 + 1)); + std::vector> crG(s.size() - 1, std::vector(L2 + 1)); for (int m=0; m < (int)s.size() - 1; m++) { Sm += s[m]; Smp1 = Sm + s[m+1]; @@ -3587,12 +3587,12 @@ static cln::cl_N crandall_Y_loop(const cln::cl_N& Sqk, // [Cra] section 4 -static void calc_f(std::vector >& f_kj, +static void calc_f(std::vector>& f_kj, const int maxr, const int L1) { cln::cl_N t0, t1, t2, t3, t4; int i, j, k; - std::vector >::iterator it = f_kj.begin(); + std::vector>::iterator it = f_kj.begin(); cln::cl_F one = cln::cl_float(1, cln::float_format(Digits)); t0 = cln::exp(-lambda); @@ -3616,7 +3616,7 @@ static void calc_f(std::vector >& f_kj, // [Cra] (3.1) static cln::cl_N crandall_Z(const std::vector& s, - const std::vector >& f_kj) + const std::vector>& f_kj) { const int j = s.size(); @@ -3693,7 +3693,7 @@ cln::cl_N zeta_do_sum_Crandall(const std::vector& s) } } - std::vector > f_kj(L1); + std::vector> f_kj(L1); calc_f(f_kj, maxr, L1); const cln::cl_N r0factorial = cln::factorial(r[0]-1); @@ -4082,13 +4082,13 @@ static void zeta2_print_latex(const ex& m_, const ex& s_, const print_context& c if (is_a(m_)) { m = ex_to(m_); } else { - m = lst(m_); + m = lst{m_}; } lst s; if (is_a(s_)) { s = ex_to(s_); } else { - s = lst(s_); + s = lst{s_}; } c.s << "\\zeta("; lst::const_iterator itm = m.begin();