27 |
|
* Create a set of given size containing consecutive |
28 |
|
* Integers 0 ... n. |
29 |
|
*/ |
30 |
< |
private ConcurrentSkipListSet populatedSet(int n) { |
31 |
< |
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
30 |
> |
private ConcurrentSkipListSet<Integer> populatedSet(int n) { |
31 |
> |
ConcurrentSkipListSet<Integer> q = |
32 |
> |
new ConcurrentSkipListSet<Integer>(); |
33 |
|
assertTrue(q.isEmpty()); |
34 |
|
for (int i = n-1; i >= 0; i-=2) |
35 |
|
assertTrue(q.add(new Integer(i))); |
435 |
|
} |
436 |
|
|
437 |
|
/** |
438 |
< |
* toArray contains all elements |
438 |
> |
* toArray contains all elements in sorted order |
439 |
|
*/ |
440 |
|
public void testToArray() { |
441 |
|
ConcurrentSkipListSet q = populatedSet(SIZE); |
442 |
|
Object[] o = q.toArray(); |
442 |
– |
Arrays.sort(o); |
443 |
|
for (int i = 0; i < o.length; i++) |
444 |
< |
assertEquals(o[i], q.pollFirst()); |
444 |
> |
assertSame(o[i], q.pollFirst()); |
445 |
|
} |
446 |
|
|
447 |
|
/** |
448 |
< |
* toArray(a) contains all elements |
448 |
> |
* toArray(a) contains all elements in sorted order |
449 |
|
*/ |
450 |
|
public void testToArray2() { |
451 |
< |
ConcurrentSkipListSet q = populatedSet(SIZE); |
451 |
> |
ConcurrentSkipListSet<Integer> q = populatedSet(SIZE); |
452 |
|
Integer[] ints = new Integer[SIZE]; |
453 |
< |
ints = (Integer[])q.toArray(ints); |
454 |
< |
Arrays.sort(ints); |
453 |
> |
Integer[] array = q.toArray(ints); |
454 |
> |
assertSame(ints, array); |
455 |
|
for (int i = 0; i < ints.length; i++) |
456 |
< |
assertEquals(ints[i], q.pollFirst()); |
456 |
> |
assertSame(ints[i], q.pollFirst()); |
457 |
|
} |
458 |
|
|
459 |
|
/** |
659 |
|
* Subsets of subsets subdivide correctly |
660 |
|
*/ |
661 |
|
public void testRecursiveSubSets() throws Exception { |
662 |
< |
int setSize = 1000; |
662 |
> |
int setSize = expensiveTests ? 1000 : 100; |
663 |
|
Class cl = ConcurrentSkipListSet.class; |
664 |
|
|
665 |
|
NavigableSet<Integer> set = newSet(cl); |
875 |
|
// BitSet should support this! Test would run much faster |
876 |
|
while (element >= min) { |
877 |
|
if (bs.get(element)) |
878 |
< |
return(element); |
878 |
> |
return element; |
879 |
|
element--; |
880 |
|
} |
881 |
|
return -1; |