27 |
|
} |
28 |
|
|
29 |
|
/** |
30 |
< |
* Create a set of given size containing consecutive |
30 |
> |
* Creates a set of given size containing consecutive |
31 |
|
* Integers 0 ... n. |
32 |
|
*/ |
33 |
|
private NavigableSet<Integer> populatedSet(int n) { |
47 |
|
} |
48 |
|
|
49 |
|
/** |
50 |
< |
* Create set of first 5 ints |
50 |
> |
* Creates set of first 5 ints. |
51 |
|
*/ |
52 |
|
private NavigableSet set5() { |
53 |
|
TreeSet q = new TreeSet(); |
445 |
|
assertTrue(q.contains(it.next())); |
446 |
|
++i; |
447 |
|
} |
448 |
< |
assertEquals(i, 0); |
448 |
> |
assertEquals(0, i); |
449 |
|
} |
450 |
|
|
451 |
|
/** |
462 |
|
it.remove(); |
463 |
|
|
464 |
|
it = q.iterator(); |
465 |
< |
assertEquals(it.next(), 2); |
466 |
< |
assertEquals(it.next(), 3); |
465 |
> |
assertEquals(2, it.next()); |
466 |
> |
assertEquals(3, it.next()); |
467 |
|
assertFalse(it.hasNext()); |
468 |
|
} |
469 |
|
|
934 |
|
assertTrue(q.contains(it.next())); |
935 |
|
++i; |
936 |
|
} |
937 |
< |
assertEquals(i, 0); |
937 |
> |
assertEquals(0, i); |
938 |
|
} |
939 |
|
|
940 |
|
/** |
951 |
|
it.remove(); |
952 |
|
|
953 |
|
it = q.iterator(); |
954 |
< |
assertEquals(it.next(), 2); |
955 |
< |
assertEquals(it.next(), 3); |
954 |
> |
assertEquals(2, it.next()); |
955 |
> |
assertEquals(3, it.next()); |
956 |
|
assertFalse(it.hasNext()); |
957 |
|
} |
958 |
|
|