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 |
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.*; |
9 |
|
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
10 |
< |
import java.io.*; |
10 |
> |
|
11 |
> |
import java.util.ArrayList; |
12 |
> |
import java.util.Arrays; |
13 |
> |
import java.util.Collection; |
14 |
> |
import java.util.Iterator; |
15 |
> |
import java.util.NoSuchElementException; |
16 |
> |
import java.util.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 |
> |
|
22 |
> |
import junit.framework.Test; |
23 |
|
|
24 |
|
public class SynchronousQueueTest extends JSR166TestCase { |
25 |
|
|
48 |
|
/** |
49 |
|
* Any SynchronousQueue is both empty and full |
50 |
|
*/ |
51 |
< |
public void testEmptyFull(SynchronousQueue q) { |
51 |
> |
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 |
|
assertTrue(q.isEmpty()); |
56 |
|
assertEquals(0, q.size()); |
57 |
|
assertEquals(0, q.remainingCapacity()); |
59 |
|
} |
60 |
|
|
61 |
|
/** |
50 |
– |
* A non-fair SynchronousQueue is both empty and full |
51 |
– |
*/ |
52 |
– |
public void testEmptyFull() { |
53 |
– |
testEmptyFull(new SynchronousQueue()); |
54 |
– |
} |
55 |
– |
|
56 |
– |
/** |
57 |
– |
* A fair SynchronousQueue is both empty and full |
58 |
– |
*/ |
59 |
– |
public void testFairEmptyFull() { |
60 |
– |
testEmptyFull(new SynchronousQueue(true)); |
61 |
– |
} |
62 |
– |
|
63 |
– |
/** |
64 |
– |
* offer(null) throws NPE |
65 |
– |
*/ |
66 |
– |
public void testOfferNull() { |
67 |
– |
try { |
68 |
– |
SynchronousQueue q = new SynchronousQueue(); |
69 |
– |
q.offer(null); |
70 |
– |
shouldThrow(); |
71 |
– |
} catch (NullPointerException success) {} |
72 |
– |
} |
73 |
– |
|
74 |
– |
/** |
75 |
– |
* add(null) throws NPE |
76 |
– |
*/ |
77 |
– |
public void testAddNull() { |
78 |
– |
try { |
79 |
– |
SynchronousQueue q = new SynchronousQueue(); |
80 |
– |
q.add(null); |
81 |
– |
shouldThrow(); |
82 |
– |
} catch (NullPointerException success) {} |
83 |
– |
} |
84 |
– |
|
85 |
– |
/** |
62 |
|
* offer fails if no active taker |
63 |
|
*/ |
64 |
< |
public void testOffer() { |
65 |
< |
SynchronousQueue q = new SynchronousQueue(); |
64 |
> |
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 |
|
assertFalse(q.offer(one)); |
69 |
|
} |
70 |
|
|
71 |
|
/** |
72 |
< |
* add throws ISE if no active taker |
72 |
> |
* add throws IllegalStateException if no active taker |
73 |
|
*/ |
74 |
< |
public void testAdd() { |
74 |
> |
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 |
|
try { |
98 |
– |
SynchronousQueue q = new SynchronousQueue(); |
99 |
– |
assertEquals(0, q.remainingCapacity()); |
80 |
|
q.add(one); |
81 |
|
shouldThrow(); |
82 |
|
} catch (IllegalStateException success) {} |
83 |
|
} |
84 |
|
|
85 |
|
/** |
86 |
< |
* addAll(null) throws NPE |
107 |
< |
*/ |
108 |
< |
public void testAddAll1() { |
109 |
< |
try { |
110 |
< |
SynchronousQueue q = new SynchronousQueue(); |
111 |
< |
q.addAll(null); |
112 |
< |
shouldThrow(); |
113 |
< |
} catch (NullPointerException success) {} |
114 |
< |
} |
115 |
< |
|
116 |
< |
/** |
117 |
< |
* addAll(this) throws IAE |
86 |
> |
* addAll(this) throws IllegalArgumentException |
87 |
|
*/ |
88 |
< |
public void testAddAllSelf() { |
88 |
> |
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 |
|
try { |
121 |
– |
SynchronousQueue q = new SynchronousQueue(); |
93 |
|
q.addAll(q); |
94 |
|
shouldThrow(); |
95 |
|
} catch (IllegalArgumentException success) {} |
96 |
|
} |
97 |
|
|
98 |
|
/** |
128 |
– |
* addAll of a collection with null elements throws NPE |
129 |
– |
*/ |
130 |
– |
public void testAddAll2() { |
131 |
– |
try { |
132 |
– |
SynchronousQueue q = new SynchronousQueue(); |
133 |
– |
Integer[] ints = new Integer[1]; |
134 |
– |
q.addAll(Arrays.asList(ints)); |
135 |
– |
shouldThrow(); |
136 |
– |
} catch (NullPointerException success) {} |
137 |
– |
} |
138 |
– |
|
139 |
– |
/** |
99 |
|
* addAll throws ISE if no active taker |
100 |
|
*/ |
101 |
< |
public void testAddAll4() { |
101 |
> |
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 |
|
try { |
110 |
< |
SynchronousQueue q = new SynchronousQueue(); |
145 |
< |
Integer[] ints = new Integer[1]; |
146 |
< |
for (int i = 0; i < 1; ++i) |
147 |
< |
ints[i] = new Integer(i); |
148 |
< |
q.addAll(Arrays.asList(ints)); |
110 |
> |
q.addAll(coll); |
111 |
|
shouldThrow(); |
112 |
|
} catch (IllegalStateException success) {} |
113 |
|
} |
114 |
|
|
115 |
|
/** |
154 |
– |
* put(null) throws NPE |
155 |
– |
*/ |
156 |
– |
public void testPutNull() throws InterruptedException { |
157 |
– |
try { |
158 |
– |
SynchronousQueue q = new SynchronousQueue(); |
159 |
– |
q.put(null); |
160 |
– |
shouldThrow(); |
161 |
– |
} catch (NullPointerException success) {} |
162 |
– |
} |
163 |
– |
|
164 |
– |
/** |
116 |
|
* put blocks interruptibly if no active taker |
117 |
|
*/ |
118 |
< |
public void testBlockingPut() throws InterruptedException { |
119 |
< |
Thread t = new Thread(new CheckedInterruptedRunnable() { |
118 |
> |
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 |
|
public void realRun() throws InterruptedException { |
125 |
< |
SynchronousQueue q = new SynchronousQueue(); |
126 |
< |
q.put(zero); |
127 |
< |
}}); |
128 |
< |
|
129 |
< |
t.start(); |
130 |
< |
Thread.sleep(SHORT_DELAY_MS); |
176 |
< |
t.interrupt(); |
177 |
< |
t.join(); |
178 |
< |
} |
125 |
> |
Thread.currentThread().interrupt(); |
126 |
> |
try { |
127 |
> |
q.put(99); |
128 |
> |
shouldThrow(); |
129 |
> |
} catch (InterruptedException success) {} |
130 |
> |
assertFalse(Thread.interrupted()); |
131 |
|
|
132 |
< |
/** |
181 |
< |
* put blocks waiting for take |
182 |
< |
*/ |
183 |
< |
public void testPutWithTake() throws InterruptedException { |
184 |
< |
final SynchronousQueue q = new SynchronousQueue(); |
185 |
< |
Thread t = new Thread(new CheckedRunnable() { |
186 |
< |
public void realRun() throws InterruptedException { |
187 |
< |
int added = 0; |
132 |
> |
pleaseInterrupt.countDown(); |
133 |
|
try { |
134 |
< |
while (true) { |
135 |
< |
q.put(added); |
136 |
< |
++added; |
137 |
< |
} |
193 |
< |
} catch (InterruptedException success) { |
194 |
< |
assertEquals(1, added); |
195 |
< |
} |
134 |
> |
q.put(99); |
135 |
> |
shouldThrow(); |
136 |
> |
} catch (InterruptedException success) {} |
137 |
> |
assertFalse(Thread.interrupted()); |
138 |
|
}}); |
139 |
|
|
140 |
< |
t.start(); |
141 |
< |
Thread.sleep(SHORT_DELAY_MS); |
200 |
< |
assertEquals(0, q.take()); |
201 |
< |
Thread.sleep(SHORT_DELAY_MS); |
140 |
> |
await(pleaseInterrupt); |
141 |
> |
assertThreadStaysAlive(t); |
142 |
|
t.interrupt(); |
143 |
< |
t.join(); |
143 |
> |
awaitTermination(t); |
144 |
> |
assertEquals(0, q.remainingCapacity()); |
145 |
|
} |
146 |
|
|
147 |
|
/** |
148 |
< |
* timed offer times out if elements not taken |
148 |
> |
* put blocks interruptibly waiting for take |
149 |
|
*/ |
150 |
< |
public void testTimedOffer(final SynchronousQueue q) |
151 |
< |
throws InterruptedException { |
150 |
> |
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 |
|
public void realRun() throws InterruptedException { |
158 |
< |
long t0 = System.nanoTime(); |
159 |
< |
assertFalse(q.offer(new Object(), SHORT_DELAY_MS, MILLISECONDS)); |
160 |
< |
assertTrue(millisElapsedSince(t0) >= SHORT_DELAY_MS); |
158 |
> |
pleaseTake.countDown(); |
159 |
> |
q.put(one); |
160 |
> |
|
161 |
|
pleaseInterrupt.countDown(); |
218 |
– |
t0 = System.nanoTime(); |
162 |
|
try { |
163 |
< |
q.offer(new Object(), LONG_DELAY_MS, MILLISECONDS); |
163 |
> |
q.put(99); |
164 |
|
shouldThrow(); |
165 |
|
} catch (InterruptedException success) {} |
166 |
< |
assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS); |
166 |
> |
assertFalse(Thread.interrupted()); |
167 |
|
}}); |
168 |
|
|
169 |
< |
assertTrue(pleaseInterrupt.await(MEDIUM_DELAY_MS, MILLISECONDS)); |
170 |
< |
t.interrupt(); |
171 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
172 |
< |
} |
230 |
< |
|
231 |
< |
/** |
232 |
< |
* timed offer times out if elements not taken |
233 |
< |
*/ |
234 |
< |
public void testTimedOffer() throws InterruptedException { |
235 |
< |
testTimedOffer(new SynchronousQueue()); |
236 |
< |
} |
237 |
< |
|
238 |
< |
/** |
239 |
< |
* timed offer times out if elements not taken |
240 |
< |
*/ |
241 |
< |
public void testFairTimedOffer() throws InterruptedException { |
242 |
< |
testTimedOffer(new SynchronousQueue(true)); |
243 |
< |
} |
244 |
< |
|
245 |
< |
/** |
246 |
< |
* put blocks interruptibly if no active taker |
247 |
< |
*/ |
248 |
< |
public void testFairBlockingPut() throws InterruptedException { |
249 |
< |
Thread t = new Thread(new CheckedInterruptedRunnable() { |
250 |
< |
public void realRun() throws InterruptedException { |
251 |
< |
SynchronousQueue q = new SynchronousQueue(true); |
252 |
< |
q.put(zero); |
253 |
< |
}}); |
169 |
> |
await(pleaseTake); |
170 |
> |
assertEquals(0, q.remainingCapacity()); |
171 |
> |
try { assertSame(one, q.take()); } |
172 |
> |
catch (InterruptedException e) { threadUnexpectedException(e); } |
173 |
|
|
174 |
< |
t.start(); |
175 |
< |
Thread.sleep(SHORT_DELAY_MS); |
174 |
> |
await(pleaseInterrupt); |
175 |
> |
assertThreadStaysAlive(t); |
176 |
|
t.interrupt(); |
177 |
< |
t.join(); |
177 |
> |
awaitTermination(t); |
178 |
> |
assertEquals(0, q.remainingCapacity()); |
179 |
|
} |
180 |
|
|
181 |
|
/** |
182 |
< |
* put blocks waiting for take |
182 |
> |
* timed offer times out if elements not taken |
183 |
|
*/ |
184 |
< |
public void testFairPutWithTake() throws InterruptedException { |
185 |
< |
final SynchronousQueue q = new SynchronousQueue(true); |
186 |
< |
Thread t = new Thread(new CheckedRunnable() { |
184 |
> |
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 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
189 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
190 |
|
public void realRun() throws InterruptedException { |
191 |
< |
int added = 0; |
191 |
> |
long startTime = System.nanoTime(); |
192 |
> |
assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS)); |
193 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
194 |
> |
pleaseInterrupt.countDown(); |
195 |
|
try { |
196 |
< |
while (true) { |
197 |
< |
q.put(added); |
198 |
< |
++added; |
273 |
< |
} |
274 |
< |
} catch (InterruptedException success) { |
275 |
< |
assertEquals(1, added); |
276 |
< |
} |
277 |
< |
}}); |
278 |
< |
|
279 |
< |
t.start(); |
280 |
< |
Thread.sleep(SHORT_DELAY_MS); |
281 |
< |
assertEquals(0, q.take()); |
282 |
< |
Thread.sleep(SHORT_DELAY_MS); |
283 |
< |
t.interrupt(); |
284 |
< |
t.join(); |
285 |
< |
} |
286 |
< |
|
287 |
< |
/** |
288 |
< |
* take blocks interruptibly when empty |
289 |
< |
*/ |
290 |
< |
public void testFairTakeFromEmpty() throws InterruptedException { |
291 |
< |
final SynchronousQueue q = new SynchronousQueue(true); |
292 |
< |
Thread t = new Thread(new CheckedInterruptedRunnable() { |
293 |
< |
public void realRun() throws InterruptedException { |
294 |
< |
q.take(); |
196 |
> |
q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS); |
197 |
> |
shouldThrow(); |
198 |
> |
} catch (InterruptedException success) {} |
199 |
|
}}); |
200 |
|
|
201 |
< |
t.start(); |
202 |
< |
Thread.sleep(SHORT_DELAY_MS); |
201 |
> |
await(pleaseInterrupt); |
202 |
> |
assertThreadStaysAlive(t); |
203 |
|
t.interrupt(); |
204 |
< |
t.join(); |
204 |
> |
awaitTermination(t); |
205 |
|
} |
206 |
|
|
207 |
|
/** |
208 |
|
* poll return null if no active putter |
209 |
|
*/ |
210 |
< |
public void testPoll() { |
211 |
< |
SynchronousQueue q = new SynchronousQueue(); |
210 |
> |
public void testPoll() { testPoll(false); } |
211 |
> |
public void testPoll_fair() { testPoll(true); } |
212 |
> |
public void testPoll(boolean fair) { |
213 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
214 |
|
assertNull(q.poll()); |
215 |
|
} |
216 |
|
|
217 |
|
/** |
218 |
|
* timed poll with zero timeout times out if no active putter |
219 |
|
*/ |
220 |
< |
public void testTimedPoll0() throws InterruptedException { |
221 |
< |
SynchronousQueue q = new SynchronousQueue(); |
222 |
< |
assertNull(q.poll(0, MILLISECONDS)); |
220 |
> |
public void testTimedPoll0() { testTimedPoll0(false); } |
221 |
> |
public void testTimedPoll0_fair() { testTimedPoll0(true); } |
222 |
> |
public void testTimedPoll0(boolean fair) { |
223 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
224 |
> |
try { assertNull(q.poll(0, MILLISECONDS)); } |
225 |
> |
catch (InterruptedException e) { threadUnexpectedException(e); } |
226 |
|
} |
227 |
|
|
228 |
|
/** |
229 |
|
* timed poll with nonzero timeout times out if no active putter |
230 |
|
*/ |
231 |
< |
public void testTimedPoll() throws InterruptedException { |
232 |
< |
SynchronousQueue q = new SynchronousQueue(); |
233 |
< |
long t0 = System.nanoTime(); |
234 |
< |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
235 |
< |
assertTrue(millisElapsedSince(t0) >= SHORT_DELAY_MS); |
236 |
< |
} |
237 |
< |
|
238 |
< |
/** |
330 |
< |
* Interrupted timed poll throws InterruptedException instead of |
331 |
< |
* returning timeout status |
332 |
< |
*/ |
333 |
< |
public void testInterruptedTimedPoll(final SynchronousQueue q) |
334 |
< |
throws InterruptedException { |
335 |
< |
final CountDownLatch threadStarted = new CountDownLatch(1); |
336 |
< |
Thread t = newStartedThread(new CheckedRunnable() { |
337 |
< |
public void realRun() throws InterruptedException { |
338 |
< |
long t0 = System.nanoTime(); |
339 |
< |
threadStarted.countDown(); |
340 |
< |
try { |
341 |
< |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
342 |
< |
shouldThrow(); |
343 |
< |
} catch (InterruptedException success) {} |
344 |
< |
assertTrue(millisElapsedSince(t0) >= SHORT_DELAY_MS); |
345 |
< |
assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS); |
346 |
< |
}}); |
347 |
< |
|
348 |
< |
threadStarted.await(); |
349 |
< |
Thread.sleep(SHORT_DELAY_MS); |
350 |
< |
t.interrupt(); |
351 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
352 |
< |
} |
353 |
< |
|
354 |
< |
/** |
355 |
< |
* Interrupted timed poll throws InterruptedException instead of |
356 |
< |
* returning timeout status |
357 |
< |
*/ |
358 |
< |
public void testInterruptedTimedPoll() throws InterruptedException { |
359 |
< |
testInterruptedTimedPoll(new SynchronousQueue()); |
360 |
< |
} |
361 |
< |
|
362 |
< |
/** |
363 |
< |
* Interrupted timed poll throws InterruptedException instead of |
364 |
< |
* returning timeout status |
365 |
< |
*/ |
366 |
< |
public void testFairInterruptedTimedPoll() throws InterruptedException { |
367 |
< |
testInterruptedTimedPoll(new SynchronousQueue(true)); |
231 |
> |
public void testTimedPoll() { testTimedPoll(false); } |
232 |
> |
public void testTimedPoll_fair() { testTimedPoll(true); } |
233 |
> |
public void testTimedPoll(boolean fair) { |
234 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
235 |
> |
long startTime = System.nanoTime(); |
236 |
> |
try { assertNull(q.poll(timeoutMillis(), MILLISECONDS)); } |
237 |
> |
catch (InterruptedException e) { threadUnexpectedException(e); } |
238 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
239 |
|
} |
240 |
|
|
241 |
|
/** |
242 |
|
* timed poll before a delayed offer times out, returning null; |
243 |
|
* after offer succeeds; on interruption throws |
244 |
|
*/ |
245 |
< |
public void testFairTimedPollWithOffer() throws InterruptedException { |
246 |
< |
final SynchronousQueue q = new SynchronousQueue(true); |
245 |
> |
public void testTimedPollWithOffer() { testTimedPollWithOffer(false); } |
246 |
> |
public void testTimedPollWithOffer_fair() { testTimedPollWithOffer(true); } |
247 |
> |
public void testTimedPollWithOffer(boolean fair) { |
248 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
249 |
|
final CountDownLatch pleaseOffer = new CountDownLatch(1); |
250 |
+ |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
251 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
252 |
|
public void realRun() throws InterruptedException { |
253 |
< |
long t0 = System.nanoTime(); |
254 |
< |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
255 |
< |
assertTrue(millisElapsedSince(t0) >= SHORT_DELAY_MS); |
253 |
> |
long startTime = System.nanoTime(); |
254 |
> |
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
255 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
256 |
|
|
257 |
|
pleaseOffer.countDown(); |
258 |
< |
t0 = System.nanoTime(); |
258 |
> |
startTime = System.nanoTime(); |
259 |
|
assertSame(zero, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
260 |
< |
assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS); |
260 |
> |
assertTrue(millisElapsedSince(startTime) < MEDIUM_DELAY_MS); |
261 |
> |
|
262 |
> |
Thread.currentThread().interrupt(); |
263 |
> |
try { |
264 |
> |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
265 |
> |
shouldThrow(); |
266 |
> |
} catch (InterruptedException success) {} |
267 |
> |
assertFalse(Thread.interrupted()); |
268 |
|
|
269 |
< |
t0 = System.nanoTime(); |
269 |
> |
pleaseInterrupt.countDown(); |
270 |
|
try { |
271 |
|
q.poll(LONG_DELAY_MS, MILLISECONDS); |
272 |
|
shouldThrow(); |
273 |
|
} catch (InterruptedException success) {} |
274 |
< |
assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS); |
274 |
> |
assertFalse(Thread.interrupted()); |
275 |
|
}}); |
276 |
|
|
277 |
< |
assertTrue(pleaseOffer.await(MEDIUM_DELAY_MS, MILLISECONDS)); |
278 |
< |
long t0 = System.nanoTime(); |
279 |
< |
assertTrue(q.offer(zero, LONG_DELAY_MS, MILLISECONDS)); |
280 |
< |
assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS); |
281 |
< |
|
277 |
> |
await(pleaseOffer); |
278 |
> |
long startTime = System.nanoTime(); |
279 |
> |
try { assertTrue(q.offer(zero, LONG_DELAY_MS, MILLISECONDS)); } |
280 |
> |
catch (InterruptedException e) { threadUnexpectedException(e); } |
281 |
> |
assertTrue(millisElapsedSince(startTime) < MEDIUM_DELAY_MS); |
282 |
> |
|
283 |
> |
await(pleaseInterrupt); |
284 |
> |
assertThreadStaysAlive(t); |
285 |
|
t.interrupt(); |
286 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
286 |
> |
awaitTermination(t); |
287 |
|
} |
288 |
|
|
289 |
|
/** |
290 |
|
* peek() returns null if no active putter |
291 |
|
*/ |
292 |
< |
public void testPeek() { |
293 |
< |
SynchronousQueue q = new SynchronousQueue(); |
292 |
> |
public void testPeek() { testPeek(false); } |
293 |
> |
public void testPeek_fair() { testPeek(true); } |
294 |
> |
public void testPeek(boolean fair) { |
295 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
296 |
|
assertNull(q.peek()); |
297 |
|
} |
298 |
|
|
299 |
|
/** |
300 |
< |
* element() throws NSEE if no active putter |
300 |
> |
* element() throws NoSuchElementException if no active putter |
301 |
|
*/ |
302 |
< |
public void testElement() { |
303 |
< |
SynchronousQueue q = new SynchronousQueue(); |
302 |
> |
public void testElement() { testElement(false); } |
303 |
> |
public void testElement_fair() { testElement(true); } |
304 |
> |
public void testElement(boolean fair) { |
305 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
306 |
|
try { |
307 |
|
q.element(); |
308 |
|
shouldThrow(); |
310 |
|
} |
311 |
|
|
312 |
|
/** |
313 |
< |
* remove() throws NSEE if no active putter |
313 |
> |
* remove() throws NoSuchElementException if no active putter |
314 |
|
*/ |
315 |
< |
public void testRemove() { |
316 |
< |
SynchronousQueue q = new SynchronousQueue(); |
315 |
> |
public void testRemove() { testRemove(false); } |
316 |
> |
public void testRemove_fair() { testRemove(true); } |
317 |
> |
public void testRemove(boolean fair) { |
318 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
319 |
|
try { |
320 |
|
q.remove(); |
321 |
|
shouldThrow(); |
323 |
|
} |
324 |
|
|
325 |
|
/** |
436 |
– |
* remove(x) returns false |
437 |
– |
*/ |
438 |
– |
public void testRemoveElement() { |
439 |
– |
SynchronousQueue q = new SynchronousQueue(); |
440 |
– |
assertFalse(q.remove(zero)); |
441 |
– |
assertTrue(q.isEmpty()); |
442 |
– |
} |
443 |
– |
|
444 |
– |
/** |
326 |
|
* contains returns false |
327 |
|
*/ |
328 |
< |
public void testContains() { |
329 |
< |
SynchronousQueue q = new SynchronousQueue(); |
328 |
> |
public void testContains() { testContains(false); } |
329 |
> |
public void testContains_fair() { testContains(true); } |
330 |
> |
public void testContains(boolean fair) { |
331 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
332 |
|
assertFalse(q.contains(zero)); |
333 |
|
} |
334 |
|
|
335 |
|
/** |
336 |
|
* clear ensures isEmpty |
337 |
|
*/ |
338 |
< |
public void testClear() { |
339 |
< |
SynchronousQueue q = new SynchronousQueue(); |
338 |
> |
public void testClear() { testClear(false); } |
339 |
> |
public void testClear_fair() { testClear(true); } |
340 |
> |
public void testClear(boolean fair) { |
341 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
342 |
|
q.clear(); |
343 |
|
assertTrue(q.isEmpty()); |
344 |
|
} |
346 |
|
/** |
347 |
|
* containsAll returns false unless empty |
348 |
|
*/ |
349 |
< |
public void testContainsAll() { |
350 |
< |
SynchronousQueue q = new SynchronousQueue(); |
349 |
> |
public void testContainsAll() { testContainsAll(false); } |
350 |
> |
public void testContainsAll_fair() { testContainsAll(true); } |
351 |
> |
public void testContainsAll(boolean fair) { |
352 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
353 |
|
Integer[] empty = new Integer[0]; |
354 |
|
assertTrue(q.containsAll(Arrays.asList(empty))); |
355 |
|
Integer[] ints = new Integer[1]; ints[0] = zero; |
359 |
|
/** |
360 |
|
* retainAll returns false |
361 |
|
*/ |
362 |
< |
public void testRetainAll() { |
363 |
< |
SynchronousQueue q = new SynchronousQueue(); |
362 |
> |
public void testRetainAll() { testRetainAll(false); } |
363 |
> |
public void testRetainAll_fair() { testRetainAll(true); } |
364 |
> |
public void testRetainAll(boolean fair) { |
365 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
366 |
|
Integer[] empty = new Integer[0]; |
367 |
|
assertFalse(q.retainAll(Arrays.asList(empty))); |
368 |
|
Integer[] ints = new Integer[1]; ints[0] = zero; |
372 |
|
/** |
373 |
|
* removeAll returns false |
374 |
|
*/ |
375 |
< |
public void testRemoveAll() { |
376 |
< |
SynchronousQueue q = new SynchronousQueue(); |
375 |
> |
public void testRemoveAll() { testRemoveAll(false); } |
376 |
> |
public void testRemoveAll_fair() { testRemoveAll(true); } |
377 |
> |
public void testRemoveAll(boolean fair) { |
378 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
379 |
|
Integer[] empty = new Integer[0]; |
380 |
|
assertFalse(q.removeAll(Arrays.asList(empty))); |
381 |
|
Integer[] ints = new Integer[1]; ints[0] = zero; |
382 |
|
assertFalse(q.containsAll(Arrays.asList(ints))); |
383 |
|
} |
384 |
|
|
494 |
– |
|
385 |
|
/** |
386 |
|
* toArray is empty |
387 |
|
*/ |
388 |
< |
public void testToArray() { |
389 |
< |
SynchronousQueue q = new SynchronousQueue(); |
388 |
> |
public void testToArray() { testToArray(false); } |
389 |
> |
public void testToArray_fair() { testToArray(true); } |
390 |
> |
public void testToArray(boolean fair) { |
391 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
392 |
|
Object[] o = q.toArray(); |
393 |
< |
assertEquals(o.length, 0); |
393 |
> |
assertEquals(0, o.length); |
394 |
|
} |
395 |
|
|
396 |
|
/** |
397 |
< |
* toArray(a) is nulled at position 0 |
397 |
> |
* toArray(Integer array) returns its argument with the first |
398 |
> |
* element (if present) nulled out |
399 |
|
*/ |
400 |
< |
public void testToArray2() { |
401 |
< |
SynchronousQueue q = new SynchronousQueue(); |
402 |
< |
Integer[] ints = new Integer[1]; |
403 |
< |
assertNull(ints[0]); |
400 |
> |
public void testToArray2() { testToArray2(false); } |
401 |
> |
public void testToArray2_fair() { testToArray2(true); } |
402 |
> |
public void testToArray2(boolean fair) { |
403 |
> |
final SynchronousQueue<Integer> q |
404 |
> |
= new SynchronousQueue<Integer>(fair); |
405 |
> |
Integer[] a; |
406 |
> |
|
407 |
> |
a = new Integer[0]; |
408 |
> |
assertSame(a, q.toArray(a)); |
409 |
> |
|
410 |
> |
a = new Integer[3]; |
411 |
> |
Arrays.fill(a, 42); |
412 |
> |
assertSame(a, q.toArray(a)); |
413 |
> |
assertNull(a[0]); |
414 |
> |
for (int i = 1; i < a.length; i++) |
415 |
> |
assertEquals(42, (int) a[i]); |
416 |
|
} |
417 |
|
|
418 |
|
/** |
419 |
|
* toArray(null) throws NPE |
420 |
|
*/ |
421 |
< |
public void testToArray_BadArg() { |
422 |
< |
SynchronousQueue q = new SynchronousQueue(); |
421 |
> |
public void testToArray_null() { testToArray_null(false); } |
422 |
> |
public void testToArray_null_fair() { testToArray_null(true); } |
423 |
> |
public void testToArray_null(boolean fair) { |
424 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
425 |
|
try { |
426 |
< |
Object o[] = q.toArray(null); |
426 |
> |
Object[] o = q.toArray(null); |
427 |
|
shouldThrow(); |
428 |
|
} catch (NullPointerException success) {} |
429 |
|
} |
430 |
|
|
524 |
– |
|
431 |
|
/** |
432 |
|
* iterator does not traverse any elements |
433 |
|
*/ |
434 |
< |
public void testIterator() { |
435 |
< |
SynchronousQueue q = new SynchronousQueue(); |
434 |
> |
public void testIterator() { testIterator(false); } |
435 |
> |
public void testIterator_fair() { testIterator(true); } |
436 |
> |
public void testIterator(boolean fair) { |
437 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
438 |
|
Iterator it = q.iterator(); |
439 |
|
assertFalse(it.hasNext()); |
440 |
|
try { |
446 |
|
/** |
447 |
|
* iterator remove throws ISE |
448 |
|
*/ |
449 |
< |
public void testIteratorRemove() { |
450 |
< |
SynchronousQueue q = new SynchronousQueue(); |
449 |
> |
public void testIteratorRemove() { testIteratorRemove(false); } |
450 |
> |
public void testIteratorRemove_fair() { testIteratorRemove(true); } |
451 |
> |
public void testIteratorRemove(boolean fair) { |
452 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
453 |
|
Iterator it = q.iterator(); |
454 |
|
try { |
455 |
|
it.remove(); |
460 |
|
/** |
461 |
|
* toString returns a non-null string |
462 |
|
*/ |
463 |
< |
public void testToString() { |
464 |
< |
SynchronousQueue q = new SynchronousQueue(); |
463 |
> |
public void testToString() { testToString(false); } |
464 |
> |
public void testToString_fair() { testToString(true); } |
465 |
> |
public void testToString(boolean fair) { |
466 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
467 |
|
String s = q.toString(); |
468 |
|
assertNotNull(s); |
469 |
|
} |
470 |
|
|
559 |
– |
|
471 |
|
/** |
472 |
|
* offer transfers elements across Executor tasks |
473 |
|
*/ |
474 |
< |
public void testOfferInExecutor() { |
475 |
< |
final SynchronousQueue q = new SynchronousQueue(); |
474 |
> |
public void testOfferInExecutor() { testOfferInExecutor(false); } |
475 |
> |
public void testOfferInExecutor_fair() { testOfferInExecutor(true); } |
476 |
> |
public void testOfferInExecutor(boolean fair) { |
477 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
478 |
|
ExecutorService executor = Executors.newFixedThreadPool(2); |
479 |
+ |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
480 |
|
|
481 |
|
executor.execute(new CheckedRunnable() { |
482 |
|
public void realRun() throws InterruptedException { |
483 |
|
assertFalse(q.offer(one)); |
484 |
< |
assertTrue(q.offer(one, MEDIUM_DELAY_MS, MILLISECONDS)); |
484 |
> |
threadsStarted.await(); |
485 |
> |
assertTrue(q.offer(one, LONG_DELAY_MS, MILLISECONDS)); |
486 |
|
assertEquals(0, q.remainingCapacity()); |
487 |
|
}}); |
488 |
|
|
489 |
|
executor.execute(new CheckedRunnable() { |
490 |
|
public void realRun() throws InterruptedException { |
491 |
< |
Thread.sleep(SMALL_DELAY_MS); |
491 |
> |
threadsStarted.await(); |
492 |
|
assertSame(one, q.take()); |
493 |
|
}}); |
494 |
|
|
496 |
|
} |
497 |
|
|
498 |
|
/** |
499 |
< |
* poll retrieves elements across Executor threads |
499 |
> |
* timed poll retrieves elements across Executor threads |
500 |
|
*/ |
501 |
< |
public void testPollInExecutor() { |
502 |
< |
final SynchronousQueue q = new SynchronousQueue(); |
501 |
> |
public void testPollInExecutor() { testPollInExecutor(false); } |
502 |
> |
public void testPollInExecutor_fair() { testPollInExecutor(true); } |
503 |
> |
public void testPollInExecutor(boolean fair) { |
504 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
505 |
> |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
506 |
|
ExecutorService executor = Executors.newFixedThreadPool(2); |
507 |
|
executor.execute(new CheckedRunnable() { |
508 |
|
public void realRun() throws InterruptedException { |
509 |
|
assertNull(q.poll()); |
510 |
< |
assertSame(one, q.poll(MEDIUM_DELAY_MS, MILLISECONDS)); |
510 |
> |
threadsStarted.await(); |
511 |
> |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
512 |
|
assertTrue(q.isEmpty()); |
513 |
|
}}); |
514 |
|
|
515 |
|
executor.execute(new CheckedRunnable() { |
516 |
|
public void realRun() throws InterruptedException { |
517 |
< |
Thread.sleep(SHORT_DELAY_MS); |
517 |
> |
threadsStarted.await(); |
518 |
|
q.put(one); |
519 |
|
}}); |
520 |
|
|
524 |
|
/** |
525 |
|
* a deserialized serialized queue is usable |
526 |
|
*/ |
527 |
< |
public void testSerialization() throws Exception { |
528 |
< |
SynchronousQueue q = new SynchronousQueue(); |
529 |
< |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
530 |
< |
ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout)); |
531 |
< |
out.writeObject(q); |
532 |
< |
out.close(); |
533 |
< |
|
534 |
< |
ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray()); |
535 |
< |
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); |
536 |
< |
SynchronousQueue r = (SynchronousQueue)in.readObject(); |
537 |
< |
assertEquals(q.size(), r.size()); |
538 |
< |
while (!q.isEmpty()) |
539 |
< |
assertEquals(q.remove(), r.remove()); |
540 |
< |
} |
541 |
< |
|
542 |
< |
/** |
624 |
< |
* drainTo(null) throws NPE |
625 |
< |
*/ |
626 |
< |
public void testDrainToNull() { |
627 |
< |
SynchronousQueue q = new SynchronousQueue(); |
628 |
< |
try { |
629 |
< |
q.drainTo(null); |
630 |
< |
shouldThrow(); |
631 |
< |
} catch (NullPointerException success) {} |
632 |
< |
} |
633 |
< |
|
634 |
< |
/** |
635 |
< |
* drainTo(this) throws IAE |
636 |
< |
*/ |
637 |
< |
public void testDrainToSelf() { |
638 |
< |
SynchronousQueue q = new SynchronousQueue(); |
639 |
< |
try { |
640 |
< |
q.drainTo(q); |
641 |
< |
shouldThrow(); |
642 |
< |
} catch (IllegalArgumentException success) {} |
527 |
> |
public void testSerialization() { |
528 |
> |
final SynchronousQueue x = new SynchronousQueue(); |
529 |
> |
final SynchronousQueue y = new SynchronousQueue(false); |
530 |
> |
final SynchronousQueue z = new SynchronousQueue(true); |
531 |
> |
assertSerialEquals(x, y); |
532 |
> |
assertNotSerialEquals(x, z); |
533 |
> |
SynchronousQueue[] qs = { x, y, z }; |
534 |
> |
for (SynchronousQueue q : qs) { |
535 |
> |
SynchronousQueue clone = serialClone(q); |
536 |
> |
assertNotSame(q, clone); |
537 |
> |
assertSerialEquals(q, clone); |
538 |
> |
assertTrue(clone.isEmpty()); |
539 |
> |
assertEquals(0, clone.size()); |
540 |
> |
assertEquals(0, clone.remainingCapacity()); |
541 |
> |
assertFalse(clone.offer(zero)); |
542 |
> |
} |
543 |
|
} |
544 |
|
|
545 |
|
/** |
546 |
|
* drainTo(c) of empty queue doesn't transfer elements |
547 |
|
*/ |
548 |
< |
public void testDrainTo() { |
549 |
< |
SynchronousQueue q = new SynchronousQueue(); |
548 |
> |
public void testDrainTo() { testDrainTo(false); } |
549 |
> |
public void testDrainTo_fair() { testDrainTo(true); } |
550 |
> |
public void testDrainTo(boolean fair) { |
551 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
552 |
|
ArrayList l = new ArrayList(); |
553 |
|
q.drainTo(l); |
554 |
< |
assertEquals(q.size(), 0); |
555 |
< |
assertEquals(l.size(), 0); |
554 |
> |
assertEquals(0, q.size()); |
555 |
> |
assertEquals(0, l.size()); |
556 |
|
} |
557 |
|
|
558 |
|
/** |
559 |
|
* drainTo empties queue, unblocking a waiting put. |
560 |
|
*/ |
561 |
< |
public void testDrainToWithActivePut() throws InterruptedException { |
562 |
< |
final SynchronousQueue q = new SynchronousQueue(); |
563 |
< |
Thread t = new Thread(new CheckedRunnable() { |
561 |
> |
public void testDrainToWithActivePut() { testDrainToWithActivePut(false); } |
562 |
> |
public void testDrainToWithActivePut_fair() { testDrainToWithActivePut(true); } |
563 |
> |
public void testDrainToWithActivePut(boolean fair) { |
564 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
565 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
566 |
|
public void realRun() throws InterruptedException { |
567 |
< |
q.put(new Integer(1)); |
567 |
> |
q.put(one); |
568 |
|
}}); |
569 |
|
|
666 |
– |
t.start(); |
570 |
|
ArrayList l = new ArrayList(); |
571 |
< |
Thread.sleep(SHORT_DELAY_MS); |
572 |
< |
q.drainTo(l); |
573 |
< |
assertTrue(l.size() <= 1); |
574 |
< |
if (l.size() > 0) |
575 |
< |
assertEquals(l.get(0), new Integer(1)); |
576 |
< |
t.join(); |
577 |
< |
assertTrue(l.size() <= 1); |
578 |
< |
} |
579 |
< |
|
580 |
< |
/** |
678 |
< |
* drainTo(null, n) throws NPE |
679 |
< |
*/ |
680 |
< |
public void testDrainToNullN() { |
681 |
< |
SynchronousQueue q = new SynchronousQueue(); |
682 |
< |
try { |
683 |
< |
q.drainTo(null, 0); |
684 |
< |
shouldThrow(); |
685 |
< |
} catch (NullPointerException success) {} |
686 |
< |
} |
687 |
< |
|
688 |
< |
/** |
689 |
< |
* drainTo(this, n) throws IAE |
690 |
< |
*/ |
691 |
< |
public void testDrainToSelfN() { |
692 |
< |
SynchronousQueue q = new SynchronousQueue(); |
693 |
< |
try { |
694 |
< |
q.drainTo(q, 0); |
695 |
< |
shouldThrow(); |
696 |
< |
} catch (IllegalArgumentException success) {} |
571 |
> |
long startTime = System.nanoTime(); |
572 |
> |
while (l.isEmpty()) { |
573 |
> |
q.drainTo(l); |
574 |
> |
if (millisElapsedSince(startTime) > LONG_DELAY_MS) |
575 |
> |
fail("timed out"); |
576 |
> |
Thread.yield(); |
577 |
> |
} |
578 |
> |
assertTrue(l.size() == 1); |
579 |
> |
assertSame(one, l.get(0)); |
580 |
> |
awaitTermination(t); |
581 |
|
} |
582 |
|
|
583 |
|
/** |
585 |
|
*/ |
586 |
|
public void testDrainToN() throws InterruptedException { |
587 |
|
final SynchronousQueue q = new SynchronousQueue(); |
588 |
< |
Thread t1 = new Thread(new CheckedRunnable() { |
588 |
> |
Thread t1 = newStartedThread(new CheckedRunnable() { |
589 |
|
public void realRun() throws InterruptedException { |
590 |
|
q.put(one); |
591 |
|
}}); |
592 |
|
|
593 |
< |
Thread t2 = new Thread(new CheckedRunnable() { |
593 |
> |
Thread t2 = newStartedThread(new CheckedRunnable() { |
594 |
|
public void realRun() throws InterruptedException { |
595 |
|
q.put(two); |
596 |
|
}}); |
597 |
|
|
714 |
– |
t1.start(); |
715 |
– |
t2.start(); |
598 |
|
ArrayList l = new ArrayList(); |
599 |
< |
Thread.sleep(SHORT_DELAY_MS); |
599 |
> |
delay(SHORT_DELAY_MS); |
600 |
|
q.drainTo(l, 1); |
601 |
|
assertEquals(1, l.size()); |
602 |
|
q.drainTo(l, 1); |
603 |
|
assertEquals(2, l.size()); |
604 |
|
assertTrue(l.contains(one)); |
605 |
|
assertTrue(l.contains(two)); |
606 |
< |
t1.join(); |
607 |
< |
t2.join(); |
606 |
> |
awaitTermination(t1); |
607 |
> |
awaitTermination(t2); |
608 |
> |
} |
609 |
> |
|
610 |
> |
/** |
611 |
> |
* remove(null), contains(null) always return false |
612 |
> |
*/ |
613 |
> |
public void testNeverContainsNull() { |
614 |
> |
Collection<?> q = new SynchronousQueue(); |
615 |
> |
assertFalse(q.contains(null)); |
616 |
> |
assertFalse(q.remove(null)); |
617 |
|
} |
618 |
|
|
619 |
|
} |