32 |
|
} |
33 |
|
|
34 |
|
/** |
35 |
< |
* Create a set of given size containing consecutive |
35 |
> |
* Returns a new set of given size containing consecutive |
36 |
|
* Integers 0 ... n. |
37 |
|
*/ |
38 |
|
private NavigableSet<Integer> populatedSet(int n) { |
53 |
|
} |
54 |
|
|
55 |
|
/** |
56 |
< |
* Create set of first 5 ints |
56 |
> |
* Returns a new set of first 5 ints. |
57 |
|
*/ |
58 |
|
private NavigableSet set5() { |
59 |
|
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
71 |
|
} |
72 |
|
|
73 |
|
/** |
74 |
< |
* Create set of first 5 negative ints |
74 |
> |
* Returns a new set of first 5 negative ints. |
75 |
|
*/ |
76 |
|
private NavigableSet dset5() { |
77 |
|
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
454 |
|
assertTrue(q.contains(it.next())); |
455 |
|
++i; |
456 |
|
} |
457 |
< |
assertEquals(i, 0); |
457 |
> |
assertEquals(0, i); |
458 |
|
} |
459 |
|
|
460 |
|
/** |
494 |
|
NavigableSet x = populatedSet(SIZE); |
495 |
|
NavigableSet y = serialClone(x); |
496 |
|
|
497 |
< |
assertTrue(x != y); |
497 |
> |
assertNotSame(y, x); |
498 |
|
assertEquals(x.size(), y.size()); |
499 |
|
assertEquals(x, y); |
500 |
|
assertEquals(y, x); |
954 |
|
assertTrue(q.contains(it.next())); |
955 |
|
++i; |
956 |
|
} |
957 |
< |
assertEquals(i, 0); |
957 |
> |
assertEquals(0, i); |
958 |
|
} |
959 |
|
|
960 |
|
/** |
994 |
|
NavigableSet x = dset5(); |
995 |
|
NavigableSet y = serialClone(x); |
996 |
|
|
997 |
< |
assertTrue(x != y); |
997 |
> |
assertNotSame(y, x); |
998 |
|
assertEquals(x.size(), y.size()); |
999 |
|
assertEquals(x, y); |
1000 |
|
assertEquals(y, x); |