35 |
|
|
36 |
|
/** |
37 |
|
* Returns a new set of given size containing consecutive |
38 |
< |
* Integers 0 ... n. |
38 |
> |
* Integers 0 ... n - 1. |
39 |
|
*/ |
40 |
< |
private ConcurrentSkipListSet<Integer> populatedSet(int n) { |
40 |
> |
private static ConcurrentSkipListSet<Integer> populatedSet(int n) { |
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))); |
53 |
|
/** |
54 |
|
* Returns a new set of first 5 ints. |
55 |
|
*/ |
56 |
< |
private ConcurrentSkipListSet set5() { |
56 |
> |
private static ConcurrentSkipListSet set5() { |
57 |
|
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
58 |
|
assertTrue(q.isEmpty()); |
59 |
|
q.add(one); |
87 |
|
*/ |
88 |
|
public void testConstructor4() { |
89 |
|
try { |
90 |
< |
Integer[] ints = new Integer[SIZE]; |
91 |
< |
new ConcurrentSkipListSet(Arrays.asList(ints)); |
90 |
> |
new ConcurrentSkipListSet(Arrays.asList(new Integer[SIZE])); |
91 |
|
shouldThrow(); |
92 |
|
} catch (NullPointerException success) {} |
93 |
|
} |
96 |
|
* Initializing from Collection with some null elements throws NPE |
97 |
|
*/ |
98 |
|
public void testConstructor5() { |
99 |
+ |
Integer[] ints = new Integer[SIZE]; |
100 |
+ |
for (int i = 0; i < SIZE - 1; ++i) |
101 |
+ |
ints[i] = new Integer(i); |
102 |
|
try { |
101 |
– |
Integer[] ints = new Integer[SIZE]; |
102 |
– |
for (int i = 0; i < SIZE-1; ++i) |
103 |
– |
ints[i] = new Integer(i); |
103 |
|
new ConcurrentSkipListSet(Arrays.asList(ints)); |
104 |
|
shouldThrow(); |
105 |
|
} catch (NullPointerException success) {} |
128 |
|
for (int i = 0; i < SIZE; ++i) |
129 |
|
ints[i] = new Integer(i); |
130 |
|
q.addAll(Arrays.asList(ints)); |
131 |
< |
for (int i = SIZE-1; i >= 0; --i) |
131 |
> |
for (int i = SIZE - 1; i >= 0; --i) |
132 |
|
assertEquals(ints[i], q.pollFirst()); |
133 |
|
} |
134 |
|
|
152 |
|
public void testSize() { |
153 |
|
ConcurrentSkipListSet q = populatedSet(SIZE); |
154 |
|
for (int i = 0; i < SIZE; ++i) { |
155 |
< |
assertEquals(SIZE-i, q.size()); |
155 |
> |
assertEquals(SIZE - i, q.size()); |
156 |
|
q.pollFirst(); |
157 |
|
} |
158 |
|
for (int i = 0; i < SIZE; ++i) { |
199 |
|
q.add(new Object()); |
200 |
|
q.add(new Object()); |
201 |
|
shouldThrow(); |
202 |
< |
} catch (ClassCastException success) {} |
202 |
> |
} catch (ClassCastException success) { |
203 |
> |
assertTrue(q.size() < 2); |
204 |
> |
for (int i = 0, size = q.size(); i < size; i++) |
205 |
> |
assertTrue(q.pollFirst().getClass() == Object.class); |
206 |
> |
assertNull(q.pollFirst()); |
207 |
> |
assertTrue(q.isEmpty()); |
208 |
> |
assertEquals(0, q.size()); |
209 |
> |
} |
210 |
|
} |
211 |
|
|
212 |
|
/** |
239 |
|
public void testAddAll3() { |
240 |
|
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
241 |
|
Integer[] ints = new Integer[SIZE]; |
242 |
< |
for (int i = 0; i < SIZE-1; ++i) |
242 |
> |
for (int i = 0; i < SIZE - 1; ++i) |
243 |
|
ints[i] = new Integer(i); |
244 |
|
try { |
245 |
|
q.addAll(Arrays.asList(ints)); |
254 |
|
Integer[] empty = new Integer[0]; |
255 |
|
Integer[] ints = new Integer[SIZE]; |
256 |
|
for (int i = 0; i < SIZE; ++i) |
257 |
< |
ints[i] = new Integer(SIZE-1-i); |
257 |
> |
ints[i] = new Integer(SIZE - 1 - i); |
258 |
|
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
259 |
|
assertFalse(q.addAll(Arrays.asList(empty))); |
260 |
|
assertTrue(q.addAll(Arrays.asList(ints))); |
278 |
|
*/ |
279 |
|
public void testPollLast() { |
280 |
|
ConcurrentSkipListSet q = populatedSet(SIZE); |
281 |
< |
for (int i = SIZE-1; i >= 0; --i) { |
281 |
> |
for (int i = SIZE - 1; i >= 0; --i) { |
282 |
|
assertEquals(i, q.pollLast()); |
283 |
|
} |
284 |
|
assertNull(q.pollFirst()); |
293 |
|
assertTrue(q.contains(i)); |
294 |
|
assertTrue(q.remove(i)); |
295 |
|
assertFalse(q.contains(i)); |
296 |
< |
assertTrue(q.contains(i-1)); |
296 |
> |
assertTrue(q.contains(i - 1)); |
297 |
|
} |
298 |
|
for (int i = 0; i < SIZE; i += 2) { |
299 |
|
assertTrue(q.contains(i)); |
300 |
|
assertTrue(q.remove(i)); |
301 |
|
assertFalse(q.contains(i)); |
302 |
< |
assertFalse(q.remove(i+1)); |
303 |
< |
assertFalse(q.contains(i+1)); |
302 |
> |
assertFalse(q.remove(i + 1)); |
303 |
> |
assertFalse(q.contains(i + 1)); |
304 |
|
} |
305 |
|
assertTrue(q.isEmpty()); |
306 |
|
} |
359 |
|
assertTrue(changed); |
360 |
|
|
361 |
|
assertTrue(q.containsAll(p)); |
362 |
< |
assertEquals(SIZE-i, q.size()); |
362 |
> |
assertEquals(SIZE - i, q.size()); |
363 |
|
p.pollFirst(); |
364 |
|
} |
365 |
|
} |
372 |
|
ConcurrentSkipListSet q = populatedSet(SIZE); |
373 |
|
ConcurrentSkipListSet p = populatedSet(i); |
374 |
|
assertTrue(q.removeAll(p)); |
375 |
< |
assertEquals(SIZE-i, q.size()); |
375 |
> |
assertEquals(SIZE - i, q.size()); |
376 |
|
for (int j = 0; j < i; ++j) { |
377 |
|
Integer x = (Integer)(p.pollFirst()); |
378 |
|
assertFalse(q.contains(x)); |
698 |
|
} |
699 |
|
|
700 |
|
static NavigableSet<Integer> newSet(Class cl) throws Exception { |
701 |
< |
NavigableSet<Integer> result = (NavigableSet<Integer>) cl.newInstance(); |
701 |
> |
NavigableSet<Integer> result = |
702 |
> |
(NavigableSet<Integer>) cl.getConstructor().newInstance(); |
703 |
|
assertEquals(0, result.size()); |
704 |
|
assertFalse(result.iterator().hasNext()); |
705 |
|
return result; |
982 |
|
} |
983 |
|
|
984 |
|
static boolean eq(Integer i, int j) { |
985 |
< |
return i == null ? j == -1 : i == j; |
985 |
> |
return (i == null) ? j == -1 : i == j; |
986 |
|
} |
987 |
|
|
988 |
|
} |