369 |
|
assertTrue(q.removeAll(p)); |
370 |
|
assertEquals(SIZE-i, q.size()); |
371 |
|
for (int j = 0; j < i; ++j) { |
372 |
< |
Integer I = (Integer)(p.pollFirst()); |
373 |
< |
assertFalse(q.contains(I)); |
372 |
> |
Integer x = (Integer)(p.pollFirst()); |
373 |
> |
assertFalse(q.contains(x)); |
374 |
|
} |
375 |
|
} |
376 |
|
} |
732 |
|
// Add entries till we're back to original size |
733 |
|
while (set.size() < size) { |
734 |
|
int element = min + rnd.nextInt(rangeSize); |
735 |
< |
assertTrue(element >= min && element<= max); |
735 |
> |
assertTrue(element >= min && element <= max); |
736 |
|
put(set, element, bs); |
737 |
|
} |
738 |
|
} |
758 |
|
// Add entries till we're back to original size |
759 |
|
while (set.size() < size) { |
760 |
|
int element = min - 5 + rnd.nextInt(rangeSize + 10); |
761 |
< |
if (element >= min && element<= max) { |
761 |
> |
if (element >= min && element <= max) { |
762 |
|
put(set, element, bs); |
763 |
|
} else { |
764 |
|
try { |