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 junit.framework.*; |
10 |
< |
import java.util.*; |
11 |
< |
import java.util.concurrent.*; |
10 |
> |
import java.util.Arrays; |
11 |
> |
import java.util.ArrayList; |
12 |
> |
import java.util.Collection; |
13 |
> |
import java.util.Comparator; |
14 |
> |
import java.util.Iterator; |
15 |
> |
import java.util.NoSuchElementException; |
16 |
> |
import java.util.concurrent.PriorityBlockingQueue; |
17 |
> |
import java.util.concurrent.BlockingQueue; |
18 |
> |
import java.util.concurrent.CountDownLatch; |
19 |
> |
import java.util.concurrent.Executors; |
20 |
> |
import java.util.concurrent.ExecutorService; |
21 |
|
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
22 |
|
import java.io.*; |
23 |
|
|
24 |
|
public class PriorityBlockingQueueTest extends JSR166TestCase { |
25 |
+ |
|
26 |
+ |
public static class Generic extends BlockingQueueTest { |
27 |
+ |
protected BlockingQueue emptyCollection() { |
28 |
+ |
return new PriorityBlockingQueue(); |
29 |
+ |
} |
30 |
+ |
} |
31 |
+ |
|
32 |
+ |
public static class InitialCapacity extends BlockingQueueTest { |
33 |
+ |
protected BlockingQueue emptyCollection() { |
34 |
+ |
return new PriorityBlockingQueue(20); |
35 |
+ |
} |
36 |
+ |
} |
37 |
+ |
|
38 |
|
public static void main(String[] args) { |
39 |
|
junit.textui.TestRunner.run(suite()); |
40 |
|
} |
41 |
+ |
|
42 |
|
public static Test suite() { |
43 |
< |
return new TestSuite(PriorityBlockingQueueTest.class); |
43 |
> |
return newTestSuite(PriorityBlockingQueueTest.class, |
44 |
> |
new Generic().testSuite(), |
45 |
> |
new InitialCapacity().testSuite()); |
46 |
|
} |
47 |
|
|
48 |
|
private static final int NOCAP = Integer.MAX_VALUE; |
58 |
|
* Create a queue of given size containing consecutive |
59 |
|
* Integers 0 ... n. |
60 |
|
*/ |
61 |
< |
private PriorityBlockingQueue populatedQueue(int n) { |
62 |
< |
PriorityBlockingQueue q = new PriorityBlockingQueue(n); |
61 |
> |
private PriorityBlockingQueue<Integer> populatedQueue(int n) { |
62 |
> |
PriorityBlockingQueue<Integer> q = |
63 |
> |
new PriorityBlockingQueue<Integer>(n); |
64 |
|
assertTrue(q.isEmpty()); |
65 |
|
for (int i = n-1; i >= 0; i-=2) |
66 |
|
assertTrue(q.offer(new Integer(i))); |
84 |
|
*/ |
85 |
|
public void testConstructor2() { |
86 |
|
try { |
87 |
< |
PriorityBlockingQueue q = new PriorityBlockingQueue(0); |
87 |
> |
new PriorityBlockingQueue(0); |
88 |
|
shouldThrow(); |
89 |
|
} catch (IllegalArgumentException success) {} |
90 |
|
} |
94 |
|
*/ |
95 |
|
public void testConstructor3() { |
96 |
|
try { |
97 |
< |
PriorityBlockingQueue q = new PriorityBlockingQueue(null); |
97 |
> |
new PriorityBlockingQueue(null); |
98 |
|
shouldThrow(); |
99 |
|
} catch (NullPointerException success) {} |
100 |
|
} |
103 |
|
* Initializing from Collection of null elements throws NPE |
104 |
|
*/ |
105 |
|
public void testConstructor4() { |
106 |
+ |
Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); |
107 |
|
try { |
108 |
< |
Integer[] ints = new Integer[SIZE]; |
82 |
< |
PriorityBlockingQueue q = new PriorityBlockingQueue(Arrays.asList(ints)); |
108 |
> |
new PriorityBlockingQueue(elements); |
109 |
|
shouldThrow(); |
110 |
|
} catch (NullPointerException success) {} |
111 |
|
} |
114 |
|
* Initializing from Collection with some null elements throws NPE |
115 |
|
*/ |
116 |
|
public void testConstructor5() { |
117 |
+ |
Integer[] ints = new Integer[SIZE]; |
118 |
+ |
for (int i = 0; i < SIZE-1; ++i) |
119 |
+ |
ints[i] = i; |
120 |
+ |
Collection<Integer> elements = Arrays.asList(ints); |
121 |
|
try { |
122 |
< |
Integer[] ints = new Integer[SIZE]; |
93 |
< |
for (int i = 0; i < SIZE-1; ++i) |
94 |
< |
ints[i] = new Integer(i); |
95 |
< |
PriorityBlockingQueue q = new PriorityBlockingQueue(Arrays.asList(ints)); |
122 |
> |
new PriorityBlockingQueue(elements); |
123 |
|
shouldThrow(); |
124 |
|
} catch (NullPointerException success) {} |
125 |
|
} |
130 |
|
public void testConstructor6() { |
131 |
|
Integer[] ints = new Integer[SIZE]; |
132 |
|
for (int i = 0; i < SIZE; ++i) |
133 |
< |
ints[i] = new Integer(i); |
133 |
> |
ints[i] = i; |
134 |
|
PriorityBlockingQueue q = new PriorityBlockingQueue(Arrays.asList(ints)); |
135 |
|
for (int i = 0; i < SIZE; ++i) |
136 |
|
assertEquals(ints[i], q.poll()); |
185 |
|
} |
186 |
|
|
187 |
|
/** |
161 |
– |
* offer(null) throws NPE |
162 |
– |
*/ |
163 |
– |
public void testOfferNull() { |
164 |
– |
try { |
165 |
– |
PriorityBlockingQueue q = new PriorityBlockingQueue(1); |
166 |
– |
q.offer(null); |
167 |
– |
shouldThrow(); |
168 |
– |
} catch (NullPointerException success) {} |
169 |
– |
} |
170 |
– |
|
171 |
– |
/** |
172 |
– |
* add(null) throws NPE |
173 |
– |
*/ |
174 |
– |
public void testAddNull() { |
175 |
– |
try { |
176 |
– |
PriorityBlockingQueue q = new PriorityBlockingQueue(1); |
177 |
– |
q.add(null); |
178 |
– |
shouldThrow(); |
179 |
– |
} catch (NullPointerException success) {} |
180 |
– |
} |
181 |
– |
|
182 |
– |
/** |
188 |
|
* Offer of comparable element succeeds |
189 |
|
*/ |
190 |
|
public void testOffer() { |
218 |
|
} |
219 |
|
|
220 |
|
/** |
216 |
– |
* addAll(null) throws NPE |
217 |
– |
*/ |
218 |
– |
public void testAddAll1() { |
219 |
– |
try { |
220 |
– |
PriorityBlockingQueue q = new PriorityBlockingQueue(1); |
221 |
– |
q.addAll(null); |
222 |
– |
shouldThrow(); |
223 |
– |
} catch (NullPointerException success) {} |
224 |
– |
} |
225 |
– |
|
226 |
– |
/** |
221 |
|
* addAll(this) throws IAE |
222 |
|
*/ |
223 |
|
public void testAddAllSelf() { |
229 |
|
} |
230 |
|
|
231 |
|
/** |
238 |
– |
* addAll of a collection with null elements throws NPE |
239 |
– |
*/ |
240 |
– |
public void testAddAll2() { |
241 |
– |
try { |
242 |
– |
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE); |
243 |
– |
Integer[] ints = new Integer[SIZE]; |
244 |
– |
q.addAll(Arrays.asList(ints)); |
245 |
– |
shouldThrow(); |
246 |
– |
} catch (NullPointerException success) {} |
247 |
– |
} |
248 |
– |
|
249 |
– |
/** |
232 |
|
* addAll of a collection with any null elements throws NPE after |
233 |
|
* possibly adding some elements |
234 |
|
*/ |
259 |
|
} |
260 |
|
|
261 |
|
/** |
280 |
– |
* put(null) throws NPE |
281 |
– |
*/ |
282 |
– |
public void testPutNull() { |
283 |
– |
try { |
284 |
– |
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE); |
285 |
– |
q.put(null); |
286 |
– |
shouldThrow(); |
287 |
– |
} catch (NullPointerException success) {} |
288 |
– |
} |
289 |
– |
|
290 |
– |
/** |
262 |
|
* all elements successfully put are contained |
263 |
|
*/ |
264 |
< |
public void testPut() { |
265 |
< |
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE); |
266 |
< |
for (int i = 0; i < SIZE; ++i) { |
267 |
< |
Integer I = new Integer(i); |
268 |
< |
q.put(I); |
269 |
< |
assertTrue(q.contains(I)); |
270 |
< |
} |
271 |
< |
assertEquals(SIZE, q.size()); |
264 |
> |
public void testPut() { |
265 |
> |
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE); |
266 |
> |
for (int i = 0; i < SIZE; ++i) { |
267 |
> |
Integer I = new Integer(i); |
268 |
> |
q.put(I); |
269 |
> |
assertTrue(q.contains(I)); |
270 |
> |
} |
271 |
> |
assertEquals(SIZE, q.size()); |
272 |
|
} |
273 |
|
|
274 |
|
/** |
277 |
|
public void testPutWithTake() throws InterruptedException { |
278 |
|
final PriorityBlockingQueue q = new PriorityBlockingQueue(2); |
279 |
|
final int size = 4; |
280 |
< |
Thread t = new Thread(new CheckedRunnable() { |
280 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
281 |
|
public void realRun() { |
282 |
|
for (int i = 0; i < size; i++) |
283 |
|
q.put(new Integer(0)); |
284 |
|
}}); |
285 |
|
|
286 |
< |
t.start(); |
287 |
< |
Thread.sleep(SHORT_DELAY_MS); |
317 |
< |
assertEquals(q.size(), size); |
286 |
> |
awaitTermination(t); |
287 |
> |
assertEquals(size, q.size()); |
288 |
|
q.take(); |
319 |
– |
t.interrupt(); |
320 |
– |
t.join(); |
289 |
|
} |
290 |
|
|
291 |
|
/** |
293 |
|
*/ |
294 |
|
public void testTimedOffer() throws InterruptedException { |
295 |
|
final PriorityBlockingQueue q = new PriorityBlockingQueue(2); |
296 |
< |
Thread t = new Thread(new CheckedRunnable() { |
296 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
297 |
|
public void realRun() { |
298 |
|
q.put(new Integer(0)); |
299 |
|
q.put(new Integer(0)); |
301 |
|
assertTrue(q.offer(new Integer(0), LONG_DELAY_MS, MILLISECONDS)); |
302 |
|
}}); |
303 |
|
|
304 |
< |
t.start(); |
337 |
< |
Thread.sleep(SMALL_DELAY_MS); |
338 |
< |
t.interrupt(); |
339 |
< |
t.join(); |
304 |
> |
awaitTermination(t); |
305 |
|
} |
306 |
|
|
307 |
|
/** |
315 |
|
} |
316 |
|
|
317 |
|
/** |
353 |
– |
* take blocks interruptibly when empty |
354 |
– |
*/ |
355 |
– |
public void testTakeFromEmpty() throws InterruptedException { |
356 |
– |
final PriorityBlockingQueue q = new PriorityBlockingQueue(2); |
357 |
– |
Thread t = new Thread(new CheckedInterruptedRunnable() { |
358 |
– |
public void realRun() throws InterruptedException { |
359 |
– |
q.take(); |
360 |
– |
}}); |
361 |
– |
|
362 |
– |
t.start(); |
363 |
– |
Thread.sleep(SHORT_DELAY_MS); |
364 |
– |
t.interrupt(); |
365 |
– |
t.join(); |
366 |
– |
} |
367 |
– |
|
368 |
– |
/** |
318 |
|
* Take removes existing elements until empty, then blocks interruptibly |
319 |
|
*/ |
320 |
|
public void testBlockingTake() throws InterruptedException { |
321 |
|
final PriorityBlockingQueue q = populatedQueue(SIZE); |
322 |
< |
Thread t = new Thread(new CheckedRunnable() { |
322 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
323 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
324 |
|
public void realRun() throws InterruptedException { |
325 |
|
for (int i = 0; i < SIZE; ++i) { |
326 |
|
assertEquals(i, q.take()); |
327 |
|
} |
328 |
+ |
|
329 |
+ |
Thread.currentThread().interrupt(); |
330 |
+ |
try { |
331 |
+ |
q.take(); |
332 |
+ |
shouldThrow(); |
333 |
+ |
} catch (InterruptedException success) {} |
334 |
+ |
assertFalse(Thread.interrupted()); |
335 |
+ |
|
336 |
+ |
pleaseInterrupt.countDown(); |
337 |
|
try { |
338 |
|
q.take(); |
339 |
|
shouldThrow(); |
340 |
|
} catch (InterruptedException success) {} |
341 |
+ |
assertFalse(Thread.interrupted()); |
342 |
|
}}); |
343 |
|
|
344 |
< |
t.start(); |
345 |
< |
Thread.sleep(SHORT_DELAY_MS); |
344 |
> |
await(pleaseInterrupt); |
345 |
> |
assertThreadStaysAlive(t); |
346 |
|
t.interrupt(); |
347 |
< |
t.join(); |
347 |
> |
awaitTermination(t); |
348 |
|
} |
349 |
|
|
390 |
– |
|
350 |
|
/** |
351 |
|
* poll succeeds unless empty |
352 |
|
*/ |
359 |
|
} |
360 |
|
|
361 |
|
/** |
362 |
< |
* timed pool with zero timeout succeeds when non-empty, else times out |
362 |
> |
* timed poll with zero timeout succeeds when non-empty, else times out |
363 |
|
*/ |
364 |
|
public void testTimedPoll0() throws InterruptedException { |
365 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
370 |
|
} |
371 |
|
|
372 |
|
/** |
373 |
< |
* timed pool with nonzero timeout succeeds when non-empty, else times out |
373 |
> |
* timed poll with nonzero timeout succeeds when non-empty, else times out |
374 |
|
*/ |
375 |
|
public void testTimedPoll() throws InterruptedException { |
376 |
< |
PriorityBlockingQueue q = populatedQueue(SIZE); |
376 |
> |
PriorityBlockingQueue<Integer> q = populatedQueue(SIZE); |
377 |
|
for (int i = 0; i < SIZE; ++i) { |
378 |
< |
assertEquals(i, q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
379 |
< |
} |
380 |
< |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
378 |
> |
long startTime = System.nanoTime(); |
379 |
> |
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
380 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
381 |
> |
} |
382 |
> |
long startTime = System.nanoTime(); |
383 |
> |
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
384 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
385 |
> |
checkEmpty(q); |
386 |
|
} |
387 |
|
|
388 |
|
/** |
390 |
|
* returning timeout status |
391 |
|
*/ |
392 |
|
public void testInterruptedTimedPoll() throws InterruptedException { |
393 |
< |
Thread t = new Thread(new CheckedRunnable() { |
393 |
> |
final BlockingQueue<Integer> q = populatedQueue(SIZE); |
394 |
> |
final CountDownLatch aboutToWait = new CountDownLatch(1); |
395 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
396 |
|
public void realRun() throws InterruptedException { |
431 |
– |
PriorityBlockingQueue q = populatedQueue(SIZE); |
397 |
|
for (int i = 0; i < SIZE; ++i) { |
398 |
< |
assertEquals(i, q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
398 |
> |
long t0 = System.nanoTime(); |
399 |
> |
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
400 |
> |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
401 |
|
} |
402 |
< |
try { |
403 |
< |
q.poll(SMALL_DELAY_MS, MILLISECONDS); |
437 |
< |
shouldThrow(); |
438 |
< |
} catch (InterruptedException success) {} |
439 |
< |
}}); |
440 |
< |
|
441 |
< |
t.start(); |
442 |
< |
Thread.sleep(SHORT_DELAY_MS); |
443 |
< |
t.interrupt(); |
444 |
< |
t.join(); |
445 |
< |
} |
446 |
< |
|
447 |
< |
/** |
448 |
< |
* timed poll before a delayed offer fails; after offer succeeds; |
449 |
< |
* on interruption throws |
450 |
< |
*/ |
451 |
< |
public void testTimedPollWithOffer() throws InterruptedException { |
452 |
< |
final PriorityBlockingQueue q = new PriorityBlockingQueue(2); |
453 |
< |
Thread t = new Thread(new CheckedRunnable() { |
454 |
< |
public void realRun() throws InterruptedException { |
455 |
< |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
456 |
< |
assertSame(zero, q.poll(MEDIUM_DELAY_MS, MILLISECONDS)); |
402 |
> |
long t0 = System.nanoTime(); |
403 |
> |
aboutToWait.countDown(); |
404 |
|
try { |
405 |
|
q.poll(LONG_DELAY_MS, MILLISECONDS); |
406 |
|
shouldThrow(); |
407 |
< |
} catch (InterruptedException success) {} |
407 |
> |
} catch (InterruptedException success) { |
408 |
> |
assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS); |
409 |
> |
} |
410 |
|
}}); |
411 |
|
|
412 |
< |
t.start(); |
413 |
< |
Thread.sleep(SMALL_DELAY_MS); |
465 |
< |
assertTrue(q.offer(zero, SHORT_DELAY_MS, MILLISECONDS)); |
412 |
> |
aboutToWait.await(); |
413 |
> |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
414 |
|
t.interrupt(); |
415 |
< |
t.join(); |
415 |
> |
awaitTermination(t, MEDIUM_DELAY_MS); |
416 |
|
} |
417 |
|
|
470 |
– |
|
418 |
|
/** |
419 |
|
* peek returns next element, or null if empty |
420 |
|
*/ |
464 |
|
public void testRemoveElement() { |
465 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
466 |
|
for (int i = 1; i < SIZE; i+=2) { |
467 |
< |
assertTrue(q.remove(new Integer(i))); |
467 |
> |
assertTrue(q.contains(i)); |
468 |
> |
assertTrue(q.remove(i)); |
469 |
> |
assertFalse(q.contains(i)); |
470 |
> |
assertTrue(q.contains(i-1)); |
471 |
|
} |
472 |
|
for (int i = 0; i < SIZE; i+=2) { |
473 |
< |
assertTrue(q.remove(new Integer(i))); |
474 |
< |
assertFalse(q.remove(new Integer(i+1))); |
473 |
> |
assertTrue(q.contains(i)); |
474 |
> |
assertTrue(q.remove(i)); |
475 |
> |
assertFalse(q.contains(i)); |
476 |
> |
assertFalse(q.remove(i+1)); |
477 |
> |
assertFalse(q.contains(i+1)); |
478 |
|
} |
479 |
|
assertTrue(q.isEmpty()); |
480 |
|
} |
556 |
|
} |
557 |
|
|
558 |
|
/** |
559 |
< |
* toArray contains all elements |
559 |
> |
* toArray contains all elements |
560 |
|
*/ |
561 |
|
public void testToArray() throws InterruptedException { |
562 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
563 |
|
Object[] o = q.toArray(); |
564 |
|
Arrays.sort(o); |
565 |
|
for (int i = 0; i < o.length; i++) |
566 |
< |
assertEquals(o[i], q.take()); |
566 |
> |
assertSame(o[i], q.take()); |
567 |
|
} |
568 |
|
|
569 |
|
/** |
570 |
|
* toArray(a) contains all elements |
571 |
|
*/ |
572 |
|
public void testToArray2() throws InterruptedException { |
573 |
< |
PriorityBlockingQueue q = populatedQueue(SIZE); |
573 |
> |
PriorityBlockingQueue<Integer> q = populatedQueue(SIZE); |
574 |
|
Integer[] ints = new Integer[SIZE]; |
575 |
< |
ints = (Integer[])q.toArray(ints); |
575 |
> |
Integer[] array = q.toArray(ints); |
576 |
> |
assertSame(ints, array); |
577 |
|
Arrays.sort(ints); |
578 |
|
for (int i = 0; i < ints.length; i++) |
579 |
< |
assertEquals(ints[i], q.take()); |
626 |
< |
} |
627 |
< |
|
628 |
< |
/** |
629 |
< |
* toArray(null) throws NPE |
630 |
< |
*/ |
631 |
< |
public void testToArray_BadArg() { |
632 |
< |
PriorityBlockingQueue q = populatedQueue(SIZE); |
633 |
< |
try { |
634 |
< |
Object o[] = q.toArray(null); |
635 |
< |
shouldThrow(); |
636 |
< |
} catch (NullPointerException success) {} |
579 |
> |
assertSame(ints[i], q.take()); |
580 |
|
} |
581 |
|
|
582 |
|
/** |
583 |
< |
* toArray with incompatible array type throws CCE |
583 |
> |
* toArray(incompatible array type) throws ArrayStoreException |
584 |
|
*/ |
585 |
|
public void testToArray1_BadArg() { |
586 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
587 |
|
try { |
588 |
< |
Object o[] = q.toArray(new String[10]); |
588 |
> |
q.toArray(new String[10]); |
589 |
|
shouldThrow(); |
590 |
|
} catch (ArrayStoreException success) {} |
591 |
|
} |
623 |
|
assertFalse(it.hasNext()); |
624 |
|
} |
625 |
|
|
683 |
– |
|
626 |
|
/** |
627 |
|
* toString contains toStrings of elements |
628 |
|
*/ |
630 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
631 |
|
String s = q.toString(); |
632 |
|
for (int i = 0; i < SIZE; ++i) { |
633 |
< |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
633 |
> |
assertTrue(s.contains(String.valueOf(i))); |
634 |
|
} |
635 |
|
} |
636 |
|
|
637 |
|
/** |
638 |
< |
* offer transfers elements across Executor tasks |
638 |
> |
* timed poll transfers elements across Executor tasks |
639 |
|
*/ |
640 |
|
public void testPollInExecutor() { |
641 |
|
final PriorityBlockingQueue q = new PriorityBlockingQueue(2); |
642 |
+ |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
643 |
|
ExecutorService executor = Executors.newFixedThreadPool(2); |
644 |
|
executor.execute(new CheckedRunnable() { |
645 |
|
public void realRun() throws InterruptedException { |
646 |
|
assertNull(q.poll()); |
647 |
< |
assertSame(one, q.poll(MEDIUM_DELAY_MS, MILLISECONDS)); |
648 |
< |
assertTrue(q.isEmpty()); |
647 |
> |
threadsStarted.await(); |
648 |
> |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
649 |
> |
checkEmpty(q); |
650 |
|
}}); |
651 |
|
|
652 |
|
executor.execute(new CheckedRunnable() { |
653 |
|
public void realRun() throws InterruptedException { |
654 |
< |
Thread.sleep(SMALL_DELAY_MS); |
654 |
> |
threadsStarted.await(); |
655 |
|
q.put(one); |
656 |
|
}}); |
657 |
|
|
677 |
|
} |
678 |
|
|
679 |
|
/** |
736 |
– |
* drainTo(null) throws NPE |
737 |
– |
*/ |
738 |
– |
public void testDrainToNull() { |
739 |
– |
PriorityBlockingQueue q = populatedQueue(SIZE); |
740 |
– |
try { |
741 |
– |
q.drainTo(null); |
742 |
– |
shouldThrow(); |
743 |
– |
} catch (NullPointerException success) {} |
744 |
– |
} |
745 |
– |
|
746 |
– |
/** |
747 |
– |
* drainTo(this) throws IAE |
748 |
– |
*/ |
749 |
– |
public void testDrainToSelf() { |
750 |
– |
PriorityBlockingQueue q = populatedQueue(SIZE); |
751 |
– |
try { |
752 |
– |
q.drainTo(q); |
753 |
– |
shouldThrow(); |
754 |
– |
} catch (IllegalArgumentException success) {} |
755 |
– |
} |
756 |
– |
|
757 |
– |
/** |
680 |
|
* drainTo(c) empties queue into another collection c |
681 |
|
*/ |
682 |
|
public void testDrainTo() { |
721 |
|
} |
722 |
|
|
723 |
|
/** |
724 |
< |
* drainTo(null, n) throws NPE |
803 |
< |
*/ |
804 |
< |
public void testDrainToNullN() { |
805 |
< |
PriorityBlockingQueue q = populatedQueue(SIZE); |
806 |
< |
try { |
807 |
< |
q.drainTo(null, 0); |
808 |
< |
shouldThrow(); |
809 |
< |
} catch (NullPointerException success) {} |
810 |
< |
} |
811 |
< |
|
812 |
< |
/** |
813 |
< |
* drainTo(this, n) throws IAE |
814 |
< |
*/ |
815 |
< |
public void testDrainToSelfN() { |
816 |
< |
PriorityBlockingQueue q = populatedQueue(SIZE); |
817 |
< |
try { |
818 |
< |
q.drainTo(q, 0); |
819 |
< |
shouldThrow(); |
820 |
< |
} catch (IllegalArgumentException success) {} |
821 |
< |
} |
822 |
< |
|
823 |
< |
/** |
824 |
< |
* drainTo(c, n) empties first max {n, size} elements of queue into c |
724 |
> |
* drainTo(c, n) empties first min(n, size) elements of queue into c |
725 |
|
*/ |
726 |
|
public void testDrainToN() { |
727 |
|
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE*2); |
730 |
|
assertTrue(q.offer(new Integer(j))); |
731 |
|
ArrayList l = new ArrayList(); |
732 |
|
q.drainTo(l, i); |
733 |
< |
int k = (i < SIZE)? i : SIZE; |
733 |
> |
int k = (i < SIZE) ? i : SIZE; |
734 |
|
assertEquals(l.size(), k); |
735 |
|
assertEquals(q.size(), SIZE-k); |
736 |
|
for (int j = 0; j < k; ++j) |