X-Git-Url: https://ginac.de/CLN/cln.git//cln.git?a=blobdiff_plain;f=src%2Ffloat%2Ftranscendental%2Fcl_LF_eulerconst.cc;h=3e13c1917c242b59a5d7cd34aa9ae6e00b7fbbc3;hb=4109ef07d74b779bb4d4371c24a6364302f464bb;hp=1258f7566b56e30aba035e41a580944721f35300;hpb=c486b78a1a0613f07a10816d6f6ca9e485bc8290;p=cln.git

diff --git a/src/float/transcendental/cl_LF_eulerconst.cc b/src/float/transcendental/cl_LF_eulerconst.cc
index 1258f75..3e13c19 100644
--- a/src/float/transcendental/cl_LF_eulerconst.cc
+++ b/src/float/transcendental/cl_LF_eulerconst.cc
@@ -447,16 +447,26 @@ const cl_LF compute_eulerconst_besselintegral4 (uintC len)
 	var uintC sx = (uintC)(0.25*0.693148*intDsize*actuallen)+1;
 	var uintC N = (uintC)(3.591121477*sx);
 	var cl_I x = square((cl_I)sx);
-	CL_ALLOCA_STACK;
-	var cl_pqd_series_term* args = (cl_pqd_series_term*) cl_alloca(N*sizeof(cl_pqd_series_term));
-	var uintC n;
-	for (n = 0; n < N; n++) {
-		init1(cl_I, args[n].p) (x);
-		init1(cl_I, args[n].q) (square((cl_I)(n+1)));
-		init1(cl_I, args[n].d) (n+1);
-	}
+	struct rational_series_stream : cl_pqd_series_stream {
+		uintC n;
+		cl_I x;
+		static cl_pqd_series_term computenext (cl_pqd_series_stream& thisss)
+		{
+			var rational_series_stream& thiss = (rational_series_stream&)thisss;
+			var uintC n = thiss.n;
+			var cl_pqd_series_term result;
+			result.p = thiss.x;
+			result.q = square((cl_I)(n+1));
+			result.d = n+1;
+			thiss.n = n+1;
+			return result;
+		}
+		rational_series_stream (const cl_I& _x)
+			: cl_pqd_series_stream (rational_series_stream::computenext),
+			  n (0), x (_x) {}
+	} series(x);
 	var cl_pqd_series_result sums;
-	eval_pqd_series_aux(N,args,sums);
+	eval_pqd_series_aux(N,series,sums);
 	// Instead of computing  fsum = 1 + T/Q  and  gsum = V/(D*Q)
 	// and then dividing them, to compute  gsum/fsum, we save two
 	// divisions by computing  V/(D*(Q+T)).
@@ -464,11 +474,6 @@ const cl_LF compute_eulerconst_besselintegral4 (uintC len)
 	  cl_I_to_LF(sums.V,actuallen)
 	  / The(cl_LF)(sums.D * cl_I_to_LF(sums.Q+sums.T,actuallen))
 	  - ln(cl_I_to_LF(sx,actuallen));
-	for (n = 0; n < N; n++) {
-		args[n].p.~cl_I();
-		args[n].q.~cl_I();
-		args[n].d.~cl_I();
-	}
 	return shorten(result,len); // verkürzen und fertig
 }
 // Bit complexity (N = len): O(log(N)^2*M(N)).