1 |
|
/* |
2 |
|
* Written by Doug Lea with assistance from members of JCP JSR-166 |
3 |
|
* Expert Group and released to the public domain, as explained at |
4 |
< |
* http://creativecommons.org/licenses/publicdomain |
4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
* Other contributors include Andrew Wright, Jeffrey Hayes, |
6 |
|
* Pat Fisher, Mike Judd. |
7 |
|
*/ |
8 |
|
|
9 |
+ |
import java.util.AbstractQueue; |
10 |
+ |
import java.util.Arrays; |
11 |
+ |
import java.util.Iterator; |
12 |
+ |
import java.util.NoSuchElementException; |
13 |
|
|
14 |
< |
import junit.framework.*; |
15 |
< |
import java.util.*; |
12 |
< |
import java.util.concurrent.*; |
13 |
< |
import java.util.concurrent.locks.*; |
14 |
< |
import java.io.*; |
14 |
> |
import junit.framework.Test; |
15 |
> |
import junit.framework.TestSuite; |
16 |
|
|
17 |
|
public class AbstractQueueTest extends JSR166TestCase { |
18 |
|
public static void main(String[] args) { |
93 |
|
} catch (NoSuchElementException success) {} |
94 |
|
} |
95 |
|
|
95 |
– |
|
96 |
|
/** |
97 |
|
* element returns normally if peek succeeds |
98 |
|
*/ |
113 |
|
} |
114 |
|
|
115 |
|
/** |
116 |
< |
* addAll(null) throws NPE |
116 |
> |
* addAll(null) throws NPE |
117 |
|
*/ |
118 |
|
public void testAddAll1() { |
119 |
+ |
Succeed q = new Succeed(); |
120 |
|
try { |
120 |
– |
Succeed q = new Succeed(); |
121 |
|
q.addAll(null); |
122 |
|
shouldThrow(); |
123 |
|
} catch (NullPointerException success) {} |
127 |
|
* addAll(this) throws IAE |
128 |
|
*/ |
129 |
|
public void testAddAllSelf() { |
130 |
+ |
Succeed q = new Succeed(); |
131 |
|
try { |
131 |
– |
Succeed q = new Succeed(); |
132 |
|
q.addAll(q); |
133 |
|
shouldThrow(); |
134 |
|
} catch (IllegalArgumentException success) {} |
135 |
|
} |
136 |
|
|
137 |
– |
|
137 |
|
/** |
138 |
< |
* addAll of a collection with null elements throws NPE |
138 |
> |
* addAll of a collection with null elements throws NPE |
139 |
|
*/ |
140 |
|
public void testAddAll2() { |
141 |
+ |
Succeed q = new Succeed(); |
142 |
+ |
Integer[] ints = new Integer[SIZE]; |
143 |
|
try { |
143 |
– |
Succeed q = new Succeed(); |
144 |
– |
Integer[] ints = new Integer[SIZE]; |
144 |
|
q.addAll(Arrays.asList(ints)); |
145 |
|
shouldThrow(); |
146 |
|
} catch (NullPointerException success) {} |
151 |
|
* possibly adding some elements |
152 |
|
*/ |
153 |
|
public void testAddAll3() { |
154 |
+ |
Succeed q = new Succeed(); |
155 |
+ |
Integer[] ints = new Integer[SIZE]; |
156 |
+ |
for (int i = 0; i < SIZE-1; ++i) |
157 |
+ |
ints[i] = new Integer(i); |
158 |
|
try { |
156 |
– |
Succeed q = new Succeed(); |
157 |
– |
Integer[] ints = new Integer[SIZE]; |
158 |
– |
for (int i = 0; i < SIZE-1; ++i) |
159 |
– |
ints[i] = new Integer(i); |
159 |
|
q.addAll(Arrays.asList(ints)); |
160 |
|
shouldThrow(); |
161 |
|
} catch (NullPointerException success) {} |
165 |
|
* addAll throws ISE if an add fails |
166 |
|
*/ |
167 |
|
public void testAddAll4() { |
168 |
+ |
Fail q = new Fail(); |
169 |
+ |
Integer[] ints = new Integer[SIZE]; |
170 |
+ |
for (int i = 0; i < SIZE; ++i) |
171 |
+ |
ints[i] = new Integer(i); |
172 |
|
try { |
170 |
– |
Fail q = new Fail(); |
171 |
– |
Integer[] ints = new Integer[SIZE]; |
172 |
– |
for (int i = 0; i < SIZE; ++i) |
173 |
– |
ints[i] = new Integer(i); |
173 |
|
q.addAll(Arrays.asList(ints)); |
174 |
|
shouldThrow(); |
175 |
|
} catch (IllegalStateException success) {} |