203 |
|
shouldThrow(); |
204 |
|
} catch (NullPointerException success) {} |
205 |
|
} |
206 |
+ |
|
207 |
|
/** |
208 |
|
* addAll of a collection with null elements throws NPE |
209 |
|
*/ |
215 |
|
shouldThrow(); |
216 |
|
} catch (NullPointerException success) {} |
217 |
|
} |
218 |
+ |
|
219 |
|
/** |
220 |
|
* addAll of a collection with any null elements throws NPE after |
221 |
|
* possibly adding some elements |
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; |