@@ -130,7 +130,7 @@ version(mir_test)
130
130
assert (sum(ubyte .max.repeat(100 )) == 25_500);
131
131
132
132
// 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 );
134
134
// But a seed can be used to change the summation primitive
135
135
assert (uint .max.repeat(3 ).sum(ulong .init) == 12_884_901_885UL);
136
136
@@ -169,7 +169,7 @@ nothrow @nogc unittest
169
169
Summator! (real , Summation.precise) s = 0.0 ;
170
170
s.put(r);
171
171
s -= 1.7L .pow(1000 );
172
- assert (s.sum() == - 1 );
172
+ assert (s.sum == - 1 );
173
173
}
174
174
175
175
// / Precise summation with output range
@@ -182,9 +182,9 @@ nothrow @nogc unittest
182
182
auto s = Summator! (float , Summation.precise)(0 );
183
183
s += M;
184
184
s += M;
185
- assert (float .infinity == s.sum() ); // infinity
185
+ assert (float .infinity == s.sum); // infinity
186
186
auto e = cast (Summator! (double , Summation.precise)) s;
187
- assert (e.sum() < double .infinity);
187
+ assert (e.sum < double .infinity);
188
188
assert (N+ N == e.sum()); // finite number
189
189
}
190
190
@@ -204,7 +204,7 @@ unittest
204
204
205
205
double avg () @property const
206
206
{
207
- return summator.sum() / circularBuffer.length;
207
+ return summator.sum / circularBuffer.length;
208
208
}
209
209
210
210
this (double [] buffer)
@@ -1488,7 +1488,7 @@ public:
1488
1488
foreach (e; r2) s2 -= e;
1489
1489
s1 -= s2;
1490
1490
s1 -= 1.7L .pow(1000 );
1491
- assert (s1.sum() == - 1 );
1491
+ assert (s1.sum == - 1 );
1492
1492
}
1493
1493
1494
1494
0 commit comments