37 |
|
static final int SIZE = 20; |
38 |
|
|
39 |
|
/** |
40 |
< |
* Create a set of given size containing consecutive |
40 |
> |
* Returns a new set of given size containing consecutive |
41 |
|
* Integers 0 ... n. |
42 |
|
*/ |
43 |
|
private TreeSet<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 TreeSet set5() { |
59 |
|
TreeSet q = new TreeSet(); |
496 |
|
assertTrue(q.contains(it.next())); |
497 |
|
++i; |
498 |
|
} |
499 |
< |
assertEquals(i, 0); |
499 |
> |
assertEquals(0, i); |
500 |
|
} |
501 |
|
|
502 |
|
/** |
536 |
|
NavigableSet x = populatedSet(SIZE); |
537 |
|
NavigableSet y = serialClone(x); |
538 |
|
|
539 |
< |
assertTrue(x != y); |
539 |
> |
assertNotSame(x, y); |
540 |
|
assertEquals(x.size(), y.size()); |
541 |
|
assertEquals(x, y); |
542 |
|
assertEquals(y, x); |
691 |
|
0, setSize - 1, true); |
692 |
|
} |
693 |
|
|
694 |
+ |
/** |
695 |
+ |
* addAll is idempotent |
696 |
+ |
*/ |
697 |
+ |
public void testAddAll_idempotent() throws Exception { |
698 |
+ |
Set x = populatedSet(SIZE); |
699 |
+ |
Set y = new TreeSet(x); |
700 |
+ |
y.addAll(x); |
701 |
+ |
assertEquals(x, y); |
702 |
+ |
assertEquals(y, x); |
703 |
+ |
} |
704 |
+ |
|
705 |
|
static NavigableSet<Integer> newSet(Class cl) throws Exception { |
706 |
|
NavigableSet<Integer> result = (NavigableSet<Integer>) cl.newInstance(); |
707 |
< |
assertEquals(result.size(), 0); |
707 |
> |
assertEquals(0, result.size()); |
708 |
|
assertFalse(result.iterator().hasNext()); |
709 |
|
return result; |
710 |
|
} |
935 |
|
if (bsContainsI) |
936 |
|
size++; |
937 |
|
} |
938 |
< |
assertEquals(set.size(), size); |
938 |
> |
assertEquals(size, set.size()); |
939 |
|
|
940 |
|
// Test contents using contains elementSet iterator |
941 |
|
int size2 = 0; |