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 |
|
/** |
693 |
|
|
694 |
|
static NavigableSet<Integer> newSet(Class cl) throws Exception { |
695 |
|
NavigableSet<Integer> result = (NavigableSet<Integer>) cl.newInstance(); |
696 |
< |
assertEquals(result.size(), 0); |
696 |
> |
assertEquals(0, result.size()); |
697 |
|
assertFalse(result.iterator().hasNext()); |
698 |
|
return result; |
699 |
|
} |
924 |
|
if (bsContainsI) |
925 |
|
size++; |
926 |
|
} |
927 |
< |
assertEquals(set.size(), size); |
927 |
> |
assertEquals(size, set.size()); |
928 |
|
|
929 |
|
// Test contents using contains elementSet iterator |
930 |
|
int size2 = 0; |