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