@@ -130,7 +130,7 @@ version(mir_test)
130130 assert (sum(ubyte .max.repeat(100 )) == 25_500);
131131
132132 // The result may overflow
133- assert (uint .max.repeat(3 ).sum() == 4_294_967_293U );
133+ assert (uint .max.repeat(3 ).sum == 4_294_967_293U );
134134 // But a seed can be used to change the summation primitive
135135 assert (uint .max.repeat(3 ).sum(ulong .init) == 12_884_901_885UL);
136136
@@ -169,7 +169,7 @@ nothrow @nogc unittest
169169 Summator! (real , Summation.precise) s = 0.0 ;
170170 s.put(r);
171171 s -= 1.7L .pow(1000 );
172- assert (s.sum() == - 1 );
172+ assert (s.sum == - 1 );
173173}
174174
175175// / Precise summation with output range
@@ -182,9 +182,9 @@ nothrow @nogc unittest
182182 auto s = Summator! (float , Summation.precise)(0 );
183183 s += M;
184184 s += M;
185- assert (float .infinity == s.sum() ); // infinity
185+ assert (float .infinity == s.sum); // infinity
186186 auto e = cast (Summator! (double , Summation.precise)) s;
187- assert (e.sum() < double .infinity);
187+ assert (e.sum < double .infinity);
188188 assert (N+ N == e.sum()); // finite number
189189}
190190
@@ -204,7 +204,7 @@ unittest
204204
205205 double avg () @property const
206206 {
207- return summator.sum() / circularBuffer.length;
207+ return summator.sum / circularBuffer.length;
208208 }
209209
210210 this (double [] buffer)
@@ -1488,7 +1488,7 @@ public:
14881488 foreach (e; r2) s2 -= e;
14891489 s1 -= s2;
14901490 s1 -= 1.7L .pow(1000 );
1491- assert (s1.sum() == - 1 );
1491+ assert (s1.sum == - 1 );
14921492 }
14931493
14941494
0 commit comments