1 |
|
/* |
2 |
|
* Written by Doug Lea with assistance from members of JCP JSR-166 |
3 |
|
* Expert Group and released to the public domain, as explained at |
4 |
< |
* http://creativecommons.org/licenses/publicdomain |
4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
*/ |
6 |
|
|
7 |
|
import junit.framework.*; |
8 |
< |
import java.util.*; |
9 |
< |
import java.util.concurrent.*; |
10 |
< |
import java.io.*; |
8 |
> |
import java.util.Arrays; |
9 |
> |
import java.util.Comparator; |
10 |
> |
import java.util.Iterator; |
11 |
> |
import java.util.NavigableSet; |
12 |
> |
import java.util.SortedSet; |
13 |
> |
import java.util.concurrent.ConcurrentSkipListSet; |
14 |
|
|
15 |
|
public class ConcurrentSkipListSubSetTest extends JSR166TestCase { |
16 |
|
public static void main(String[] args) { |
27 |
|
} |
28 |
|
|
29 |
|
/** |
30 |
< |
* Create a set of given size containing consecutive |
30 |
> |
* Returns a new set of given size containing consecutive |
31 |
|
* Integers 0 ... n. |
32 |
|
*/ |
33 |
< |
private NavigableSet populatedSet(int n) { |
34 |
< |
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
33 |
> |
private NavigableSet<Integer> populatedSet(int n) { |
34 |
> |
ConcurrentSkipListSet<Integer> q = |
35 |
> |
new ConcurrentSkipListSet<Integer>(); |
36 |
|
assertTrue(q.isEmpty()); |
37 |
|
|
38 |
|
for (int i = n-1; i >= 0; i-=2) |
48 |
|
} |
49 |
|
|
50 |
|
/** |
51 |
< |
* Create set of first 5 ints |
51 |
> |
* Returns a new set of first 5 ints. |
52 |
|
*/ |
53 |
|
private NavigableSet set5() { |
54 |
|
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
66 |
|
} |
67 |
|
|
68 |
|
/** |
69 |
< |
* Create set of first 5 negative ints |
69 |
> |
* Returns a new set of first 5 negative ints. |
70 |
|
*/ |
71 |
|
private NavigableSet dset5() { |
72 |
|
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
100 |
|
assertEquals(0, set0().size()); |
101 |
|
} |
102 |
|
|
99 |
– |
|
103 |
|
/** |
104 |
|
* isEmpty is true before add, false after |
105 |
|
*/ |
170 |
|
} catch (ClassCastException success) {} |
171 |
|
} |
172 |
|
|
170 |
– |
|
173 |
|
/** |
174 |
|
* addAll(null) throws NPE |
175 |
|
*/ |
240 |
|
public void testRemoveElement() { |
241 |
|
NavigableSet q = populatedSet(SIZE); |
242 |
|
for (int i = 1; i < SIZE; i+=2) { |
243 |
< |
assertTrue(q.remove(new Integer(i))); |
243 |
> |
assertTrue(q.contains(i)); |
244 |
> |
assertTrue(q.remove(i)); |
245 |
> |
assertFalse(q.contains(i)); |
246 |
> |
assertTrue(q.contains(i-1)); |
247 |
|
} |
248 |
|
for (int i = 0; i < SIZE; i+=2) { |
249 |
< |
assertTrue(q.remove(new Integer(i))); |
250 |
< |
assertFalse(q.remove(new Integer(i+1))); |
249 |
> |
assertTrue(q.contains(i)); |
250 |
> |
assertTrue(q.remove(i)); |
251 |
> |
assertFalse(q.contains(i)); |
252 |
> |
assertFalse(q.remove(i+1)); |
253 |
> |
assertFalse(q.contains(i+1)); |
254 |
|
} |
255 |
|
assertTrue(q.isEmpty()); |
256 |
|
} |
330 |
|
} |
331 |
|
} |
332 |
|
|
325 |
– |
|
326 |
– |
|
333 |
|
/** |
334 |
|
* lower returns preceding element |
335 |
|
*/ |
403 |
|
} |
404 |
|
|
405 |
|
/** |
406 |
< |
* toArray contains all elements |
406 |
> |
* toArray contains all elements in sorted order |
407 |
|
*/ |
408 |
|
public void testToArray() { |
409 |
|
NavigableSet q = populatedSet(SIZE); |
410 |
|
Object[] o = q.toArray(); |
405 |
– |
Arrays.sort(o); |
411 |
|
for (int i = 0; i < o.length; i++) |
412 |
< |
assertEquals(o[i], q.pollFirst()); |
412 |
> |
assertSame(o[i], q.pollFirst()); |
413 |
|
} |
414 |
|
|
415 |
|
/** |
416 |
< |
* toArray(a) contains all elements |
416 |
> |
* toArray(a) contains all elements in sorted order |
417 |
|
*/ |
418 |
|
public void testToArray2() { |
419 |
< |
NavigableSet q = populatedSet(SIZE); |
419 |
> |
NavigableSet<Integer> q = populatedSet(SIZE); |
420 |
|
Integer[] ints = new Integer[SIZE]; |
421 |
< |
ints = (Integer[])q.toArray(ints); |
422 |
< |
Arrays.sort(ints); |
421 |
> |
Integer[] array = q.toArray(ints); |
422 |
> |
assertSame(ints, array); |
423 |
|
for (int i = 0; i < ints.length; i++) |
424 |
< |
assertEquals(ints[i], q.pollFirst()); |
424 |
> |
assertSame(ints[i], q.pollFirst()); |
425 |
|
} |
426 |
|
|
427 |
|
/** |
449 |
|
assertTrue(q.contains(it.next())); |
450 |
|
++i; |
451 |
|
} |
452 |
< |
assertEquals(i, 0); |
452 |
> |
assertEquals(0, i); |
453 |
|
} |
454 |
|
|
455 |
|
/** |
471 |
|
assertFalse(it.hasNext()); |
472 |
|
} |
473 |
|
|
469 |
– |
|
474 |
|
/** |
475 |
|
* toString contains toStrings of elements |
476 |
|
*/ |
478 |
|
NavigableSet q = populatedSet(SIZE); |
479 |
|
String s = q.toString(); |
480 |
|
for (int i = 0; i < SIZE; ++i) { |
481 |
< |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
481 |
> |
assertTrue(s.contains(String.valueOf(i))); |
482 |
|
} |
483 |
|
} |
484 |
|
|
486 |
|
* A deserialized serialized set has same elements |
487 |
|
*/ |
488 |
|
public void testSerialization() throws Exception { |
489 |
< |
NavigableSet q = populatedSet(SIZE); |
490 |
< |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
491 |
< |
ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout)); |
492 |
< |
out.writeObject(q); |
493 |
< |
out.close(); |
494 |
< |
|
495 |
< |
ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray()); |
496 |
< |
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); |
497 |
< |
NavigableSet r = (NavigableSet)in.readObject(); |
498 |
< |
assertEquals(q.size(), r.size()); |
499 |
< |
while (!q.isEmpty()) |
500 |
< |
assertEquals(q.pollFirst(), r.pollFirst()); |
489 |
> |
NavigableSet x = populatedSet(SIZE); |
490 |
> |
NavigableSet y = serialClone(x); |
491 |
> |
|
492 |
> |
assertNotSame(y, x); |
493 |
> |
assertEquals(x.size(), y.size()); |
494 |
> |
assertEquals(x, y); |
495 |
> |
assertEquals(y, x); |
496 |
> |
while (!x.isEmpty()) { |
497 |
> |
assertFalse(y.isEmpty()); |
498 |
> |
assertEquals(x.pollFirst(), y.pollFirst()); |
499 |
> |
} |
500 |
> |
assertTrue(y.isEmpty()); |
501 |
|
} |
502 |
|
|
503 |
|
/** |
675 |
|
} catch (ClassCastException success) {} |
676 |
|
} |
677 |
|
|
674 |
– |
|
678 |
|
/** |
679 |
|
* addAll(null) throws NPE |
680 |
|
*/ |
829 |
|
} |
830 |
|
} |
831 |
|
|
829 |
– |
|
830 |
– |
|
832 |
|
/** |
833 |
|
* lower returns preceding element |
834 |
|
*/ |
918 |
|
public void testDescendingToArray2() { |
919 |
|
NavigableSet q = populatedSet(SIZE); |
920 |
|
Integer[] ints = new Integer[SIZE]; |
921 |
< |
ints = (Integer[])q.toArray(ints); |
921 |
> |
assertSame(ints, q.toArray(ints)); |
922 |
|
Arrays.sort(ints); |
923 |
|
for (int i = 0; i < ints.length; i++) |
924 |
|
assertEquals(ints[i], q.pollFirst()); |
949 |
|
assertTrue(q.contains(it.next())); |
950 |
|
++i; |
951 |
|
} |
952 |
< |
assertEquals(i, 0); |
952 |
> |
assertEquals(0, i); |
953 |
|
} |
954 |
|
|
955 |
|
/** |
971 |
|
assertFalse(it.hasNext()); |
972 |
|
} |
973 |
|
|
973 |
– |
|
974 |
|
/** |
975 |
|
* toString contains toStrings of elements |
976 |
|
*/ |
978 |
|
NavigableSet q = populatedSet(SIZE); |
979 |
|
String s = q.toString(); |
980 |
|
for (int i = 0; i < SIZE; ++i) { |
981 |
< |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
981 |
> |
assertTrue(s.contains(String.valueOf(i))); |
982 |
|
} |
983 |
|
} |
984 |
|
|
986 |
|
* A deserialized serialized set has same elements |
987 |
|
*/ |
988 |
|
public void testDescendingSerialization() throws Exception { |
989 |
< |
NavigableSet q = populatedSet(SIZE); |
990 |
< |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
991 |
< |
ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout)); |
992 |
< |
out.writeObject(q); |
993 |
< |
out.close(); |
994 |
< |
|
995 |
< |
ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray()); |
996 |
< |
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); |
997 |
< |
NavigableSet r = (NavigableSet)in.readObject(); |
998 |
< |
assertEquals(q.size(), r.size()); |
999 |
< |
while (!q.isEmpty()) |
1000 |
< |
assertEquals(q.pollFirst(), r.pollFirst()); |
989 |
> |
NavigableSet x = dset5(); |
990 |
> |
NavigableSet y = serialClone(x); |
991 |
> |
|
992 |
> |
assertNotSame(y, x); |
993 |
> |
assertEquals(x.size(), y.size()); |
994 |
> |
assertEquals(x, y); |
995 |
> |
assertEquals(y, x); |
996 |
> |
while (!x.isEmpty()) { |
997 |
> |
assertFalse(y.isEmpty()); |
998 |
> |
assertEquals(x.pollFirst(), y.pollFirst()); |
999 |
> |
} |
1000 |
> |
assertTrue(y.isEmpty()); |
1001 |
|
} |
1002 |
|
|
1003 |
|
/** |