326 |
|
assertTrue(q.removeAll(p)); |
327 |
|
assertEquals(SIZE-i, q.size()); |
328 |
|
for (int j = 0; j < i; ++j) { |
329 |
< |
Integer I = (Integer)(p.pollFirst()); |
330 |
< |
assertFalse(q.contains(I)); |
329 |
> |
Integer x = (Integer)(p.pollFirst()); |
330 |
> |
assertFalse(q.contains(x)); |
331 |
|
} |
332 |
|
} |
333 |
|
} |
431 |
|
*/ |
432 |
|
public void testIterator() { |
433 |
|
NavigableSet q = populatedSet(SIZE); |
434 |
– |
int i = 0; |
434 |
|
Iterator it = q.iterator(); |
435 |
< |
while (it.hasNext()) { |
435 |
> |
int i; |
436 |
> |
for (i = 0; it.hasNext(); i++) |
437 |
|
assertTrue(q.contains(it.next())); |
438 |
– |
++i; |
439 |
– |
} |
438 |
|
assertEquals(i, SIZE); |
439 |
+ |
assertIteratorExhausted(it); |
440 |
|
} |
441 |
|
|
442 |
|
/** |
443 |
|
* iterator of empty set has no elements |
444 |
|
*/ |
445 |
|
public void testEmptyIterator() { |
446 |
< |
NavigableSet q = set0(); |
448 |
< |
int i = 0; |
449 |
< |
Iterator it = q.iterator(); |
450 |
< |
while (it.hasNext()) { |
451 |
< |
assertTrue(q.contains(it.next())); |
452 |
< |
++i; |
453 |
< |
} |
454 |
< |
assertEquals(0, i); |
446 |
> |
assertIteratorExhausted(set0().iterator()); |
447 |
|
} |
448 |
|
|
449 |
|
/** |
817 |
|
assertTrue(q.removeAll(p)); |
818 |
|
assertEquals(SIZE-i, q.size()); |
819 |
|
for (int j = 0; j < i; ++j) { |
820 |
< |
Integer I = (Integer)(p.pollFirst()); |
821 |
< |
assertFalse(q.contains(I)); |
820 |
> |
Integer x = (Integer)(p.pollFirst()); |
821 |
> |
assertFalse(q.contains(x)); |
822 |
|
} |
823 |
|
} |
824 |
|
} |