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) { |
41 |
< |
ConcurrentSkipListSet<Integer> q = |
42 |
< |
new ConcurrentSkipListSet<Integer>(); |
40 |
> |
private static ConcurrentSkipListSet<Integer> populatedSet(int n) { |
41 |
> |
ConcurrentSkipListSet<Integer> q = new ConcurrentSkipListSet<>(); |
42 |
|
assertTrue(q.isEmpty()); |
43 |
< |
for (int i = n-1; i >= 0; i -= 2) |
43 |
> |
for (int i = n - 1; i >= 0; i -= 2) |
44 |
|
assertTrue(q.add(new Integer(i))); |
45 |
|
for (int i = (n & 1); i < n; i += 2) |
46 |
|
assertTrue(q.add(new Integer(i))); |
52 |
|
/** |
53 |
|
* Returns a new set of first 5 ints. |
54 |
|
*/ |
55 |
< |
private ConcurrentSkipListSet set5() { |
55 |
> |
private static ConcurrentSkipListSet set5() { |
56 |
|
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
57 |
|
assertTrue(q.isEmpty()); |
58 |
|
q.add(one); |
96 |
|
*/ |
97 |
|
public void testConstructor5() { |
98 |
|
Integer[] ints = new Integer[SIZE]; |
99 |
< |
for (int i = 0; i < SIZE-1; ++i) |
99 |
> |
for (int i = 0; i < SIZE - 1; ++i) |
100 |
|
ints[i] = new Integer(i); |
101 |
|
try { |
102 |
|
new ConcurrentSkipListSet(Arrays.asList(ints)); |
127 |
|
for (int i = 0; i < SIZE; ++i) |
128 |
|
ints[i] = new Integer(i); |
129 |
|
q.addAll(Arrays.asList(ints)); |
130 |
< |
for (int i = SIZE-1; i >= 0; --i) |
130 |
> |
for (int i = SIZE - 1; i >= 0; --i) |
131 |
|
assertEquals(ints[i], q.pollFirst()); |
132 |
|
} |
133 |
|
|
151 |
|
public void testSize() { |
152 |
|
ConcurrentSkipListSet q = populatedSet(SIZE); |
153 |
|
for (int i = 0; i < SIZE; ++i) { |
154 |
< |
assertEquals(SIZE-i, q.size()); |
154 |
> |
assertEquals(SIZE - i, q.size()); |
155 |
|
q.pollFirst(); |
156 |
|
} |
157 |
|
for (int i = 0; i < SIZE; ++i) { |
198 |
|
q.add(new Object()); |
199 |
|
q.add(new Object()); |
200 |
|
shouldThrow(); |
201 |
< |
} catch (ClassCastException success) {} |
201 |
> |
} catch (ClassCastException success) { |
202 |
> |
assertTrue(q.size() < 2); |
203 |
> |
for (int i = 0, size = q.size(); i < size; i++) |
204 |
> |
assertSame(Object.class, q.pollFirst().getClass()); |
205 |
> |
assertNull(q.pollFirst()); |
206 |
> |
assertTrue(q.isEmpty()); |
207 |
> |
assertEquals(0, q.size()); |
208 |
> |
} |
209 |
|
} |
210 |
|
|
211 |
|
/** |
238 |
|
public void testAddAll3() { |
239 |
|
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
240 |
|
Integer[] ints = new Integer[SIZE]; |
241 |
< |
for (int i = 0; i < SIZE-1; ++i) |
241 |
> |
for (int i = 0; i < SIZE - 1; ++i) |
242 |
|
ints[i] = new Integer(i); |
243 |
|
try { |
244 |
|
q.addAll(Arrays.asList(ints)); |
253 |
|
Integer[] empty = new Integer[0]; |
254 |
|
Integer[] ints = new Integer[SIZE]; |
255 |
|
for (int i = 0; i < SIZE; ++i) |
256 |
< |
ints[i] = new Integer(SIZE-1-i); |
256 |
> |
ints[i] = new Integer(SIZE - 1 - i); |
257 |
|
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
258 |
|
assertFalse(q.addAll(Arrays.asList(empty))); |
259 |
|
assertTrue(q.addAll(Arrays.asList(ints))); |
277 |
|
*/ |
278 |
|
public void testPollLast() { |
279 |
|
ConcurrentSkipListSet q = populatedSet(SIZE); |
280 |
< |
for (int i = SIZE-1; i >= 0; --i) { |
280 |
> |
for (int i = SIZE - 1; i >= 0; --i) { |
281 |
|
assertEquals(i, q.pollLast()); |
282 |
|
} |
283 |
|
assertNull(q.pollFirst()); |
292 |
|
assertTrue(q.contains(i)); |
293 |
|
assertTrue(q.remove(i)); |
294 |
|
assertFalse(q.contains(i)); |
295 |
< |
assertTrue(q.contains(i-1)); |
295 |
> |
assertTrue(q.contains(i - 1)); |
296 |
|
} |
297 |
|
for (int i = 0; i < SIZE; i += 2) { |
298 |
|
assertTrue(q.contains(i)); |
299 |
|
assertTrue(q.remove(i)); |
300 |
|
assertFalse(q.contains(i)); |
301 |
< |
assertFalse(q.remove(i+1)); |
302 |
< |
assertFalse(q.contains(i+1)); |
301 |
> |
assertFalse(q.remove(i + 1)); |
302 |
> |
assertFalse(q.contains(i + 1)); |
303 |
|
} |
304 |
|
assertTrue(q.isEmpty()); |
305 |
|
} |
358 |
|
assertTrue(changed); |
359 |
|
|
360 |
|
assertTrue(q.containsAll(p)); |
361 |
< |
assertEquals(SIZE-i, q.size()); |
361 |
> |
assertEquals(SIZE - i, q.size()); |
362 |
|
p.pollFirst(); |
363 |
|
} |
364 |
|
} |
371 |
|
ConcurrentSkipListSet q = populatedSet(SIZE); |
372 |
|
ConcurrentSkipListSet p = populatedSet(i); |
373 |
|
assertTrue(q.removeAll(p)); |
374 |
< |
assertEquals(SIZE-i, q.size()); |
374 |
> |
assertEquals(SIZE - i, q.size()); |
375 |
|
for (int j = 0; j < i; ++j) { |
376 |
|
Integer x = (Integer)(p.pollFirst()); |
377 |
|
assertFalse(q.contains(x)); |
456 |
|
*/ |
457 |
|
public void testToArray() { |
458 |
|
ConcurrentSkipListSet q = populatedSet(SIZE); |
459 |
< |
Object[] o = q.toArray(); |
460 |
< |
for (int i = 0; i < o.length; i++) |
461 |
< |
assertSame(o[i], q.pollFirst()); |
459 |
> |
Object[] a = q.toArray(); |
460 |
> |
assertSame(Object[].class, a.getClass()); |
461 |
> |
for (Object o : a) |
462 |
> |
assertSame(o, q.pollFirst()); |
463 |
> |
assertTrue(q.isEmpty()); |
464 |
|
} |
465 |
|
|
466 |
|
/** |
470 |
|
ConcurrentSkipListSet<Integer> q = populatedSet(SIZE); |
471 |
|
Integer[] ints = new Integer[SIZE]; |
472 |
|
assertSame(ints, q.toArray(ints)); |
473 |
< |
for (int i = 0; i < ints.length; i++) |
474 |
< |
assertSame(ints[i], q.pollFirst()); |
473 |
> |
for (Integer o : ints) |
474 |
> |
assertSame(o, q.pollFirst()); |
475 |
> |
assertTrue(q.isEmpty()); |
476 |
|
} |
477 |
|
|
478 |
|
/** |
528 |
|
} |
529 |
|
|
530 |
|
/** |
531 |
< |
* A deserialized serialized set has same elements |
531 |
> |
* A cloned set equals original |
532 |
> |
*/ |
533 |
> |
public void testClone() { |
534 |
> |
ConcurrentSkipListSet x = populatedSet(SIZE); |
535 |
> |
ConcurrentSkipListSet y = x.clone(); |
536 |
> |
|
537 |
> |
assertNotSame(x, y); |
538 |
> |
assertEquals(x.size(), y.size()); |
539 |
> |
assertEquals(x, y); |
540 |
> |
assertEquals(y, x); |
541 |
> |
while (!x.isEmpty()) { |
542 |
> |
assertFalse(y.isEmpty()); |
543 |
> |
assertEquals(x.pollFirst(), y.pollFirst()); |
544 |
> |
} |
545 |
> |
assertTrue(y.isEmpty()); |
546 |
> |
} |
547 |
> |
|
548 |
> |
/** |
549 |
> |
* A deserialized/reserialized set equals original |
550 |
|
*/ |
551 |
|
public void testSerialization() throws Exception { |
552 |
|
NavigableSet x = populatedSet(SIZE); |
718 |
|
} |
719 |
|
|
720 |
|
static NavigableSet<Integer> newSet(Class cl) throws Exception { |
721 |
< |
NavigableSet<Integer> result = (NavigableSet<Integer>) cl.newInstance(); |
721 |
> |
NavigableSet<Integer> result = |
722 |
> |
(NavigableSet<Integer>) cl.getConstructor().newInstance(); |
723 |
|
assertEquals(0, result.size()); |
724 |
|
assertFalse(result.iterator().hasNext()); |
725 |
|
return result; |
1002 |
|
} |
1003 |
|
|
1004 |
|
static boolean eq(Integer i, int j) { |
1005 |
< |
return i == null ? j == -1 : i == j; |
1005 |
> |
return (i == null) ? j == -1 : i == j; |
1006 |
|
} |
1007 |
|
|
1008 |
|
} |