37 |
|
static final int SIZE = 20; |
38 |
|
|
39 |
|
/** |
40 |
< |
* Create a set of given size containing consecutive |
40 |
> |
* Creates a 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 |
> |
* Creates set of first 5 ints. |
57 |
|
*/ |
58 |
|
private TreeSet set5() { |
59 |
|
TreeSet q = new TreeSet(); |
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; |