13 |
|
import java.io.*; |
14 |
|
|
15 |
|
public class PriorityBlockingQueueTest extends JSR166TestCase { |
16 |
+ |
|
17 |
+ |
public static class Generic extends BlockingQueueTest { |
18 |
+ |
protected BlockingQueue emptyCollection() { |
19 |
+ |
return new PriorityBlockingQueue(); |
20 |
+ |
} |
21 |
+ |
} |
22 |
+ |
|
23 |
+ |
public static class InitialCapacity extends BlockingQueueTest { |
24 |
+ |
protected BlockingQueue emptyCollection() { |
25 |
+ |
return new PriorityBlockingQueue(20); |
26 |
+ |
} |
27 |
+ |
} |
28 |
+ |
|
29 |
|
public static void main(String[] args) { |
30 |
|
junit.textui.TestRunner.run(suite()); |
31 |
|
} |
32 |
+ |
|
33 |
|
public static Test suite() { |
34 |
< |
return new TestSuite(PriorityBlockingQueueTest.class); |
34 |
> |
return newTestSuite(PriorityBlockingQueueTest.class, |
35 |
> |
new Generic().testSuite(), |
36 |
> |
new InitialCapacity().testSuite()); |
37 |
|
} |
38 |
|
|
39 |
|
private static final int NOCAP = Integer.MAX_VALUE; |
49 |
|
* Create a queue of given size containing consecutive |
50 |
|
* Integers 0 ... n. |
51 |
|
*/ |
52 |
< |
private PriorityBlockingQueue populatedQueue(int n) { |
53 |
< |
PriorityBlockingQueue q = new PriorityBlockingQueue(n); |
52 |
> |
private PriorityBlockingQueue<Integer> populatedQueue(int n) { |
53 |
> |
PriorityBlockingQueue<Integer> q = |
54 |
> |
new PriorityBlockingQueue<Integer>(n); |
55 |
|
assertTrue(q.isEmpty()); |
56 |
|
for (int i = n-1; i >= 0; i-=2) |
57 |
|
assertTrue(q.offer(new Integer(i))); |
367 |
|
} |
368 |
|
|
369 |
|
/** |
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 |
– |
/** |
370 |
|
* Take removes existing elements until empty, then blocks interruptibly |
371 |
|
*/ |
372 |
|
public void testBlockingTake() throws InterruptedException { |
401 |
|
} |
402 |
|
|
403 |
|
/** |
404 |
< |
* timed pool with zero timeout succeeds when non-empty, else times out |
404 |
> |
* timed poll with zero timeout succeeds when non-empty, else times out |
405 |
|
*/ |
406 |
|
public void testTimedPoll0() throws InterruptedException { |
407 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
412 |
|
} |
413 |
|
|
414 |
|
/** |
415 |
< |
* timed pool with nonzero timeout succeeds when non-empty, else times out |
415 |
> |
* timed poll with nonzero timeout succeeds when non-empty, else times out |
416 |
|
*/ |
417 |
|
public void testTimedPoll() throws InterruptedException { |
418 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
446 |
|
} |
447 |
|
|
448 |
|
/** |
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 |
– |
try { |
456 |
– |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
457 |
– |
assertSame(zero, q.poll(MEDIUM_DELAY_MS, MILLISECONDS)); |
458 |
– |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
459 |
– |
shouldThrow(); |
460 |
– |
} catch (InterruptedException success) {} |
461 |
– |
}}); |
462 |
– |
|
463 |
– |
t.start(); |
464 |
– |
Thread.sleep(SMALL_DELAY_MS); |
465 |
– |
assertTrue(q.offer(zero, SHORT_DELAY_MS, MILLISECONDS)); |
466 |
– |
t.interrupt(); |
467 |
– |
t.join(); |
468 |
– |
} |
469 |
– |
|
470 |
– |
|
471 |
– |
/** |
449 |
|
* peek returns next element, or null if empty |
450 |
|
*/ |
451 |
|
public void testPeek() { |
580 |
|
} |
581 |
|
|
582 |
|
/** |
583 |
< |
* toArray contains all elements |
583 |
> |
* toArray contains all elements |
584 |
|
*/ |
585 |
|
public void testToArray() throws InterruptedException { |
586 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
587 |
|
Object[] o = q.toArray(); |
588 |
|
Arrays.sort(o); |
589 |
|
for (int i = 0; i < o.length; i++) |
590 |
< |
assertEquals(o[i], q.take()); |
590 |
> |
assertSame(o[i], q.take()); |
591 |
|
} |
592 |
|
|
593 |
|
/** |
594 |
|
* toArray(a) contains all elements |
595 |
|
*/ |
596 |
|
public void testToArray2() throws InterruptedException { |
597 |
< |
PriorityBlockingQueue q = populatedQueue(SIZE); |
597 |
> |
PriorityBlockingQueue<Integer> q = populatedQueue(SIZE); |
598 |
|
Integer[] ints = new Integer[SIZE]; |
599 |
< |
ints = (Integer[])q.toArray(ints); |
599 |
> |
Integer[] array = q.toArray(ints); |
600 |
> |
assertSame(ints, array); |
601 |
|
Arrays.sort(ints); |
602 |
|
for (int i = 0; i < ints.length; i++) |
603 |
< |
assertEquals(ints[i], q.take()); |
603 |
> |
assertSame(ints[i], q.take()); |
604 |
|
} |
605 |
|
|
606 |
|
/** |
607 |
< |
* toArray(null) throws NPE |
607 |
> |
* toArray(null) throws NullPointerException |
608 |
|
*/ |
609 |
< |
public void testToArray_BadArg() { |
609 |
> |
public void testToArray_NullArg() { |
610 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
611 |
|
try { |
612 |
< |
Object o[] = q.toArray(null); |
612 |
> |
q.toArray(null); |
613 |
|
shouldThrow(); |
614 |
|
} catch (NullPointerException success) {} |
615 |
|
} |
616 |
|
|
617 |
|
/** |
618 |
< |
* toArray with incompatible array type throws CCE |
618 |
> |
* toArray(incompatible array type) throws ArrayStoreException |
619 |
|
*/ |
620 |
|
public void testToArray1_BadArg() { |
621 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
622 |
|
try { |
623 |
< |
Object o[] = q.toArray(new String[10]); |
623 |
> |
q.toArray(new String[10]); |
624 |
|
shouldThrow(); |
625 |
|
} catch (ArrayStoreException success) {} |
626 |
|
} |
799 |
|
} |
800 |
|
|
801 |
|
/** |
802 |
< |
* drainTo(c, n) empties first max {n, size} elements of queue into c |
802 |
> |
* drainTo(c, n) empties first min(n, size) elements of queue into c |
803 |
|
*/ |
804 |
|
public void testDrainToN() { |
805 |
|
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE*2); |
808 |
|
assertTrue(q.offer(new Integer(j))); |
809 |
|
ArrayList l = new ArrayList(); |
810 |
|
q.drainTo(l, i); |
811 |
< |
int k = (i < SIZE)? i : SIZE; |
811 |
> |
int k = (i < SIZE) ? i : SIZE; |
812 |
|
assertEquals(l.size(), k); |
813 |
|
assertEquals(q.size(), SIZE-k); |
814 |
|
for (int j = 0; j < k; ++j) |