1 |
dl |
1.1 |
/* |
2 |
dl |
1.7 |
* 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 |
5 |
jsr166 |
1.12 |
* Other contributors include Andrew Wright, Jeffrey Hayes, |
6 |
|
|
* Pat Fisher, Mike Judd. |
7 |
dl |
1.1 |
*/ |
8 |
|
|
|
9 |
dl |
1.4 |
|
10 |
dl |
1.1 |
import junit.framework.*; |
11 |
|
|
import java.util.*; |
12 |
|
|
import java.util.concurrent.*; |
13 |
jsr166 |
1.16 |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
14 |
dl |
1.2 |
import java.io.*; |
15 |
dl |
1.1 |
|
16 |
dl |
1.3 |
public class ArrayBlockingQueueTest extends JSR166TestCase { |
17 |
dl |
1.1 |
public static void main(String[] args) { |
18 |
jsr166 |
1.15 |
junit.textui.TestRunner.run (suite()); |
19 |
dl |
1.1 |
} |
20 |
|
|
public static Test suite() { |
21 |
jsr166 |
1.15 |
return new TestSuite(ArrayBlockingQueueTest.class); |
22 |
dl |
1.1 |
} |
23 |
|
|
|
24 |
|
|
/** |
25 |
|
|
* Create a queue of given size containing consecutive |
26 |
|
|
* Integers 0 ... n. |
27 |
|
|
*/ |
28 |
dl |
1.3 |
private ArrayBlockingQueue populatedQueue(int n) { |
29 |
dl |
1.1 |
ArrayBlockingQueue q = new ArrayBlockingQueue(n); |
30 |
|
|
assertTrue(q.isEmpty()); |
31 |
jsr166 |
1.15 |
for (int i = 0; i < n; i++) |
32 |
|
|
assertTrue(q.offer(new Integer(i))); |
33 |
dl |
1.1 |
assertFalse(q.isEmpty()); |
34 |
|
|
assertEquals(0, q.remainingCapacity()); |
35 |
jsr166 |
1.15 |
assertEquals(n, q.size()); |
36 |
dl |
1.1 |
return q; |
37 |
|
|
} |
38 |
jsr166 |
1.12 |
|
39 |
dl |
1.4 |
/** |
40 |
dl |
1.5 |
* A new queue has the indicated capacity |
41 |
dl |
1.4 |
*/ |
42 |
|
|
public void testConstructor1() { |
43 |
dl |
1.3 |
assertEquals(SIZE, new ArrayBlockingQueue(SIZE).remainingCapacity()); |
44 |
dl |
1.1 |
} |
45 |
|
|
|
46 |
dl |
1.4 |
/** |
47 |
jsr166 |
1.18 |
* Constructor throws IAE if capacity argument nonpositive |
48 |
dl |
1.4 |
*/ |
49 |
|
|
public void testConstructor2() { |
50 |
dl |
1.1 |
try { |
51 |
|
|
ArrayBlockingQueue q = new ArrayBlockingQueue(0); |
52 |
dl |
1.4 |
shouldThrow(); |
53 |
jsr166 |
1.17 |
} catch (IllegalArgumentException success) {} |
54 |
dl |
1.1 |
} |
55 |
|
|
|
56 |
dl |
1.4 |
/** |
57 |
dl |
1.5 |
* Initializing from null Collection throws NPE |
58 |
dl |
1.4 |
*/ |
59 |
|
|
public void testConstructor3() { |
60 |
dl |
1.1 |
try { |
61 |
|
|
ArrayBlockingQueue q = new ArrayBlockingQueue(1, true, null); |
62 |
dl |
1.4 |
shouldThrow(); |
63 |
jsr166 |
1.17 |
} catch (NullPointerException success) {} |
64 |
dl |
1.1 |
} |
65 |
|
|
|
66 |
dl |
1.4 |
/** |
67 |
dl |
1.5 |
* Initializing from Collection of null elements throws NPE |
68 |
dl |
1.4 |
*/ |
69 |
|
|
public void testConstructor4() { |
70 |
dl |
1.1 |
try { |
71 |
dl |
1.3 |
Integer[] ints = new Integer[SIZE]; |
72 |
|
|
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints)); |
73 |
dl |
1.4 |
shouldThrow(); |
74 |
jsr166 |
1.17 |
} catch (NullPointerException success) {} |
75 |
dl |
1.1 |
} |
76 |
|
|
|
77 |
dl |
1.4 |
/** |
78 |
dl |
1.5 |
* Initializing from Collection with some null elements throws NPE |
79 |
dl |
1.4 |
*/ |
80 |
|
|
public void testConstructor5() { |
81 |
dl |
1.1 |
try { |
82 |
dl |
1.3 |
Integer[] ints = new Integer[SIZE]; |
83 |
|
|
for (int i = 0; i < SIZE-1; ++i) |
84 |
dl |
1.1 |
ints[i] = new Integer(i); |
85 |
dl |
1.3 |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints)); |
86 |
dl |
1.4 |
shouldThrow(); |
87 |
jsr166 |
1.17 |
} catch (NullPointerException success) {} |
88 |
dl |
1.1 |
} |
89 |
|
|
|
90 |
dl |
1.4 |
/** |
91 |
dl |
1.5 |
* Initializing from too large collection throws IAE |
92 |
dl |
1.4 |
*/ |
93 |
|
|
public void testConstructor6() { |
94 |
dl |
1.1 |
try { |
95 |
dl |
1.3 |
Integer[] ints = new Integer[SIZE]; |
96 |
|
|
for (int i = 0; i < SIZE; ++i) |
97 |
dl |
1.1 |
ints[i] = new Integer(i); |
98 |
|
|
ArrayBlockingQueue q = new ArrayBlockingQueue(1, false, Arrays.asList(ints)); |
99 |
dl |
1.4 |
shouldThrow(); |
100 |
jsr166 |
1.17 |
} catch (IllegalArgumentException success) {} |
101 |
dl |
1.1 |
} |
102 |
|
|
|
103 |
dl |
1.4 |
/** |
104 |
dl |
1.5 |
* Queue contains all elements of collection used to initialize |
105 |
dl |
1.4 |
*/ |
106 |
|
|
public void testConstructor7() { |
107 |
jsr166 |
1.19 |
Integer[] ints = new Integer[SIZE]; |
108 |
|
|
for (int i = 0; i < SIZE; ++i) |
109 |
|
|
ints[i] = new Integer(i); |
110 |
|
|
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, true, Arrays.asList(ints)); |
111 |
|
|
for (int i = 0; i < SIZE; ++i) |
112 |
|
|
assertEquals(ints[i], q.poll()); |
113 |
dl |
1.1 |
} |
114 |
|
|
|
115 |
dl |
1.4 |
/** |
116 |
dl |
1.5 |
* Queue transitions from empty to full when elements added |
117 |
dl |
1.4 |
*/ |
118 |
dl |
1.1 |
public void testEmptyFull() { |
119 |
|
|
ArrayBlockingQueue q = new ArrayBlockingQueue(2); |
120 |
|
|
assertTrue(q.isEmpty()); |
121 |
dl |
1.4 |
assertEquals(2, q.remainingCapacity()); |
122 |
dl |
1.3 |
q.add(one); |
123 |
dl |
1.1 |
assertFalse(q.isEmpty()); |
124 |
dl |
1.3 |
q.add(two); |
125 |
dl |
1.1 |
assertFalse(q.isEmpty()); |
126 |
dl |
1.4 |
assertEquals(0, q.remainingCapacity()); |
127 |
|
|
assertFalse(q.offer(three)); |
128 |
dl |
1.1 |
} |
129 |
|
|
|
130 |
dl |
1.4 |
/** |
131 |
dl |
1.5 |
* remainingCapacity decreases on add, increases on remove |
132 |
dl |
1.4 |
*/ |
133 |
|
|
public void testRemainingCapacity() { |
134 |
dl |
1.3 |
ArrayBlockingQueue q = populatedQueue(SIZE); |
135 |
|
|
for (int i = 0; i < SIZE; ++i) { |
136 |
dl |
1.1 |
assertEquals(i, q.remainingCapacity()); |
137 |
dl |
1.3 |
assertEquals(SIZE-i, q.size()); |
138 |
dl |
1.1 |
q.remove(); |
139 |
|
|
} |
140 |
dl |
1.3 |
for (int i = 0; i < SIZE; ++i) { |
141 |
|
|
assertEquals(SIZE-i, q.remainingCapacity()); |
142 |
dl |
1.1 |
assertEquals(i, q.size()); |
143 |
|
|
q.add(new Integer(i)); |
144 |
|
|
} |
145 |
|
|
} |
146 |
|
|
|
147 |
dl |
1.4 |
/** |
148 |
dl |
1.5 |
* offer(null) throws NPE |
149 |
dl |
1.4 |
*/ |
150 |
|
|
public void testOfferNull() { |
151 |
jsr166 |
1.15 |
try { |
152 |
dl |
1.1 |
ArrayBlockingQueue q = new ArrayBlockingQueue(1); |
153 |
|
|
q.offer(null); |
154 |
dl |
1.4 |
shouldThrow(); |
155 |
jsr166 |
1.17 |
} catch (NullPointerException success) {} |
156 |
dl |
1.1 |
} |
157 |
|
|
|
158 |
dl |
1.4 |
/** |
159 |
dl |
1.6 |
* add(null) throws NPE |
160 |
|
|
*/ |
161 |
|
|
public void testAddNull() { |
162 |
jsr166 |
1.15 |
try { |
163 |
dl |
1.6 |
ArrayBlockingQueue q = new ArrayBlockingQueue(1); |
164 |
|
|
q.add(null); |
165 |
|
|
shouldThrow(); |
166 |
jsr166 |
1.17 |
} catch (NullPointerException success) {} |
167 |
dl |
1.6 |
} |
168 |
|
|
|
169 |
|
|
/** |
170 |
dl |
1.5 |
* Offer succeeds if not full; fails if full |
171 |
dl |
1.4 |
*/ |
172 |
|
|
public void testOffer() { |
173 |
dl |
1.1 |
ArrayBlockingQueue q = new ArrayBlockingQueue(1); |
174 |
dl |
1.3 |
assertTrue(q.offer(zero)); |
175 |
|
|
assertFalse(q.offer(one)); |
176 |
dl |
1.1 |
} |
177 |
|
|
|
178 |
dl |
1.4 |
/** |
179 |
dl |
1.5 |
* add succeeds if not full; throws ISE if full |
180 |
dl |
1.4 |
*/ |
181 |
|
|
public void testAdd() { |
182 |
jsr166 |
1.15 |
try { |
183 |
dl |
1.3 |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
184 |
|
|
for (int i = 0; i < SIZE; ++i) { |
185 |
dl |
1.1 |
assertTrue(q.add(new Integer(i))); |
186 |
|
|
} |
187 |
|
|
assertEquals(0, q.remainingCapacity()); |
188 |
dl |
1.3 |
q.add(new Integer(SIZE)); |
189 |
jsr166 |
1.17 |
shouldThrow(); |
190 |
|
|
} catch (IllegalStateException success) {} |
191 |
dl |
1.1 |
} |
192 |
|
|
|
193 |
dl |
1.4 |
/** |
194 |
dl |
1.5 |
* addAll(null) throws NPE |
195 |
dl |
1.4 |
*/ |
196 |
|
|
public void testAddAll1() { |
197 |
dl |
1.1 |
try { |
198 |
|
|
ArrayBlockingQueue q = new ArrayBlockingQueue(1); |
199 |
|
|
q.addAll(null); |
200 |
dl |
1.4 |
shouldThrow(); |
201 |
jsr166 |
1.17 |
} catch (NullPointerException success) {} |
202 |
dl |
1.1 |
} |
203 |
dl |
1.6 |
|
204 |
|
|
/** |
205 |
|
|
* addAll(this) throws IAE |
206 |
|
|
*/ |
207 |
|
|
public void testAddAllSelf() { |
208 |
|
|
try { |
209 |
|
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
210 |
|
|
q.addAll(q); |
211 |
|
|
shouldThrow(); |
212 |
jsr166 |
1.17 |
} catch (IllegalArgumentException success) {} |
213 |
dl |
1.6 |
} |
214 |
|
|
|
215 |
|
|
|
216 |
dl |
1.4 |
/** |
217 |
dl |
1.5 |
* addAll of a collection with null elements throws NPE |
218 |
dl |
1.4 |
*/ |
219 |
|
|
public void testAddAll2() { |
220 |
dl |
1.1 |
try { |
221 |
dl |
1.3 |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
222 |
|
|
Integer[] ints = new Integer[SIZE]; |
223 |
dl |
1.1 |
q.addAll(Arrays.asList(ints)); |
224 |
dl |
1.4 |
shouldThrow(); |
225 |
jsr166 |
1.17 |
} catch (NullPointerException success) {} |
226 |
dl |
1.1 |
} |
227 |
dl |
1.4 |
/** |
228 |
dl |
1.5 |
* addAll of a collection with any null elements throws NPE after |
229 |
|
|
* possibly adding some elements |
230 |
dl |
1.4 |
*/ |
231 |
|
|
public void testAddAll3() { |
232 |
dl |
1.1 |
try { |
233 |
dl |
1.3 |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
234 |
|
|
Integer[] ints = new Integer[SIZE]; |
235 |
|
|
for (int i = 0; i < SIZE-1; ++i) |
236 |
dl |
1.1 |
ints[i] = new Integer(i); |
237 |
|
|
q.addAll(Arrays.asList(ints)); |
238 |
dl |
1.4 |
shouldThrow(); |
239 |
jsr166 |
1.17 |
} catch (NullPointerException success) {} |
240 |
dl |
1.1 |
} |
241 |
dl |
1.4 |
/** |
242 |
dl |
1.5 |
* addAll throws ISE if not enough room |
243 |
dl |
1.4 |
*/ |
244 |
|
|
public void testAddAll4() { |
245 |
dl |
1.1 |
try { |
246 |
|
|
ArrayBlockingQueue q = new ArrayBlockingQueue(1); |
247 |
dl |
1.3 |
Integer[] ints = new Integer[SIZE]; |
248 |
|
|
for (int i = 0; i < SIZE; ++i) |
249 |
dl |
1.1 |
ints[i] = new Integer(i); |
250 |
|
|
q.addAll(Arrays.asList(ints)); |
251 |
dl |
1.4 |
shouldThrow(); |
252 |
jsr166 |
1.17 |
} catch (IllegalStateException success) {} |
253 |
dl |
1.1 |
} |
254 |
dl |
1.4 |
/** |
255 |
dl |
1.5 |
* Queue contains all elements, in traversal order, of successful addAll |
256 |
dl |
1.4 |
*/ |
257 |
|
|
public void testAddAll5() { |
258 |
jsr166 |
1.17 |
Integer[] empty = new Integer[0]; |
259 |
|
|
Integer[] ints = new Integer[SIZE]; |
260 |
|
|
for (int i = 0; i < SIZE; ++i) |
261 |
|
|
ints[i] = new Integer(i); |
262 |
|
|
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
263 |
|
|
assertFalse(q.addAll(Arrays.asList(empty))); |
264 |
|
|
assertTrue(q.addAll(Arrays.asList(ints))); |
265 |
|
|
for (int i = 0; i < SIZE; ++i) |
266 |
|
|
assertEquals(ints[i], q.poll()); |
267 |
dl |
1.1 |
} |
268 |
|
|
|
269 |
dl |
1.4 |
/** |
270 |
dl |
1.5 |
* put(null) throws NPE |
271 |
dl |
1.4 |
*/ |
272 |
jsr166 |
1.17 |
public void testPutNull() throws InterruptedException { |
273 |
jsr166 |
1.15 |
try { |
274 |
dl |
1.3 |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
275 |
dl |
1.1 |
q.put(null); |
276 |
dl |
1.4 |
shouldThrow(); |
277 |
jsr166 |
1.17 |
} catch (NullPointerException success) {} |
278 |
dl |
1.1 |
} |
279 |
|
|
|
280 |
dl |
1.4 |
/** |
281 |
dl |
1.5 |
* all elements successfully put are contained |
282 |
dl |
1.4 |
*/ |
283 |
jsr166 |
1.17 |
public void testPut() throws InterruptedException { |
284 |
|
|
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
285 |
|
|
for (int i = 0; i < SIZE; ++i) { |
286 |
|
|
Integer I = new Integer(i); |
287 |
|
|
q.put(I); |
288 |
|
|
assertTrue(q.contains(I)); |
289 |
dl |
1.1 |
} |
290 |
jsr166 |
1.17 |
assertEquals(0, q.remainingCapacity()); |
291 |
dl |
1.1 |
} |
292 |
|
|
|
293 |
dl |
1.4 |
/** |
294 |
dl |
1.5 |
* put blocks interruptibly if full |
295 |
dl |
1.4 |
*/ |
296 |
jsr166 |
1.17 |
public void testBlockingPut() throws InterruptedException { |
297 |
dl |
1.10 |
final ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
298 |
jsr166 |
1.17 |
Thread t = new Thread(new CheckedRunnable() { |
299 |
|
|
public void realRun() { |
300 |
|
|
int added = 0; |
301 |
|
|
try { |
302 |
|
|
for (int i = 0; i < SIZE; ++i) { |
303 |
|
|
q.put(new Integer(i)); |
304 |
|
|
++added; |
305 |
jsr166 |
1.12 |
} |
306 |
jsr166 |
1.17 |
q.put(new Integer(SIZE)); |
307 |
|
|
threadShouldThrow(); |
308 |
jsr166 |
1.20 |
} catch (InterruptedException success) { |
309 |
jsr166 |
1.17 |
threadAssertEquals(added, SIZE); |
310 |
|
|
}}}); |
311 |
|
|
|
312 |
|
|
t.start(); |
313 |
|
|
Thread.sleep(MEDIUM_DELAY_MS); |
314 |
|
|
t.interrupt(); |
315 |
|
|
t.join(); |
316 |
dl |
1.1 |
} |
317 |
|
|
|
318 |
dl |
1.4 |
/** |
319 |
dl |
1.5 |
* put blocks waiting for take when full |
320 |
dl |
1.4 |
*/ |
321 |
jsr166 |
1.17 |
public void testPutWithTake() throws InterruptedException { |
322 |
dl |
1.1 |
final ArrayBlockingQueue q = new ArrayBlockingQueue(2); |
323 |
jsr166 |
1.17 |
Thread t = new Thread(new CheckedRunnable() { |
324 |
|
|
public void realRun() { |
325 |
|
|
int added = 0; |
326 |
|
|
try { |
327 |
|
|
q.put(new Object()); |
328 |
|
|
++added; |
329 |
|
|
q.put(new Object()); |
330 |
|
|
++added; |
331 |
|
|
q.put(new Object()); |
332 |
|
|
++added; |
333 |
|
|
q.put(new Object()); |
334 |
|
|
++added; |
335 |
|
|
threadShouldThrow(); |
336 |
jsr166 |
1.20 |
} catch (InterruptedException success) { |
337 |
jsr166 |
1.17 |
threadAssertTrue(added >= 2); |
338 |
|
|
} |
339 |
|
|
}}); |
340 |
|
|
|
341 |
|
|
t.start(); |
342 |
|
|
Thread.sleep(SHORT_DELAY_MS); |
343 |
|
|
q.take(); |
344 |
|
|
t.interrupt(); |
345 |
|
|
t.join(); |
346 |
dl |
1.1 |
} |
347 |
|
|
|
348 |
dl |
1.4 |
/** |
349 |
dl |
1.5 |
* timed offer times out if full and elements not taken |
350 |
dl |
1.4 |
*/ |
351 |
jsr166 |
1.17 |
public void testTimedOffer() throws InterruptedException { |
352 |
dl |
1.1 |
final ArrayBlockingQueue q = new ArrayBlockingQueue(2); |
353 |
jsr166 |
1.17 |
Thread t = new ThreadShouldThrow(InterruptedException.class) { |
354 |
|
|
public void realRun() throws InterruptedException { |
355 |
|
|
q.put(new Object()); |
356 |
|
|
q.put(new Object()); |
357 |
|
|
threadAssertFalse(q.offer(new Object(), SHORT_DELAY_MS/2, MILLISECONDS)); |
358 |
|
|
q.offer(new Object(), LONG_DELAY_MS, MILLISECONDS); |
359 |
|
|
}}; |
360 |
|
|
|
361 |
|
|
t.start(); |
362 |
|
|
Thread.sleep(SHORT_DELAY_MS); |
363 |
|
|
t.interrupt(); |
364 |
|
|
t.join(); |
365 |
dl |
1.1 |
} |
366 |
|
|
|
367 |
dl |
1.4 |
/** |
368 |
dl |
1.5 |
* take retrieves elements in FIFO order |
369 |
dl |
1.4 |
*/ |
370 |
jsr166 |
1.17 |
public void testTake() throws InterruptedException { |
371 |
|
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
372 |
|
|
for (int i = 0; i < SIZE; ++i) { |
373 |
|
|
assertEquals(i, ((Integer)q.take()).intValue()); |
374 |
jsr166 |
1.15 |
} |
375 |
dl |
1.1 |
} |
376 |
|
|
|
377 |
dl |
1.4 |
/** |
378 |
dl |
1.5 |
* take blocks interruptibly when empty |
379 |
dl |
1.4 |
*/ |
380 |
jsr166 |
1.17 |
public void testTakeFromEmpty() throws InterruptedException { |
381 |
dl |
1.1 |
final ArrayBlockingQueue q = new ArrayBlockingQueue(2); |
382 |
jsr166 |
1.17 |
Thread t = new ThreadShouldThrow(InterruptedException.class) { |
383 |
|
|
public void realRun() throws InterruptedException { |
384 |
|
|
q.take(); |
385 |
|
|
}}; |
386 |
|
|
|
387 |
|
|
t.start(); |
388 |
|
|
Thread.sleep(SHORT_DELAY_MS); |
389 |
|
|
t.interrupt(); |
390 |
|
|
t.join(); |
391 |
dl |
1.1 |
} |
392 |
|
|
|
393 |
dl |
1.4 |
/** |
394 |
dl |
1.5 |
* Take removes existing elements until empty, then blocks interruptibly |
395 |
dl |
1.4 |
*/ |
396 |
jsr166 |
1.17 |
public void testBlockingTake() throws InterruptedException { |
397 |
|
|
Thread t = new ThreadShouldThrow(InterruptedException.class) { |
398 |
|
|
public void realRun() throws InterruptedException { |
399 |
|
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
400 |
|
|
for (int i = 0; i < SIZE; ++i) { |
401 |
|
|
threadAssertEquals(i, ((Integer)q.take()).intValue()); |
402 |
|
|
} |
403 |
|
|
q.take(); |
404 |
|
|
}}; |
405 |
|
|
|
406 |
|
|
t.start(); |
407 |
jsr166 |
1.12 |
Thread.sleep(SHORT_DELAY_MS); |
408 |
dl |
1.3 |
t.interrupt(); |
409 |
|
|
t.join(); |
410 |
dl |
1.1 |
} |
411 |
|
|
|
412 |
|
|
|
413 |
dl |
1.4 |
/** |
414 |
dl |
1.5 |
* poll succeeds unless empty |
415 |
dl |
1.4 |
*/ |
416 |
|
|
public void testPoll() { |
417 |
dl |
1.3 |
ArrayBlockingQueue q = populatedQueue(SIZE); |
418 |
|
|
for (int i = 0; i < SIZE; ++i) { |
419 |
dl |
1.1 |
assertEquals(i, ((Integer)q.poll()).intValue()); |
420 |
|
|
} |
421 |
jsr166 |
1.15 |
assertNull(q.poll()); |
422 |
dl |
1.1 |
} |
423 |
|
|
|
424 |
dl |
1.4 |
/** |
425 |
dl |
1.5 |
* timed pool with zero timeout succeeds when non-empty, else times out |
426 |
dl |
1.4 |
*/ |
427 |
jsr166 |
1.17 |
public void testTimedPoll0() throws InterruptedException { |
428 |
|
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
429 |
|
|
for (int i = 0; i < SIZE; ++i) { |
430 |
|
|
assertEquals(i, ((Integer)q.poll(0, MILLISECONDS)).intValue()); |
431 |
jsr166 |
1.15 |
} |
432 |
jsr166 |
1.17 |
assertNull(q.poll(0, MILLISECONDS)); |
433 |
dl |
1.1 |
} |
434 |
|
|
|
435 |
dl |
1.4 |
/** |
436 |
dl |
1.5 |
* timed pool with nonzero timeout succeeds when non-empty, else times out |
437 |
dl |
1.4 |
*/ |
438 |
jsr166 |
1.17 |
public void testTimedPoll() throws InterruptedException { |
439 |
|
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
440 |
|
|
for (int i = 0; i < SIZE; ++i) { |
441 |
|
|
assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, MILLISECONDS)).intValue()); |
442 |
jsr166 |
1.15 |
} |
443 |
jsr166 |
1.17 |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
444 |
dl |
1.1 |
} |
445 |
|
|
|
446 |
dl |
1.4 |
/** |
447 |
dl |
1.5 |
* Interrupted timed poll throws InterruptedException instead of |
448 |
|
|
* returning timeout status |
449 |
dl |
1.4 |
*/ |
450 |
jsr166 |
1.17 |
public void testInterruptedTimedPoll() throws InterruptedException { |
451 |
|
|
Thread t = new ThreadShouldThrow(InterruptedException.class) { |
452 |
|
|
public void realRun() throws InterruptedException { |
453 |
|
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
454 |
|
|
for (int i = 0; i < SIZE; ++i) { |
455 |
|
|
threadAssertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, MILLISECONDS)).intValue()); |
456 |
|
|
} |
457 |
|
|
q.poll(MEDIUM_DELAY_MS, MILLISECONDS); |
458 |
|
|
}}; |
459 |
|
|
|
460 |
|
|
t.start(); |
461 |
|
|
Thread.sleep(SMALL_DELAY_MS); |
462 |
|
|
t.interrupt(); |
463 |
|
|
t.join(); |
464 |
dl |
1.1 |
} |
465 |
|
|
|
466 |
dl |
1.4 |
/** |
467 |
dl |
1.5 |
* timed poll before a delayed offer fails; after offer succeeds; |
468 |
|
|
* on interruption throws |
469 |
dl |
1.4 |
*/ |
470 |
jsr166 |
1.17 |
public void testTimedPollWithOffer() throws InterruptedException { |
471 |
dl |
1.1 |
final ArrayBlockingQueue q = new ArrayBlockingQueue(2); |
472 |
jsr166 |
1.17 |
Thread t = new ThreadShouldThrow(InterruptedException.class) { |
473 |
|
|
public void realRun() throws InterruptedException { |
474 |
|
|
threadAssertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
475 |
|
|
q.poll(LONG_DELAY_MS, MILLISECONDS); |
476 |
|
|
q.poll(LONG_DELAY_MS, MILLISECONDS); |
477 |
|
|
}}; |
478 |
|
|
|
479 |
|
|
t.start(); |
480 |
|
|
Thread.sleep(SMALL_DELAY_MS); |
481 |
|
|
assertTrue(q.offer(zero, SHORT_DELAY_MS, MILLISECONDS)); |
482 |
|
|
t.interrupt(); |
483 |
|
|
t.join(); |
484 |
jsr166 |
1.12 |
} |
485 |
dl |
1.1 |
|
486 |
|
|
|
487 |
dl |
1.4 |
/** |
488 |
dl |
1.5 |
* peek returns next element, or null if empty |
489 |
dl |
1.4 |
*/ |
490 |
|
|
public void testPeek() { |
491 |
dl |
1.3 |
ArrayBlockingQueue q = populatedQueue(SIZE); |
492 |
|
|
for (int i = 0; i < SIZE; ++i) { |
493 |
dl |
1.1 |
assertEquals(i, ((Integer)q.peek()).intValue()); |
494 |
|
|
q.poll(); |
495 |
|
|
assertTrue(q.peek() == null || |
496 |
|
|
i != ((Integer)q.peek()).intValue()); |
497 |
|
|
} |
498 |
jsr166 |
1.15 |
assertNull(q.peek()); |
499 |
dl |
1.1 |
} |
500 |
|
|
|
501 |
dl |
1.4 |
/** |
502 |
dl |
1.5 |
* element returns next element, or throws NSEE if empty |
503 |
dl |
1.4 |
*/ |
504 |
|
|
public void testElement() { |
505 |
dl |
1.3 |
ArrayBlockingQueue q = populatedQueue(SIZE); |
506 |
|
|
for (int i = 0; i < SIZE; ++i) { |
507 |
dl |
1.1 |
assertEquals(i, ((Integer)q.element()).intValue()); |
508 |
|
|
q.poll(); |
509 |
|
|
} |
510 |
|
|
try { |
511 |
|
|
q.element(); |
512 |
dl |
1.4 |
shouldThrow(); |
513 |
jsr166 |
1.17 |
} catch (NoSuchElementException success) {} |
514 |
dl |
1.1 |
} |
515 |
|
|
|
516 |
dl |
1.4 |
/** |
517 |
dl |
1.5 |
* remove removes next element, or throws NSEE if empty |
518 |
dl |
1.4 |
*/ |
519 |
|
|
public void testRemove() { |
520 |
dl |
1.3 |
ArrayBlockingQueue q = populatedQueue(SIZE); |
521 |
|
|
for (int i = 0; i < SIZE; ++i) { |
522 |
dl |
1.1 |
assertEquals(i, ((Integer)q.remove()).intValue()); |
523 |
|
|
} |
524 |
|
|
try { |
525 |
|
|
q.remove(); |
526 |
dl |
1.4 |
shouldThrow(); |
527 |
jsr166 |
1.17 |
} catch (NoSuchElementException success) {} |
528 |
dl |
1.1 |
} |
529 |
|
|
|
530 |
dl |
1.4 |
/** |
531 |
dl |
1.5 |
* remove(x) removes x and returns true if present |
532 |
dl |
1.4 |
*/ |
533 |
|
|
public void testRemoveElement() { |
534 |
dl |
1.3 |
ArrayBlockingQueue q = populatedQueue(SIZE); |
535 |
|
|
for (int i = 1; i < SIZE; i+=2) { |
536 |
dl |
1.1 |
assertTrue(q.remove(new Integer(i))); |
537 |
|
|
} |
538 |
dl |
1.3 |
for (int i = 0; i < SIZE; i+=2) { |
539 |
dl |
1.1 |
assertTrue(q.remove(new Integer(i))); |
540 |
|
|
assertFalse(q.remove(new Integer(i+1))); |
541 |
|
|
} |
542 |
dl |
1.2 |
assertTrue(q.isEmpty()); |
543 |
dl |
1.1 |
} |
544 |
jsr166 |
1.12 |
|
545 |
dl |
1.4 |
/** |
546 |
dl |
1.5 |
* contains(x) reports true when elements added but not yet removed |
547 |
dl |
1.4 |
*/ |
548 |
|
|
public void testContains() { |
549 |
dl |
1.3 |
ArrayBlockingQueue q = populatedQueue(SIZE); |
550 |
|
|
for (int i = 0; i < SIZE; ++i) { |
551 |
dl |
1.1 |
assertTrue(q.contains(new Integer(i))); |
552 |
|
|
q.poll(); |
553 |
|
|
assertFalse(q.contains(new Integer(i))); |
554 |
|
|
} |
555 |
|
|
} |
556 |
|
|
|
557 |
dl |
1.4 |
/** |
558 |
dl |
1.5 |
* clear removes all elements |
559 |
dl |
1.4 |
*/ |
560 |
|
|
public void testClear() { |
561 |
dl |
1.3 |
ArrayBlockingQueue q = populatedQueue(SIZE); |
562 |
dl |
1.1 |
q.clear(); |
563 |
|
|
assertTrue(q.isEmpty()); |
564 |
|
|
assertEquals(0, q.size()); |
565 |
dl |
1.3 |
assertEquals(SIZE, q.remainingCapacity()); |
566 |
|
|
q.add(one); |
567 |
dl |
1.1 |
assertFalse(q.isEmpty()); |
568 |
dl |
1.11 |
assertTrue(q.contains(one)); |
569 |
dl |
1.1 |
q.clear(); |
570 |
|
|
assertTrue(q.isEmpty()); |
571 |
|
|
} |
572 |
|
|
|
573 |
dl |
1.4 |
/** |
574 |
dl |
1.5 |
* containsAll(c) is true when c contains a subset of elements |
575 |
dl |
1.4 |
*/ |
576 |
|
|
public void testContainsAll() { |
577 |
dl |
1.3 |
ArrayBlockingQueue q = populatedQueue(SIZE); |
578 |
|
|
ArrayBlockingQueue p = new ArrayBlockingQueue(SIZE); |
579 |
|
|
for (int i = 0; i < SIZE; ++i) { |
580 |
dl |
1.1 |
assertTrue(q.containsAll(p)); |
581 |
|
|
assertFalse(p.containsAll(q)); |
582 |
|
|
p.add(new Integer(i)); |
583 |
|
|
} |
584 |
|
|
assertTrue(p.containsAll(q)); |
585 |
|
|
} |
586 |
|
|
|
587 |
dl |
1.4 |
/** |
588 |
dl |
1.5 |
* retainAll(c) retains only those elements of c and reports true if changed |
589 |
dl |
1.4 |
*/ |
590 |
|
|
public void testRetainAll() { |
591 |
dl |
1.3 |
ArrayBlockingQueue q = populatedQueue(SIZE); |
592 |
|
|
ArrayBlockingQueue p = populatedQueue(SIZE); |
593 |
|
|
for (int i = 0; i < SIZE; ++i) { |
594 |
dl |
1.1 |
boolean changed = q.retainAll(p); |
595 |
|
|
if (i == 0) |
596 |
|
|
assertFalse(changed); |
597 |
|
|
else |
598 |
|
|
assertTrue(changed); |
599 |
|
|
|
600 |
|
|
assertTrue(q.containsAll(p)); |
601 |
dl |
1.3 |
assertEquals(SIZE-i, q.size()); |
602 |
dl |
1.1 |
p.remove(); |
603 |
|
|
} |
604 |
|
|
} |
605 |
|
|
|
606 |
dl |
1.4 |
/** |
607 |
dl |
1.5 |
* removeAll(c) removes only those elements of c and reports true if changed |
608 |
dl |
1.4 |
*/ |
609 |
|
|
public void testRemoveAll() { |
610 |
dl |
1.3 |
for (int i = 1; i < SIZE; ++i) { |
611 |
|
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
612 |
|
|
ArrayBlockingQueue p = populatedQueue(i); |
613 |
dl |
1.1 |
assertTrue(q.removeAll(p)); |
614 |
dl |
1.3 |
assertEquals(SIZE-i, q.size()); |
615 |
dl |
1.1 |
for (int j = 0; j < i; ++j) { |
616 |
|
|
Integer I = (Integer)(p.remove()); |
617 |
|
|
assertFalse(q.contains(I)); |
618 |
|
|
} |
619 |
|
|
} |
620 |
|
|
} |
621 |
|
|
|
622 |
dl |
1.4 |
/** |
623 |
dl |
1.5 |
* toArray contains all elements |
624 |
dl |
1.4 |
*/ |
625 |
jsr166 |
1.17 |
public void testToArray() throws InterruptedException { |
626 |
dl |
1.3 |
ArrayBlockingQueue q = populatedQueue(SIZE); |
627 |
jsr166 |
1.15 |
Object[] o = q.toArray(); |
628 |
|
|
for (int i = 0; i < o.length; i++) |
629 |
|
|
assertEquals(o[i], q.take()); |
630 |
dl |
1.1 |
} |
631 |
|
|
|
632 |
dl |
1.4 |
/** |
633 |
dl |
1.5 |
* toArray(a) contains all elements |
634 |
dl |
1.4 |
*/ |
635 |
jsr166 |
1.17 |
public void testToArray2() throws InterruptedException { |
636 |
dl |
1.3 |
ArrayBlockingQueue q = populatedQueue(SIZE); |
637 |
jsr166 |
1.15 |
Integer[] ints = new Integer[SIZE]; |
638 |
|
|
ints = (Integer[])q.toArray(ints); |
639 |
jsr166 |
1.17 |
for (int i = 0; i < ints.length; i++) |
640 |
|
|
assertEquals(ints[i], q.take()); |
641 |
dl |
1.1 |
} |
642 |
dl |
1.6 |
|
643 |
|
|
/** |
644 |
|
|
* toArray(null) throws NPE |
645 |
|
|
*/ |
646 |
|
|
public void testToArray_BadArg() { |
647 |
jsr166 |
1.15 |
try { |
648 |
dl |
1.6 |
ArrayBlockingQueue q = populatedQueue(SIZE); |
649 |
jsr166 |
1.15 |
Object o[] = q.toArray(null); |
650 |
|
|
shouldThrow(); |
651 |
|
|
} catch (NullPointerException success) {} |
652 |
dl |
1.6 |
} |
653 |
|
|
|
654 |
|
|
/** |
655 |
dl |
1.8 |
* toArray with incompatible array type throws CCE |
656 |
dl |
1.6 |
*/ |
657 |
|
|
public void testToArray1_BadArg() { |
658 |
jsr166 |
1.15 |
try { |
659 |
dl |
1.6 |
ArrayBlockingQueue q = populatedQueue(SIZE); |
660 |
jsr166 |
1.15 |
Object o[] = q.toArray(new String[10] ); |
661 |
|
|
shouldThrow(); |
662 |
jsr166 |
1.18 |
} catch (ArrayStoreException success) {} |
663 |
dl |
1.6 |
} |
664 |
|
|
|
665 |
jsr166 |
1.12 |
|
666 |
dl |
1.4 |
/** |
667 |
dl |
1.5 |
* iterator iterates through all elements |
668 |
dl |
1.4 |
*/ |
669 |
jsr166 |
1.17 |
public void testIterator() throws InterruptedException { |
670 |
dl |
1.3 |
ArrayBlockingQueue q = populatedQueue(SIZE); |
671 |
jsr166 |
1.15 |
Iterator it = q.iterator(); |
672 |
jsr166 |
1.17 |
while (it.hasNext()) { |
673 |
|
|
assertEquals(it.next(), q.take()); |
674 |
jsr166 |
1.15 |
} |
675 |
dl |
1.1 |
} |
676 |
|
|
|
677 |
dl |
1.4 |
/** |
678 |
dl |
1.5 |
* iterator.remove removes current element |
679 |
|
|
*/ |
680 |
|
|
public void testIteratorRemove () { |
681 |
|
|
final ArrayBlockingQueue q = new ArrayBlockingQueue(3); |
682 |
|
|
q.add(two); |
683 |
|
|
q.add(one); |
684 |
|
|
q.add(three); |
685 |
|
|
|
686 |
|
|
Iterator it = q.iterator(); |
687 |
|
|
it.next(); |
688 |
|
|
it.remove(); |
689 |
jsr166 |
1.12 |
|
690 |
dl |
1.5 |
it = q.iterator(); |
691 |
|
|
assertEquals(it.next(), one); |
692 |
|
|
assertEquals(it.next(), three); |
693 |
|
|
assertFalse(it.hasNext()); |
694 |
|
|
} |
695 |
|
|
|
696 |
|
|
/** |
697 |
|
|
* iterator ordering is FIFO |
698 |
dl |
1.4 |
*/ |
699 |
dl |
1.1 |
public void testIteratorOrdering() { |
700 |
|
|
final ArrayBlockingQueue q = new ArrayBlockingQueue(3); |
701 |
dl |
1.3 |
q.add(one); |
702 |
|
|
q.add(two); |
703 |
|
|
q.add(three); |
704 |
dl |
1.1 |
|
705 |
|
|
assertEquals("queue should be full", 0, q.remainingCapacity()); |
706 |
|
|
|
707 |
|
|
int k = 0; |
708 |
|
|
for (Iterator it = q.iterator(); it.hasNext();) { |
709 |
|
|
int i = ((Integer)(it.next())).intValue(); |
710 |
dl |
1.4 |
assertEquals(++k, i); |
711 |
dl |
1.1 |
} |
712 |
dl |
1.4 |
assertEquals(3, k); |
713 |
dl |
1.1 |
} |
714 |
|
|
|
715 |
dl |
1.4 |
/** |
716 |
dl |
1.5 |
* Modifications do not cause iterators to fail |
717 |
dl |
1.4 |
*/ |
718 |
dl |
1.1 |
public void testWeaklyConsistentIteration () { |
719 |
|
|
final ArrayBlockingQueue q = new ArrayBlockingQueue(3); |
720 |
dl |
1.3 |
q.add(one); |
721 |
|
|
q.add(two); |
722 |
|
|
q.add(three); |
723 |
jsr166 |
1.17 |
for (Iterator it = q.iterator(); it.hasNext();) { |
724 |
|
|
q.remove(); |
725 |
|
|
it.next(); |
726 |
dl |
1.1 |
} |
727 |
dl |
1.4 |
assertEquals(0, q.size()); |
728 |
dl |
1.1 |
} |
729 |
|
|
|
730 |
|
|
|
731 |
dl |
1.4 |
/** |
732 |
dl |
1.5 |
* toString contains toStrings of elements |
733 |
dl |
1.4 |
*/ |
734 |
|
|
public void testToString() { |
735 |
dl |
1.3 |
ArrayBlockingQueue q = populatedQueue(SIZE); |
736 |
dl |
1.1 |
String s = q.toString(); |
737 |
dl |
1.3 |
for (int i = 0; i < SIZE; ++i) { |
738 |
dl |
1.1 |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
739 |
|
|
} |
740 |
jsr166 |
1.12 |
} |
741 |
dl |
1.1 |
|
742 |
|
|
|
743 |
dl |
1.4 |
/** |
744 |
dl |
1.5 |
* offer transfers elements across Executor tasks |
745 |
dl |
1.4 |
*/ |
746 |
dl |
1.1 |
public void testOfferInExecutor() { |
747 |
|
|
final ArrayBlockingQueue q = new ArrayBlockingQueue(2); |
748 |
dl |
1.3 |
q.add(one); |
749 |
|
|
q.add(two); |
750 |
dl |
1.1 |
ExecutorService executor = Executors.newFixedThreadPool(2); |
751 |
jsr166 |
1.17 |
executor.execute(new CheckedRunnable() { |
752 |
|
|
public void realRun() throws InterruptedException { |
753 |
dl |
1.3 |
threadAssertFalse(q.offer(three)); |
754 |
jsr166 |
1.17 |
threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, MILLISECONDS)); |
755 |
|
|
threadAssertEquals(0, q.remainingCapacity()); |
756 |
|
|
}}); |
757 |
|
|
|
758 |
|
|
executor.execute(new CheckedRunnable() { |
759 |
|
|
public void realRun() throws InterruptedException { |
760 |
|
|
Thread.sleep(SMALL_DELAY_MS); |
761 |
|
|
threadAssertEquals(one, q.take()); |
762 |
|
|
}}); |
763 |
jsr166 |
1.12 |
|
764 |
dl |
1.3 |
joinPool(executor); |
765 |
dl |
1.1 |
|
766 |
|
|
} |
767 |
|
|
|
768 |
dl |
1.4 |
/** |
769 |
dl |
1.5 |
* poll retrieves elements across Executor threads |
770 |
dl |
1.4 |
*/ |
771 |
dl |
1.1 |
public void testPollInExecutor() { |
772 |
|
|
final ArrayBlockingQueue q = new ArrayBlockingQueue(2); |
773 |
|
|
ExecutorService executor = Executors.newFixedThreadPool(2); |
774 |
jsr166 |
1.17 |
executor.execute(new CheckedRunnable() { |
775 |
|
|
public void realRun() throws InterruptedException { |
776 |
dl |
1.3 |
threadAssertNull(q.poll()); |
777 |
jsr166 |
1.17 |
threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, MILLISECONDS)); |
778 |
|
|
threadAssertTrue(q.isEmpty()); |
779 |
|
|
}}); |
780 |
|
|
|
781 |
|
|
executor.execute(new CheckedRunnable() { |
782 |
|
|
public void realRun() throws InterruptedException { |
783 |
|
|
Thread.sleep(SMALL_DELAY_MS); |
784 |
|
|
q.put(one); |
785 |
|
|
}}); |
786 |
jsr166 |
1.12 |
|
787 |
dl |
1.3 |
joinPool(executor); |
788 |
dl |
1.1 |
} |
789 |
dl |
1.2 |
|
790 |
dl |
1.4 |
/** |
791 |
dl |
1.5 |
* A deserialized serialized queue has same elements in same order |
792 |
dl |
1.4 |
*/ |
793 |
jsr166 |
1.17 |
public void testSerialization() throws Exception { |
794 |
dl |
1.3 |
ArrayBlockingQueue q = populatedQueue(SIZE); |
795 |
dl |
1.2 |
|
796 |
jsr166 |
1.17 |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
797 |
|
|
ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout)); |
798 |
|
|
out.writeObject(q); |
799 |
|
|
out.close(); |
800 |
|
|
|
801 |
|
|
ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray()); |
802 |
|
|
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); |
803 |
|
|
ArrayBlockingQueue r = (ArrayBlockingQueue)in.readObject(); |
804 |
|
|
assertEquals(q.size(), r.size()); |
805 |
|
|
while (!q.isEmpty()) |
806 |
|
|
assertEquals(q.remove(), r.remove()); |
807 |
dl |
1.6 |
} |
808 |
|
|
|
809 |
|
|
/** |
810 |
|
|
* drainTo(null) throws NPE |
811 |
jsr166 |
1.12 |
*/ |
812 |
dl |
1.6 |
public void testDrainToNull() { |
813 |
|
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
814 |
|
|
try { |
815 |
|
|
q.drainTo(null); |
816 |
|
|
shouldThrow(); |
817 |
jsr166 |
1.17 |
} catch (NullPointerException success) {} |
818 |
dl |
1.6 |
} |
819 |
|
|
|
820 |
|
|
/** |
821 |
|
|
* drainTo(this) throws IAE |
822 |
jsr166 |
1.12 |
*/ |
823 |
dl |
1.6 |
public void testDrainToSelf() { |
824 |
|
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
825 |
|
|
try { |
826 |
|
|
q.drainTo(q); |
827 |
|
|
shouldThrow(); |
828 |
jsr166 |
1.17 |
} catch (IllegalArgumentException success) {} |
829 |
dl |
1.6 |
} |
830 |
|
|
|
831 |
|
|
/** |
832 |
|
|
* drainTo(c) empties queue into another collection c |
833 |
jsr166 |
1.12 |
*/ |
834 |
dl |
1.6 |
public void testDrainTo() { |
835 |
|
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
836 |
|
|
ArrayList l = new ArrayList(); |
837 |
|
|
q.drainTo(l); |
838 |
|
|
assertEquals(q.size(), 0); |
839 |
|
|
assertEquals(l.size(), SIZE); |
840 |
jsr166 |
1.12 |
for (int i = 0; i < SIZE; ++i) |
841 |
dl |
1.6 |
assertEquals(l.get(i), new Integer(i)); |
842 |
dl |
1.11 |
q.add(zero); |
843 |
|
|
q.add(one); |
844 |
|
|
assertFalse(q.isEmpty()); |
845 |
|
|
assertTrue(q.contains(zero)); |
846 |
|
|
assertTrue(q.contains(one)); |
847 |
|
|
l.clear(); |
848 |
|
|
q.drainTo(l); |
849 |
|
|
assertEquals(q.size(), 0); |
850 |
|
|
assertEquals(l.size(), 2); |
851 |
jsr166 |
1.12 |
for (int i = 0; i < 2; ++i) |
852 |
dl |
1.11 |
assertEquals(l.get(i), new Integer(i)); |
853 |
dl |
1.6 |
} |
854 |
|
|
|
855 |
|
|
/** |
856 |
|
|
* drainTo empties full queue, unblocking a waiting put. |
857 |
jsr166 |
1.12 |
*/ |
858 |
jsr166 |
1.17 |
public void testDrainToWithActivePut() throws InterruptedException { |
859 |
dl |
1.6 |
final ArrayBlockingQueue q = populatedQueue(SIZE); |
860 |
jsr166 |
1.17 |
Thread t = new Thread(new CheckedRunnable() { |
861 |
|
|
public void realRun() throws InterruptedException { |
862 |
|
|
q.put(new Integer(SIZE+1)); |
863 |
|
|
}}); |
864 |
|
|
|
865 |
|
|
t.start(); |
866 |
|
|
ArrayList l = new ArrayList(); |
867 |
|
|
q.drainTo(l); |
868 |
|
|
assertTrue(l.size() >= SIZE); |
869 |
|
|
for (int i = 0; i < SIZE; ++i) |
870 |
|
|
assertEquals(l.get(i), new Integer(i)); |
871 |
|
|
t.join(); |
872 |
|
|
assertTrue(q.size() + l.size() >= SIZE); |
873 |
dl |
1.6 |
} |
874 |
|
|
|
875 |
|
|
/** |
876 |
|
|
* drainTo(null, n) throws NPE |
877 |
jsr166 |
1.12 |
*/ |
878 |
dl |
1.6 |
public void testDrainToNullN() { |
879 |
|
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
880 |
|
|
try { |
881 |
|
|
q.drainTo(null, 0); |
882 |
|
|
shouldThrow(); |
883 |
jsr166 |
1.17 |
} catch (NullPointerException success) {} |
884 |
dl |
1.6 |
} |
885 |
|
|
|
886 |
|
|
/** |
887 |
|
|
* drainTo(this, n) throws IAE |
888 |
jsr166 |
1.12 |
*/ |
889 |
dl |
1.6 |
public void testDrainToSelfN() { |
890 |
|
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
891 |
|
|
try { |
892 |
|
|
q.drainTo(q, 0); |
893 |
|
|
shouldThrow(); |
894 |
jsr166 |
1.17 |
} catch (IllegalArgumentException success) {} |
895 |
dl |
1.6 |
} |
896 |
|
|
|
897 |
|
|
/** |
898 |
|
|
* drainTo(c, n) empties first max {n, size} elements of queue into c |
899 |
jsr166 |
1.12 |
*/ |
900 |
dl |
1.6 |
public void testDrainToN() { |
901 |
dl |
1.11 |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE*2); |
902 |
dl |
1.6 |
for (int i = 0; i < SIZE + 2; ++i) { |
903 |
jsr166 |
1.13 |
for (int j = 0; j < SIZE; j++) |
904 |
dl |
1.11 |
assertTrue(q.offer(new Integer(j))); |
905 |
dl |
1.6 |
ArrayList l = new ArrayList(); |
906 |
|
|
q.drainTo(l, i); |
907 |
|
|
int k = (i < SIZE)? i : SIZE; |
908 |
dl |
1.11 |
assertEquals(l.size(), k); |
909 |
dl |
1.6 |
assertEquals(q.size(), SIZE-k); |
910 |
jsr166 |
1.12 |
for (int j = 0; j < k; ++j) |
911 |
dl |
1.6 |
assertEquals(l.get(j), new Integer(j)); |
912 |
dl |
1.11 |
while (q.poll() != null) ; |
913 |
dl |
1.2 |
} |
914 |
|
|
} |
915 |
|
|
|
916 |
dl |
1.1 |
} |