#include "cln/lfloat.h"
#include "cln/integer.h"
-#include "cln/abort.h"
+#include "cln/real.h"
+#include "cln/exception.h"
#include "cl_LF.h"
namespace cln {
// and T = B*Q*S (all integers). On entry N1 < N2.
// P will not be computed if a NULL pointer is passed.
-static void eval_pqab_series_aux (uintL N1, uintL N2,
+static void eval_pqab_series_aux (uintC N1, uintC N2,
const cl_pqab_series& args,
cl_I* P, cl_I* Q, cl_I* B, cl_I* T)
{
switch (N2 - N1) {
case 0:
- cl_abort(); break;
+ throw runtime_exception(); break;
case 1:
if (P) { *P = args.pv[N1]; }
*Q = args.qv[N1];
break;
}
default: {
- var uintL Nm = (N1+N2)/2; // midpoint
+ var uintC Nm = (N1+N2)/2; // midpoint
// Compute left part.
var cl_I LP, LQ, LB, LT;
eval_pqab_series_aux(N1,Nm,args,&LP,&LQ,&LB,<);
}
}
-static void eval_pqsab_series_aux (uintL N1, uintL N2,
+static void eval_pqsab_series_aux (uintC N1, uintC N2,
const cl_pqab_series& args,
- cl_I* P, cl_I* Q, uintL* QS, cl_I* B, cl_I* T)
+ cl_I* P, cl_I* Q, uintC* QS, cl_I* B, cl_I* T)
{
switch (N2 - N1) {
case 0:
- cl_abort(); break;
+ throw runtime_exception(); break;
case 1:
if (P) { *P = args.pv[N1]; }
*Q = args.qv[N1];
break;
}
default: {
- var uintL Nm = (N1+N2)/2; // midpoint
+ var uintC Nm = (N1+N2)/2; // midpoint
// Compute left part.
var cl_I LP, LQ, LB, LT;
- var uintL LQS;
+ var uintC LQS;
eval_pqsab_series_aux(N1,Nm,args,&LP,&LQ,&LQS,&LB,<);
// Compute right part.
var cl_I RP, RQ, RB, RT;
- var uintL RQS;
+ var uintC RQS;
eval_pqsab_series_aux(Nm,N2,args,(P?&RP:(cl_I*)0),&RQ,&RQS,&RB,&RT);
// Put together partial results.
if (P) { *P = LP*RP; }
}
}
-const cl_LF eval_rational_series (uintL N, const cl_pqab_series& args, uintC len)
+const cl_LF eval_rational_series (uintC N, const cl_pqab_series& args, uintC len)
{
if (N==0)
return cl_I_to_LF(0,len);
// Split qv[n] into qv[n]*2^qsv[n].
{
var cl_I* qp = args.qv;
- var uintL* qsp = args.qsv;
- for (var uintL n = 0; n < N; n++, qp++, qsp++) {
+ var uintC* qsp = args.qsv;
+ for (var uintC n = 0; n < N; n++, qp++, qsp++) {
// Pull out maximal power of 2 out of *qp = args.qv[n].
- var uintL qs = 0;
+ var uintC qs = 0;
if (!zerop(*qp)) {
qs = ord2(*qp);
if (qs > 0)
}
}
// Main computation.
- var uintL QS;
+ var uintC QS;
eval_pqsab_series_aux(0,N,args,NULL,&Q,&QS,&B,&T);
return cl_I_to_LF(T,len) / scale_float(cl_I_to_LF(B*Q,len),QS);
}
}
+
+static void eval_pqab_series_aux (uintC N1, uintC N2,
+ cl_pqab_series_stream& args,
+ cl_I* P, cl_I* Q, cl_I* B, cl_I* T)
+{
+ switch (N2 - N1) {
+ case 0:
+ throw runtime_exception(); break;
+ case 1: {
+ var cl_pqab_series_term v0 = args.next(); // [N1]
+ if (P) { *P = v0.p; }
+ *Q = v0.q;
+ *B = v0.b;
+ *T = v0.a * v0.p;
+ break;
+ }
+ case 2: {
+ var cl_pqab_series_term v0 = args.next(); // [N1]
+ var cl_pqab_series_term v1 = args.next(); // [N1+1]
+ var cl_I p01 = v0.p * v1.p;
+ if (P) { *P = p01; }
+ *Q = v0.q * v1.q;
+ *B = v0.b * v1.b;
+ *T = v1.b * v1.q * v0.a * v0.p
+ + v0.b * v1.a * p01;
+ break;
+ }
+ case 3: {
+ var cl_pqab_series_term v0 = args.next(); // [N1]
+ var cl_pqab_series_term v1 = args.next(); // [N1+1]
+ var cl_pqab_series_term v2 = args.next(); // [N1+2]
+ var cl_I p01 = v0.p * v1.p;
+ var cl_I p012 = p01 * v2.p;
+ if (P) { *P = p012; }
+ var cl_I q12 = v1.q * v2.q;
+ *Q = v0.q * q12;
+ var cl_I b12 = v1.b * v2.b;
+ *B = v0.b * b12;
+ *T = b12 * q12 * v0.a * v0.p
+ + v0.b * (v2.b * v2.q * v1.a * p01
+ + v1.b * v2.a * p012);
+ break;
+ }
+ case 4: {
+ var cl_pqab_series_term v0 = args.next(); // [N1]
+ var cl_pqab_series_term v1 = args.next(); // [N1+1]
+ var cl_pqab_series_term v2 = args.next(); // [N1+2]
+ var cl_pqab_series_term v3 = args.next(); // [N1+3]
+ var cl_I p01 = v0.p * v1.p;
+ var cl_I p012 = p01 * v2.p;
+ var cl_I p0123 = p012 * v3.p;
+ if (P) { *P = p0123; }
+ var cl_I q23 = v2.q * v3.q;
+ var cl_I q123 = v1.q * q23;
+ *Q = v0.q * q123;
+ var cl_I b01 = v0.b * v1.b;
+ var cl_I b23 = v2.b * v3.b;
+ *B = b01 * b23;
+ *T = b23 * (v1.b * q123 * v0.a * v0.p
+ + v0.b * q23 * v1.a * p01)
+ + b01 * (v3.b * v3.q * v2.a * p012
+ + v2.b * v3.a * p0123);
+ break;
+ }
+ default: {
+ var uintC Nm = (N1+N2)/2; // midpoint
+ // Compute left part.
+ var cl_I LP, LQ, LB, LT;
+ eval_pqab_series_aux(N1,Nm,args,&LP,&LQ,&LB,<);
+ // Compute right part.
+ var cl_I RP, RQ, RB, RT;
+ eval_pqab_series_aux(Nm,N2,args,(P?&RP:(cl_I*)0),&RQ,&RB,&RT);
+ // Put together partial results.
+ if (P) { *P = LP*RP; }
+ *Q = LQ*RQ;
+ *B = LB*RB;
+ // S = LS + LP/LQ * RS, so T = RB*RQ*LT + LB*LP*RT.
+ *T = RB*RQ*LT + LB*LP*RT;
+ break;
+ }
+ }
+}
+
+const cl_LF eval_rational_series (uintC N, cl_pqab_series_stream& args, uintC len)
+{
+ if (N==0)
+ return cl_I_to_LF(0,len);
+ var cl_I Q, B, T;
+ eval_pqab_series_aux(0,N,args,NULL,&Q,&B,&T);
+ return cl_I_to_LF(T,len) / cl_I_to_LF(B*Q,len);
+}
+
+static void eval_pqab_series_aux (uintC N1, uintC N2,
+ cl_pqab_series_stream& args,
+ cl_R* P, cl_R* Q, cl_R* B, cl_R* T,
+ uintC trunclen)
+{
+ switch (N2 - N1) {
+ case 0:
+ throw runtime_exception(); break;
+ case 1: {
+ var cl_pqab_series_term v0 = args.next(); // [N1]
+ if (P) { *P = v0.p; }
+ *Q = v0.q;
+ *B = v0.b;
+ *T = v0.a * v0.p;
+ break;
+ }
+ case 2: {
+ var cl_pqab_series_term v0 = args.next(); // [N1]
+ var cl_pqab_series_term v1 = args.next(); // [N1+1]
+ var cl_I p01 = v0.p * v1.p;
+ if (P) { *P = p01; }
+ *Q = v0.q * v1.q;
+ *B = v0.b * v1.b;
+ *T = v1.b * v1.q * v0.a * v0.p
+ + v0.b * v1.a * p01;
+ break;
+ }
+ case 3: {
+ var cl_pqab_series_term v0 = args.next(); // [N1]
+ var cl_pqab_series_term v1 = args.next(); // [N1+1]
+ var cl_pqab_series_term v2 = args.next(); // [N1+2]
+ var cl_I p01 = v0.p * v1.p;
+ var cl_I p012 = p01 * v2.p;
+ if (P) { *P = p012; }
+ var cl_I q12 = v1.q * v2.q;
+ *Q = v0.q * q12;
+ var cl_I b12 = v1.b * v2.b;
+ *B = v0.b * b12;
+ *T = b12 * q12 * v0.a * v0.p
+ + v0.b * (v2.b * v2.q * v1.a * p01
+ + v1.b * v2.a * p012);
+ break;
+ }
+ case 4: {
+ var cl_pqab_series_term v0 = args.next(); // [N1]
+ var cl_pqab_series_term v1 = args.next(); // [N1+1]
+ var cl_pqab_series_term v2 = args.next(); // [N1+2]
+ var cl_pqab_series_term v3 = args.next(); // [N1+3]
+ var cl_I p01 = v0.p * v1.p;
+ var cl_I p012 = p01 * v2.p;
+ var cl_I p0123 = p012 * v3.p;
+ if (P) { *P = p0123; }
+ var cl_I q23 = v2.q * v3.q;
+ var cl_I q123 = v1.q * q23;
+ *Q = v0.q * q123;
+ var cl_I b01 = v0.b * v1.b;
+ var cl_I b23 = v2.b * v3.b;
+ *B = b01 * b23;
+ *T = b23 * (v1.b * q123 * v0.a * v0.p
+ + v0.b * q23 * v1.a * p01)
+ + b01 * (v3.b * v3.q * v2.a * p012
+ + v2.b * v3.a * p0123);
+ break;
+ }
+ default: {
+ var uintC Nm = (N1+N2)/2; // midpoint
+ // Compute left part.
+ var cl_R LP, LQ, LB, LT;
+ eval_pqab_series_aux(N1,Nm,args,&LP,&LQ,&LB,<,trunclen);
+ // Compute right part.
+ var cl_R RP, RQ, RB, RT;
+ eval_pqab_series_aux(Nm,N2,args,(P?&RP:(cl_I*)0),&RQ,&RB,&RT,trunclen);
+ // Put together partial results.
+ if (P) {
+ *P = LP*RP;
+ truncate_precision(*P,trunclen);
+ }
+ *Q = LQ*RQ;
+ truncate_precision(*Q,trunclen);
+ *B = LB*RB;
+ truncate_precision(*B,trunclen);
+ // S = LS + LP/LQ * RS, so T = RB*RQ*LT + LB*LP*RT.
+ *T = RB*RQ*LT + LB*LP*RT;
+ truncate_precision(*T,trunclen);
+ break;
+ }
+ }
+}
+
+const cl_LF eval_rational_series (uintC N, cl_pqab_series_stream& args, uintC len, uintC trunclen)
+{
+ if (N==0)
+ return cl_I_to_LF(0,len);
+ var cl_R Q, B, T;
+ eval_pqab_series_aux(0,N,args,NULL,&Q,&B,&T,trunclen);
+ return cl_R_to_LF(T,len) / cl_R_to_LF(B*Q,len);
+}
// Bit complexity (if p(n), q(n), a(n), b(n) have length O(log(n))):
// O(log(N)^2*M(N)).
git://www.ginac.de / cln.git / blobdiff