41 |
|
ConcurrentSkipListSet<Integer> q = |
42 |
|
new ConcurrentSkipListSet<Integer>(); |
43 |
|
assertTrue(q.isEmpty()); |
44 |
< |
for (int i = n-1; i >= 0; i -= 2) |
44 |
> |
for (int i = n - 1; i >= 0; i -= 2) |
45 |
|
assertTrue(q.add(new Integer(i))); |
46 |
|
for (int i = (n & 1); i < n; i += 2) |
47 |
|
assertTrue(q.add(new Integer(i))); |
286 |
|
assertTrue(q.contains(i)); |
287 |
|
assertTrue(q.remove(i)); |
288 |
|
assertFalse(q.contains(i)); |
289 |
< |
assertTrue(q.contains(i-1)); |
289 |
> |
assertTrue(q.contains(i - 1)); |
290 |
|
} |
291 |
|
for (int i = 0; i < SIZE; i += 2) { |
292 |
|
assertTrue(q.contains(i)); |
293 |
|
assertTrue(q.remove(i)); |
294 |
|
assertFalse(q.contains(i)); |
295 |
< |
assertFalse(q.remove(i+1)); |
296 |
< |
assertFalse(q.contains(i+1)); |
295 |
> |
assertFalse(q.remove(i + 1)); |
296 |
> |
assertFalse(q.contains(i + 1)); |
297 |
|
} |
298 |
|
assertTrue(q.isEmpty()); |
299 |
|
} |