45 |
|
private TreeSet<Integer> populatedSet(int n) { |
46 |
|
TreeSet<Integer> q = new TreeSet<Integer>(); |
47 |
|
assertTrue(q.isEmpty()); |
48 |
< |
for (int i = n-1; i >= 0; i-=2) |
48 |
> |
for (int i = n-1; i >= 0; i -= 2) |
49 |
|
assertTrue(q.add(new Integer(i))); |
50 |
< |
for (int i = (n & 1); i < n; i+=2) |
50 |
> |
for (int i = (n & 1); i < n; i += 2) |
51 |
|
assertTrue(q.add(new Integer(i))); |
52 |
|
assertFalse(q.isEmpty()); |
53 |
|
assertEquals(n, q.size()); |
288 |
|
*/ |
289 |
|
public void testRemoveElement() { |
290 |
|
TreeSet q = populatedSet(SIZE); |
291 |
< |
for (int i = 1; i < SIZE; i+=2) { |
291 |
> |
for (int i = 1; i < SIZE; i += 2) { |
292 |
|
assertTrue(q.contains(i)); |
293 |
|
assertTrue(q.remove(i)); |
294 |
|
assertFalse(q.contains(i)); |
295 |
|
assertTrue(q.contains(i-1)); |
296 |
|
} |
297 |
< |
for (int i = 0; i < SIZE; i+=2) { |
297 |
> |
for (int i = 0; i < SIZE; i += 2) { |
298 |
|
assertTrue(q.contains(i)); |
299 |
|
assertTrue(q.remove(i)); |
300 |
|
assertFalse(q.contains(i)); |
373 |
|
assertTrue(q.removeAll(p)); |
374 |
|
assertEquals(SIZE-i, q.size()); |
375 |
|
for (int j = 0; j < i; ++j) { |
376 |
< |
Integer I = (Integer)(p.pollFirst()); |
377 |
< |
assertFalse(q.contains(I)); |
376 |
> |
Integer x = (Integer)(p.pollFirst()); |
377 |
> |
assertFalse(q.contains(x)); |
378 |
|
} |
379 |
|
} |
380 |
|
} |