* Li({},{}) has improved sum-loop now.
int q = 0;
do {
t0buf = t[0];
int q = 0;
do {
t0buf = t[0];
q++;
t[j-1] = t[j-1] + cln::expt(x[j-1], q) / cln::expt(cln::cl_I(q),s[j-1]) * one;
for (int k=j-2; k>=0; k--) {
t[k] = t[k] + t[k+1] * cln::expt(x[k], q+j-1-k) / cln::expt(cln::cl_I(q+j-1-k), s[k]);
}
q++;
t[j-1] = t[j-1] + cln::expt(x[j-1], q) / cln::expt(cln::cl_I(q),s[j-1]) * one;
for (int k=j-2; k>=0; k--) {
t[k] = t[k] + t[k+1] * cln::expt(x[k], q+j-1-k) / cln::expt(cln::cl_I(q+j-1-k), s[k]);
}
- } while ((t[0] != t0buf) || (q<10));
+ // ... and do it again (to avoid premature drop out due to special arguments)
+ q++;
+ t[j-1] = t[j-1] + cln::expt(x[j-1], q) / cln::expt(cln::cl_I(q),s[j-1]) * one;
+ for (int k=j-2; k>=0; k--) {
+ t[k] = t[k] + t[k+1] * cln::expt(x[k], q+j-1-k) / cln::expt(cln::cl_I(q+j-1-k), s[k]);
+ }
+ } while (t[0] != t0buf);
} else {
if (m_p.front() == 1) {
m_p.erase(m_p.begin());
} else {
if (m_p.front() == 1) {
m_p.erase(m_p.begin());
+ cln::cl_N spbuf = s_p.front();
s_p.erase(s_p.begin());
if (s_p.size() > 0) {
s_p.erase(s_p.begin());
if (s_p.size() > 0) {
- s_p.front() = s_p.front() * cln::cl_N("1/2");
+ s_p.front() = s_p.front() * spbuf;
- for (int i=0; i<s.size(); i++) {
- s_p[i] = -s_p[i];
- if (s[i] > 0) break;
-
- }
m_q.insert(m_q.begin(), 1);
if (s_q.size() > 0) {
s_q.front() = s_q.front() * 4;
m_q.insert(m_q.begin(), 1);
if (s_q.size() > 0) {
s_q.front() = s_q.front() * 4;