6 |
|
* Pat Fisher, Mike Judd. |
7 |
|
*/ |
8 |
|
|
9 |
– |
import junit.framework.*; |
10 |
– |
import java.util.*; |
11 |
– |
import java.util.concurrent.*; |
9 |
|
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
10 |
< |
import java.io.*; |
10 |
> |
|
11 |
> |
import java.util.ArrayList; |
12 |
> |
import java.util.Arrays; |
13 |
> |
import java.util.Collection; |
14 |
> |
import java.util.Iterator; |
15 |
> |
import java.util.NoSuchElementException; |
16 |
> |
import java.util.Queue; |
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 java.util.concurrent.LinkedBlockingQueue; |
22 |
> |
|
23 |
> |
import junit.framework.Test; |
24 |
|
|
25 |
|
public class LinkedBlockingQueueTest extends JSR166TestCase { |
26 |
|
|
32 |
|
|
33 |
|
public static class Bounded extends BlockingQueueTest { |
34 |
|
protected BlockingQueue emptyCollection() { |
35 |
< |
return new LinkedBlockingQueue(20); |
35 |
> |
return new LinkedBlockingQueue(SIZE); |
36 |
|
} |
37 |
|
} |
38 |
|
|
39 |
|
public static void main(String[] args) { |
40 |
< |
junit.textui.TestRunner.run(suite()); |
40 |
> |
main(suite(), args); |
41 |
|
} |
42 |
|
|
43 |
|
public static Test suite() { |
44 |
+ |
class Implementation implements CollectionImplementation { |
45 |
+ |
public Class<?> klazz() { return LinkedBlockingQueue.class; } |
46 |
+ |
public Collection emptyCollection() { return new LinkedBlockingQueue(); } |
47 |
+ |
public Object makeElement(int i) { return i; } |
48 |
+ |
public boolean isConcurrent() { return true; } |
49 |
+ |
public boolean permitsNulls() { return false; } |
50 |
+ |
} |
51 |
|
return newTestSuite(LinkedBlockingQueueTest.class, |
52 |
|
new Unbounded().testSuite(), |
53 |
< |
new Bounded().testSuite()); |
53 |
> |
new Bounded().testSuite(), |
54 |
> |
CollectionTest.testSuite(new Implementation())); |
55 |
|
} |
56 |
|
|
57 |
|
/** |
58 |
< |
* Create a queue of given size containing consecutive |
59 |
< |
* Integers 0 ... n. |
58 |
> |
* Returns a new queue of given size containing consecutive |
59 |
> |
* Integers 0 ... n - 1. |
60 |
|
*/ |
61 |
< |
private LinkedBlockingQueue<Integer> populatedQueue(int n) { |
61 |
> |
private static LinkedBlockingQueue<Integer> populatedQueue(int n) { |
62 |
|
LinkedBlockingQueue<Integer> q = |
63 |
|
new LinkedBlockingQueue<Integer>(n); |
64 |
|
assertTrue(q.isEmpty()); |
67 |
|
assertFalse(q.isEmpty()); |
68 |
|
assertEquals(0, q.remainingCapacity()); |
69 |
|
assertEquals(n, q.size()); |
70 |
+ |
assertEquals((Integer) 0, q.peek()); |
71 |
|
return q; |
72 |
|
} |
73 |
|
|
81 |
|
} |
82 |
|
|
83 |
|
/** |
84 |
< |
* Constructor throws IAE if capacity argument nonpositive |
84 |
> |
* Constructor throws IllegalArgumentException if capacity argument nonpositive |
85 |
|
*/ |
86 |
|
public void testConstructor2() { |
87 |
|
try { |
88 |
< |
LinkedBlockingQueue q = new LinkedBlockingQueue(0); |
88 |
> |
new LinkedBlockingQueue(0); |
89 |
|
shouldThrow(); |
90 |
|
} catch (IllegalArgumentException success) {} |
91 |
|
} |
92 |
|
|
93 |
|
/** |
94 |
< |
* Initializing from null Collection throws NPE |
94 |
> |
* Initializing from null Collection throws NullPointerException |
95 |
|
*/ |
96 |
|
public void testConstructor3() { |
97 |
|
try { |
98 |
< |
LinkedBlockingQueue q = new LinkedBlockingQueue(null); |
98 |
> |
new LinkedBlockingQueue(null); |
99 |
|
shouldThrow(); |
100 |
|
} catch (NullPointerException success) {} |
101 |
|
} |
102 |
|
|
103 |
|
/** |
104 |
< |
* Initializing from Collection of null elements throws NPE |
104 |
> |
* Initializing from Collection of null elements throws NullPointerException |
105 |
|
*/ |
106 |
|
public void testConstructor4() { |
107 |
+ |
Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); |
108 |
|
try { |
109 |
< |
Integer[] ints = new Integer[SIZE]; |
90 |
< |
LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints)); |
109 |
> |
new LinkedBlockingQueue(elements); |
110 |
|
shouldThrow(); |
111 |
|
} catch (NullPointerException success) {} |
112 |
|
} |
113 |
|
|
114 |
|
/** |
115 |
< |
* Initializing from Collection with some null elements throws NPE |
115 |
> |
* Initializing from Collection with some null elements throws |
116 |
> |
* NullPointerException |
117 |
|
*/ |
118 |
|
public void testConstructor5() { |
119 |
+ |
Integer[] ints = new Integer[SIZE]; |
120 |
+ |
for (int i = 0; i < SIZE - 1; ++i) |
121 |
+ |
ints[i] = new Integer(i); |
122 |
+ |
Collection<Integer> elements = Arrays.asList(ints); |
123 |
|
try { |
124 |
< |
Integer[] ints = new Integer[SIZE]; |
101 |
< |
for (int i = 0; i < SIZE-1; ++i) |
102 |
< |
ints[i] = new Integer(i); |
103 |
< |
LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints)); |
124 |
> |
new LinkedBlockingQueue(elements); |
125 |
|
shouldThrow(); |
126 |
|
} catch (NullPointerException success) {} |
127 |
|
} |
157 |
|
* remainingCapacity decreases on add, increases on remove |
158 |
|
*/ |
159 |
|
public void testRemainingCapacity() { |
160 |
< |
LinkedBlockingQueue q = populatedQueue(SIZE); |
160 |
> |
BlockingQueue q = populatedQueue(SIZE); |
161 |
|
for (int i = 0; i < SIZE; ++i) { |
162 |
|
assertEquals(i, q.remainingCapacity()); |
163 |
< |
assertEquals(SIZE-i, q.size()); |
164 |
< |
q.remove(); |
163 |
> |
assertEquals(SIZE, q.size() + q.remainingCapacity()); |
164 |
> |
assertEquals(i, q.remove()); |
165 |
|
} |
166 |
|
for (int i = 0; i < SIZE; ++i) { |
167 |
< |
assertEquals(SIZE-i, q.remainingCapacity()); |
168 |
< |
assertEquals(i, q.size()); |
169 |
< |
q.add(new Integer(i)); |
167 |
> |
assertEquals(SIZE - i, q.remainingCapacity()); |
168 |
> |
assertEquals(SIZE, q.size() + q.remainingCapacity()); |
169 |
> |
assertTrue(q.add(i)); |
170 |
|
} |
171 |
|
} |
172 |
|
|
173 |
|
/** |
153 |
– |
* offer(null) throws NPE |
154 |
– |
*/ |
155 |
– |
public void testOfferNull() { |
156 |
– |
try { |
157 |
– |
LinkedBlockingQueue q = new LinkedBlockingQueue(1); |
158 |
– |
q.offer(null); |
159 |
– |
shouldThrow(); |
160 |
– |
} catch (NullPointerException success) {} |
161 |
– |
} |
162 |
– |
|
163 |
– |
/** |
164 |
– |
* add(null) throws NPE |
165 |
– |
*/ |
166 |
– |
public void testAddNull() { |
167 |
– |
try { |
168 |
– |
LinkedBlockingQueue q = new LinkedBlockingQueue(1); |
169 |
– |
q.add(null); |
170 |
– |
shouldThrow(); |
171 |
– |
} catch (NullPointerException success) {} |
172 |
– |
} |
173 |
– |
|
174 |
– |
/** |
174 |
|
* Offer succeeds if not full; fails if full |
175 |
|
*/ |
176 |
|
public void testOffer() { |
180 |
|
} |
181 |
|
|
182 |
|
/** |
183 |
< |
* add succeeds if not full; throws ISE if full |
183 |
> |
* add succeeds if not full; throws IllegalStateException if full |
184 |
|
*/ |
185 |
|
public void testAdd() { |
186 |
+ |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
187 |
+ |
for (int i = 0; i < SIZE; ++i) |
188 |
+ |
assertTrue(q.add(new Integer(i))); |
189 |
+ |
assertEquals(0, q.remainingCapacity()); |
190 |
|
try { |
188 |
– |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
189 |
– |
for (int i = 0; i < SIZE; ++i) { |
190 |
– |
assertTrue(q.add(new Integer(i))); |
191 |
– |
} |
192 |
– |
assertEquals(0, q.remainingCapacity()); |
191 |
|
q.add(new Integer(SIZE)); |
192 |
|
shouldThrow(); |
193 |
|
} catch (IllegalStateException success) {} |
194 |
|
} |
195 |
|
|
196 |
|
/** |
197 |
< |
* addAll(null) throws NPE |
200 |
< |
*/ |
201 |
< |
public void testAddAll1() { |
202 |
< |
try { |
203 |
< |
LinkedBlockingQueue q = new LinkedBlockingQueue(1); |
204 |
< |
q.addAll(null); |
205 |
< |
shouldThrow(); |
206 |
< |
} catch (NullPointerException success) {} |
207 |
< |
} |
208 |
< |
|
209 |
< |
/** |
210 |
< |
* addAll(this) throws IAE |
197 |
> |
* addAll(this) throws IllegalArgumentException |
198 |
|
*/ |
199 |
|
public void testAddAllSelf() { |
200 |
+ |
LinkedBlockingQueue q = populatedQueue(SIZE); |
201 |
|
try { |
214 |
– |
LinkedBlockingQueue q = populatedQueue(SIZE); |
202 |
|
q.addAll(q); |
203 |
|
shouldThrow(); |
204 |
|
} catch (IllegalArgumentException success) {} |
205 |
|
} |
206 |
|
|
207 |
|
/** |
221 |
– |
* addAll of a collection with null elements throws NPE |
222 |
– |
*/ |
223 |
– |
public void testAddAll2() { |
224 |
– |
try { |
225 |
– |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
226 |
– |
Integer[] ints = new Integer[SIZE]; |
227 |
– |
q.addAll(Arrays.asList(ints)); |
228 |
– |
shouldThrow(); |
229 |
– |
} catch (NullPointerException success) {} |
230 |
– |
} |
231 |
– |
|
232 |
– |
/** |
208 |
|
* addAll of a collection with any null elements throws NPE after |
209 |
|
* possibly adding some elements |
210 |
|
*/ |
211 |
|
public void testAddAll3() { |
212 |
+ |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
213 |
+ |
Integer[] ints = new Integer[SIZE]; |
214 |
+ |
for (int i = 0; i < SIZE - 1; ++i) |
215 |
+ |
ints[i] = new Integer(i); |
216 |
+ |
Collection<Integer> elements = Arrays.asList(ints); |
217 |
|
try { |
218 |
< |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
239 |
< |
Integer[] ints = new Integer[SIZE]; |
240 |
< |
for (int i = 0; i < SIZE-1; ++i) |
241 |
< |
ints[i] = new Integer(i); |
242 |
< |
q.addAll(Arrays.asList(ints)); |
218 |
> |
q.addAll(elements); |
219 |
|
shouldThrow(); |
220 |
|
} catch (NullPointerException success) {} |
221 |
|
} |
222 |
|
|
223 |
|
/** |
224 |
< |
* addAll throws ISE if not enough room |
224 |
> |
* addAll throws IllegalStateException if not enough room |
225 |
|
*/ |
226 |
|
public void testAddAll4() { |
227 |
+ |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE - 1); |
228 |
+ |
Integer[] ints = new Integer[SIZE]; |
229 |
+ |
for (int i = 0; i < SIZE; ++i) |
230 |
+ |
ints[i] = new Integer(i); |
231 |
+ |
Collection<Integer> elements = Arrays.asList(ints); |
232 |
|
try { |
233 |
< |
LinkedBlockingQueue q = new LinkedBlockingQueue(1); |
253 |
< |
Integer[] ints = new Integer[SIZE]; |
254 |
< |
for (int i = 0; i < SIZE; ++i) |
255 |
< |
ints[i] = new Integer(i); |
256 |
< |
q.addAll(Arrays.asList(ints)); |
233 |
> |
q.addAll(elements); |
234 |
|
shouldThrow(); |
235 |
|
} catch (IllegalStateException success) {} |
236 |
|
} |
251 |
|
} |
252 |
|
|
253 |
|
/** |
277 |
– |
* put(null) throws NPE |
278 |
– |
*/ |
279 |
– |
public void testPutNull() throws InterruptedException { |
280 |
– |
try { |
281 |
– |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
282 |
– |
q.put(null); |
283 |
– |
shouldThrow(); |
284 |
– |
} catch (NullPointerException success) {} |
285 |
– |
} |
286 |
– |
|
287 |
– |
/** |
254 |
|
* all elements successfully put are contained |
255 |
|
*/ |
256 |
|
public void testPut() throws InterruptedException { |
257 |
|
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
258 |
|
for (int i = 0; i < SIZE; ++i) { |
259 |
< |
Integer I = new Integer(i); |
260 |
< |
q.put(I); |
261 |
< |
assertTrue(q.contains(I)); |
259 |
> |
Integer x = new Integer(i); |
260 |
> |
q.put(x); |
261 |
> |
assertTrue(q.contains(x)); |
262 |
|
} |
263 |
|
assertEquals(0, q.remainingCapacity()); |
264 |
|
} |
292 |
|
}}); |
293 |
|
|
294 |
|
await(pleaseInterrupt); |
295 |
< |
assertThreadStaysAlive(t); |
295 |
> |
assertThreadBlocks(t, Thread.State.WAITING); |
296 |
|
t.interrupt(); |
297 |
|
awaitTermination(t); |
298 |
|
assertEquals(SIZE, q.size()); |
323 |
|
}}); |
324 |
|
|
325 |
|
await(pleaseTake); |
326 |
< |
assertEquals(q.remainingCapacity(), 0); |
326 |
> |
assertEquals(0, q.remainingCapacity()); |
327 |
|
assertEquals(0, q.take()); |
328 |
|
|
329 |
|
await(pleaseInterrupt); |
330 |
< |
assertThreadStaysAlive(t); |
330 |
> |
assertThreadBlocks(t, Thread.State.WAITING); |
331 |
|
t.interrupt(); |
332 |
|
awaitTermination(t); |
333 |
< |
assertEquals(q.remainingCapacity(), 0); |
333 |
> |
assertEquals(0, q.remainingCapacity()); |
334 |
|
} |
335 |
|
|
336 |
|
/** |
351 |
|
q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS); |
352 |
|
shouldThrow(); |
353 |
|
} catch (InterruptedException success) {} |
354 |
+ |
assertFalse(Thread.interrupted()); |
355 |
|
}}); |
356 |
|
|
357 |
|
await(pleaseInterrupt); |
358 |
< |
assertThreadStaysAlive(t); |
358 |
> |
assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
359 |
|
t.interrupt(); |
360 |
|
awaitTermination(t); |
361 |
|
} |
378 |
|
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
379 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
380 |
|
public void realRun() throws InterruptedException { |
381 |
< |
for (int i = 0; i < SIZE; ++i) { |
415 |
< |
assertEquals(i, q.take()); |
416 |
< |
} |
381 |
> |
for (int i = 0; i < SIZE; i++) assertEquals(i, q.take()); |
382 |
|
|
383 |
|
Thread.currentThread().interrupt(); |
384 |
|
try { |
396 |
|
}}); |
397 |
|
|
398 |
|
await(pleaseInterrupt); |
399 |
< |
assertThreadStaysAlive(t); |
399 |
> |
assertThreadBlocks(t, Thread.State.WAITING); |
400 |
|
t.interrupt(); |
401 |
|
awaitTermination(t); |
402 |
|
} |
445 |
|
*/ |
446 |
|
public void testInterruptedTimedPoll() throws InterruptedException { |
447 |
|
final BlockingQueue<Integer> q = populatedQueue(SIZE); |
448 |
< |
final CountDownLatch aboutToWait = new CountDownLatch(1); |
448 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
449 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
450 |
|
public void realRun() throws InterruptedException { |
451 |
< |
for (int i = 0; i < SIZE; ++i) { |
452 |
< |
long t0 = System.nanoTime(); |
451 |
> |
long startTime = System.nanoTime(); |
452 |
> |
for (int i = 0; i < SIZE; i++) |
453 |
|
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
454 |
< |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
455 |
< |
} |
456 |
< |
long t0 = System.nanoTime(); |
457 |
< |
aboutToWait.countDown(); |
454 |
> |
|
455 |
> |
Thread.currentThread().interrupt(); |
456 |
> |
try { |
457 |
> |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
458 |
> |
shouldThrow(); |
459 |
> |
} catch (InterruptedException success) {} |
460 |
> |
assertFalse(Thread.interrupted()); |
461 |
> |
|
462 |
> |
pleaseInterrupt.countDown(); |
463 |
|
try { |
464 |
< |
q.poll(MEDIUM_DELAY_MS, MILLISECONDS); |
464 |
> |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
465 |
|
shouldThrow(); |
466 |
< |
} catch (InterruptedException success) { |
467 |
< |
assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS); |
468 |
< |
} |
466 |
> |
} catch (InterruptedException success) {} |
467 |
> |
assertFalse(Thread.interrupted()); |
468 |
> |
|
469 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
470 |
|
}}); |
471 |
|
|
472 |
< |
aboutToWait.await(); |
473 |
< |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
472 |
> |
await(pleaseInterrupt); |
473 |
> |
assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
474 |
|
t.interrupt(); |
475 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
475 |
> |
awaitTermination(t); |
476 |
|
checkEmpty(q); |
477 |
|
} |
478 |
|
|
520 |
|
} |
521 |
|
|
522 |
|
/** |
552 |
– |
* remove(x) removes x and returns true if present |
553 |
– |
*/ |
554 |
– |
public void testRemoveElement() { |
555 |
– |
LinkedBlockingQueue q = populatedQueue(SIZE); |
556 |
– |
for (int i = 1; i < SIZE; i+=2) { |
557 |
– |
assertTrue(q.contains(i)); |
558 |
– |
assertTrue(q.remove(i)); |
559 |
– |
assertFalse(q.contains(i)); |
560 |
– |
assertTrue(q.contains(i-1)); |
561 |
– |
} |
562 |
– |
for (int i = 0; i < SIZE; i+=2) { |
563 |
– |
assertTrue(q.contains(i)); |
564 |
– |
assertTrue(q.remove(i)); |
565 |
– |
assertFalse(q.contains(i)); |
566 |
– |
assertFalse(q.remove(i+1)); |
567 |
– |
assertFalse(q.contains(i+1)); |
568 |
– |
} |
569 |
– |
assertTrue(q.isEmpty()); |
570 |
– |
} |
571 |
– |
|
572 |
– |
/** |
523 |
|
* An add following remove(x) succeeds |
524 |
|
*/ |
525 |
|
public void testRemoveElementAndAdd() throws InterruptedException { |
529 |
|
assertTrue(q.remove(new Integer(1))); |
530 |
|
assertTrue(q.remove(new Integer(2))); |
531 |
|
assertTrue(q.add(new Integer(3))); |
532 |
< |
assertTrue(q.take() != null); |
532 |
> |
assertNotNull(q.take()); |
533 |
|
} |
534 |
|
|
535 |
|
/** |
588 |
|
assertTrue(changed); |
589 |
|
|
590 |
|
assertTrue(q.containsAll(p)); |
591 |
< |
assertEquals(SIZE-i, q.size()); |
591 |
> |
assertEquals(SIZE - i, q.size()); |
592 |
|
p.remove(); |
593 |
|
} |
594 |
|
} |
601 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
602 |
|
LinkedBlockingQueue p = populatedQueue(i); |
603 |
|
assertTrue(q.removeAll(p)); |
604 |
< |
assertEquals(SIZE-i, q.size()); |
604 |
> |
assertEquals(SIZE - i, q.size()); |
605 |
|
for (int j = 0; j < i; ++j) { |
606 |
< |
Integer I = (Integer)(p.remove()); |
607 |
< |
assertFalse(q.contains(I)); |
606 |
> |
Integer x = (Integer)(p.remove()); |
607 |
> |
assertFalse(q.contains(x)); |
608 |
|
} |
609 |
|
} |
610 |
|
} |
632 |
|
} |
633 |
|
|
634 |
|
/** |
685 |
– |
* toArray(null) throws NullPointerException |
686 |
– |
*/ |
687 |
– |
public void testToArray_NullArg() { |
688 |
– |
LinkedBlockingQueue q = populatedQueue(SIZE); |
689 |
– |
try { |
690 |
– |
q.toArray(null); |
691 |
– |
shouldThrow(); |
692 |
– |
} catch (NullPointerException success) {} |
693 |
– |
} |
694 |
– |
|
695 |
– |
/** |
635 |
|
* toArray(incompatible array type) throws ArrayStoreException |
636 |
|
*/ |
637 |
|
public void testToArray1_BadArg() { |
648 |
|
public void testIterator() throws InterruptedException { |
649 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
650 |
|
Iterator it = q.iterator(); |
651 |
< |
while (it.hasNext()) { |
651 |
> |
int i; |
652 |
> |
for (i = 0; it.hasNext(); i++) |
653 |
> |
assertTrue(q.contains(it.next())); |
654 |
> |
assertEquals(i, SIZE); |
655 |
> |
assertIteratorExhausted(it); |
656 |
> |
|
657 |
> |
it = q.iterator(); |
658 |
> |
for (i = 0; it.hasNext(); i++) |
659 |
|
assertEquals(it.next(), q.take()); |
660 |
< |
} |
660 |
> |
assertEquals(i, SIZE); |
661 |
> |
assertIteratorExhausted(it); |
662 |
> |
} |
663 |
> |
|
664 |
> |
/** |
665 |
> |
* iterator of empty collection has no elements |
666 |
> |
*/ |
667 |
> |
public void testEmptyIterator() { |
668 |
> |
assertIteratorExhausted(new LinkedBlockingQueue().iterator()); |
669 |
|
} |
670 |
|
|
671 |
|
/** |
736 |
|
final LinkedBlockingQueue q = new LinkedBlockingQueue(2); |
737 |
|
q.add(one); |
738 |
|
q.add(two); |
785 |
– |
ExecutorService executor = Executors.newFixedThreadPool(2); |
739 |
|
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
740 |
< |
executor.execute(new CheckedRunnable() { |
741 |
< |
public void realRun() throws InterruptedException { |
742 |
< |
assertFalse(q.offer(three)); |
743 |
< |
threadsStarted.await(); |
744 |
< |
assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS)); |
745 |
< |
assertEquals(0, q.remainingCapacity()); |
746 |
< |
}}); |
747 |
< |
|
748 |
< |
executor.execute(new CheckedRunnable() { |
749 |
< |
public void realRun() throws InterruptedException { |
750 |
< |
threadsStarted.await(); |
751 |
< |
assertSame(one, q.take()); |
752 |
< |
}}); |
753 |
< |
|
754 |
< |
joinPool(executor); |
740 |
> |
final ExecutorService executor = Executors.newFixedThreadPool(2); |
741 |
> |
try (PoolCleaner cleaner = cleaner(executor)) { |
742 |
> |
executor.execute(new CheckedRunnable() { |
743 |
> |
public void realRun() throws InterruptedException { |
744 |
> |
assertFalse(q.offer(three)); |
745 |
> |
threadsStarted.await(); |
746 |
> |
assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS)); |
747 |
> |
assertEquals(0, q.remainingCapacity()); |
748 |
> |
}}); |
749 |
> |
|
750 |
> |
executor.execute(new CheckedRunnable() { |
751 |
> |
public void realRun() throws InterruptedException { |
752 |
> |
threadsStarted.await(); |
753 |
> |
assertSame(one, q.take()); |
754 |
> |
}}); |
755 |
> |
} |
756 |
|
} |
757 |
|
|
758 |
|
/** |
761 |
|
public void testPollInExecutor() { |
762 |
|
final LinkedBlockingQueue q = new LinkedBlockingQueue(2); |
763 |
|
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
764 |
< |
ExecutorService executor = Executors.newFixedThreadPool(2); |
765 |
< |
executor.execute(new CheckedRunnable() { |
766 |
< |
public void realRun() throws InterruptedException { |
767 |
< |
assertNull(q.poll()); |
768 |
< |
threadsStarted.await(); |
769 |
< |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
770 |
< |
checkEmpty(q); |
771 |
< |
}}); |
772 |
< |
|
773 |
< |
executor.execute(new CheckedRunnable() { |
774 |
< |
public void realRun() throws InterruptedException { |
775 |
< |
threadsStarted.await(); |
776 |
< |
q.put(one); |
777 |
< |
}}); |
778 |
< |
|
779 |
< |
joinPool(executor); |
764 |
> |
final ExecutorService executor = Executors.newFixedThreadPool(2); |
765 |
> |
try (PoolCleaner cleaner = cleaner(executor)) { |
766 |
> |
executor.execute(new CheckedRunnable() { |
767 |
> |
public void realRun() throws InterruptedException { |
768 |
> |
assertNull(q.poll()); |
769 |
> |
threadsStarted.await(); |
770 |
> |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
771 |
> |
checkEmpty(q); |
772 |
> |
}}); |
773 |
> |
|
774 |
> |
executor.execute(new CheckedRunnable() { |
775 |
> |
public void realRun() throws InterruptedException { |
776 |
> |
threadsStarted.await(); |
777 |
> |
q.put(one); |
778 |
> |
}}); |
779 |
> |
} |
780 |
|
} |
781 |
|
|
782 |
|
/** |
783 |
|
* A deserialized serialized queue has same elements in same order |
784 |
|
*/ |
785 |
|
public void testSerialization() throws Exception { |
786 |
< |
LinkedBlockingQueue q = populatedQueue(SIZE); |
787 |
< |
|
834 |
< |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
835 |
< |
ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout)); |
836 |
< |
out.writeObject(q); |
837 |
< |
out.close(); |
838 |
< |
|
839 |
< |
ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray()); |
840 |
< |
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); |
841 |
< |
LinkedBlockingQueue r = (LinkedBlockingQueue)in.readObject(); |
842 |
< |
assertEquals(q.size(), r.size()); |
843 |
< |
while (!q.isEmpty()) |
844 |
< |
assertEquals(q.remove(), r.remove()); |
845 |
< |
} |
846 |
< |
|
847 |
< |
/** |
848 |
< |
* drainTo(null) throws NPE |
849 |
< |
*/ |
850 |
< |
public void testDrainToNull() { |
851 |
< |
LinkedBlockingQueue q = populatedQueue(SIZE); |
852 |
< |
try { |
853 |
< |
q.drainTo(null); |
854 |
< |
shouldThrow(); |
855 |
< |
} catch (NullPointerException success) {} |
856 |
< |
} |
786 |
> |
Queue x = populatedQueue(SIZE); |
787 |
> |
Queue y = serialClone(x); |
788 |
|
|
789 |
< |
/** |
790 |
< |
* drainTo(this) throws IAE |
791 |
< |
*/ |
792 |
< |
public void testDrainToSelf() { |
793 |
< |
LinkedBlockingQueue q = populatedQueue(SIZE); |
794 |
< |
try { |
795 |
< |
q.drainTo(q); |
796 |
< |
shouldThrow(); |
797 |
< |
} catch (IllegalArgumentException success) {} |
789 |
> |
assertNotSame(x, y); |
790 |
> |
assertEquals(x.size(), y.size()); |
791 |
> |
assertEquals(x.toString(), y.toString()); |
792 |
> |
assertTrue(Arrays.equals(x.toArray(), y.toArray())); |
793 |
> |
while (!x.isEmpty()) { |
794 |
> |
assertFalse(y.isEmpty()); |
795 |
> |
assertEquals(x.remove(), y.remove()); |
796 |
> |
} |
797 |
> |
assertTrue(y.isEmpty()); |
798 |
|
} |
799 |
|
|
800 |
|
/** |
804 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
805 |
|
ArrayList l = new ArrayList(); |
806 |
|
q.drainTo(l); |
807 |
< |
assertEquals(q.size(), 0); |
808 |
< |
assertEquals(l.size(), SIZE); |
807 |
> |
assertEquals(0, q.size()); |
808 |
> |
assertEquals(SIZE, l.size()); |
809 |
|
for (int i = 0; i < SIZE; ++i) |
810 |
|
assertEquals(l.get(i), new Integer(i)); |
811 |
|
q.add(zero); |
815 |
|
assertTrue(q.contains(one)); |
816 |
|
l.clear(); |
817 |
|
q.drainTo(l); |
818 |
< |
assertEquals(q.size(), 0); |
819 |
< |
assertEquals(l.size(), 2); |
818 |
> |
assertEquals(0, q.size()); |
819 |
> |
assertEquals(2, l.size()); |
820 |
|
for (int i = 0; i < 2; ++i) |
821 |
|
assertEquals(l.get(i), new Integer(i)); |
822 |
|
} |
828 |
|
final LinkedBlockingQueue q = populatedQueue(SIZE); |
829 |
|
Thread t = new Thread(new CheckedRunnable() { |
830 |
|
public void realRun() throws InterruptedException { |
831 |
< |
q.put(new Integer(SIZE+1)); |
831 |
> |
q.put(new Integer(SIZE + 1)); |
832 |
|
}}); |
833 |
|
|
834 |
|
t.start(); |
842 |
|
} |
843 |
|
|
844 |
|
/** |
914 |
– |
* drainTo(null, n) throws NPE |
915 |
– |
*/ |
916 |
– |
public void testDrainToNullN() { |
917 |
– |
LinkedBlockingQueue q = populatedQueue(SIZE); |
918 |
– |
try { |
919 |
– |
q.drainTo(null, 0); |
920 |
– |
shouldThrow(); |
921 |
– |
} catch (NullPointerException success) {} |
922 |
– |
} |
923 |
– |
|
924 |
– |
/** |
925 |
– |
* drainTo(this, n) throws IAE |
926 |
– |
*/ |
927 |
– |
public void testDrainToSelfN() { |
928 |
– |
LinkedBlockingQueue q = populatedQueue(SIZE); |
929 |
– |
try { |
930 |
– |
q.drainTo(q, 0); |
931 |
– |
shouldThrow(); |
932 |
– |
} catch (IllegalArgumentException success) {} |
933 |
– |
} |
934 |
– |
|
935 |
– |
/** |
845 |
|
* drainTo(c, n) empties first min(n, size) elements of queue into c |
846 |
|
*/ |
847 |
|
public void testDrainToN() { |
852 |
|
ArrayList l = new ArrayList(); |
853 |
|
q.drainTo(l, i); |
854 |
|
int k = (i < SIZE) ? i : SIZE; |
855 |
< |
assertEquals(l.size(), k); |
856 |
< |
assertEquals(q.size(), SIZE-k); |
855 |
> |
assertEquals(k, l.size()); |
856 |
> |
assertEquals(SIZE - k, q.size()); |
857 |
|
for (int j = 0; j < k; ++j) |
858 |
|
assertEquals(l.get(j), new Integer(j)); |
859 |
< |
while (q.poll() != null) ; |
859 |
> |
do {} while (q.poll() != null); |
860 |
> |
} |
861 |
> |
} |
862 |
> |
|
863 |
> |
/** |
864 |
> |
* remove(null), contains(null) always return false |
865 |
> |
*/ |
866 |
> |
public void testNeverContainsNull() { |
867 |
> |
Collection<?>[] qs = { |
868 |
> |
new LinkedBlockingQueue<Object>(), |
869 |
> |
populatedQueue(2), |
870 |
> |
}; |
871 |
> |
|
872 |
> |
for (Collection<?> q : qs) { |
873 |
> |
assertFalse(q.contains(null)); |
874 |
> |
assertFalse(q.remove(null)); |
875 |
|
} |
876 |
|
} |
877 |
|
|