// Implementation.
-#include "cl_lfloat.h"
-#include "cl_integer.h"
-#include "cl_abort.h"
+#include "cln/lfloat.h"
+#include "cln/integer.h"
+#include "cln/abort.h"
#include "cl_LF.h"
+namespace cln {
+
// Subroutine.
// Evaluates S = sum(N1 <= n < N2, a(n)/b(n) * (p(N1)...p(n))/(q(N1)...q(n)))
// and returns P = p(N1)...p(N2-1), Q = q(N1)...q(N2-1), B = B(N1)...B(N2-1)
// 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_pa_series_aux (uintL N1, uintL N2,
+static void eval_pa_series_aux (uintC N1, uintC N2,
const cl_pa_series& args,
cl_I* P, cl_I* T)
{
break;
}
default: {
- var uintL Nm = (N1+N2)/2; // midpoint
+ var uintC Nm = (N1+N2)/2; // midpoint
// Compute left part.
var cl_I LP, LT;
eval_pa_series_aux(N1,Nm,args,&LP,<);
}
}
-const cl_LF eval_rational_series (uintL N, const cl_pa_series& args, uintC len)
+const cl_LF eval_rational_series (uintC N, const cl_pa_series& args, uintC len)
{
if (N==0)
return cl_I_to_LF(0,len);
}
// Bit complexity (if p(n), q(n), a(n), b(n) have length O(log(n))):
// O(log(N)^2*M(N)).
+
+} // namespace cln