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 |
5 |
< |
* Other contributors include Andrew Wright, Jeffrey Hayes, |
6 |
< |
* Pat Fisher, Mike Judd. |
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.*; |
12 |
< |
import java.io.*; |
9 |
> |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
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 |
|
|
27 |
+ |
public static class Unbounded extends BlockingQueueTest { |
28 |
+ |
protected BlockingQueue emptyCollection() { |
29 |
+ |
return new LinkedBlockingQueue(); |
30 |
+ |
} |
31 |
+ |
} |
32 |
+ |
|
33 |
+ |
public static class Bounded extends BlockingQueueTest { |
34 |
+ |
protected BlockingQueue emptyCollection() { |
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 |
< |
return new TestSuite(LinkedBlockingQueueTest.class); |
44 |
> |
return newTestSuite(LinkedBlockingQueueTest.class, |
45 |
> |
new Unbounded().testSuite(), |
46 |
> |
new Bounded().testSuite()); |
47 |
|
} |
48 |
|
|
24 |
– |
|
49 |
|
/** |
50 |
< |
* Create a queue of given size containing consecutive |
51 |
< |
* Integers 0 ... n. |
50 |
> |
* Returns a new queue of given size containing consecutive |
51 |
> |
* Integers 0 ... n - 1. |
52 |
|
*/ |
53 |
< |
private LinkedBlockingQueue populatedQueue(int n) { |
54 |
< |
LinkedBlockingQueue q = new LinkedBlockingQueue(n); |
53 |
> |
private LinkedBlockingQueue<Integer> populatedQueue(int n) { |
54 |
> |
LinkedBlockingQueue<Integer> q = |
55 |
> |
new LinkedBlockingQueue<Integer>(n); |
56 |
|
assertTrue(q.isEmpty()); |
57 |
< |
for(int i = 0; i < n; i++) |
58 |
< |
assertTrue(q.offer(new Integer(i))); |
57 |
> |
for (int i = 0; i < n; i++) |
58 |
> |
assertTrue(q.offer(new Integer(i))); |
59 |
|
assertFalse(q.isEmpty()); |
60 |
|
assertEquals(0, q.remainingCapacity()); |
61 |
< |
assertEquals(n, q.size()); |
61 |
> |
assertEquals(n, q.size()); |
62 |
> |
assertEquals((Integer) 0, q.peek()); |
63 |
|
return q; |
64 |
|
} |
65 |
< |
|
65 |
> |
|
66 |
|
/** |
67 |
|
* A new queue has the indicated capacity, or Integer.MAX_VALUE if |
68 |
|
* none given |
73 |
|
} |
74 |
|
|
75 |
|
/** |
76 |
< |
* Constructor throws IAE if capacity argument nonpositive |
76 |
> |
* Constructor throws IllegalArgumentException if capacity argument nonpositive |
77 |
|
*/ |
78 |
|
public void testConstructor2() { |
79 |
|
try { |
80 |
< |
LinkedBlockingQueue q = new LinkedBlockingQueue(0); |
80 |
> |
new LinkedBlockingQueue(0); |
81 |
|
shouldThrow(); |
82 |
< |
} |
57 |
< |
catch (IllegalArgumentException success) {} |
82 |
> |
} catch (IllegalArgumentException success) {} |
83 |
|
} |
84 |
|
|
85 |
|
/** |
86 |
< |
* Initializing from null Collection throws NPE |
86 |
> |
* Initializing from null Collection throws NullPointerException |
87 |
|
*/ |
88 |
|
public void testConstructor3() { |
89 |
|
try { |
90 |
< |
LinkedBlockingQueue q = new LinkedBlockingQueue(null); |
90 |
> |
new LinkedBlockingQueue(null); |
91 |
|
shouldThrow(); |
92 |
< |
} |
68 |
< |
catch (NullPointerException success) {} |
92 |
> |
} catch (NullPointerException success) {} |
93 |
|
} |
94 |
|
|
95 |
|
/** |
96 |
< |
* Initializing from Collection of null elements throws NPE |
96 |
> |
* Initializing from Collection of null elements throws NullPointerException |
97 |
|
*/ |
98 |
|
public void testConstructor4() { |
99 |
+ |
Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); |
100 |
|
try { |
101 |
< |
Integer[] ints = new Integer[SIZE]; |
77 |
< |
LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints)); |
101 |
> |
new LinkedBlockingQueue(elements); |
102 |
|
shouldThrow(); |
103 |
< |
} |
80 |
< |
catch (NullPointerException success) {} |
103 |
> |
} catch (NullPointerException success) {} |
104 |
|
} |
105 |
|
|
106 |
|
/** |
107 |
< |
* Initializing from Collection with some null elements throws NPE |
107 |
> |
* Initializing from Collection with some null elements throws |
108 |
> |
* NullPointerException |
109 |
|
*/ |
110 |
|
public void testConstructor5() { |
111 |
+ |
Integer[] ints = new Integer[SIZE]; |
112 |
+ |
for (int i = 0; i < SIZE - 1; ++i) |
113 |
+ |
ints[i] = new Integer(i); |
114 |
+ |
Collection<Integer> elements = Arrays.asList(ints); |
115 |
|
try { |
116 |
< |
Integer[] ints = new Integer[SIZE]; |
89 |
< |
for (int i = 0; i < SIZE-1; ++i) |
90 |
< |
ints[i] = new Integer(i); |
91 |
< |
LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints)); |
116 |
> |
new LinkedBlockingQueue(elements); |
117 |
|
shouldThrow(); |
118 |
< |
} |
94 |
< |
catch (NullPointerException success) {} |
118 |
> |
} catch (NullPointerException success) {} |
119 |
|
} |
120 |
|
|
121 |
|
/** |
122 |
|
* Queue contains all elements of collection used to initialize |
123 |
|
*/ |
124 |
|
public void testConstructor6() { |
125 |
< |
try { |
126 |
< |
Integer[] ints = new Integer[SIZE]; |
127 |
< |
for (int i = 0; i < SIZE; ++i) |
128 |
< |
ints[i] = new Integer(i); |
129 |
< |
LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints)); |
130 |
< |
for (int i = 0; i < SIZE; ++i) |
107 |
< |
assertEquals(ints[i], q.poll()); |
108 |
< |
} |
109 |
< |
finally {} |
125 |
> |
Integer[] ints = new Integer[SIZE]; |
126 |
> |
for (int i = 0; i < SIZE; ++i) |
127 |
> |
ints[i] = new Integer(i); |
128 |
> |
LinkedBlockingQueue q = new LinkedBlockingQueue(Arrays.asList(ints)); |
129 |
> |
for (int i = 0; i < SIZE; ++i) |
130 |
> |
assertEquals(ints[i], q.poll()); |
131 |
|
} |
132 |
|
|
133 |
|
/** |
149 |
|
* remainingCapacity decreases on add, increases on remove |
150 |
|
*/ |
151 |
|
public void testRemainingCapacity() { |
152 |
< |
LinkedBlockingQueue q = populatedQueue(SIZE); |
152 |
> |
BlockingQueue q = populatedQueue(SIZE); |
153 |
|
for (int i = 0; i < SIZE; ++i) { |
154 |
|
assertEquals(i, q.remainingCapacity()); |
155 |
< |
assertEquals(SIZE-i, q.size()); |
156 |
< |
q.remove(); |
155 |
> |
assertEquals(SIZE, q.size() + q.remainingCapacity()); |
156 |
> |
assertEquals(i, q.remove()); |
157 |
|
} |
158 |
|
for (int i = 0; i < SIZE; ++i) { |
159 |
< |
assertEquals(SIZE-i, q.remainingCapacity()); |
160 |
< |
assertEquals(i, q.size()); |
161 |
< |
q.add(new Integer(i)); |
159 |
> |
assertEquals(SIZE - i, q.remainingCapacity()); |
160 |
> |
assertEquals(SIZE, q.size() + q.remainingCapacity()); |
161 |
> |
assertTrue(q.add(i)); |
162 |
|
} |
163 |
|
} |
164 |
|
|
165 |
|
/** |
145 |
– |
* offer(null) throws NPE |
146 |
– |
*/ |
147 |
– |
public void testOfferNull() { |
148 |
– |
try { |
149 |
– |
LinkedBlockingQueue q = new LinkedBlockingQueue(1); |
150 |
– |
q.offer(null); |
151 |
– |
shouldThrow(); |
152 |
– |
} catch (NullPointerException success) { } |
153 |
– |
} |
154 |
– |
|
155 |
– |
/** |
156 |
– |
* add(null) throws NPE |
157 |
– |
*/ |
158 |
– |
public void testAddNull() { |
159 |
– |
try { |
160 |
– |
LinkedBlockingQueue q = new LinkedBlockingQueue(1); |
161 |
– |
q.add(null); |
162 |
– |
shouldThrow(); |
163 |
– |
} catch (NullPointerException success) { } |
164 |
– |
} |
165 |
– |
|
166 |
– |
/** |
166 |
|
* Offer succeeds if not full; fails if full |
167 |
|
*/ |
168 |
|
public void testOffer() { |
172 |
|
} |
173 |
|
|
174 |
|
/** |
175 |
< |
* add succeeds if not full; throws ISE if full |
175 |
> |
* add succeeds if not full; throws IllegalStateException if full |
176 |
|
*/ |
177 |
|
public void testAdd() { |
178 |
< |
try { |
179 |
< |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
180 |
< |
for (int i = 0; i < SIZE; ++i) { |
181 |
< |
assertTrue(q.add(new Integer(i))); |
183 |
< |
} |
184 |
< |
assertEquals(0, q.remainingCapacity()); |
185 |
< |
q.add(new Integer(SIZE)); |
186 |
< |
} catch (IllegalStateException success){ |
187 |
< |
} |
188 |
< |
} |
189 |
< |
|
190 |
< |
/** |
191 |
< |
* addAll(null) throws NPE |
192 |
< |
*/ |
193 |
< |
public void testAddAll1() { |
178 |
> |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
179 |
> |
for (int i = 0; i < SIZE; ++i) |
180 |
> |
assertTrue(q.add(new Integer(i))); |
181 |
> |
assertEquals(0, q.remainingCapacity()); |
182 |
|
try { |
183 |
< |
LinkedBlockingQueue q = new LinkedBlockingQueue(1); |
196 |
< |
q.addAll(null); |
183 |
> |
q.add(new Integer(SIZE)); |
184 |
|
shouldThrow(); |
185 |
< |
} |
199 |
< |
catch (NullPointerException success) {} |
185 |
> |
} catch (IllegalStateException success) {} |
186 |
|
} |
187 |
|
|
188 |
|
/** |
189 |
< |
* addAll(this) throws IAE |
189 |
> |
* addAll(this) throws IllegalArgumentException |
190 |
|
*/ |
191 |
|
public void testAddAllSelf() { |
192 |
+ |
LinkedBlockingQueue q = populatedQueue(SIZE); |
193 |
|
try { |
207 |
– |
LinkedBlockingQueue q = populatedQueue(SIZE); |
194 |
|
q.addAll(q); |
195 |
|
shouldThrow(); |
196 |
< |
} |
211 |
< |
catch (IllegalArgumentException success) {} |
196 |
> |
} catch (IllegalArgumentException success) {} |
197 |
|
} |
198 |
|
|
199 |
|
/** |
215 |
– |
* addAll of a collection with null elements throws NPE |
216 |
– |
*/ |
217 |
– |
public void testAddAll2() { |
218 |
– |
try { |
219 |
– |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
220 |
– |
Integer[] ints = new Integer[SIZE]; |
221 |
– |
q.addAll(Arrays.asList(ints)); |
222 |
– |
shouldThrow(); |
223 |
– |
} |
224 |
– |
catch (NullPointerException success) {} |
225 |
– |
} |
226 |
– |
/** |
200 |
|
* addAll of a collection with any null elements throws NPE after |
201 |
|
* possibly adding some elements |
202 |
|
*/ |
203 |
|
public void testAddAll3() { |
204 |
+ |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
205 |
+ |
Integer[] ints = new Integer[SIZE]; |
206 |
+ |
for (int i = 0; i < SIZE - 1; ++i) |
207 |
+ |
ints[i] = new Integer(i); |
208 |
+ |
Collection<Integer> elements = Arrays.asList(ints); |
209 |
|
try { |
210 |
< |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
233 |
< |
Integer[] ints = new Integer[SIZE]; |
234 |
< |
for (int i = 0; i < SIZE-1; ++i) |
235 |
< |
ints[i] = new Integer(i); |
236 |
< |
q.addAll(Arrays.asList(ints)); |
210 |
> |
q.addAll(elements); |
211 |
|
shouldThrow(); |
212 |
< |
} |
239 |
< |
catch (NullPointerException success) {} |
212 |
> |
} catch (NullPointerException success) {} |
213 |
|
} |
214 |
+ |
|
215 |
|
/** |
216 |
< |
* addAll throws ISE if not enough room |
216 |
> |
* addAll throws IllegalStateException if not enough room |
217 |
|
*/ |
218 |
|
public void testAddAll4() { |
219 |
+ |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE - 1); |
220 |
+ |
Integer[] ints = new Integer[SIZE]; |
221 |
+ |
for (int i = 0; i < SIZE; ++i) |
222 |
+ |
ints[i] = new Integer(i); |
223 |
+ |
Collection<Integer> elements = Arrays.asList(ints); |
224 |
|
try { |
225 |
< |
LinkedBlockingQueue q = new LinkedBlockingQueue(1); |
247 |
< |
Integer[] ints = new Integer[SIZE]; |
248 |
< |
for (int i = 0; i < SIZE; ++i) |
249 |
< |
ints[i] = new Integer(i); |
250 |
< |
q.addAll(Arrays.asList(ints)); |
225 |
> |
q.addAll(elements); |
226 |
|
shouldThrow(); |
227 |
< |
} |
253 |
< |
catch (IllegalStateException success) {} |
227 |
> |
} catch (IllegalStateException success) {} |
228 |
|
} |
229 |
+ |
|
230 |
|
/** |
231 |
|
* Queue contains all elements, in traversal order, of successful addAll |
232 |
|
*/ |
233 |
|
public void testAddAll5() { |
234 |
< |
try { |
235 |
< |
Integer[] empty = new Integer[0]; |
236 |
< |
Integer[] ints = new Integer[SIZE]; |
237 |
< |
for (int i = 0; i < SIZE; ++i) |
238 |
< |
ints[i] = new Integer(i); |
239 |
< |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
240 |
< |
assertFalse(q.addAll(Arrays.asList(empty))); |
241 |
< |
assertTrue(q.addAll(Arrays.asList(ints))); |
242 |
< |
for (int i = 0; i < SIZE; ++i) |
268 |
< |
assertEquals(ints[i], q.poll()); |
269 |
< |
} |
270 |
< |
finally {} |
234 |
> |
Integer[] empty = new Integer[0]; |
235 |
> |
Integer[] ints = new Integer[SIZE]; |
236 |
> |
for (int i = 0; i < SIZE; ++i) |
237 |
> |
ints[i] = new Integer(i); |
238 |
> |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
239 |
> |
assertFalse(q.addAll(Arrays.asList(empty))); |
240 |
> |
assertTrue(q.addAll(Arrays.asList(ints))); |
241 |
> |
for (int i = 0; i < SIZE; ++i) |
242 |
> |
assertEquals(ints[i], q.poll()); |
243 |
|
} |
244 |
|
|
245 |
|
/** |
274 |
– |
* put(null) throws NPE |
275 |
– |
*/ |
276 |
– |
public void testPutNull() { |
277 |
– |
try { |
278 |
– |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
279 |
– |
q.put(null); |
280 |
– |
shouldThrow(); |
281 |
– |
} |
282 |
– |
catch (NullPointerException success){ |
283 |
– |
} |
284 |
– |
catch (InterruptedException ie) { |
285 |
– |
unexpectedException(); |
286 |
– |
} |
287 |
– |
} |
288 |
– |
|
289 |
– |
/** |
246 |
|
* all elements successfully put are contained |
247 |
|
*/ |
248 |
< |
public void testPut() { |
249 |
< |
try { |
250 |
< |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
251 |
< |
for (int i = 0; i < SIZE; ++i) { |
252 |
< |
Integer I = new Integer(i); |
253 |
< |
q.put(I); |
298 |
< |
assertTrue(q.contains(I)); |
299 |
< |
} |
300 |
< |
assertEquals(0, q.remainingCapacity()); |
301 |
< |
} |
302 |
< |
catch (InterruptedException ie) { |
303 |
< |
unexpectedException(); |
248 |
> |
public void testPut() throws InterruptedException { |
249 |
> |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
250 |
> |
for (int i = 0; i < SIZE; ++i) { |
251 |
> |
Integer x = new Integer(i); |
252 |
> |
q.put(x); |
253 |
> |
assertTrue(q.contains(x)); |
254 |
|
} |
255 |
+ |
assertEquals(0, q.remainingCapacity()); |
256 |
|
} |
257 |
|
|
258 |
|
/** |
259 |
|
* put blocks interruptibly if full |
260 |
|
*/ |
261 |
< |
public void testBlockingPut() { |
262 |
< |
Thread t = new Thread(new Runnable() { |
263 |
< |
public void run() { |
264 |
< |
int added = 0; |
265 |
< |
try { |
266 |
< |
LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
267 |
< |
for (int i = 0; i < SIZE; ++i) { |
268 |
< |
q.put(new Integer(i)); |
269 |
< |
++added; |
270 |
< |
} |
271 |
< |
q.put(new Integer(SIZE)); |
272 |
< |
threadShouldThrow(); |
273 |
< |
} catch (InterruptedException ie){ |
274 |
< |
threadAssertEquals(added, SIZE); |
275 |
< |
} |
276 |
< |
}}); |
277 |
< |
t.start(); |
278 |
< |
try { |
279 |
< |
Thread.sleep(SHORT_DELAY_MS); |
280 |
< |
t.interrupt(); |
281 |
< |
t.join(); |
282 |
< |
} |
283 |
< |
catch (InterruptedException ie) { |
284 |
< |
unexpectedException(); |
285 |
< |
} |
261 |
> |
public void testBlockingPut() throws InterruptedException { |
262 |
> |
final LinkedBlockingQueue q = new LinkedBlockingQueue(SIZE); |
263 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
264 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
265 |
> |
public void realRun() throws InterruptedException { |
266 |
> |
for (int i = 0; i < SIZE; ++i) |
267 |
> |
q.put(i); |
268 |
> |
assertEquals(SIZE, q.size()); |
269 |
> |
assertEquals(0, q.remainingCapacity()); |
270 |
> |
|
271 |
> |
Thread.currentThread().interrupt(); |
272 |
> |
try { |
273 |
> |
q.put(99); |
274 |
> |
shouldThrow(); |
275 |
> |
} catch (InterruptedException success) {} |
276 |
> |
assertFalse(Thread.interrupted()); |
277 |
> |
|
278 |
> |
pleaseInterrupt.countDown(); |
279 |
> |
try { |
280 |
> |
q.put(99); |
281 |
> |
shouldThrow(); |
282 |
> |
} catch (InterruptedException success) {} |
283 |
> |
assertFalse(Thread.interrupted()); |
284 |
> |
}}); |
285 |
> |
|
286 |
> |
await(pleaseInterrupt); |
287 |
> |
assertThreadStaysAlive(t); |
288 |
> |
t.interrupt(); |
289 |
> |
awaitTermination(t); |
290 |
> |
assertEquals(SIZE, q.size()); |
291 |
> |
assertEquals(0, q.remainingCapacity()); |
292 |
|
} |
293 |
|
|
294 |
|
/** |
295 |
< |
* put blocks waiting for take when full |
295 |
> |
* put blocks interruptibly waiting for take when full |
296 |
|
*/ |
297 |
< |
public void testPutWithTake() { |
297 |
> |
public void testPutWithTake() throws InterruptedException { |
298 |
> |
final int capacity = 2; |
299 |
|
final LinkedBlockingQueue q = new LinkedBlockingQueue(2); |
300 |
< |
Thread t = new Thread(new Runnable() { |
301 |
< |
public void run() { |
302 |
< |
int added = 0; |
303 |
< |
try { |
304 |
< |
q.put(new Object()); |
305 |
< |
++added; |
306 |
< |
q.put(new Object()); |
307 |
< |
++added; |
308 |
< |
q.put(new Object()); |
309 |
< |
++added; |
310 |
< |
q.put(new Object()); |
311 |
< |
++added; |
312 |
< |
threadShouldThrow(); |
313 |
< |
} catch (InterruptedException e){ |
314 |
< |
threadAssertTrue(added >= 2); |
315 |
< |
} |
316 |
< |
} |
317 |
< |
}); |
318 |
< |
try { |
319 |
< |
t.start(); |
320 |
< |
Thread.sleep(SHORT_DELAY_MS); |
321 |
< |
q.take(); |
322 |
< |
t.interrupt(); |
323 |
< |
t.join(); |
324 |
< |
} catch (Exception e){ |
325 |
< |
unexpectedException(); |
368 |
< |
} |
300 |
> |
final CountDownLatch pleaseTake = new CountDownLatch(1); |
301 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
302 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
303 |
> |
public void realRun() throws InterruptedException { |
304 |
> |
for (int i = 0; i < capacity; i++) |
305 |
> |
q.put(i); |
306 |
> |
pleaseTake.countDown(); |
307 |
> |
q.put(86); |
308 |
> |
|
309 |
> |
pleaseInterrupt.countDown(); |
310 |
> |
try { |
311 |
> |
q.put(99); |
312 |
> |
shouldThrow(); |
313 |
> |
} catch (InterruptedException success) {} |
314 |
> |
assertFalse(Thread.interrupted()); |
315 |
> |
}}); |
316 |
> |
|
317 |
> |
await(pleaseTake); |
318 |
> |
assertEquals(0, q.remainingCapacity()); |
319 |
> |
assertEquals(0, q.take()); |
320 |
> |
|
321 |
> |
await(pleaseInterrupt); |
322 |
> |
assertThreadStaysAlive(t); |
323 |
> |
t.interrupt(); |
324 |
> |
awaitTermination(t); |
325 |
> |
assertEquals(0, q.remainingCapacity()); |
326 |
|
} |
327 |
|
|
328 |
|
/** |
330 |
|
*/ |
331 |
|
public void testTimedOffer() { |
332 |
|
final LinkedBlockingQueue q = new LinkedBlockingQueue(2); |
333 |
< |
Thread t = new Thread(new Runnable() { |
334 |
< |
public void run() { |
335 |
< |
try { |
336 |
< |
q.put(new Object()); |
337 |
< |
q.put(new Object()); |
338 |
< |
threadAssertFalse(q.offer(new Object(), SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
339 |
< |
q.offer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS); |
340 |
< |
threadShouldThrow(); |
341 |
< |
} catch (InterruptedException success){} |
342 |
< |
} |
343 |
< |
}); |
344 |
< |
|
345 |
< |
try { |
346 |
< |
t.start(); |
347 |
< |
Thread.sleep(SMALL_DELAY_MS); |
348 |
< |
t.interrupt(); |
349 |
< |
t.join(); |
350 |
< |
} catch (Exception e){ |
351 |
< |
unexpectedException(); |
395 |
< |
} |
333 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
334 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
335 |
> |
public void realRun() throws InterruptedException { |
336 |
> |
q.put(new Object()); |
337 |
> |
q.put(new Object()); |
338 |
> |
long startTime = System.nanoTime(); |
339 |
> |
assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS)); |
340 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
341 |
> |
pleaseInterrupt.countDown(); |
342 |
> |
try { |
343 |
> |
q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS); |
344 |
> |
shouldThrow(); |
345 |
> |
} catch (InterruptedException success) {} |
346 |
> |
}}); |
347 |
> |
|
348 |
> |
await(pleaseInterrupt); |
349 |
> |
assertThreadStaysAlive(t); |
350 |
> |
t.interrupt(); |
351 |
> |
awaitTermination(t); |
352 |
|
} |
353 |
|
|
354 |
|
/** |
355 |
|
* take retrieves elements in FIFO order |
356 |
|
*/ |
357 |
< |
public void testTake() { |
358 |
< |
try { |
359 |
< |
LinkedBlockingQueue q = populatedQueue(SIZE); |
360 |
< |
for (int i = 0; i < SIZE; ++i) { |
405 |
< |
assertEquals(i, ((Integer)q.take()).intValue()); |
406 |
< |
} |
407 |
< |
} catch (InterruptedException e){ |
408 |
< |
unexpectedException(); |
409 |
< |
} |
410 |
< |
} |
411 |
< |
|
412 |
< |
/** |
413 |
< |
* take blocks interruptibly when empty |
414 |
< |
*/ |
415 |
< |
public void testTakeFromEmpty() { |
416 |
< |
final LinkedBlockingQueue q = new LinkedBlockingQueue(2); |
417 |
< |
Thread t = new Thread(new Runnable() { |
418 |
< |
public void run() { |
419 |
< |
try { |
420 |
< |
q.take(); |
421 |
< |
threadShouldThrow(); |
422 |
< |
} catch (InterruptedException success){ } |
423 |
< |
} |
424 |
< |
}); |
425 |
< |
try { |
426 |
< |
t.start(); |
427 |
< |
Thread.sleep(SHORT_DELAY_MS); |
428 |
< |
t.interrupt(); |
429 |
< |
t.join(); |
430 |
< |
} catch (Exception e){ |
431 |
< |
unexpectedException(); |
357 |
> |
public void testTake() throws InterruptedException { |
358 |
> |
LinkedBlockingQueue q = populatedQueue(SIZE); |
359 |
> |
for (int i = 0; i < SIZE; ++i) { |
360 |
> |
assertEquals(i, q.take()); |
361 |
|
} |
362 |
|
} |
363 |
|
|
364 |
|
/** |
365 |
|
* Take removes existing elements until empty, then blocks interruptibly |
366 |
|
*/ |
367 |
< |
public void testBlockingTake() { |
368 |
< |
Thread t = new Thread(new Runnable() { |
369 |
< |
public void run() { |
370 |
< |
try { |
371 |
< |
LinkedBlockingQueue q = populatedQueue(SIZE); |
372 |
< |
for (int i = 0; i < SIZE; ++i) { |
373 |
< |
assertEquals(i, ((Integer)q.take()).intValue()); |
374 |
< |
} |
446 |
< |
q.take(); |
447 |
< |
threadShouldThrow(); |
448 |
< |
} catch (InterruptedException success){ |
449 |
< |
} |
450 |
< |
}}); |
451 |
< |
t.start(); |
452 |
< |
try { |
453 |
< |
Thread.sleep(SHORT_DELAY_MS); |
454 |
< |
t.interrupt(); |
455 |
< |
t.join(); |
456 |
< |
} |
457 |
< |
catch (InterruptedException ie) { |
458 |
< |
unexpectedException(); |
459 |
< |
} |
460 |
< |
} |
367 |
> |
public void testBlockingTake() throws InterruptedException { |
368 |
> |
final BlockingQueue q = populatedQueue(SIZE); |
369 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
370 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
371 |
> |
public void realRun() throws InterruptedException { |
372 |
> |
for (int i = 0; i < SIZE; ++i) { |
373 |
> |
assertEquals(i, q.take()); |
374 |
> |
} |
375 |
|
|
376 |
+ |
Thread.currentThread().interrupt(); |
377 |
+ |
try { |
378 |
+ |
q.take(); |
379 |
+ |
shouldThrow(); |
380 |
+ |
} catch (InterruptedException success) {} |
381 |
+ |
assertFalse(Thread.interrupted()); |
382 |
+ |
|
383 |
+ |
pleaseInterrupt.countDown(); |
384 |
+ |
try { |
385 |
+ |
q.take(); |
386 |
+ |
shouldThrow(); |
387 |
+ |
} catch (InterruptedException success) {} |
388 |
+ |
assertFalse(Thread.interrupted()); |
389 |
+ |
}}); |
390 |
+ |
|
391 |
+ |
await(pleaseInterrupt); |
392 |
+ |
assertThreadStaysAlive(t); |
393 |
+ |
t.interrupt(); |
394 |
+ |
awaitTermination(t); |
395 |
+ |
} |
396 |
|
|
397 |
|
/** |
398 |
|
* poll succeeds unless empty |
400 |
|
public void testPoll() { |
401 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
402 |
|
for (int i = 0; i < SIZE; ++i) { |
403 |
< |
assertEquals(i, ((Integer)q.poll()).intValue()); |
403 |
> |
assertEquals(i, q.poll()); |
404 |
|
} |
405 |
< |
assertNull(q.poll()); |
405 |
> |
assertNull(q.poll()); |
406 |
|
} |
407 |
|
|
408 |
|
/** |
409 |
< |
* timed pool with zero timeout succeeds when non-empty, else times out |
409 |
> |
* timed poll with zero timeout succeeds when non-empty, else times out |
410 |
|
*/ |
411 |
< |
public void testTimedPoll0() { |
412 |
< |
try { |
413 |
< |
LinkedBlockingQueue q = populatedQueue(SIZE); |
414 |
< |
for (int i = 0; i < SIZE; ++i) { |
415 |
< |
assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue()); |
416 |
< |
} |
483 |
< |
assertNull(q.poll(0, TimeUnit.MILLISECONDS)); |
484 |
< |
} catch (InterruptedException e){ |
485 |
< |
unexpectedException(); |
486 |
< |
} |
411 |
> |
public void testTimedPoll0() throws InterruptedException { |
412 |
> |
LinkedBlockingQueue q = populatedQueue(SIZE); |
413 |
> |
for (int i = 0; i < SIZE; ++i) { |
414 |
> |
assertEquals(i, q.poll(0, MILLISECONDS)); |
415 |
> |
} |
416 |
> |
assertNull(q.poll(0, MILLISECONDS)); |
417 |
|
} |
418 |
|
|
419 |
|
/** |
420 |
< |
* timed pool with nonzero timeout succeeds when non-empty, else times out |
420 |
> |
* timed poll with nonzero timeout succeeds when non-empty, else times out |
421 |
|
*/ |
422 |
< |
public void testTimedPoll() { |
423 |
< |
try { |
424 |
< |
LinkedBlockingQueue q = populatedQueue(SIZE); |
425 |
< |
for (int i = 0; i < SIZE; ++i) { |
426 |
< |
assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue()); |
427 |
< |
} |
428 |
< |
assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
429 |
< |
} catch (InterruptedException e){ |
430 |
< |
unexpectedException(); |
431 |
< |
} |
422 |
> |
public void testTimedPoll() throws InterruptedException { |
423 |
> |
LinkedBlockingQueue<Integer> q = populatedQueue(SIZE); |
424 |
> |
for (int i = 0; i < SIZE; ++i) { |
425 |
> |
long startTime = System.nanoTime(); |
426 |
> |
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
427 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
428 |
> |
} |
429 |
> |
long startTime = System.nanoTime(); |
430 |
> |
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
431 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
432 |
> |
checkEmpty(q); |
433 |
|
} |
434 |
|
|
435 |
|
/** |
436 |
|
* Interrupted timed poll throws InterruptedException instead of |
437 |
|
* returning timeout status |
438 |
|
*/ |
439 |
< |
public void testInterruptedTimedPoll() { |
440 |
< |
Thread t = new Thread(new Runnable() { |
441 |
< |
public void run() { |
442 |
< |
try { |
443 |
< |
LinkedBlockingQueue q = populatedQueue(SIZE); |
444 |
< |
for (int i = 0; i < SIZE; ++i) { |
445 |
< |
threadAssertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue()); |
446 |
< |
} |
516 |
< |
threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
517 |
< |
} catch (InterruptedException success){ |
518 |
< |
} |
519 |
< |
}}); |
520 |
< |
t.start(); |
521 |
< |
try { |
522 |
< |
Thread.sleep(SHORT_DELAY_MS); |
523 |
< |
t.interrupt(); |
524 |
< |
t.join(); |
525 |
< |
} |
526 |
< |
catch (InterruptedException ie) { |
527 |
< |
unexpectedException(); |
528 |
< |
} |
529 |
< |
} |
530 |
< |
|
531 |
< |
/** |
532 |
< |
* timed poll before a delayed offer fails; after offer succeeds; |
533 |
< |
* on interruption throws |
534 |
< |
*/ |
535 |
< |
public void testTimedPollWithOffer() { |
536 |
< |
final LinkedBlockingQueue q = new LinkedBlockingQueue(2); |
537 |
< |
Thread t = new Thread(new Runnable() { |
538 |
< |
public void run() { |
539 |
< |
try { |
540 |
< |
threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
541 |
< |
q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS); |
542 |
< |
q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS); |
543 |
< |
threadShouldThrow(); |
544 |
< |
} catch (InterruptedException success) { } |
439 |
> |
public void testInterruptedTimedPoll() throws InterruptedException { |
440 |
> |
final BlockingQueue<Integer> q = populatedQueue(SIZE); |
441 |
> |
final CountDownLatch aboutToWait = new CountDownLatch(1); |
442 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
443 |
> |
public void realRun() throws InterruptedException { |
444 |
> |
long startTime = System.nanoTime(); |
445 |
> |
for (int i = 0; i < SIZE; ++i) { |
446 |
> |
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
447 |
|
} |
448 |
< |
}); |
449 |
< |
try { |
450 |
< |
t.start(); |
451 |
< |
Thread.sleep(SMALL_DELAY_MS); |
452 |
< |
assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
453 |
< |
t.interrupt(); |
454 |
< |
t.join(); |
455 |
< |
} catch (Exception e){ |
456 |
< |
unexpectedException(); |
457 |
< |
} |
458 |
< |
} |
448 |
> |
aboutToWait.countDown(); |
449 |
> |
try { |
450 |
> |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
451 |
> |
shouldThrow(); |
452 |
> |
} catch (InterruptedException success) { |
453 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
454 |
> |
} |
455 |
> |
}}); |
456 |
> |
|
457 |
> |
await(aboutToWait); |
458 |
> |
waitForThreadToEnterWaitState(t); |
459 |
> |
t.interrupt(); |
460 |
> |
awaitTermination(t); |
461 |
> |
checkEmpty(q); |
462 |
> |
} |
463 |
|
|
464 |
|
/** |
465 |
|
* peek returns next element, or null if empty |
467 |
|
public void testPeek() { |
468 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
469 |
|
for (int i = 0; i < SIZE; ++i) { |
470 |
< |
assertEquals(i, ((Integer)q.peek()).intValue()); |
471 |
< |
q.poll(); |
470 |
> |
assertEquals(i, q.peek()); |
471 |
> |
assertEquals(i, q.poll()); |
472 |
|
assertTrue(q.peek() == null || |
473 |
< |
i != ((Integer)q.peek()).intValue()); |
473 |
> |
!q.peek().equals(i)); |
474 |
|
} |
475 |
< |
assertNull(q.peek()); |
475 |
> |
assertNull(q.peek()); |
476 |
|
} |
477 |
|
|
478 |
|
/** |
481 |
|
public void testElement() { |
482 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
483 |
|
for (int i = 0; i < SIZE; ++i) { |
484 |
< |
assertEquals(i, ((Integer)q.element()).intValue()); |
485 |
< |
q.poll(); |
484 |
> |
assertEquals(i, q.element()); |
485 |
> |
assertEquals(i, q.poll()); |
486 |
|
} |
487 |
|
try { |
488 |
|
q.element(); |
489 |
|
shouldThrow(); |
490 |
< |
} |
585 |
< |
catch (NoSuchElementException success) {} |
490 |
> |
} catch (NoSuchElementException success) {} |
491 |
|
} |
492 |
|
|
493 |
|
/** |
496 |
|
public void testRemove() { |
497 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
498 |
|
for (int i = 0; i < SIZE; ++i) { |
499 |
< |
assertEquals(i, ((Integer)q.remove()).intValue()); |
499 |
> |
assertEquals(i, q.remove()); |
500 |
|
} |
501 |
|
try { |
502 |
|
q.remove(); |
503 |
|
shouldThrow(); |
504 |
< |
} catch (NoSuchElementException success){ |
600 |
< |
} |
601 |
< |
} |
602 |
< |
|
603 |
< |
/** |
604 |
< |
* remove(x) removes x and returns true if present |
605 |
< |
*/ |
606 |
< |
public void testRemoveElement() { |
607 |
< |
LinkedBlockingQueue q = populatedQueue(SIZE); |
608 |
< |
for (int i = 1; i < SIZE; i+=2) { |
609 |
< |
assertTrue(q.remove(new Integer(i))); |
610 |
< |
} |
611 |
< |
for (int i = 0; i < SIZE; i+=2) { |
612 |
< |
assertTrue(q.remove(new Integer(i))); |
613 |
< |
assertFalse(q.remove(new Integer(i+1))); |
614 |
< |
} |
615 |
< |
assertTrue(q.isEmpty()); |
504 |
> |
} catch (NoSuchElementException success) {} |
505 |
|
} |
506 |
|
|
507 |
|
/** |
508 |
|
* An add following remove(x) succeeds |
509 |
|
*/ |
510 |
< |
public void testRemoveElementAndAdd() { |
511 |
< |
try { |
512 |
< |
LinkedBlockingQueue q = new LinkedBlockingQueue(); |
513 |
< |
assertTrue(q.add(new Integer(1))); |
514 |
< |
assertTrue(q.add(new Integer(2))); |
515 |
< |
assertTrue(q.remove(new Integer(1))); |
516 |
< |
assertTrue(q.remove(new Integer(2))); |
517 |
< |
assertTrue(q.add(new Integer(3))); |
629 |
< |
assertTrue(q.take() != null); |
630 |
< |
} catch (Exception e){ |
631 |
< |
unexpectedException(); |
632 |
< |
} |
510 |
> |
public void testRemoveElementAndAdd() throws InterruptedException { |
511 |
> |
LinkedBlockingQueue q = new LinkedBlockingQueue(); |
512 |
> |
assertTrue(q.add(new Integer(1))); |
513 |
> |
assertTrue(q.add(new Integer(2))); |
514 |
> |
assertTrue(q.remove(new Integer(1))); |
515 |
> |
assertTrue(q.remove(new Integer(2))); |
516 |
> |
assertTrue(q.add(new Integer(3))); |
517 |
> |
assertNotNull(q.take()); |
518 |
|
} |
519 |
< |
|
519 |
> |
|
520 |
|
/** |
521 |
|
* contains(x) reports true when elements added but not yet removed |
522 |
|
*/ |
573 |
|
assertTrue(changed); |
574 |
|
|
575 |
|
assertTrue(q.containsAll(p)); |
576 |
< |
assertEquals(SIZE-i, q.size()); |
576 |
> |
assertEquals(SIZE - i, q.size()); |
577 |
|
p.remove(); |
578 |
|
} |
579 |
|
} |
586 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
587 |
|
LinkedBlockingQueue p = populatedQueue(i); |
588 |
|
assertTrue(q.removeAll(p)); |
589 |
< |
assertEquals(SIZE-i, q.size()); |
589 |
> |
assertEquals(SIZE - i, q.size()); |
590 |
|
for (int j = 0; j < i; ++j) { |
591 |
< |
Integer I = (Integer)(p.remove()); |
592 |
< |
assertFalse(q.contains(I)); |
591 |
> |
Integer x = (Integer)(p.remove()); |
592 |
> |
assertFalse(q.contains(x)); |
593 |
|
} |
594 |
|
} |
595 |
|
} |
596 |
|
|
597 |
|
/** |
598 |
< |
* toArray contains all elements |
598 |
> |
* toArray contains all elements in FIFO order |
599 |
|
*/ |
600 |
|
public void testToArray() { |
601 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
602 |
< |
Object[] o = q.toArray(); |
603 |
< |
try { |
604 |
< |
for(int i = 0; i < o.length; i++) |
720 |
< |
assertEquals(o[i], q.take()); |
721 |
< |
} catch (InterruptedException e){ |
722 |
< |
unexpectedException(); |
723 |
< |
} |
602 |
> |
Object[] o = q.toArray(); |
603 |
> |
for (int i = 0; i < o.length; i++) |
604 |
> |
assertSame(o[i], q.poll()); |
605 |
|
} |
606 |
|
|
607 |
|
/** |
608 |
< |
* toArray(a) contains all elements |
608 |
> |
* toArray(a) contains all elements in FIFO order |
609 |
|
*/ |
610 |
< |
public void testToArray2() { |
611 |
< |
LinkedBlockingQueue q = populatedQueue(SIZE); |
612 |
< |
Integer[] ints = new Integer[SIZE]; |
613 |
< |
ints = (Integer[])q.toArray(ints); |
614 |
< |
try { |
615 |
< |
for(int i = 0; i < ints.length; i++) |
616 |
< |
assertEquals(ints[i], q.take()); |
736 |
< |
} catch (InterruptedException e){ |
737 |
< |
unexpectedException(); |
738 |
< |
} |
610 |
> |
public void testToArray2() throws InterruptedException { |
611 |
> |
LinkedBlockingQueue<Integer> q = populatedQueue(SIZE); |
612 |
> |
Integer[] ints = new Integer[SIZE]; |
613 |
> |
Integer[] array = q.toArray(ints); |
614 |
> |
assertSame(ints, array); |
615 |
> |
for (int i = 0; i < ints.length; i++) |
616 |
> |
assertSame(ints[i], q.poll()); |
617 |
|
} |
618 |
|
|
619 |
|
/** |
620 |
< |
* toArray(null) throws NPE |
620 |
> |
* toArray(incompatible array type) throws ArrayStoreException |
621 |
|
*/ |
622 |
< |
public void testToArray_BadArg() { |
623 |
< |
try { |
624 |
< |
LinkedBlockingQueue q = populatedQueue(SIZE); |
625 |
< |
Object o[] = q.toArray(null); |
626 |
< |
shouldThrow(); |
627 |
< |
} catch(NullPointerException success){} |
622 |
> |
public void testToArray1_BadArg() { |
623 |
> |
LinkedBlockingQueue q = populatedQueue(SIZE); |
624 |
> |
try { |
625 |
> |
q.toArray(new String[10]); |
626 |
> |
shouldThrow(); |
627 |
> |
} catch (ArrayStoreException success) {} |
628 |
|
} |
629 |
|
|
630 |
|
/** |
631 |
< |
* toArray with incompatible array type throws CCE |
631 |
> |
* iterator iterates through all elements |
632 |
|
*/ |
633 |
< |
public void testToArray1_BadArg() { |
634 |
< |
try { |
635 |
< |
LinkedBlockingQueue q = populatedQueue(SIZE); |
636 |
< |
Object o[] = q.toArray(new String[10] ); |
637 |
< |
shouldThrow(); |
638 |
< |
} catch(ArrayStoreException success){} |
633 |
> |
public void testIterator() throws InterruptedException { |
634 |
> |
LinkedBlockingQueue q = populatedQueue(SIZE); |
635 |
> |
Iterator it = q.iterator(); |
636 |
> |
int i; |
637 |
> |
for (i = 0; it.hasNext(); i++) |
638 |
> |
assertTrue(q.contains(it.next())); |
639 |
> |
assertEquals(i, SIZE); |
640 |
> |
assertIteratorExhausted(it); |
641 |
> |
|
642 |
> |
it = q.iterator(); |
643 |
> |
for (i = 0; it.hasNext(); i++) |
644 |
> |
assertEquals(it.next(), q.take()); |
645 |
> |
assertEquals(i, SIZE); |
646 |
> |
assertIteratorExhausted(it); |
647 |
|
} |
648 |
|
|
763 |
– |
|
649 |
|
/** |
650 |
< |
* iterator iterates through all elements |
650 |
> |
* iterator of empty collection has no elements |
651 |
|
*/ |
652 |
< |
public void testIterator() { |
653 |
< |
LinkedBlockingQueue q = populatedQueue(SIZE); |
769 |
< |
Iterator it = q.iterator(); |
770 |
< |
try { |
771 |
< |
while(it.hasNext()){ |
772 |
< |
assertEquals(it.next(), q.take()); |
773 |
< |
} |
774 |
< |
} catch (InterruptedException e){ |
775 |
< |
unexpectedException(); |
776 |
< |
} |
652 |
> |
public void testEmptyIterator() { |
653 |
> |
assertIteratorExhausted(new LinkedBlockingQueue().iterator()); |
654 |
|
} |
655 |
|
|
656 |
|
/** |
657 |
|
* iterator.remove removes current element |
658 |
|
*/ |
659 |
< |
public void testIteratorRemove () { |
659 |
> |
public void testIteratorRemove() { |
660 |
|
final LinkedBlockingQueue q = new LinkedBlockingQueue(3); |
661 |
|
q.add(two); |
662 |
|
q.add(one); |
665 |
|
Iterator it = q.iterator(); |
666 |
|
it.next(); |
667 |
|
it.remove(); |
668 |
< |
|
668 |
> |
|
669 |
|
it = q.iterator(); |
670 |
< |
assertEquals(it.next(), one); |
671 |
< |
assertEquals(it.next(), three); |
670 |
> |
assertSame(it.next(), one); |
671 |
> |
assertSame(it.next(), three); |
672 |
|
assertFalse(it.hasNext()); |
673 |
|
} |
674 |
|
|
798 |
– |
|
675 |
|
/** |
676 |
|
* iterator ordering is FIFO |
677 |
|
*/ |
683 |
|
assertEquals(0, q.remainingCapacity()); |
684 |
|
int k = 0; |
685 |
|
for (Iterator it = q.iterator(); it.hasNext();) { |
686 |
< |
int i = ((Integer)(it.next())).intValue(); |
811 |
< |
assertEquals(++k, i); |
686 |
> |
assertEquals(++k, it.next()); |
687 |
|
} |
688 |
|
assertEquals(3, k); |
689 |
|
} |
691 |
|
/** |
692 |
|
* Modifications do not cause iterators to fail |
693 |
|
*/ |
694 |
< |
public void testWeaklyConsistentIteration () { |
694 |
> |
public void testWeaklyConsistentIteration() { |
695 |
|
final LinkedBlockingQueue q = new LinkedBlockingQueue(3); |
696 |
|
q.add(one); |
697 |
|
q.add(two); |
698 |
|
q.add(three); |
699 |
< |
try { |
700 |
< |
for (Iterator it = q.iterator(); it.hasNext();) { |
701 |
< |
q.remove(); |
827 |
< |
it.next(); |
828 |
< |
} |
829 |
< |
} |
830 |
< |
catch (ConcurrentModificationException e) { |
831 |
< |
unexpectedException(); |
699 |
> |
for (Iterator it = q.iterator(); it.hasNext();) { |
700 |
> |
q.remove(); |
701 |
> |
it.next(); |
702 |
|
} |
703 |
|
assertEquals(0, q.size()); |
704 |
|
} |
705 |
|
|
836 |
– |
|
706 |
|
/** |
707 |
|
* toString contains toStrings of elements |
708 |
|
*/ |
710 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
711 |
|
String s = q.toString(); |
712 |
|
for (int i = 0; i < SIZE; ++i) { |
713 |
< |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
713 |
> |
assertTrue(s.contains(String.valueOf(i))); |
714 |
|
} |
715 |
< |
} |
847 |
< |
|
715 |
> |
} |
716 |
|
|
717 |
|
/** |
718 |
|
* offer transfers elements across Executor tasks |
721 |
|
final LinkedBlockingQueue q = new LinkedBlockingQueue(2); |
722 |
|
q.add(one); |
723 |
|
q.add(two); |
724 |
< |
ExecutorService executor = Executors.newFixedThreadPool(2); |
725 |
< |
executor.execute(new Runnable() { |
726 |
< |
public void run() { |
727 |
< |
threadAssertFalse(q.offer(three)); |
728 |
< |
try { |
729 |
< |
threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS)); |
730 |
< |
threadAssertEquals(0, q.remainingCapacity()); |
731 |
< |
} |
732 |
< |
catch (InterruptedException e) { |
733 |
< |
threadUnexpectedException(); |
866 |
< |
} |
867 |
< |
} |
868 |
< |
}); |
724 |
> |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
725 |
> |
final ExecutorService executor = Executors.newFixedThreadPool(2); |
726 |
> |
try (PoolCleaner cleaner = cleaner(executor)) { |
727 |
> |
executor.execute(new CheckedRunnable() { |
728 |
> |
public void realRun() throws InterruptedException { |
729 |
> |
assertFalse(q.offer(three)); |
730 |
> |
threadsStarted.await(); |
731 |
> |
assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS)); |
732 |
> |
assertEquals(0, q.remainingCapacity()); |
733 |
> |
}}); |
734 |
|
|
735 |
< |
executor.execute(new Runnable() { |
736 |
< |
public void run() { |
737 |
< |
try { |
738 |
< |
Thread.sleep(SMALL_DELAY_MS); |
739 |
< |
threadAssertEquals(one, q.take()); |
740 |
< |
} |
876 |
< |
catch (InterruptedException e) { |
877 |
< |
threadUnexpectedException(); |
878 |
< |
} |
879 |
< |
} |
880 |
< |
}); |
881 |
< |
|
882 |
< |
joinPool(executor); |
735 |
> |
executor.execute(new CheckedRunnable() { |
736 |
> |
public void realRun() throws InterruptedException { |
737 |
> |
threadsStarted.await(); |
738 |
> |
assertSame(one, q.take()); |
739 |
> |
}}); |
740 |
> |
} |
741 |
|
} |
742 |
|
|
743 |
|
/** |
744 |
< |
* poll retrieves elements across Executor threads |
744 |
> |
* timed poll retrieves elements across Executor threads |
745 |
|
*/ |
746 |
|
public void testPollInExecutor() { |
747 |
|
final LinkedBlockingQueue q = new LinkedBlockingQueue(2); |
748 |
< |
ExecutorService executor = Executors.newFixedThreadPool(2); |
749 |
< |
executor.execute(new Runnable() { |
750 |
< |
public void run() { |
751 |
< |
threadAssertNull(q.poll()); |
752 |
< |
try { |
753 |
< |
threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS)); |
754 |
< |
threadAssertTrue(q.isEmpty()); |
755 |
< |
} |
756 |
< |
catch (InterruptedException e) { |
757 |
< |
threadUnexpectedException(); |
900 |
< |
} |
901 |
< |
} |
902 |
< |
}); |
748 |
> |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
749 |
> |
final ExecutorService executor = Executors.newFixedThreadPool(2); |
750 |
> |
try (PoolCleaner cleaner = cleaner(executor)) { |
751 |
> |
executor.execute(new CheckedRunnable() { |
752 |
> |
public void realRun() throws InterruptedException { |
753 |
> |
assertNull(q.poll()); |
754 |
> |
threadsStarted.await(); |
755 |
> |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
756 |
> |
checkEmpty(q); |
757 |
> |
}}); |
758 |
|
|
759 |
< |
executor.execute(new Runnable() { |
760 |
< |
public void run() { |
761 |
< |
try { |
907 |
< |
Thread.sleep(SMALL_DELAY_MS); |
759 |
> |
executor.execute(new CheckedRunnable() { |
760 |
> |
public void realRun() throws InterruptedException { |
761 |
> |
threadsStarted.await(); |
762 |
|
q.put(one); |
763 |
< |
} |
764 |
< |
catch (InterruptedException e) { |
911 |
< |
threadUnexpectedException(); |
912 |
< |
} |
913 |
< |
} |
914 |
< |
}); |
915 |
< |
|
916 |
< |
joinPool(executor); |
763 |
> |
}}); |
764 |
> |
} |
765 |
|
} |
766 |
|
|
767 |
|
/** |
768 |
|
* A deserialized serialized queue has same elements in same order |
769 |
|
*/ |
770 |
< |
public void testSerialization() { |
771 |
< |
LinkedBlockingQueue q = populatedQueue(SIZE); |
772 |
< |
|
773 |
< |
try { |
774 |
< |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
775 |
< |
ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout)); |
776 |
< |
out.writeObject(q); |
777 |
< |
out.close(); |
778 |
< |
|
779 |
< |
ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray()); |
780 |
< |
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); |
933 |
< |
LinkedBlockingQueue r = (LinkedBlockingQueue)in.readObject(); |
934 |
< |
assertEquals(q.size(), r.size()); |
935 |
< |
while (!q.isEmpty()) |
936 |
< |
assertEquals(q.remove(), r.remove()); |
937 |
< |
} catch(Exception e){ |
938 |
< |
unexpectedException(); |
939 |
< |
} |
940 |
< |
} |
941 |
< |
|
942 |
< |
/** |
943 |
< |
* drainTo(null) throws NPE |
944 |
< |
*/ |
945 |
< |
public void testDrainToNull() { |
946 |
< |
LinkedBlockingQueue q = populatedQueue(SIZE); |
947 |
< |
try { |
948 |
< |
q.drainTo(null); |
949 |
< |
shouldThrow(); |
950 |
< |
} catch(NullPointerException success) { |
951 |
< |
} |
952 |
< |
} |
953 |
< |
|
954 |
< |
/** |
955 |
< |
* drainTo(this) throws IAE |
956 |
< |
*/ |
957 |
< |
public void testDrainToSelf() { |
958 |
< |
LinkedBlockingQueue q = populatedQueue(SIZE); |
959 |
< |
try { |
960 |
< |
q.drainTo(q); |
961 |
< |
shouldThrow(); |
962 |
< |
} catch(IllegalArgumentException success) { |
770 |
> |
public void testSerialization() throws Exception { |
771 |
> |
Queue x = populatedQueue(SIZE); |
772 |
> |
Queue y = serialClone(x); |
773 |
> |
|
774 |
> |
assertNotSame(x, y); |
775 |
> |
assertEquals(x.size(), y.size()); |
776 |
> |
assertEquals(x.toString(), y.toString()); |
777 |
> |
assertTrue(Arrays.equals(x.toArray(), y.toArray())); |
778 |
> |
while (!x.isEmpty()) { |
779 |
> |
assertFalse(y.isEmpty()); |
780 |
> |
assertEquals(x.remove(), y.remove()); |
781 |
|
} |
782 |
+ |
assertTrue(y.isEmpty()); |
783 |
|
} |
784 |
|
|
785 |
|
/** |
786 |
|
* drainTo(c) empties queue into another collection c |
787 |
< |
*/ |
787 |
> |
*/ |
788 |
|
public void testDrainTo() { |
789 |
|
LinkedBlockingQueue q = populatedQueue(SIZE); |
790 |
|
ArrayList l = new ArrayList(); |
791 |
|
q.drainTo(l); |
792 |
< |
assertEquals(q.size(), 0); |
793 |
< |
assertEquals(l.size(), SIZE); |
794 |
< |
for (int i = 0; i < SIZE; ++i) |
792 |
> |
assertEquals(0, q.size()); |
793 |
> |
assertEquals(SIZE, l.size()); |
794 |
> |
for (int i = 0; i < SIZE; ++i) |
795 |
|
assertEquals(l.get(i), new Integer(i)); |
796 |
|
q.add(zero); |
797 |
|
q.add(one); |
800 |
|
assertTrue(q.contains(one)); |
801 |
|
l.clear(); |
802 |
|
q.drainTo(l); |
803 |
< |
assertEquals(q.size(), 0); |
804 |
< |
assertEquals(l.size(), 2); |
805 |
< |
for (int i = 0; i < 2; ++i) |
803 |
> |
assertEquals(0, q.size()); |
804 |
> |
assertEquals(2, l.size()); |
805 |
> |
for (int i = 0; i < 2; ++i) |
806 |
|
assertEquals(l.get(i), new Integer(i)); |
807 |
|
} |
808 |
|
|
809 |
|
/** |
810 |
|
* drainTo empties full queue, unblocking a waiting put. |
811 |
< |
*/ |
812 |
< |
public void testDrainToWithActivePut() { |
811 |
> |
*/ |
812 |
> |
public void testDrainToWithActivePut() throws InterruptedException { |
813 |
|
final LinkedBlockingQueue q = populatedQueue(SIZE); |
814 |
< |
Thread t = new Thread(new Runnable() { |
815 |
< |
public void run() { |
816 |
< |
try { |
817 |
< |
q.put(new Integer(SIZE+1)); |
999 |
< |
} catch (InterruptedException ie){ |
1000 |
< |
threadUnexpectedException(); |
1001 |
< |
} |
1002 |
< |
} |
1003 |
< |
}); |
1004 |
< |
try { |
1005 |
< |
t.start(); |
1006 |
< |
ArrayList l = new ArrayList(); |
1007 |
< |
q.drainTo(l); |
1008 |
< |
assertTrue(l.size() >= SIZE); |
1009 |
< |
for (int i = 0; i < SIZE; ++i) |
1010 |
< |
assertEquals(l.get(i), new Integer(i)); |
1011 |
< |
t.join(); |
1012 |
< |
assertTrue(q.size() + l.size() >= SIZE); |
1013 |
< |
} catch(Exception e){ |
1014 |
< |
unexpectedException(); |
1015 |
< |
} |
1016 |
< |
} |
814 |
> |
Thread t = new Thread(new CheckedRunnable() { |
815 |
> |
public void realRun() throws InterruptedException { |
816 |
> |
q.put(new Integer(SIZE + 1)); |
817 |
> |
}}); |
818 |
|
|
819 |
< |
/** |
820 |
< |
* drainTo(null, n) throws NPE |
821 |
< |
*/ |
822 |
< |
public void testDrainToNullN() { |
823 |
< |
LinkedBlockingQueue q = populatedQueue(SIZE); |
824 |
< |
try { |
825 |
< |
q.drainTo(null, 0); |
826 |
< |
shouldThrow(); |
1026 |
< |
} catch(NullPointerException success) { |
1027 |
< |
} |
1028 |
< |
} |
1029 |
< |
|
1030 |
< |
/** |
1031 |
< |
* drainTo(this, n) throws IAE |
1032 |
< |
*/ |
1033 |
< |
public void testDrainToSelfN() { |
1034 |
< |
LinkedBlockingQueue q = populatedQueue(SIZE); |
1035 |
< |
try { |
1036 |
< |
q.drainTo(q, 0); |
1037 |
< |
shouldThrow(); |
1038 |
< |
} catch(IllegalArgumentException success) { |
1039 |
< |
} |
819 |
> |
t.start(); |
820 |
> |
ArrayList l = new ArrayList(); |
821 |
> |
q.drainTo(l); |
822 |
> |
assertTrue(l.size() >= SIZE); |
823 |
> |
for (int i = 0; i < SIZE; ++i) |
824 |
> |
assertEquals(l.get(i), new Integer(i)); |
825 |
> |
t.join(); |
826 |
> |
assertTrue(q.size() + l.size() >= SIZE); |
827 |
|
} |
828 |
|
|
829 |
|
/** |
830 |
< |
* drainTo(c, n) empties first max {n, size} elements of queue into c |
831 |
< |
*/ |
830 |
> |
* drainTo(c, n) empties first min(n, size) elements of queue into c |
831 |
> |
*/ |
832 |
|
public void testDrainToN() { |
833 |
|
LinkedBlockingQueue q = new LinkedBlockingQueue(); |
834 |
|
for (int i = 0; i < SIZE + 2; ++i) { |
835 |
< |
for(int j = 0; j < SIZE; j++) |
835 |
> |
for (int j = 0; j < SIZE; j++) |
836 |
|
assertTrue(q.offer(new Integer(j))); |
837 |
|
ArrayList l = new ArrayList(); |
838 |
|
q.drainTo(l, i); |
839 |
< |
int k = (i < SIZE)? i : SIZE; |
840 |
< |
assertEquals(l.size(), k); |
841 |
< |
assertEquals(q.size(), SIZE-k); |
842 |
< |
for (int j = 0; j < k; ++j) |
839 |
> |
int k = (i < SIZE) ? i : SIZE; |
840 |
> |
assertEquals(k, l.size()); |
841 |
> |
assertEquals(SIZE - k, q.size()); |
842 |
> |
for (int j = 0; j < k; ++j) |
843 |
|
assertEquals(l.get(j), new Integer(j)); |
844 |
< |
while (q.poll() != null) ; |
844 |
> |
do {} while (q.poll() != null); |
845 |
> |
} |
846 |
> |
} |
847 |
> |
|
848 |
> |
/** |
849 |
> |
* remove(null), contains(null) always return false |
850 |
> |
*/ |
851 |
> |
public void testNeverContainsNull() { |
852 |
> |
Collection<?>[] qs = { |
853 |
> |
new LinkedBlockingQueue<Object>(), |
854 |
> |
populatedQueue(2), |
855 |
> |
}; |
856 |
> |
|
857 |
> |
for (Collection<?> q : qs) { |
858 |
> |
assertFalse(q.contains(null)); |
859 |
> |
assertFalse(q.remove(null)); |
860 |
|
} |
861 |
|
} |
862 |
|
|