132 |
|
* add(null) throws NPE |
133 |
|
*/ |
134 |
|
public void testAddNull() { |
135 |
+ |
NavigableSet q = set0(); |
136 |
|
try { |
136 |
– |
NavigableSet q = set0(); |
137 |
|
q.add(null); |
138 |
|
shouldThrow(); |
139 |
|
} catch (NullPointerException success) {} |
160 |
|
* Add of non-Comparable throws CCE |
161 |
|
*/ |
162 |
|
public void testAddNonComparable() { |
163 |
+ |
NavigableSet q = set0(); |
164 |
|
try { |
164 |
– |
NavigableSet q = set0(); |
165 |
– |
q.add(new Object()); |
165 |
|
q.add(new Object()); |
166 |
|
q.add(new Object()); |
167 |
|
shouldThrow(); |
172 |
|
* addAll(null) throws NPE |
173 |
|
*/ |
174 |
|
public void testAddAll1() { |
175 |
+ |
NavigableSet q = set0(); |
176 |
|
try { |
177 |
– |
NavigableSet q = set0(); |
177 |
|
q.addAll(null); |
178 |
|
shouldThrow(); |
179 |
|
} catch (NullPointerException success) {} |
183 |
|
* addAll of a collection with null elements throws NPE |
184 |
|
*/ |
185 |
|
public void testAddAll2() { |
186 |
+ |
NavigableSet q = set0(); |
187 |
+ |
Integer[] ints = new Integer[SIZE]; |
188 |
|
try { |
188 |
– |
NavigableSet q = set0(); |
189 |
– |
Integer[] ints = new Integer[SIZE]; |
189 |
|
q.addAll(Arrays.asList(ints)); |
190 |
|
shouldThrow(); |
191 |
|
} catch (NullPointerException success) {} |
196 |
|
* possibly adding some elements |
197 |
|
*/ |
198 |
|
public void testAddAll3() { |
199 |
+ |
NavigableSet q = set0(); |
200 |
+ |
Integer[] ints = new Integer[SIZE]; |
201 |
+ |
for (int i = 0; i < SIZE-1; ++i) |
202 |
+ |
ints[i] = new Integer(i+SIZE); |
203 |
|
try { |
201 |
– |
NavigableSet q = set0(); |
202 |
– |
Integer[] ints = new Integer[SIZE]; |
203 |
– |
for (int i = 0; i < SIZE-1; ++i) |
204 |
– |
ints[i] = new Integer(i+SIZE); |
204 |
|
q.addAll(Arrays.asList(ints)); |
205 |
|
shouldThrow(); |
206 |
|
} catch (NullPointerException success) {} |
645 |
|
* Add of non-Comparable throws CCE |
646 |
|
*/ |
647 |
|
public void testDescendingAddNonComparable() { |
648 |
+ |
NavigableSet q = dset0(); |
649 |
|
try { |
650 |
– |
NavigableSet q = dset0(); |
651 |
– |
q.add(new Object()); |
650 |
|
q.add(new Object()); |
651 |
|
q.add(new Object()); |
652 |
|
shouldThrow(); |
657 |
|
* addAll(null) throws NPE |
658 |
|
*/ |
659 |
|
public void testDescendingAddAll1() { |
660 |
+ |
NavigableSet q = dset0(); |
661 |
|
try { |
663 |
– |
NavigableSet q = dset0(); |
662 |
|
q.addAll(null); |
663 |
|
shouldThrow(); |
664 |
|
} catch (NullPointerException success) {} |
668 |
|
* addAll of a collection with null elements throws NPE |
669 |
|
*/ |
670 |
|
public void testDescendingAddAll2() { |
671 |
+ |
NavigableSet q = dset0(); |
672 |
+ |
Integer[] ints = new Integer[SIZE]; |
673 |
|
try { |
674 |
– |
NavigableSet q = dset0(); |
675 |
– |
Integer[] ints = new Integer[SIZE]; |
674 |
|
q.addAll(Arrays.asList(ints)); |
675 |
|
shouldThrow(); |
676 |
|
} catch (NullPointerException success) {} |
681 |
|
* possibly adding some elements |
682 |
|
*/ |
683 |
|
public void testDescendingAddAll3() { |
684 |
+ |
NavigableSet q = dset0(); |
685 |
+ |
Integer[] ints = new Integer[SIZE]; |
686 |
+ |
for (int i = 0; i < SIZE-1; ++i) |
687 |
+ |
ints[i] = new Integer(i+SIZE); |
688 |
|
try { |
687 |
– |
NavigableSet q = dset0(); |
688 |
– |
Integer[] ints = new Integer[SIZE]; |
689 |
– |
for (int i = 0; i < SIZE-1; ++i) |
690 |
– |
ints[i] = new Integer(i+SIZE); |
689 |
|
q.addAll(Arrays.asList(ints)); |
690 |
|
shouldThrow(); |
691 |
|
} catch (NullPointerException success) {} |