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