37 |
|
new ConcurrentSkipListSet<Integer>(); |
38 |
|
assertTrue(q.isEmpty()); |
39 |
|
|
40 |
< |
for (int i = n-1; i >= 0; i-=2) |
40 |
> |
for (int i = n-1; i >= 0; i -= 2) |
41 |
|
assertTrue(q.add(new Integer(i))); |
42 |
< |
for (int i = (n & 1); i < n; i+=2) |
42 |
> |
for (int i = (n & 1); i < n; i += 2) |
43 |
|
assertTrue(q.add(new Integer(i))); |
44 |
|
assertTrue(q.add(new Integer(-n))); |
45 |
|
assertTrue(q.add(new Integer(n))); |
241 |
|
*/ |
242 |
|
public void testRemoveElement() { |
243 |
|
NavigableSet q = populatedSet(SIZE); |
244 |
< |
for (int i = 1; i < SIZE; i+=2) { |
244 |
> |
for (int i = 1; i < SIZE; i += 2) { |
245 |
|
assertTrue(q.contains(i)); |
246 |
|
assertTrue(q.remove(i)); |
247 |
|
assertFalse(q.contains(i)); |
248 |
|
assertTrue(q.contains(i-1)); |
249 |
|
} |
250 |
< |
for (int i = 0; i < SIZE; i+=2) { |
250 |
> |
for (int i = 0; i < SIZE; i += 2) { |
251 |
|
assertTrue(q.contains(i)); |
252 |
|
assertTrue(q.remove(i)); |
253 |
|
assertFalse(q.contains(i)); |
746 |
|
*/ |
747 |
|
public void testDescendingRemoveElement() { |
748 |
|
NavigableSet q = populatedSet(SIZE); |
749 |
< |
for (int i = 1; i < SIZE; i+=2) { |
749 |
> |
for (int i = 1; i < SIZE; i += 2) { |
750 |
|
assertTrue(q.remove(new Integer(i))); |
751 |
|
} |
752 |
< |
for (int i = 0; i < SIZE; i+=2) { |
752 |
> |
for (int i = 0; i < SIZE; i += 2 ) { |
753 |
|
assertTrue(q.remove(new Integer(i))); |
754 |
|
assertFalse(q.remove(new Integer(i+1))); |
755 |
|
} |