38 |
|
} |
39 |
|
|
40 |
|
public static void main(String[] args) { |
41 |
< |
junit.textui.TestRunner.run(suite()); |
41 |
> |
main(suite(), args); |
42 |
|
} |
43 |
|
|
44 |
|
public static Test suite() { |
45 |
+ |
class Implementation implements CollectionImplementation { |
46 |
+ |
public Class<?> klazz() { return PriorityBlockingQueue.class; } |
47 |
+ |
public Collection emptyCollection() { return new PriorityBlockingQueue(); } |
48 |
+ |
public Object makeElement(int i) { return i; } |
49 |
+ |
public boolean isConcurrent() { return true; } |
50 |
+ |
public boolean permitsNulls() { return false; } |
51 |
+ |
} |
52 |
|
return newTestSuite(PriorityBlockingQueueTest.class, |
53 |
|
new Generic().testSuite(), |
54 |
< |
new InitialCapacity().testSuite()); |
54 |
> |
new InitialCapacity().testSuite(), |
55 |
> |
CollectionTest.testSuite(new Implementation())); |
56 |
|
} |
57 |
|
|
50 |
– |
private static final int NOCAP = Integer.MAX_VALUE; |
51 |
– |
|
58 |
|
/** Sample Comparator */ |
59 |
|
static class MyReverseComparator implements Comparator { |
60 |
|
public int compare(Object x, Object y) { |
64 |
|
|
65 |
|
/** |
66 |
|
* Returns a new queue of given size containing consecutive |
67 |
< |
* Integers 0 ... n. |
67 |
> |
* Integers 0 ... n - 1. |
68 |
|
*/ |
69 |
< |
private PriorityBlockingQueue<Integer> populatedQueue(int n) { |
69 |
> |
private static PriorityBlockingQueue<Integer> populatedQueue(int n) { |
70 |
|
PriorityBlockingQueue<Integer> q = |
71 |
|
new PriorityBlockingQueue<Integer>(n); |
72 |
|
assertTrue(q.isEmpty()); |
73 |
< |
for (int i = n-1; i >= 0; i -= 2) |
73 |
> |
for (int i = n - 1; i >= 0; i -= 2) |
74 |
|
assertTrue(q.offer(new Integer(i))); |
75 |
|
for (int i = (n & 1); i < n; i += 2) |
76 |
|
assertTrue(q.offer(new Integer(i))); |
77 |
|
assertFalse(q.isEmpty()); |
78 |
< |
assertEquals(NOCAP, q.remainingCapacity()); |
78 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
79 |
|
assertEquals(n, q.size()); |
80 |
+ |
assertEquals((Integer) 0, q.peek()); |
81 |
|
return q; |
82 |
|
} |
83 |
|
|
85 |
|
* A new queue has unbounded capacity |
86 |
|
*/ |
87 |
|
public void testConstructor1() { |
88 |
< |
assertEquals(NOCAP, new PriorityBlockingQueue(SIZE).remainingCapacity()); |
88 |
> |
assertEquals(Integer.MAX_VALUE, |
89 |
> |
new PriorityBlockingQueue(SIZE).remainingCapacity()); |
90 |
|
} |
91 |
|
|
92 |
|
/** |
125 |
|
*/ |
126 |
|
public void testConstructor5() { |
127 |
|
Integer[] ints = new Integer[SIZE]; |
128 |
< |
for (int i = 0; i < SIZE-1; ++i) |
128 |
> |
for (int i = 0; i < SIZE - 1; ++i) |
129 |
|
ints[i] = i; |
130 |
|
Collection<Integer> elements = Arrays.asList(ints); |
131 |
|
try { |
157 |
|
for (int i = 0; i < SIZE; ++i) |
158 |
|
ints[i] = new Integer(i); |
159 |
|
q.addAll(Arrays.asList(ints)); |
160 |
< |
for (int i = SIZE-1; i >= 0; --i) |
160 |
> |
for (int i = SIZE - 1; i >= 0; --i) |
161 |
|
assertEquals(ints[i], q.poll()); |
162 |
|
} |
163 |
|
|
167 |
|
public void testEmpty() { |
168 |
|
PriorityBlockingQueue q = new PriorityBlockingQueue(2); |
169 |
|
assertTrue(q.isEmpty()); |
170 |
< |
assertEquals(NOCAP, q.remainingCapacity()); |
170 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
171 |
|
q.add(one); |
172 |
|
assertFalse(q.isEmpty()); |
173 |
|
q.add(two); |
177 |
|
} |
178 |
|
|
179 |
|
/** |
180 |
< |
* remainingCapacity does not change when elements added or removed, |
173 |
< |
* but size does |
180 |
> |
* remainingCapacity() always returns Integer.MAX_VALUE |
181 |
|
*/ |
182 |
|
public void testRemainingCapacity() { |
183 |
< |
PriorityBlockingQueue q = populatedQueue(SIZE); |
183 |
> |
BlockingQueue q = populatedQueue(SIZE); |
184 |
|
for (int i = 0; i < SIZE; ++i) { |
185 |
< |
assertEquals(NOCAP, q.remainingCapacity()); |
186 |
< |
assertEquals(SIZE-i, q.size()); |
187 |
< |
q.remove(); |
185 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
186 |
> |
assertEquals(SIZE - i, q.size()); |
187 |
> |
assertEquals(i, q.remove()); |
188 |
|
} |
189 |
|
for (int i = 0; i < SIZE; ++i) { |
190 |
< |
assertEquals(NOCAP, q.remainingCapacity()); |
190 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
191 |
|
assertEquals(i, q.size()); |
192 |
< |
q.add(new Integer(i)); |
192 |
> |
assertTrue(q.add(i)); |
193 |
|
} |
194 |
|
} |
195 |
|
|
206 |
|
* Offer of non-Comparable throws CCE |
207 |
|
*/ |
208 |
|
public void testOfferNonComparable() { |
209 |
+ |
PriorityBlockingQueue q = new PriorityBlockingQueue(1); |
210 |
|
try { |
203 |
– |
PriorityBlockingQueue q = new PriorityBlockingQueue(1); |
204 |
– |
q.offer(new Object()); |
205 |
– |
q.offer(new Object()); |
211 |
|
q.offer(new Object()); |
212 |
|
shouldThrow(); |
213 |
< |
} catch (ClassCastException success) {} |
213 |
> |
} catch (ClassCastException success) { |
214 |
> |
assertTrue(q.isEmpty()); |
215 |
> |
assertEquals(0, q.size()); |
216 |
> |
assertNull(q.poll()); |
217 |
> |
} |
218 |
|
} |
219 |
|
|
220 |
|
/** |
232 |
|
* addAll(this) throws IAE |
233 |
|
*/ |
234 |
|
public void testAddAllSelf() { |
235 |
+ |
PriorityBlockingQueue q = populatedQueue(SIZE); |
236 |
|
try { |
227 |
– |
PriorityBlockingQueue q = populatedQueue(SIZE); |
237 |
|
q.addAll(q); |
238 |
|
shouldThrow(); |
239 |
|
} catch (IllegalArgumentException success) {} |
244 |
|
* possibly adding some elements |
245 |
|
*/ |
246 |
|
public void testAddAll3() { |
247 |
+ |
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE); |
248 |
+ |
Integer[] ints = new Integer[SIZE]; |
249 |
+ |
for (int i = 0; i < SIZE - 1; ++i) |
250 |
+ |
ints[i] = new Integer(i); |
251 |
|
try { |
239 |
– |
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE); |
240 |
– |
Integer[] ints = new Integer[SIZE]; |
241 |
– |
for (int i = 0; i < SIZE-1; ++i) |
242 |
– |
ints[i] = new Integer(i); |
252 |
|
q.addAll(Arrays.asList(ints)); |
253 |
|
shouldThrow(); |
254 |
|
} catch (NullPointerException success) {} |
260 |
|
public void testAddAll5() { |
261 |
|
Integer[] empty = new Integer[0]; |
262 |
|
Integer[] ints = new Integer[SIZE]; |
263 |
< |
for (int i = SIZE-1; i >= 0; --i) |
263 |
> |
for (int i = SIZE - 1; i >= 0; --i) |
264 |
|
ints[i] = new Integer(i); |
265 |
|
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE); |
266 |
|
assertFalse(q.addAll(Arrays.asList(empty))); |
405 |
|
final CountDownLatch aboutToWait = new CountDownLatch(1); |
406 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
407 |
|
public void realRun() throws InterruptedException { |
408 |
+ |
long startTime = System.nanoTime(); |
409 |
|
for (int i = 0; i < SIZE; ++i) { |
400 |
– |
long t0 = System.nanoTime(); |
410 |
|
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
402 |
– |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
411 |
|
} |
404 |
– |
long t0 = System.nanoTime(); |
412 |
|
aboutToWait.countDown(); |
413 |
|
try { |
414 |
|
q.poll(LONG_DELAY_MS, MILLISECONDS); |
415 |
|
shouldThrow(); |
416 |
|
} catch (InterruptedException success) { |
417 |
< |
assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS); |
417 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
418 |
|
} |
419 |
|
}}); |
420 |
|
|
421 |
< |
aboutToWait.await(); |
422 |
< |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
421 |
> |
await(aboutToWait); |
422 |
> |
waitForThreadToEnterWaitState(t); |
423 |
|
t.interrupt(); |
424 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
424 |
> |
awaitTermination(t); |
425 |
|
} |
426 |
|
|
427 |
|
/** |
522 |
|
assertTrue(changed); |
523 |
|
|
524 |
|
assertTrue(q.containsAll(p)); |
525 |
< |
assertEquals(SIZE-i, q.size()); |
525 |
> |
assertEquals(SIZE - i, q.size()); |
526 |
|
p.remove(); |
527 |
|
} |
528 |
|
} |
535 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
536 |
|
PriorityBlockingQueue p = populatedQueue(i); |
537 |
|
assertTrue(q.removeAll(p)); |
538 |
< |
assertEquals(SIZE-i, q.size()); |
538 |
> |
assertEquals(SIZE - i, q.size()); |
539 |
|
for (int j = 0; j < i; ++j) { |
540 |
|
Integer x = (Integer)(p.remove()); |
541 |
|
assertFalse(q.contains(x)); |
583 |
|
*/ |
584 |
|
public void testIterator() { |
585 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
579 |
– |
int i = 0; |
586 |
|
Iterator it = q.iterator(); |
587 |
< |
while (it.hasNext()) { |
587 |
> |
int i; |
588 |
> |
for (i = 0; it.hasNext(); i++) |
589 |
|
assertTrue(q.contains(it.next())); |
583 |
– |
++i; |
584 |
– |
} |
590 |
|
assertEquals(i, SIZE); |
591 |
+ |
assertIteratorExhausted(it); |
592 |
+ |
} |
593 |
+ |
|
594 |
+ |
/** |
595 |
+ |
* iterator of empty collection has no elements |
596 |
+ |
*/ |
597 |
+ |
public void testEmptyIterator() { |
598 |
+ |
assertIteratorExhausted(new PriorityBlockingQueue().iterator()); |
599 |
|
} |
600 |
|
|
601 |
|
/** |
634 |
|
public void testPollInExecutor() { |
635 |
|
final PriorityBlockingQueue q = new PriorityBlockingQueue(2); |
636 |
|
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
637 |
< |
ExecutorService executor = Executors.newFixedThreadPool(2); |
638 |
< |
executor.execute(new CheckedRunnable() { |
639 |
< |
public void realRun() throws InterruptedException { |
640 |
< |
assertNull(q.poll()); |
641 |
< |
threadsStarted.await(); |
642 |
< |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
643 |
< |
checkEmpty(q); |
644 |
< |
}}); |
645 |
< |
|
646 |
< |
executor.execute(new CheckedRunnable() { |
647 |
< |
public void realRun() throws InterruptedException { |
648 |
< |
threadsStarted.await(); |
649 |
< |
q.put(one); |
650 |
< |
}}); |
651 |
< |
|
652 |
< |
joinPool(executor); |
637 |
> |
final ExecutorService executor = Executors.newFixedThreadPool(2); |
638 |
> |
try (PoolCleaner cleaner = cleaner(executor)) { |
639 |
> |
executor.execute(new CheckedRunnable() { |
640 |
> |
public void realRun() throws InterruptedException { |
641 |
> |
assertNull(q.poll()); |
642 |
> |
threadsStarted.await(); |
643 |
> |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
644 |
> |
checkEmpty(q); |
645 |
> |
}}); |
646 |
> |
|
647 |
> |
executor.execute(new CheckedRunnable() { |
648 |
> |
public void realRun() throws InterruptedException { |
649 |
> |
threadsStarted.await(); |
650 |
> |
q.put(one); |
651 |
> |
}}); |
652 |
> |
} |
653 |
|
} |
654 |
|
|
655 |
|
/** |
699 |
|
final PriorityBlockingQueue q = populatedQueue(SIZE); |
700 |
|
Thread t = new Thread(new CheckedRunnable() { |
701 |
|
public void realRun() { |
702 |
< |
q.put(new Integer(SIZE+1)); |
702 |
> |
q.put(new Integer(SIZE + 1)); |
703 |
|
}}); |
704 |
|
|
705 |
|
t.start(); |
716 |
|
* drainTo(c, n) empties first min(n, size) elements of queue into c |
717 |
|
*/ |
718 |
|
public void testDrainToN() { |
719 |
< |
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE*2); |
719 |
> |
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE * 2); |
720 |
|
for (int i = 0; i < SIZE + 2; ++i) { |
721 |
|
for (int j = 0; j < SIZE; j++) |
722 |
|
assertTrue(q.offer(new Integer(j))); |
724 |
|
q.drainTo(l, i); |
725 |
|
int k = (i < SIZE) ? i : SIZE; |
726 |
|
assertEquals(k, l.size()); |
727 |
< |
assertEquals(SIZE-k, q.size()); |
727 |
> |
assertEquals(SIZE - k, q.size()); |
728 |
|
for (int j = 0; j < k; ++j) |
729 |
|
assertEquals(l.get(j), new Integer(j)); |
730 |
|
do {} while (q.poll() != null); |