1 |
dl |
1.1 |
/* |
2 |
dl |
1.7 |
* 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 |
jsr166 |
1.31 |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
jsr166 |
1.10 |
* Other contributors include Andrew Wright, Jeffrey Hayes, |
6 |
|
|
* Pat Fisher, Mike Judd. |
7 |
dl |
1.1 |
*/ |
8 |
|
|
|
9 |
jsr166 |
1.44 |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
10 |
|
|
|
11 |
|
|
import java.util.ArrayList; |
12 |
jsr166 |
1.37 |
import java.util.Arrays; |
13 |
|
|
import java.util.Collection; |
14 |
|
|
import java.util.Iterator; |
15 |
|
|
import java.util.NoSuchElementException; |
16 |
|
|
import java.util.concurrent.BlockingQueue; |
17 |
|
|
import java.util.concurrent.CountDownLatch; |
18 |
|
|
import java.util.concurrent.Executors; |
19 |
|
|
import java.util.concurrent.ExecutorService; |
20 |
|
|
import java.util.concurrent.SynchronousQueue; |
21 |
jsr166 |
1.44 |
|
22 |
|
|
import junit.framework.Test; |
23 |
dl |
1.1 |
|
24 |
dl |
1.3 |
public class SynchronousQueueTest extends JSR166TestCase { |
25 |
dl |
1.1 |
|
26 |
jsr166 |
1.25 |
public static class Fair extends BlockingQueueTest { |
27 |
|
|
protected BlockingQueue emptyCollection() { |
28 |
|
|
return new SynchronousQueue(true); |
29 |
|
|
} |
30 |
|
|
} |
31 |
|
|
|
32 |
|
|
public static class NonFair extends BlockingQueueTest { |
33 |
|
|
protected BlockingQueue emptyCollection() { |
34 |
|
|
return new SynchronousQueue(false); |
35 |
|
|
} |
36 |
|
|
} |
37 |
|
|
|
38 |
dl |
1.1 |
public static void main(String[] args) { |
39 |
jsr166 |
1.47 |
main(suite(), args); |
40 |
dl |
1.1 |
} |
41 |
|
|
|
42 |
|
|
public static Test suite() { |
43 |
jsr166 |
1.25 |
return newTestSuite(SynchronousQueueTest.class, |
44 |
|
|
new Fair().testSuite(), |
45 |
|
|
new NonFair().testSuite()); |
46 |
dl |
1.1 |
} |
47 |
|
|
|
48 |
dl |
1.4 |
/** |
49 |
jsr166 |
1.29 |
* Any SynchronousQueue is both empty and full |
50 |
dl |
1.4 |
*/ |
51 |
jsr166 |
1.35 |
public void testEmptyFull() { testEmptyFull(false); } |
52 |
|
|
public void testEmptyFull_fair() { testEmptyFull(true); } |
53 |
|
|
public void testEmptyFull(boolean fair) { |
54 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
55 |
dl |
1.1 |
assertTrue(q.isEmpty()); |
56 |
jsr166 |
1.14 |
assertEquals(0, q.size()); |
57 |
dl |
1.1 |
assertEquals(0, q.remainingCapacity()); |
58 |
dl |
1.5 |
assertFalse(q.offer(zero)); |
59 |
dl |
1.1 |
} |
60 |
|
|
|
61 |
dl |
1.4 |
/** |
62 |
dl |
1.5 |
* offer fails if no active taker |
63 |
dl |
1.4 |
*/ |
64 |
jsr166 |
1.36 |
public void testOffer() { testOffer(false); } |
65 |
|
|
public void testOffer_fair() { testOffer(true); } |
66 |
|
|
public void testOffer(boolean fair) { |
67 |
|
|
SynchronousQueue q = new SynchronousQueue(fair); |
68 |
dl |
1.5 |
assertFalse(q.offer(one)); |
69 |
dl |
1.1 |
} |
70 |
|
|
|
71 |
dl |
1.4 |
/** |
72 |
jsr166 |
1.36 |
* add throws IllegalStateException if no active taker |
73 |
dl |
1.4 |
*/ |
74 |
jsr166 |
1.36 |
public void testAdd() { testAdd(false); } |
75 |
|
|
public void testAdd_fair() { testAdd(true); } |
76 |
|
|
public void testAdd(boolean fair) { |
77 |
|
|
SynchronousQueue q = new SynchronousQueue(fair); |
78 |
|
|
assertEquals(0, q.remainingCapacity()); |
79 |
jsr166 |
1.14 |
try { |
80 |
dl |
1.5 |
q.add(one); |
81 |
|
|
shouldThrow(); |
82 |
jsr166 |
1.13 |
} catch (IllegalStateException success) {} |
83 |
dl |
1.1 |
} |
84 |
|
|
|
85 |
dl |
1.4 |
/** |
86 |
jsr166 |
1.36 |
* addAll(this) throws IllegalArgumentException |
87 |
dl |
1.6 |
*/ |
88 |
jsr166 |
1.36 |
public void testAddAll_self() { testAddAll_self(false); } |
89 |
|
|
public void testAddAll_self_fair() { testAddAll_self(true); } |
90 |
|
|
public void testAddAll_self(boolean fair) { |
91 |
|
|
SynchronousQueue q = new SynchronousQueue(fair); |
92 |
dl |
1.6 |
try { |
93 |
|
|
q.addAll(q); |
94 |
|
|
shouldThrow(); |
95 |
jsr166 |
1.13 |
} catch (IllegalArgumentException success) {} |
96 |
dl |
1.6 |
} |
97 |
|
|
|
98 |
dl |
1.4 |
/** |
99 |
dl |
1.5 |
* addAll throws ISE if no active taker |
100 |
dl |
1.4 |
*/ |
101 |
jsr166 |
1.36 |
public void testAddAll_ISE() { testAddAll_ISE(false); } |
102 |
|
|
public void testAddAll_ISE_fair() { testAddAll_ISE(true); } |
103 |
|
|
public void testAddAll_ISE(boolean fair) { |
104 |
|
|
SynchronousQueue q = new SynchronousQueue(fair); |
105 |
|
|
Integer[] ints = new Integer[1]; |
106 |
|
|
for (int i = 0; i < ints.length; i++) |
107 |
|
|
ints[i] = i; |
108 |
|
|
Collection<Integer> coll = Arrays.asList(ints); |
109 |
dl |
1.1 |
try { |
110 |
jsr166 |
1.36 |
q.addAll(coll); |
111 |
dl |
1.4 |
shouldThrow(); |
112 |
jsr166 |
1.13 |
} catch (IllegalStateException success) {} |
113 |
dl |
1.1 |
} |
114 |
|
|
|
115 |
dl |
1.4 |
/** |
116 |
dl |
1.5 |
* put blocks interruptibly if no active taker |
117 |
dl |
1.4 |
*/ |
118 |
jsr166 |
1.35 |
public void testBlockingPut() { testBlockingPut(false); } |
119 |
|
|
public void testBlockingPut_fair() { testBlockingPut(true); } |
120 |
|
|
public void testBlockingPut(boolean fair) { |
121 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
122 |
|
|
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
123 |
|
|
Thread t = newStartedThread(new CheckedRunnable() { |
124 |
jsr166 |
1.14 |
public void realRun() throws InterruptedException { |
125 |
jsr166 |
1.35 |
Thread.currentThread().interrupt(); |
126 |
|
|
try { |
127 |
|
|
q.put(99); |
128 |
|
|
shouldThrow(); |
129 |
|
|
} catch (InterruptedException success) {} |
130 |
|
|
assertFalse(Thread.interrupted()); |
131 |
|
|
|
132 |
|
|
pleaseInterrupt.countDown(); |
133 |
|
|
try { |
134 |
|
|
q.put(99); |
135 |
|
|
shouldThrow(); |
136 |
|
|
} catch (InterruptedException success) {} |
137 |
|
|
assertFalse(Thread.interrupted()); |
138 |
jsr166 |
1.13 |
}}); |
139 |
|
|
|
140 |
jsr166 |
1.35 |
await(pleaseInterrupt); |
141 |
jsr166 |
1.54 |
assertThreadBlocks(t, Thread.State.WAITING); |
142 |
jsr166 |
1.13 |
t.interrupt(); |
143 |
jsr166 |
1.35 |
awaitTermination(t); |
144 |
|
|
assertEquals(0, q.remainingCapacity()); |
145 |
dl |
1.1 |
} |
146 |
|
|
|
147 |
dl |
1.4 |
/** |
148 |
jsr166 |
1.35 |
* put blocks interruptibly waiting for take |
149 |
dl |
1.4 |
*/ |
150 |
jsr166 |
1.35 |
public void testPutWithTake() { testPutWithTake(false); } |
151 |
|
|
public void testPutWithTake_fair() { testPutWithTake(true); } |
152 |
|
|
public void testPutWithTake(boolean fair) { |
153 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
154 |
|
|
final CountDownLatch pleaseTake = new CountDownLatch(1); |
155 |
|
|
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
156 |
|
|
Thread t = newStartedThread(new CheckedRunnable() { |
157 |
jsr166 |
1.14 |
public void realRun() throws InterruptedException { |
158 |
jsr166 |
1.35 |
pleaseTake.countDown(); |
159 |
|
|
q.put(one); |
160 |
|
|
|
161 |
|
|
pleaseInterrupt.countDown(); |
162 |
jsr166 |
1.13 |
try { |
163 |
jsr166 |
1.35 |
q.put(99); |
164 |
|
|
shouldThrow(); |
165 |
|
|
} catch (InterruptedException success) {} |
166 |
|
|
assertFalse(Thread.interrupted()); |
167 |
jsr166 |
1.13 |
}}); |
168 |
|
|
|
169 |
jsr166 |
1.35 |
await(pleaseTake); |
170 |
jsr166 |
1.40 |
assertEquals(0, q.remainingCapacity()); |
171 |
jsr166 |
1.35 |
try { assertSame(one, q.take()); } |
172 |
|
|
catch (InterruptedException e) { threadUnexpectedException(e); } |
173 |
|
|
|
174 |
|
|
await(pleaseInterrupt); |
175 |
jsr166 |
1.53 |
assertThreadBlocks(t, Thread.State.WAITING); |
176 |
jsr166 |
1.13 |
t.interrupt(); |
177 |
jsr166 |
1.35 |
awaitTermination(t); |
178 |
jsr166 |
1.40 |
assertEquals(0, q.remainingCapacity()); |
179 |
dl |
1.1 |
} |
180 |
|
|
|
181 |
dl |
1.4 |
/** |
182 |
dl |
1.5 |
* timed offer times out if elements not taken |
183 |
dl |
1.4 |
*/ |
184 |
jsr166 |
1.35 |
public void testTimedOffer() { testTimedOffer(false); } |
185 |
|
|
public void testTimedOffer_fair() { testTimedOffer(true); } |
186 |
|
|
public void testTimedOffer(boolean fair) { |
187 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
188 |
jsr166 |
1.29 |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
189 |
|
|
Thread t = newStartedThread(new CheckedRunnable() { |
190 |
jsr166 |
1.14 |
public void realRun() throws InterruptedException { |
191 |
jsr166 |
1.34 |
long startTime = System.nanoTime(); |
192 |
|
|
assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS)); |
193 |
|
|
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
194 |
jsr166 |
1.29 |
pleaseInterrupt.countDown(); |
195 |
|
|
try { |
196 |
jsr166 |
1.34 |
q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS); |
197 |
jsr166 |
1.29 |
shouldThrow(); |
198 |
|
|
} catch (InterruptedException success) {} |
199 |
jsr166 |
1.56 |
assertFalse(Thread.interrupted()); |
200 |
jsr166 |
1.13 |
}}); |
201 |
jsr166 |
1.10 |
|
202 |
jsr166 |
1.34 |
await(pleaseInterrupt); |
203 |
jsr166 |
1.54 |
assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
204 |
jsr166 |
1.13 |
t.interrupt(); |
205 |
jsr166 |
1.34 |
awaitTermination(t); |
206 |
jsr166 |
1.29 |
} |
207 |
|
|
|
208 |
|
|
/** |
209 |
|
|
* poll return null if no active putter |
210 |
dl |
1.4 |
*/ |
211 |
jsr166 |
1.36 |
public void testPoll() { testPoll(false); } |
212 |
|
|
public void testPoll_fair() { testPoll(true); } |
213 |
|
|
public void testPoll(boolean fair) { |
214 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
215 |
jsr166 |
1.14 |
assertNull(q.poll()); |
216 |
dl |
1.1 |
} |
217 |
|
|
|
218 |
dl |
1.4 |
/** |
219 |
jsr166 |
1.29 |
* timed poll with zero timeout times out if no active putter |
220 |
dl |
1.4 |
*/ |
221 |
jsr166 |
1.36 |
public void testTimedPoll0() { testTimedPoll0(false); } |
222 |
|
|
public void testTimedPoll0_fair() { testTimedPoll0(true); } |
223 |
|
|
public void testTimedPoll0(boolean fair) { |
224 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
225 |
|
|
try { assertNull(q.poll(0, MILLISECONDS)); } |
226 |
|
|
catch (InterruptedException e) { threadUnexpectedException(e); } |
227 |
dl |
1.1 |
} |
228 |
|
|
|
229 |
dl |
1.4 |
/** |
230 |
jsr166 |
1.29 |
* timed poll with nonzero timeout times out if no active putter |
231 |
dl |
1.4 |
*/ |
232 |
jsr166 |
1.36 |
public void testTimedPoll() { testTimedPoll(false); } |
233 |
|
|
public void testTimedPoll_fair() { testTimedPoll(true); } |
234 |
|
|
public void testTimedPoll(boolean fair) { |
235 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
236 |
jsr166 |
1.35 |
long startTime = System.nanoTime(); |
237 |
jsr166 |
1.36 |
try { assertNull(q.poll(timeoutMillis(), MILLISECONDS)); } |
238 |
|
|
catch (InterruptedException e) { threadUnexpectedException(e); } |
239 |
jsr166 |
1.35 |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
240 |
dl |
1.8 |
} |
241 |
|
|
|
242 |
|
|
/** |
243 |
jsr166 |
1.29 |
* timed poll before a delayed offer times out, returning null; |
244 |
|
|
* after offer succeeds; on interruption throws |
245 |
dl |
1.8 |
*/ |
246 |
jsr166 |
1.36 |
public void testTimedPollWithOffer() { testTimedPollWithOffer(false); } |
247 |
|
|
public void testTimedPollWithOffer_fair() { testTimedPollWithOffer(true); } |
248 |
|
|
public void testTimedPollWithOffer(boolean fair) { |
249 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
250 |
jsr166 |
1.29 |
final CountDownLatch pleaseOffer = new CountDownLatch(1); |
251 |
jsr166 |
1.36 |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
252 |
jsr166 |
1.29 |
Thread t = newStartedThread(new CheckedRunnable() { |
253 |
jsr166 |
1.14 |
public void realRun() throws InterruptedException { |
254 |
jsr166 |
1.36 |
long startTime = System.nanoTime(); |
255 |
|
|
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
256 |
|
|
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
257 |
jsr166 |
1.29 |
|
258 |
|
|
pleaseOffer.countDown(); |
259 |
jsr166 |
1.36 |
startTime = System.nanoTime(); |
260 |
jsr166 |
1.29 |
assertSame(zero, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
261 |
|
|
|
262 |
jsr166 |
1.36 |
Thread.currentThread().interrupt(); |
263 |
jsr166 |
1.13 |
try { |
264 |
|
|
q.poll(LONG_DELAY_MS, MILLISECONDS); |
265 |
jsr166 |
1.29 |
shouldThrow(); |
266 |
jsr166 |
1.13 |
} catch (InterruptedException success) {} |
267 |
jsr166 |
1.36 |
assertFalse(Thread.interrupted()); |
268 |
|
|
|
269 |
|
|
pleaseInterrupt.countDown(); |
270 |
|
|
try { |
271 |
|
|
q.poll(LONG_DELAY_MS, MILLISECONDS); |
272 |
|
|
shouldThrow(); |
273 |
|
|
} catch (InterruptedException success) {} |
274 |
|
|
assertFalse(Thread.interrupted()); |
275 |
jsr166 |
1.50 |
|
276 |
|
|
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
277 |
jsr166 |
1.13 |
}}); |
278 |
|
|
|
279 |
jsr166 |
1.36 |
await(pleaseOffer); |
280 |
|
|
long startTime = System.nanoTime(); |
281 |
|
|
try { assertTrue(q.offer(zero, LONG_DELAY_MS, MILLISECONDS)); } |
282 |
|
|
catch (InterruptedException e) { threadUnexpectedException(e); } |
283 |
jsr166 |
1.50 |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
284 |
jsr166 |
1.30 |
|
285 |
jsr166 |
1.36 |
await(pleaseInterrupt); |
286 |
jsr166 |
1.55 |
assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
287 |
jsr166 |
1.13 |
t.interrupt(); |
288 |
jsr166 |
1.36 |
awaitTermination(t); |
289 |
jsr166 |
1.10 |
} |
290 |
dl |
1.1 |
|
291 |
dl |
1.4 |
/** |
292 |
jsr166 |
1.29 |
* peek() returns null if no active putter |
293 |
dl |
1.4 |
*/ |
294 |
jsr166 |
1.36 |
public void testPeek() { testPeek(false); } |
295 |
|
|
public void testPeek_fair() { testPeek(true); } |
296 |
|
|
public void testPeek(boolean fair) { |
297 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
298 |
jsr166 |
1.14 |
assertNull(q.peek()); |
299 |
dl |
1.1 |
} |
300 |
|
|
|
301 |
dl |
1.4 |
/** |
302 |
jsr166 |
1.36 |
* element() throws NoSuchElementException if no active putter |
303 |
dl |
1.4 |
*/ |
304 |
jsr166 |
1.36 |
public void testElement() { testElement(false); } |
305 |
|
|
public void testElement_fair() { testElement(true); } |
306 |
|
|
public void testElement(boolean fair) { |
307 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
308 |
dl |
1.1 |
try { |
309 |
|
|
q.element(); |
310 |
dl |
1.4 |
shouldThrow(); |
311 |
jsr166 |
1.13 |
} catch (NoSuchElementException success) {} |
312 |
dl |
1.1 |
} |
313 |
|
|
|
314 |
dl |
1.4 |
/** |
315 |
jsr166 |
1.36 |
* remove() throws NoSuchElementException if no active putter |
316 |
dl |
1.4 |
*/ |
317 |
jsr166 |
1.36 |
public void testRemove() { testRemove(false); } |
318 |
|
|
public void testRemove_fair() { testRemove(true); } |
319 |
|
|
public void testRemove(boolean fair) { |
320 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
321 |
dl |
1.1 |
try { |
322 |
|
|
q.remove(); |
323 |
dl |
1.4 |
shouldThrow(); |
324 |
jsr166 |
1.16 |
} catch (NoSuchElementException success) {} |
325 |
dl |
1.1 |
} |
326 |
|
|
|
327 |
dl |
1.4 |
/** |
328 |
dl |
1.5 |
* contains returns false |
329 |
dl |
1.4 |
*/ |
330 |
jsr166 |
1.36 |
public void testContains() { testContains(false); } |
331 |
|
|
public void testContains_fair() { testContains(true); } |
332 |
|
|
public void testContains(boolean fair) { |
333 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
334 |
dl |
1.5 |
assertFalse(q.contains(zero)); |
335 |
dl |
1.1 |
} |
336 |
|
|
|
337 |
dl |
1.4 |
/** |
338 |
dl |
1.5 |
* clear ensures isEmpty |
339 |
dl |
1.4 |
*/ |
340 |
jsr166 |
1.36 |
public void testClear() { testClear(false); } |
341 |
|
|
public void testClear_fair() { testClear(true); } |
342 |
|
|
public void testClear(boolean fair) { |
343 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
344 |
dl |
1.1 |
q.clear(); |
345 |
|
|
assertTrue(q.isEmpty()); |
346 |
|
|
} |
347 |
|
|
|
348 |
dl |
1.4 |
/** |
349 |
dl |
1.5 |
* containsAll returns false unless empty |
350 |
dl |
1.4 |
*/ |
351 |
jsr166 |
1.36 |
public void testContainsAll() { testContainsAll(false); } |
352 |
|
|
public void testContainsAll_fair() { testContainsAll(true); } |
353 |
|
|
public void testContainsAll(boolean fair) { |
354 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
355 |
dl |
1.1 |
Integer[] empty = new Integer[0]; |
356 |
dl |
1.5 |
assertTrue(q.containsAll(Arrays.asList(empty))); |
357 |
|
|
Integer[] ints = new Integer[1]; ints[0] = zero; |
358 |
dl |
1.1 |
assertFalse(q.containsAll(Arrays.asList(ints))); |
359 |
|
|
} |
360 |
|
|
|
361 |
dl |
1.4 |
/** |
362 |
dl |
1.5 |
* retainAll returns false |
363 |
dl |
1.4 |
*/ |
364 |
jsr166 |
1.36 |
public void testRetainAll() { testRetainAll(false); } |
365 |
|
|
public void testRetainAll_fair() { testRetainAll(true); } |
366 |
|
|
public void testRetainAll(boolean fair) { |
367 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
368 |
dl |
1.1 |
Integer[] empty = new Integer[0]; |
369 |
dl |
1.5 |
assertFalse(q.retainAll(Arrays.asList(empty))); |
370 |
|
|
Integer[] ints = new Integer[1]; ints[0] = zero; |
371 |
|
|
assertFalse(q.retainAll(Arrays.asList(ints))); |
372 |
dl |
1.1 |
} |
373 |
|
|
|
374 |
dl |
1.4 |
/** |
375 |
dl |
1.5 |
* removeAll returns false |
376 |
dl |
1.4 |
*/ |
377 |
jsr166 |
1.36 |
public void testRemoveAll() { testRemoveAll(false); } |
378 |
|
|
public void testRemoveAll_fair() { testRemoveAll(true); } |
379 |
|
|
public void testRemoveAll(boolean fair) { |
380 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
381 |
dl |
1.1 |
Integer[] empty = new Integer[0]; |
382 |
dl |
1.5 |
assertFalse(q.removeAll(Arrays.asList(empty))); |
383 |
|
|
Integer[] ints = new Integer[1]; ints[0] = zero; |
384 |
dl |
1.1 |
assertFalse(q.containsAll(Arrays.asList(ints))); |
385 |
|
|
} |
386 |
|
|
|
387 |
dl |
1.4 |
/** |
388 |
dl |
1.5 |
* toArray is empty |
389 |
dl |
1.4 |
*/ |
390 |
jsr166 |
1.36 |
public void testToArray() { testToArray(false); } |
391 |
|
|
public void testToArray_fair() { testToArray(true); } |
392 |
|
|
public void testToArray(boolean fair) { |
393 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
394 |
jsr166 |
1.14 |
Object[] o = q.toArray(); |
395 |
jsr166 |
1.40 |
assertEquals(0, o.length); |
396 |
dl |
1.1 |
} |
397 |
|
|
|
398 |
dl |
1.4 |
/** |
399 |
jsr166 |
1.40 |
* toArray(Integer array) returns its argument with the first |
400 |
|
|
* element (if present) nulled out |
401 |
dl |
1.4 |
*/ |
402 |
jsr166 |
1.36 |
public void testToArray2() { testToArray2(false); } |
403 |
|
|
public void testToArray2_fair() { testToArray2(true); } |
404 |
|
|
public void testToArray2(boolean fair) { |
405 |
jsr166 |
1.51 |
final SynchronousQueue<Integer> q = new SynchronousQueue<>(fair); |
406 |
jsr166 |
1.40 |
Integer[] a; |
407 |
|
|
|
408 |
|
|
a = new Integer[0]; |
409 |
|
|
assertSame(a, q.toArray(a)); |
410 |
jsr166 |
1.41 |
|
411 |
jsr166 |
1.40 |
a = new Integer[3]; |
412 |
|
|
Arrays.fill(a, 42); |
413 |
|
|
assertSame(a, q.toArray(a)); |
414 |
|
|
assertNull(a[0]); |
415 |
|
|
for (int i = 1; i < a.length; i++) |
416 |
|
|
assertEquals(42, (int) a[i]); |
417 |
dl |
1.1 |
} |
418 |
jsr166 |
1.10 |
|
419 |
dl |
1.4 |
/** |
420 |
dl |
1.6 |
* toArray(null) throws NPE |
421 |
|
|
*/ |
422 |
jsr166 |
1.36 |
public void testToArray_null() { testToArray_null(false); } |
423 |
|
|
public void testToArray_null_fair() { testToArray_null(true); } |
424 |
|
|
public void testToArray_null(boolean fair) { |
425 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
426 |
jsr166 |
1.14 |
try { |
427 |
jsr166 |
1.45 |
Object[] o = q.toArray(null); |
428 |
jsr166 |
1.14 |
shouldThrow(); |
429 |
|
|
} catch (NullPointerException success) {} |
430 |
dl |
1.6 |
} |
431 |
|
|
|
432 |
|
|
/** |
433 |
dl |
1.5 |
* iterator does not traverse any elements |
434 |
dl |
1.4 |
*/ |
435 |
jsr166 |
1.36 |
public void testIterator() { testIterator(false); } |
436 |
|
|
public void testIterator_fair() { testIterator(true); } |
437 |
|
|
public void testIterator(boolean fair) { |
438 |
jsr166 |
1.46 |
assertIteratorExhausted(new SynchronousQueue(fair).iterator()); |
439 |
dl |
1.1 |
} |
440 |
|
|
|
441 |
dl |
1.4 |
/** |
442 |
dl |
1.5 |
* iterator remove throws ISE |
443 |
dl |
1.4 |
*/ |
444 |
jsr166 |
1.36 |
public void testIteratorRemove() { testIteratorRemove(false); } |
445 |
|
|
public void testIteratorRemove_fair() { testIteratorRemove(true); } |
446 |
|
|
public void testIteratorRemove(boolean fair) { |
447 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
448 |
jsr166 |
1.14 |
Iterator it = q.iterator(); |
449 |
dl |
1.1 |
try { |
450 |
|
|
it.remove(); |
451 |
dl |
1.4 |
shouldThrow(); |
452 |
jsr166 |
1.13 |
} catch (IllegalStateException success) {} |
453 |
dl |
1.1 |
} |
454 |
|
|
|
455 |
dl |
1.4 |
/** |
456 |
dl |
1.5 |
* toString returns a non-null string |
457 |
dl |
1.4 |
*/ |
458 |
jsr166 |
1.36 |
public void testToString() { testToString(false); } |
459 |
|
|
public void testToString_fair() { testToString(true); } |
460 |
|
|
public void testToString(boolean fair) { |
461 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
462 |
dl |
1.1 |
String s = q.toString(); |
463 |
dl |
1.5 |
assertNotNull(s); |
464 |
jsr166 |
1.10 |
} |
465 |
dl |
1.1 |
|
466 |
dl |
1.4 |
/** |
467 |
dl |
1.5 |
* offer transfers elements across Executor tasks |
468 |
dl |
1.4 |
*/ |
469 |
jsr166 |
1.36 |
public void testOfferInExecutor() { testOfferInExecutor(false); } |
470 |
|
|
public void testOfferInExecutor_fair() { testOfferInExecutor(true); } |
471 |
|
|
public void testOfferInExecutor(boolean fair) { |
472 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
473 |
jsr166 |
1.35 |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
474 |
jsr166 |
1.49 |
final ExecutorService executor = Executors.newFixedThreadPool(2); |
475 |
|
|
try (PoolCleaner cleaner = cleaner(executor)) { |
476 |
dl |
1.1 |
|
477 |
jsr166 |
1.49 |
executor.execute(new CheckedRunnable() { |
478 |
|
|
public void realRun() throws InterruptedException { |
479 |
|
|
assertFalse(q.offer(one)); |
480 |
|
|
threadsStarted.await(); |
481 |
|
|
assertTrue(q.offer(one, LONG_DELAY_MS, MILLISECONDS)); |
482 |
|
|
assertEquals(0, q.remainingCapacity()); |
483 |
|
|
}}); |
484 |
|
|
|
485 |
|
|
executor.execute(new CheckedRunnable() { |
486 |
|
|
public void realRun() throws InterruptedException { |
487 |
|
|
threadsStarted.await(); |
488 |
|
|
assertSame(one, q.take()); |
489 |
|
|
}}); |
490 |
|
|
} |
491 |
dl |
1.1 |
} |
492 |
|
|
|
493 |
dl |
1.4 |
/** |
494 |
jsr166 |
1.35 |
* timed poll retrieves elements across Executor threads |
495 |
dl |
1.4 |
*/ |
496 |
jsr166 |
1.36 |
public void testPollInExecutor() { testPollInExecutor(false); } |
497 |
|
|
public void testPollInExecutor_fair() { testPollInExecutor(true); } |
498 |
|
|
public void testPollInExecutor(boolean fair) { |
499 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
500 |
jsr166 |
1.35 |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
501 |
jsr166 |
1.49 |
final ExecutorService executor = Executors.newFixedThreadPool(2); |
502 |
|
|
try (PoolCleaner cleaner = cleaner(executor)) { |
503 |
|
|
executor.execute(new CheckedRunnable() { |
504 |
|
|
public void realRun() throws InterruptedException { |
505 |
|
|
assertNull(q.poll()); |
506 |
|
|
threadsStarted.await(); |
507 |
|
|
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
508 |
|
|
assertTrue(q.isEmpty()); |
509 |
|
|
}}); |
510 |
|
|
|
511 |
|
|
executor.execute(new CheckedRunnable() { |
512 |
|
|
public void realRun() throws InterruptedException { |
513 |
|
|
threadsStarted.await(); |
514 |
|
|
q.put(one); |
515 |
|
|
}}); |
516 |
|
|
} |
517 |
dl |
1.2 |
} |
518 |
|
|
|
519 |
dl |
1.4 |
/** |
520 |
dl |
1.5 |
* a deserialized serialized queue is usable |
521 |
dl |
1.4 |
*/ |
522 |
jsr166 |
1.40 |
public void testSerialization() { |
523 |
|
|
final SynchronousQueue x = new SynchronousQueue(); |
524 |
|
|
final SynchronousQueue y = new SynchronousQueue(false); |
525 |
|
|
final SynchronousQueue z = new SynchronousQueue(true); |
526 |
|
|
assertSerialEquals(x, y); |
527 |
|
|
assertNotSerialEquals(x, z); |
528 |
|
|
SynchronousQueue[] qs = { x, y, z }; |
529 |
|
|
for (SynchronousQueue q : qs) { |
530 |
|
|
SynchronousQueue clone = serialClone(q); |
531 |
jsr166 |
1.41 |
assertNotSame(q, clone); |
532 |
jsr166 |
1.40 |
assertSerialEquals(q, clone); |
533 |
|
|
assertTrue(clone.isEmpty()); |
534 |
|
|
assertEquals(0, clone.size()); |
535 |
|
|
assertEquals(0, clone.remainingCapacity()); |
536 |
|
|
assertFalse(clone.offer(zero)); |
537 |
|
|
} |
538 |
dl |
1.1 |
} |
539 |
dl |
1.6 |
|
540 |
|
|
/** |
541 |
|
|
* drainTo(c) of empty queue doesn't transfer elements |
542 |
jsr166 |
1.10 |
*/ |
543 |
jsr166 |
1.36 |
public void testDrainTo() { testDrainTo(false); } |
544 |
|
|
public void testDrainTo_fair() { testDrainTo(true); } |
545 |
|
|
public void testDrainTo(boolean fair) { |
546 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
547 |
dl |
1.6 |
ArrayList l = new ArrayList(); |
548 |
|
|
q.drainTo(l); |
549 |
jsr166 |
1.40 |
assertEquals(0, q.size()); |
550 |
|
|
assertEquals(0, l.size()); |
551 |
dl |
1.6 |
} |
552 |
|
|
|
553 |
|
|
/** |
554 |
|
|
* drainTo empties queue, unblocking a waiting put. |
555 |
jsr166 |
1.10 |
*/ |
556 |
jsr166 |
1.36 |
public void testDrainToWithActivePut() { testDrainToWithActivePut(false); } |
557 |
|
|
public void testDrainToWithActivePut_fair() { testDrainToWithActivePut(true); } |
558 |
|
|
public void testDrainToWithActivePut(boolean fair) { |
559 |
|
|
final SynchronousQueue q = new SynchronousQueue(fair); |
560 |
jsr166 |
1.35 |
Thread t = newStartedThread(new CheckedRunnable() { |
561 |
jsr166 |
1.14 |
public void realRun() throws InterruptedException { |
562 |
jsr166 |
1.35 |
q.put(one); |
563 |
jsr166 |
1.13 |
}}); |
564 |
|
|
|
565 |
|
|
ArrayList l = new ArrayList(); |
566 |
jsr166 |
1.35 |
long startTime = System.nanoTime(); |
567 |
|
|
while (l.isEmpty()) { |
568 |
|
|
q.drainTo(l); |
569 |
|
|
if (millisElapsedSince(startTime) > LONG_DELAY_MS) |
570 |
|
|
fail("timed out"); |
571 |
|
|
Thread.yield(); |
572 |
|
|
} |
573 |
jsr166 |
1.52 |
assertEquals(1, l.size()); |
574 |
jsr166 |
1.35 |
assertSame(one, l.get(0)); |
575 |
|
|
awaitTermination(t); |
576 |
dl |
1.6 |
} |
577 |
|
|
|
578 |
|
|
/** |
579 |
|
|
* drainTo(c, n) empties up to n elements of queue into c |
580 |
jsr166 |
1.10 |
*/ |
581 |
jsr166 |
1.13 |
public void testDrainToN() throws InterruptedException { |
582 |
dl |
1.6 |
final SynchronousQueue q = new SynchronousQueue(); |
583 |
jsr166 |
1.35 |
Thread t1 = newStartedThread(new CheckedRunnable() { |
584 |
jsr166 |
1.14 |
public void realRun() throws InterruptedException { |
585 |
jsr166 |
1.13 |
q.put(one); |
586 |
|
|
}}); |
587 |
|
|
|
588 |
jsr166 |
1.35 |
Thread t2 = newStartedThread(new CheckedRunnable() { |
589 |
jsr166 |
1.14 |
public void realRun() throws InterruptedException { |
590 |
jsr166 |
1.13 |
q.put(two); |
591 |
|
|
}}); |
592 |
dl |
1.6 |
|
593 |
jsr166 |
1.13 |
ArrayList l = new ArrayList(); |
594 |
jsr166 |
1.48 |
int drained; |
595 |
|
|
while ((drained = q.drainTo(l, 1)) == 0) Thread.yield(); |
596 |
|
|
assertEquals(1, drained); |
597 |
jsr166 |
1.23 |
assertEquals(1, l.size()); |
598 |
jsr166 |
1.48 |
while ((drained = q.drainTo(l, 1)) == 0) Thread.yield(); |
599 |
|
|
assertEquals(1, drained); |
600 |
jsr166 |
1.23 |
assertEquals(2, l.size()); |
601 |
jsr166 |
1.13 |
assertTrue(l.contains(one)); |
602 |
|
|
assertTrue(l.contains(two)); |
603 |
jsr166 |
1.35 |
awaitTermination(t1); |
604 |
|
|
awaitTermination(t2); |
605 |
dl |
1.6 |
} |
606 |
|
|
|
607 |
jsr166 |
1.42 |
/** |
608 |
|
|
* remove(null), contains(null) always return false |
609 |
|
|
*/ |
610 |
|
|
public void testNeverContainsNull() { |
611 |
|
|
Collection<?> q = new SynchronousQueue(); |
612 |
|
|
assertFalse(q.contains(null)); |
613 |
|
|
assertFalse(q.remove(null)); |
614 |
|
|
} |
615 |
|
|
|
616 |
dl |
1.1 |
} |