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 |
> |
import java.util.concurrent.ThreadLocalRandom; |
22 |
> |
|
23 |
> |
import junit.framework.Test; |
24 |
|
|
25 |
|
public class SynchronousQueueTest extends JSR166TestCase { |
26 |
|
|
27 |
< |
public static void main(String[] args) { |
28 |
< |
junit.textui.TestRunner.run (suite()); |
27 |
> |
public static class Fair extends BlockingQueueTest { |
28 |
> |
protected BlockingQueue emptyCollection() { |
29 |
> |
return new SynchronousQueue(true); |
30 |
> |
} |
31 |
|
} |
32 |
|
|
33 |
< |
public static Test suite() { |
34 |
< |
return new TestSuite(SynchronousQueueTest.class); |
33 |
> |
public static class NonFair extends BlockingQueueTest { |
34 |
> |
protected BlockingQueue emptyCollection() { |
35 |
> |
return new SynchronousQueue(false); |
36 |
> |
} |
37 |
|
} |
38 |
|
|
39 |
< |
/** |
40 |
< |
* A SynchronousQueue is both empty and full |
41 |
< |
*/ |
42 |
< |
public void testEmptyFull() { |
43 |
< |
SynchronousQueue q = new SynchronousQueue(); |
44 |
< |
assertTrue(q.isEmpty()); |
45 |
< |
assertEquals(0, q.size()); |
46 |
< |
assertEquals(0, q.remainingCapacity()); |
33 |
< |
assertFalse(q.offer(zero)); |
39 |
> |
public static void main(String[] args) { |
40 |
> |
main(suite(), args); |
41 |
> |
} |
42 |
> |
|
43 |
> |
public static Test suite() { |
44 |
> |
return newTestSuite(SynchronousQueueTest.class, |
45 |
> |
new Fair().testSuite(), |
46 |
> |
new NonFair().testSuite()); |
47 |
|
} |
48 |
|
|
49 |
|
/** |
50 |
< |
* A fair SynchronousQueue is both empty and full |
50 |
> |
* Any SynchronousQueue is both empty and full |
51 |
|
*/ |
52 |
< |
public void testFairEmptyFull() { |
53 |
< |
SynchronousQueue q = new SynchronousQueue(true); |
52 |
> |
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 |
|
assertTrue(q.isEmpty()); |
57 |
|
assertEquals(0, q.size()); |
58 |
|
assertEquals(0, q.remainingCapacity()); |
60 |
|
} |
61 |
|
|
62 |
|
/** |
48 |
– |
* offer(null) throws NPE |
49 |
– |
*/ |
50 |
– |
public void testOfferNull() { |
51 |
– |
try { |
52 |
– |
SynchronousQueue q = new SynchronousQueue(); |
53 |
– |
q.offer(null); |
54 |
– |
shouldThrow(); |
55 |
– |
} catch (NullPointerException success) {} |
56 |
– |
} |
57 |
– |
|
58 |
– |
/** |
59 |
– |
* add(null) throws NPE |
60 |
– |
*/ |
61 |
– |
public void testAddNull() { |
62 |
– |
try { |
63 |
– |
SynchronousQueue q = new SynchronousQueue(); |
64 |
– |
q.add(null); |
65 |
– |
shouldThrow(); |
66 |
– |
} catch (NullPointerException success) {} |
67 |
– |
} |
68 |
– |
|
69 |
– |
/** |
63 |
|
* offer fails if no active taker |
64 |
|
*/ |
65 |
< |
public void testOffer() { |
66 |
< |
SynchronousQueue q = new SynchronousQueue(); |
65 |
> |
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 |
|
assertFalse(q.offer(one)); |
70 |
|
} |
71 |
|
|
72 |
|
/** |
73 |
< |
* add throws ISE if no active taker |
73 |
> |
* add throws IllegalStateException if no active taker |
74 |
|
*/ |
75 |
< |
public void testAdd() { |
75 |
> |
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 |
|
try { |
82 |
– |
SynchronousQueue q = new SynchronousQueue(); |
83 |
– |
assertEquals(0, q.remainingCapacity()); |
81 |
|
q.add(one); |
82 |
|
shouldThrow(); |
83 |
|
} catch (IllegalStateException success) {} |
84 |
|
} |
85 |
|
|
86 |
|
/** |
87 |
< |
* addAll(null) throws NPE |
91 |
< |
*/ |
92 |
< |
public void testAddAll1() { |
93 |
< |
try { |
94 |
< |
SynchronousQueue q = new SynchronousQueue(); |
95 |
< |
q.addAll(null); |
96 |
< |
shouldThrow(); |
97 |
< |
} catch (NullPointerException success) {} |
98 |
< |
} |
99 |
< |
|
100 |
< |
/** |
101 |
< |
* addAll(this) throws IAE |
87 |
> |
* addAll(this) throws IllegalArgumentException |
88 |
|
*/ |
89 |
< |
public void testAddAllSelf() { |
89 |
> |
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 |
|
try { |
105 |
– |
SynchronousQueue q = new SynchronousQueue(); |
94 |
|
q.addAll(q); |
95 |
|
shouldThrow(); |
96 |
|
} catch (IllegalArgumentException success) {} |
97 |
|
} |
98 |
|
|
99 |
|
/** |
100 |
< |
* addAll of a collection with null elements throws NPE |
113 |
< |
*/ |
114 |
< |
public void testAddAll2() { |
115 |
< |
try { |
116 |
< |
SynchronousQueue q = new SynchronousQueue(); |
117 |
< |
Integer[] ints = new Integer[1]; |
118 |
< |
q.addAll(Arrays.asList(ints)); |
119 |
< |
shouldThrow(); |
120 |
< |
} catch (NullPointerException success) {} |
121 |
< |
} |
122 |
< |
/** |
123 |
< |
* addAll throws ISE if no active taker |
100 |
> |
* addAll throws IllegalStateException if no active taker |
101 |
|
*/ |
102 |
< |
public void testAddAll4() { |
102 |
> |
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 |
|
try { |
111 |
< |
SynchronousQueue q = new SynchronousQueue(); |
128 |
< |
Integer[] ints = new Integer[1]; |
129 |
< |
for (int i = 0; i < 1; ++i) |
130 |
< |
ints[i] = new Integer(i); |
131 |
< |
q.addAll(Arrays.asList(ints)); |
111 |
> |
q.addAll(coll); |
112 |
|
shouldThrow(); |
113 |
|
} catch (IllegalStateException success) {} |
114 |
|
} |
115 |
|
|
116 |
|
/** |
137 |
– |
* put(null) throws NPE |
138 |
– |
*/ |
139 |
– |
public void testPutNull() throws InterruptedException { |
140 |
– |
try { |
141 |
– |
SynchronousQueue q = new SynchronousQueue(); |
142 |
– |
q.put(null); |
143 |
– |
shouldThrow(); |
144 |
– |
} catch (NullPointerException success) {} |
145 |
– |
} |
146 |
– |
|
147 |
– |
/** |
117 |
|
* put blocks interruptibly if no active taker |
118 |
|
*/ |
119 |
< |
public void testBlockingPut() throws InterruptedException { |
120 |
< |
Thread t = new Thread(new CheckedInterruptedRunnable() { |
121 |
< |
public void realRun() throws InterruptedException { |
122 |
< |
SynchronousQueue q = new SynchronousQueue(); |
123 |
< |
q.put(zero); |
124 |
< |
}}); |
156 |
< |
|
157 |
< |
t.start(); |
158 |
< |
Thread.sleep(SHORT_DELAY_MS); |
159 |
< |
t.interrupt(); |
160 |
< |
t.join(); |
161 |
< |
} |
162 |
< |
|
163 |
< |
/** |
164 |
< |
* put blocks waiting for take |
165 |
< |
*/ |
166 |
< |
public void testPutWithTake() throws InterruptedException { |
167 |
< |
final SynchronousQueue q = new SynchronousQueue(); |
168 |
< |
Thread t = new Thread(new CheckedRunnable() { |
119 |
> |
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 |
|
public void realRun() throws InterruptedException { |
126 |
< |
int added = 0; |
126 |
> |
Thread.currentThread().interrupt(); |
127 |
|
try { |
128 |
< |
while (true) { |
129 |
< |
q.put(added); |
130 |
< |
++added; |
131 |
< |
} |
176 |
< |
} catch (InterruptedException success) { |
177 |
< |
assertTrue(added == 1); |
178 |
< |
} |
179 |
< |
}}); |
180 |
< |
|
181 |
< |
t.start(); |
182 |
< |
Thread.sleep(SHORT_DELAY_MS); |
183 |
< |
assertEquals(0, q.take()); |
184 |
< |
Thread.sleep(SHORT_DELAY_MS); |
185 |
< |
t.interrupt(); |
186 |
< |
t.join(); |
187 |
< |
} |
128 |
> |
q.put(99); |
129 |
> |
shouldThrow(); |
130 |
> |
} catch (InterruptedException success) {} |
131 |
> |
assertFalse(Thread.interrupted()); |
132 |
|
|
133 |
< |
/** |
134 |
< |
* timed offer times out if elements not taken |
135 |
< |
*/ |
136 |
< |
public void testTimedOffer() throws InterruptedException { |
137 |
< |
final SynchronousQueue q = new SynchronousQueue(); |
138 |
< |
Thread t = new Thread(new CheckedInterruptedRunnable() { |
195 |
< |
public void realRun() throws InterruptedException { |
196 |
< |
assertFalse(q.offer(new Object(), SHORT_DELAY_MS, MILLISECONDS)); |
197 |
< |
q.offer(new Object(), LONG_DELAY_MS, MILLISECONDS); |
133 |
> |
pleaseInterrupt.countDown(); |
134 |
> |
try { |
135 |
> |
q.put(99); |
136 |
> |
shouldThrow(); |
137 |
> |
} catch (InterruptedException success) {} |
138 |
> |
assertFalse(Thread.interrupted()); |
139 |
|
}}); |
140 |
|
|
141 |
< |
t.start(); |
142 |
< |
Thread.sleep(SMALL_DELAY_MS); |
141 |
> |
await(pleaseInterrupt); |
142 |
> |
assertThreadBlocks(t, Thread.State.WAITING); |
143 |
|
t.interrupt(); |
144 |
< |
t.join(); |
144 |
> |
awaitTermination(t); |
145 |
> |
assertEquals(0, q.remainingCapacity()); |
146 |
|
} |
147 |
|
|
206 |
– |
|
148 |
|
/** |
149 |
< |
* take blocks interruptibly when empty |
149 |
> |
* put blocks interruptibly waiting for take |
150 |
|
*/ |
151 |
< |
public void testTakeFromEmpty() throws InterruptedException { |
152 |
< |
final SynchronousQueue q = new SynchronousQueue(); |
153 |
< |
Thread t = new Thread(new CheckedInterruptedRunnable() { |
151 |
> |
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 |
|
public void realRun() throws InterruptedException { |
159 |
< |
q.take(); |
160 |
< |
}}); |
216 |
< |
|
217 |
< |
t.start(); |
218 |
< |
Thread.sleep(SHORT_DELAY_MS); |
219 |
< |
t.interrupt(); |
220 |
< |
t.join(); |
221 |
< |
} |
222 |
< |
|
223 |
< |
|
224 |
< |
/** |
225 |
< |
* put blocks interruptibly if no active taker |
226 |
< |
*/ |
227 |
< |
public void testFairBlockingPut() throws InterruptedException { |
228 |
< |
Thread t = new Thread(new CheckedInterruptedRunnable() { |
229 |
< |
public void realRun() throws InterruptedException { |
230 |
< |
SynchronousQueue q = new SynchronousQueue(true); |
231 |
< |
q.put(zero); |
232 |
< |
}}); |
159 |
> |
pleaseTake.countDown(); |
160 |
> |
q.put(one); |
161 |
|
|
162 |
< |
t.start(); |
163 |
< |
Thread.sleep(SHORT_DELAY_MS); |
164 |
< |
t.interrupt(); |
165 |
< |
t.join(); |
166 |
< |
} |
162 |
> |
Thread.currentThread().interrupt(); |
163 |
> |
try { |
164 |
> |
q.put(99); |
165 |
> |
shouldThrow(); |
166 |
> |
} catch (InterruptedException success) {} |
167 |
> |
assertFalse(Thread.interrupted()); |
168 |
|
|
169 |
< |
/** |
241 |
< |
* put blocks waiting for take |
242 |
< |
*/ |
243 |
< |
public void testFairPutWithTake() throws InterruptedException { |
244 |
< |
final SynchronousQueue q = new SynchronousQueue(true); |
245 |
< |
Thread t = new Thread(new CheckedRunnable() { |
246 |
< |
public void realRun() throws InterruptedException { |
247 |
< |
int added = 0; |
169 |
> |
pleaseInterrupt.countDown(); |
170 |
|
try { |
171 |
< |
while (true) { |
172 |
< |
q.put(added); |
173 |
< |
++added; |
174 |
< |
} |
253 |
< |
} catch (InterruptedException success) { |
254 |
< |
assertTrue(added == 1); |
255 |
< |
} |
171 |
> |
q.put(99); |
172 |
> |
shouldThrow(); |
173 |
> |
} catch (InterruptedException success) {} |
174 |
> |
assertFalse(Thread.interrupted()); |
175 |
|
}}); |
176 |
|
|
177 |
< |
t.start(); |
178 |
< |
Thread.sleep(SHORT_DELAY_MS); |
179 |
< |
assertEquals(0, q.take()); |
180 |
< |
Thread.sleep(SHORT_DELAY_MS); |
177 |
> |
await(pleaseTake); |
178 |
> |
assertEquals(0, q.remainingCapacity()); |
179 |
> |
try { assertSame(one, q.take()); } |
180 |
> |
catch (InterruptedException e) { threadUnexpectedException(e); } |
181 |
> |
|
182 |
> |
await(pleaseInterrupt); |
183 |
> |
assertThreadBlocks(t, Thread.State.WAITING); |
184 |
|
t.interrupt(); |
185 |
< |
t.join(); |
185 |
> |
awaitTermination(t); |
186 |
> |
assertEquals(0, q.remainingCapacity()); |
187 |
|
} |
188 |
|
|
189 |
|
/** |
190 |
|
* timed offer times out if elements not taken |
191 |
|
*/ |
192 |
< |
public void testFairTimedOffer() throws InterruptedException { |
193 |
< |
final SynchronousQueue q = new SynchronousQueue(true); |
194 |
< |
Thread t = new Thread(new CheckedInterruptedRunnable() { |
195 |
< |
public void realRun() throws InterruptedException { |
196 |
< |
assertFalse(q.offer(new Object(), SHORT_DELAY_MS, MILLISECONDS)); |
197 |
< |
q.offer(new Object(), LONG_DELAY_MS, MILLISECONDS); |
198 |
< |
}}); |
199 |
< |
|
200 |
< |
t.start(); |
278 |
< |
Thread.sleep(SMALL_DELAY_MS); |
279 |
< |
t.interrupt(); |
280 |
< |
t.join(); |
281 |
< |
} |
192 |
> |
public void testTimedOffer() { |
193 |
> |
final boolean fair = ThreadLocalRandom.current().nextBoolean(); |
194 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
195 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
196 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
197 |
> |
public void realRun() throws InterruptedException { |
198 |
> |
long startTime = System.nanoTime(); |
199 |
> |
assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS)); |
200 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
201 |
|
|
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 |
< |
/** |
210 |
< |
* take blocks interruptibly when empty |
211 |
< |
*/ |
212 |
< |
public void testFairTakeFromEmpty() throws InterruptedException { |
213 |
< |
final SynchronousQueue q = new SynchronousQueue(true); |
214 |
< |
Thread t = new Thread(new CheckedInterruptedRunnable() { |
290 |
< |
public void realRun() throws InterruptedException { |
291 |
< |
q.take(); |
209 |
> |
pleaseInterrupt.countDown(); |
210 |
> |
try { |
211 |
> |
q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS); |
212 |
> |
shouldThrow(); |
213 |
> |
} catch (InterruptedException success) {} |
214 |
> |
assertFalse(Thread.interrupted()); |
215 |
|
}}); |
216 |
|
|
217 |
< |
t.start(); |
218 |
< |
Thread.sleep(SHORT_DELAY_MS); |
217 |
> |
await(pleaseInterrupt); |
218 |
> |
assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
219 |
|
t.interrupt(); |
220 |
< |
t.join(); |
220 |
> |
awaitTermination(t); |
221 |
|
} |
222 |
|
|
223 |
|
/** |
224 |
< |
* poll fails unless active taker |
224 |
> |
* poll return null if no active putter |
225 |
|
*/ |
226 |
< |
public void testPoll() { |
227 |
< |
SynchronousQueue q = new SynchronousQueue(); |
226 |
> |
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 |
|
assertNull(q.poll()); |
231 |
|
} |
232 |
|
|
233 |
|
/** |
234 |
< |
* timed pool with zero timeout times out if no active taker |
234 |
> |
* timed poll with zero timeout times out if no active putter |
235 |
|
*/ |
236 |
< |
public void testTimedPoll0() throws InterruptedException { |
237 |
< |
SynchronousQueue q = new SynchronousQueue(); |
238 |
< |
assertNull(q.poll(0, MILLISECONDS)); |
236 |
> |
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 |
|
} |
243 |
|
|
244 |
|
/** |
245 |
< |
* timed pool with nonzero timeout times out if no active taker |
245 |
> |
* timed poll with nonzero timeout times out if no active putter |
246 |
|
*/ |
247 |
< |
public void testTimedPoll() throws InterruptedException { |
248 |
< |
SynchronousQueue q = new SynchronousQueue(); |
249 |
< |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
247 |
> |
public void testTimedPoll() { |
248 |
> |
final boolean fair = ThreadLocalRandom.current().nextBoolean(); |
249 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
250 |
> |
final long startTime = System.nanoTime(); |
251 |
> |
try { assertNull(q.poll(timeoutMillis(), MILLISECONDS)); } |
252 |
> |
catch (InterruptedException e) { threadUnexpectedException(e); } |
253 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
254 |
|
} |
255 |
|
|
256 |
|
/** |
257 |
< |
* Interrupted timed poll throws InterruptedException instead of |
258 |
< |
* returning timeout status |
257 |
> |
* timed poll before a delayed offer times out, returning null; |
258 |
> |
* after offer succeeds; on interruption throws |
259 |
|
*/ |
260 |
< |
public void testInterruptedTimedPoll() throws InterruptedException { |
261 |
< |
final SynchronousQueue q = new SynchronousQueue(); |
262 |
< |
Thread t = new Thread(new CheckedInterruptedRunnable() { |
260 |
> |
public void testTimedPollWithOffer() { |
261 |
> |
final boolean fair = ThreadLocalRandom.current().nextBoolean(); |
262 |
> |
final SynchronousQueue q = new SynchronousQueue(fair); |
263 |
> |
final CountDownLatch pleaseOffer = new CountDownLatch(1); |
264 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
265 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
266 |
|
public void realRun() throws InterruptedException { |
267 |
< |
q.poll(SMALL_DELAY_MS, MILLISECONDS); |
268 |
< |
}}); |
269 |
< |
|
335 |
< |
t.start(); |
336 |
< |
Thread.sleep(SHORT_DELAY_MS); |
337 |
< |
t.interrupt(); |
338 |
< |
t.join(); |
339 |
< |
} |
267 |
> |
long startTime = System.nanoTime(); |
268 |
> |
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
269 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
270 |
|
|
271 |
< |
/** |
272 |
< |
* timed poll before a delayed offer fails; after offer succeeds; |
343 |
< |
* on interruption throws |
344 |
< |
*/ |
345 |
< |
public void testTimedPollWithOffer() throws InterruptedException { |
346 |
< |
final SynchronousQueue q = new SynchronousQueue(); |
347 |
< |
Thread t = new Thread(new CheckedRunnable() { |
348 |
< |
public void realRun() throws InterruptedException { |
349 |
< |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
271 |
> |
pleaseOffer.countDown(); |
272 |
> |
startTime = System.nanoTime(); |
273 |
|
assertSame(zero, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
274 |
+ |
|
275 |
+ |
Thread.currentThread().interrupt(); |
276 |
|
try { |
277 |
|
q.poll(LONG_DELAY_MS, MILLISECONDS); |
278 |
|
shouldThrow(); |
279 |
|
} catch (InterruptedException success) {} |
280 |
< |
}}); |
356 |
< |
|
357 |
< |
t.start(); |
358 |
< |
Thread.sleep(SMALL_DELAY_MS); |
359 |
< |
assertTrue(q.offer(zero, SHORT_DELAY_MS, MILLISECONDS)); |
360 |
< |
t.interrupt(); |
361 |
< |
t.join(); |
362 |
< |
} |
363 |
< |
|
364 |
< |
/** |
365 |
< |
* Interrupted timed poll throws InterruptedException instead of |
366 |
< |
* returning timeout status |
367 |
< |
*/ |
368 |
< |
public void testFairInterruptedTimedPoll() throws InterruptedException { |
369 |
< |
Thread t = new Thread(new CheckedInterruptedRunnable() { |
370 |
< |
public void realRun() throws InterruptedException { |
371 |
< |
SynchronousQueue q = new SynchronousQueue(true); |
372 |
< |
q.poll(SMALL_DELAY_MS, MILLISECONDS); |
373 |
< |
}}); |
280 |
> |
assertFalse(Thread.interrupted()); |
281 |
|
|
282 |
< |
t.start(); |
376 |
< |
Thread.sleep(SHORT_DELAY_MS); |
377 |
< |
t.interrupt(); |
378 |
< |
t.join(); |
379 |
< |
} |
380 |
< |
|
381 |
< |
/** |
382 |
< |
* timed poll before a delayed offer fails; after offer succeeds; |
383 |
< |
* on interruption throws |
384 |
< |
*/ |
385 |
< |
public void testFairTimedPollWithOffer() throws InterruptedException { |
386 |
< |
final SynchronousQueue q = new SynchronousQueue(true); |
387 |
< |
Thread t = new Thread(new CheckedRunnable() { |
388 |
< |
public void realRun() throws InterruptedException { |
389 |
< |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
390 |
< |
assertSame(zero, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
282 |
> |
pleaseInterrupt.countDown(); |
283 |
|
try { |
284 |
|
q.poll(LONG_DELAY_MS, MILLISECONDS); |
285 |
< |
threadShouldThrow(); |
285 |
> |
shouldThrow(); |
286 |
|
} catch (InterruptedException success) {} |
287 |
+ |
assertFalse(Thread.interrupted()); |
288 |
+ |
|
289 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
290 |
|
}}); |
291 |
|
|
292 |
< |
t.start(); |
293 |
< |
Thread.sleep(SMALL_DELAY_MS); |
294 |
< |
assertTrue(q.offer(zero, SHORT_DELAY_MS, MILLISECONDS)); |
292 |
> |
await(pleaseOffer); |
293 |
> |
long startTime = System.nanoTime(); |
294 |
> |
try { assertTrue(q.offer(zero, LONG_DELAY_MS, MILLISECONDS)); } |
295 |
> |
catch (InterruptedException e) { threadUnexpectedException(e); } |
296 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
297 |
> |
|
298 |
> |
await(pleaseInterrupt); |
299 |
> |
assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
300 |
|
t.interrupt(); |
301 |
< |
t.join(); |
301 |
> |
awaitTermination(t); |
302 |
|
} |
303 |
|
|
404 |
– |
|
304 |
|
/** |
305 |
< |
* peek returns null |
305 |
> |
* peek() returns null if no active putter |
306 |
|
*/ |
307 |
< |
public void testPeek() { |
308 |
< |
SynchronousQueue q = new SynchronousQueue(); |
307 |
> |
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 |
|
assertNull(q.peek()); |
312 |
|
} |
313 |
|
|
314 |
|
/** |
315 |
< |
* element throws NSEE |
315 |
> |
* element() throws NoSuchElementException if no active putter |
316 |
|
*/ |
317 |
< |
public void testElement() { |
318 |
< |
SynchronousQueue q = new SynchronousQueue(); |
317 |
> |
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 |
|
try { |
322 |
|
q.element(); |
323 |
|
shouldThrow(); |
325 |
|
} |
326 |
|
|
327 |
|
/** |
328 |
< |
* remove throws NSEE if no active taker |
328 |
> |
* remove() throws NoSuchElementException if no active putter |
329 |
|
*/ |
330 |
< |
public void testRemove() { |
331 |
< |
SynchronousQueue q = new SynchronousQueue(); |
330 |
> |
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 |
|
try { |
335 |
|
q.remove(); |
336 |
|
shouldThrow(); |
338 |
|
} |
339 |
|
|
340 |
|
/** |
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 |
– |
/** |
341 |
|
* contains returns false |
342 |
|
*/ |
343 |
< |
public void testContains() { |
344 |
< |
SynchronousQueue q = new SynchronousQueue(); |
343 |
> |
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 |
|
assertFalse(q.contains(zero)); |
348 |
|
} |
349 |
|
|
350 |
|
/** |
351 |
|
* clear ensures isEmpty |
352 |
|
*/ |
353 |
< |
public void testClear() { |
354 |
< |
SynchronousQueue q = new SynchronousQueue(); |
353 |
> |
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 |
|
q.clear(); |
358 |
|
assertTrue(q.isEmpty()); |
359 |
|
} |
361 |
|
/** |
362 |
|
* containsAll returns false unless empty |
363 |
|
*/ |
364 |
< |
public void testContainsAll() { |
365 |
< |
SynchronousQueue q = new SynchronousQueue(); |
364 |
> |
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 |
|
Integer[] empty = new Integer[0]; |
369 |
|
assertTrue(q.containsAll(Arrays.asList(empty))); |
370 |
|
Integer[] ints = new Integer[1]; ints[0] = zero; |
374 |
|
/** |
375 |
|
* retainAll returns false |
376 |
|
*/ |
377 |
< |
public void testRetainAll() { |
378 |
< |
SynchronousQueue q = new SynchronousQueue(); |
377 |
> |
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 |
|
Integer[] empty = new Integer[0]; |
382 |
|
assertFalse(q.retainAll(Arrays.asList(empty))); |
383 |
|
Integer[] ints = new Integer[1]; ints[0] = zero; |
387 |
|
/** |
388 |
|
* removeAll returns false |
389 |
|
*/ |
390 |
< |
public void testRemoveAll() { |
391 |
< |
SynchronousQueue q = new SynchronousQueue(); |
390 |
> |
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 |
|
Integer[] empty = new Integer[0]; |
395 |
|
assertFalse(q.removeAll(Arrays.asList(empty))); |
396 |
|
Integer[] ints = new Integer[1]; ints[0] = zero; |
397 |
|
assertFalse(q.containsAll(Arrays.asList(ints))); |
398 |
|
} |
399 |
|
|
494 |
– |
|
400 |
|
/** |
401 |
|
* toArray is empty |
402 |
|
*/ |
403 |
< |
public void testToArray() { |
404 |
< |
SynchronousQueue q = new SynchronousQueue(); |
403 |
> |
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 |
|
Object[] o = q.toArray(); |
408 |
< |
assertEquals(o.length, 0); |
408 |
> |
assertEquals(0, o.length); |
409 |
|
} |
410 |
|
|
411 |
|
/** |
412 |
< |
* toArray(a) is nulled at position 0 |
412 |
> |
* toArray(Integer array) returns its argument with the first |
413 |
> |
* element (if present) nulled out |
414 |
|
*/ |
415 |
< |
public void testToArray2() { |
416 |
< |
SynchronousQueue q = new SynchronousQueue(); |
417 |
< |
Integer[] ints = new Integer[1]; |
418 |
< |
assertNull(ints[0]); |
415 |
> |
public void testToArray2() { testToArray2(false); } |
416 |
> |
public void testToArray2_fair() { testToArray2(true); } |
417 |
> |
public void testToArray2(boolean fair) { |
418 |
> |
final SynchronousQueue<Integer> q = new SynchronousQueue<>(fair); |
419 |
> |
Integer[] a; |
420 |
> |
|
421 |
> |
a = new Integer[0]; |
422 |
> |
assertSame(a, q.toArray(a)); |
423 |
> |
|
424 |
> |
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 |
|
} |
431 |
|
|
432 |
|
/** |
433 |
|
* toArray(null) throws NPE |
434 |
|
*/ |
435 |
< |
public void testToArray_BadArg() { |
436 |
< |
SynchronousQueue q = new SynchronousQueue(); |
435 |
> |
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 |
|
try { |
440 |
< |
Object o[] = q.toArray(null); |
440 |
> |
Object[] o = q.toArray(null); |
441 |
|
shouldThrow(); |
442 |
|
} catch (NullPointerException success) {} |
443 |
|
} |
444 |
|
|
524 |
– |
|
445 |
|
/** |
446 |
|
* iterator does not traverse any elements |
447 |
|
*/ |
448 |
< |
public void testIterator() { |
449 |
< |
SynchronousQueue q = new SynchronousQueue(); |
450 |
< |
Iterator it = q.iterator(); |
451 |
< |
assertFalse(it.hasNext()); |
532 |
< |
try { |
533 |
< |
Object x = it.next(); |
534 |
< |
shouldThrow(); |
535 |
< |
} catch (NoSuchElementException success) {} |
448 |
> |
public void testIterator() { testIterator(false); } |
449 |
> |
public void testIterator_fair() { testIterator(true); } |
450 |
> |
public void testIterator(boolean fair) { |
451 |
> |
assertIteratorExhausted(new SynchronousQueue(fair).iterator()); |
452 |
|
} |
453 |
|
|
454 |
|
/** |
455 |
< |
* iterator remove throws ISE |
455 |
> |
* iterator remove throws IllegalStateException |
456 |
|
*/ |
457 |
< |
public void testIteratorRemove() { |
458 |
< |
SynchronousQueue q = new SynchronousQueue(); |
457 |
> |
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 |
|
Iterator it = q.iterator(); |
462 |
|
try { |
463 |
|
it.remove(); |
468 |
|
/** |
469 |
|
* toString returns a non-null string |
470 |
|
*/ |
471 |
< |
public void testToString() { |
472 |
< |
SynchronousQueue q = new SynchronousQueue(); |
471 |
> |
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 |
|
String s = q.toString(); |
476 |
|
assertNotNull(s); |
477 |
|
} |
478 |
|
|
559 |
– |
|
479 |
|
/** |
480 |
|
* offer transfers elements across Executor tasks |
481 |
|
*/ |
482 |
< |
public void testOfferInExecutor() { |
483 |
< |
final SynchronousQueue q = new SynchronousQueue(); |
484 |
< |
ExecutorService executor = Executors.newFixedThreadPool(2); |
485 |
< |
|
486 |
< |
executor.execute(new CheckedRunnable() { |
487 |
< |
public void realRun() throws InterruptedException { |
488 |
< |
assertFalse(q.offer(one)); |
489 |
< |
assertTrue(q.offer(one, MEDIUM_DELAY_MS, MILLISECONDS)); |
490 |
< |
assertEquals(0, q.remainingCapacity()); |
491 |
< |
}}); |
492 |
< |
|
493 |
< |
executor.execute(new CheckedRunnable() { |
494 |
< |
public void realRun() throws InterruptedException { |
495 |
< |
Thread.sleep(SMALL_DELAY_MS); |
496 |
< |
assertSame(one, q.take()); |
497 |
< |
}}); |
498 |
< |
|
499 |
< |
joinPool(executor); |
500 |
< |
} |
501 |
< |
|
502 |
< |
/** |
503 |
< |
* poll retrieves elements across Executor threads |
504 |
< |
*/ |
505 |
< |
public void testPollInExecutor() { |
506 |
< |
final SynchronousQueue q = new SynchronousQueue(); |
507 |
< |
ExecutorService executor = Executors.newFixedThreadPool(2); |
508 |
< |
executor.execute(new CheckedRunnable() { |
509 |
< |
public void realRun() throws InterruptedException { |
510 |
< |
assertNull(q.poll()); |
511 |
< |
assertSame(one, q.poll(MEDIUM_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); |
518 |
< |
q.put(one); |
519 |
< |
}}); |
520 |
< |
|
521 |
< |
joinPool(executor); |
522 |
< |
} |
523 |
< |
|
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 |
< |
/** |
543 |
< |
* drainTo(null) throws NPE |
544 |
< |
*/ |
545 |
< |
public void testDrainToNull() { |
546 |
< |
SynchronousQueue q = new SynchronousQueue(); |
547 |
< |
try { |
548 |
< |
q.drainTo(null); |
549 |
< |
shouldThrow(); |
550 |
< |
} 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) {} |
482 |
> |
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 |
> |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
487 |
> |
final ExecutorService executor = Executors.newFixedThreadPool(2); |
488 |
> |
try (PoolCleaner cleaner = cleaner(executor)) { |
489 |
> |
|
490 |
> |
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 |
> |
} |
505 |
> |
|
506 |
> |
/** |
507 |
> |
* timed poll retrieves elements across Executor threads |
508 |
> |
*/ |
509 |
> |
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 |
> |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
514 |
> |
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 |
> |
} |
531 |
> |
|
532 |
> |
/** |
533 |
> |
* a deserialized/reserialized queue is usable |
534 |
> |
*/ |
535 |
> |
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 |
> |
assertNotSame(q, clone); |
545 |
> |
assertSerialEquals(q, clone); |
546 |
> |
assertTrue(clone.isEmpty()); |
547 |
> |
assertEquals(0, clone.size()); |
548 |
> |
assertEquals(0, clone.remainingCapacity()); |
549 |
> |
assertFalse(clone.offer(zero)); |
550 |
> |
} |
551 |
|
} |
552 |
|
|
553 |
|
/** |
554 |
|
* drainTo(c) of empty queue doesn't transfer elements |
555 |
|
*/ |
556 |
< |
public void testDrainTo() { |
557 |
< |
SynchronousQueue q = new SynchronousQueue(); |
556 |
> |
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 |
|
ArrayList l = new ArrayList(); |
561 |
|
q.drainTo(l); |
562 |
< |
assertEquals(q.size(), 0); |
563 |
< |
assertEquals(l.size(), 0); |
562 |
> |
assertEquals(0, q.size()); |
563 |
> |
assertEquals(0, l.size()); |
564 |
|
} |
565 |
|
|
566 |
|
/** |
567 |
|
* drainTo empties queue, unblocking a waiting put. |
568 |
|
*/ |
569 |
< |
public void testDrainToWithActivePut() throws InterruptedException { |
570 |
< |
final SynchronousQueue q = new SynchronousQueue(); |
571 |
< |
Thread t = new Thread(new CheckedRunnable() { |
569 |
> |
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 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
574 |
|
public void realRun() throws InterruptedException { |
575 |
< |
q.put(new Integer(1)); |
575 |
> |
q.put(one); |
576 |
|
}}); |
577 |
|
|
666 |
– |
t.start(); |
578 |
|
ArrayList l = new ArrayList(); |
579 |
< |
Thread.sleep(SHORT_DELAY_MS); |
580 |
< |
q.drainTo(l); |
581 |
< |
assertTrue(l.size() <= 1); |
582 |
< |
if (l.size() > 0) |
583 |
< |
assertEquals(l.get(0), new Integer(1)); |
584 |
< |
t.join(); |
585 |
< |
assertTrue(l.size() <= 1); |
586 |
< |
} |
587 |
< |
|
588 |
< |
/** |
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) {} |
579 |
> |
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 |
> |
assertEquals(1, l.size()); |
587 |
> |
assertSame(one, l.get(0)); |
588 |
> |
awaitTermination(t); |
589 |
|
} |
590 |
|
|
591 |
|
/** |
593 |
|
*/ |
594 |
|
public void testDrainToN() throws InterruptedException { |
595 |
|
final SynchronousQueue q = new SynchronousQueue(); |
596 |
< |
Thread t1 = new Thread(new CheckedRunnable() { |
596 |
> |
Thread t1 = newStartedThread(new CheckedRunnable() { |
597 |
|
public void realRun() throws InterruptedException { |
598 |
|
q.put(one); |
599 |
|
}}); |
600 |
|
|
601 |
< |
Thread t2 = new Thread(new CheckedRunnable() { |
601 |
> |
Thread t2 = newStartedThread(new CheckedRunnable() { |
602 |
|
public void realRun() throws InterruptedException { |
603 |
|
q.put(two); |
604 |
|
}}); |
605 |
|
|
714 |
– |
t1.start(); |
715 |
– |
t2.start(); |
606 |
|
ArrayList l = new ArrayList(); |
607 |
< |
Thread.sleep(SHORT_DELAY_MS); |
608 |
< |
q.drainTo(l, 1); |
609 |
< |
assertTrue(l.size() == 1); |
610 |
< |
q.drainTo(l, 1); |
611 |
< |
assertTrue(l.size() == 2); |
607 |
> |
int drained; |
608 |
> |
while ((drained = q.drainTo(l, 1)) == 0) Thread.yield(); |
609 |
> |
assertEquals(1, drained); |
610 |
> |
assertEquals(1, l.size()); |
611 |
> |
while ((drained = q.drainTo(l, 1)) == 0) Thread.yield(); |
612 |
> |
assertEquals(1, drained); |
613 |
> |
assertEquals(2, l.size()); |
614 |
|
assertTrue(l.contains(one)); |
615 |
|
assertTrue(l.contains(two)); |
616 |
< |
t1.join(); |
617 |
< |
t2.join(); |
616 |
> |
awaitTermination(t1); |
617 |
> |
awaitTermination(t2); |
618 |
> |
} |
619 |
> |
|
620 |
> |
/** |
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 |
|
} |