336 |
|
sum[0] = 0; |
337 |
|
x.removeIf(n -> { sum[0] += n; return false; }); |
338 |
|
check.sum(sum[0]);}}}, |
339 |
+ |
new Job(klazz + " .contains") { |
340 |
+ |
public void work() throws Throwable { |
341 |
+ |
int[] sum = new int[1]; |
342 |
+ |
Object y = new Object() { public boolean equals(Object z) { |
343 |
+ |
sum[0] += (int) z; return false; }}; |
344 |
+ |
for (int i = 0; i < iterations; i++) { |
345 |
+ |
sum[0] = 0; |
346 |
+ |
x.contains(y); |
347 |
+ |
check.sum(sum[0]);}}}, |
348 |
|
new Job(klazz + " .forEach") { |
349 |
|
public void work() throws Throwable { |
350 |
|
int[] sum = new int[1]; |