1 |
– |
|
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 John Vint |
6 |
|
*/ |
7 |
|
|
8 |
< |
import java.io.BufferedInputStream; |
9 |
< |
import java.io.BufferedOutputStream; |
11 |
< |
import java.io.ByteArrayInputStream; |
12 |
< |
import java.io.ByteArrayOutputStream; |
13 |
< |
import java.io.ObjectInputStream; |
14 |
< |
import java.io.ObjectOutputStream; |
8 |
> |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
9 |
> |
|
10 |
|
import java.util.ArrayList; |
11 |
|
import java.util.Arrays; |
12 |
< |
import java.util.ConcurrentModificationException; |
12 |
> |
import java.util.Collection; |
13 |
|
import java.util.Iterator; |
14 |
+ |
import java.util.List; |
15 |
|
import java.util.NoSuchElementException; |
16 |
< |
import java.util.concurrent.*; |
16 |
> |
import java.util.Queue; |
17 |
> |
import java.util.concurrent.BlockingQueue; |
18 |
> |
import java.util.concurrent.CountDownLatch; |
19 |
> |
import java.util.concurrent.Executors; |
20 |
> |
import java.util.concurrent.ExecutorService; |
21 |
> |
import java.util.concurrent.LinkedTransferQueue; |
22 |
> |
|
23 |
|
import junit.framework.Test; |
22 |
– |
import junit.framework.TestSuite; |
24 |
|
|
25 |
+ |
@SuppressWarnings({"unchecked", "rawtypes"}) |
26 |
|
public class LinkedTransferQueueTest extends JSR166TestCase { |
27 |
+ |
public static class Generic extends BlockingQueueTest { |
28 |
+ |
protected BlockingQueue emptyCollection() { |
29 |
+ |
return new LinkedTransferQueue(); |
30 |
+ |
} |
31 |
+ |
} |
32 |
|
|
33 |
|
public static void main(String[] args) { |
34 |
< |
junit.textui.TestRunner.run(suite()); |
34 |
> |
main(suite(), args); |
35 |
|
} |
36 |
|
|
37 |
|
public static Test suite() { |
38 |
< |
return new TestSuite(LinkedTransferQueueTest.class); |
38 |
> |
class Implementation implements CollectionImplementation { |
39 |
> |
public Class<?> klazz() { return LinkedTransferQueue.class; } |
40 |
> |
public Collection emptyCollection() { return new LinkedTransferQueue(); } |
41 |
> |
public Object makeElement(int i) { return i; } |
42 |
> |
public boolean isConcurrent() { return true; } |
43 |
> |
public boolean permitsNulls() { return false; } |
44 |
> |
} |
45 |
> |
return newTestSuite(LinkedTransferQueueTest.class, |
46 |
> |
new Generic().testSuite(), |
47 |
> |
CollectionTest.testSuite(new Implementation())); |
48 |
|
} |
49 |
|
|
50 |
< |
/* |
51 |
< |
*Constructor builds new queue with size being zero and empty being true |
50 |
> |
/** |
51 |
> |
* Constructor builds new queue with size being zero and empty |
52 |
> |
* being true |
53 |
|
*/ |
54 |
|
public void testConstructor1() { |
55 |
|
assertEquals(0, new LinkedTransferQueue().size()); |
56 |
|
assertTrue(new LinkedTransferQueue().isEmpty()); |
57 |
|
} |
58 |
|
|
59 |
< |
/* |
60 |
< |
* Initizialing constructor with null collection throws NPE |
59 |
> |
/** |
60 |
> |
* Initializing constructor with null collection throws |
61 |
> |
* NullPointerException |
62 |
|
*/ |
63 |
|
public void testConstructor2() { |
64 |
|
try { |
65 |
|
new LinkedTransferQueue(null); |
66 |
|
shouldThrow(); |
67 |
< |
} catch (NullPointerException success) { |
50 |
< |
} |
67 |
> |
} catch (NullPointerException success) {} |
68 |
|
} |
69 |
|
|
70 |
|
/** |
71 |
< |
* Initializing from Collection of null elements throws NPE |
71 |
> |
* Initializing from Collection of null elements throws |
72 |
> |
* NullPointerException |
73 |
|
*/ |
74 |
|
public void testConstructor3() { |
75 |
+ |
Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); |
76 |
|
try { |
77 |
< |
Integer[] ints = new Integer[SIZE]; |
59 |
< |
LinkedTransferQueue q = new LinkedTransferQueue(Arrays.asList(ints)); |
77 |
> |
new LinkedTransferQueue(elements); |
78 |
|
shouldThrow(); |
79 |
< |
} catch (NullPointerException success) { |
62 |
< |
} |
79 |
> |
} catch (NullPointerException success) {} |
80 |
|
} |
81 |
< |
/* |
81 |
> |
|
82 |
> |
/** |
83 |
|
* Initializing constructor with a collection containing some null elements |
84 |
< |
* throws NPE |
84 |
> |
* throws NullPointerException |
85 |
|
*/ |
68 |
– |
|
86 |
|
public void testConstructor4() { |
87 |
+ |
Integer[] ints = new Integer[SIZE]; |
88 |
+ |
for (int i = 0; i < SIZE - 1; ++i) |
89 |
+ |
ints[i] = i; |
90 |
+ |
Collection<Integer> elements = Arrays.asList(ints); |
91 |
|
try { |
92 |
< |
Integer[] ints = new Integer[SIZE]; |
72 |
< |
for (int i = 0; i < SIZE - 1; ++i) { |
73 |
< |
ints[i] = new Integer(i); |
74 |
< |
} |
75 |
< |
LinkedTransferQueue q = new LinkedTransferQueue(Arrays.asList(ints)); |
92 |
> |
new LinkedTransferQueue(elements); |
93 |
|
shouldThrow(); |
94 |
< |
} catch (NullPointerException success) { |
78 |
< |
} |
94 |
> |
} catch (NullPointerException success) {} |
95 |
|
} |
96 |
|
|
97 |
< |
/* |
97 |
> |
/** |
98 |
|
* Queue contains all elements of the collection it is initialized by |
99 |
|
*/ |
100 |
|
public void testConstructor5() { |
101 |
< |
try { |
102 |
< |
Integer[] ints = new Integer[SIZE]; |
103 |
< |
for (int i = 0; i < SIZE; ++i) { |
104 |
< |
ints[i] = new Integer(i); |
105 |
< |
} |
106 |
< |
LinkedTransferQueue q = new LinkedTransferQueue(Arrays.asList(ints)); |
107 |
< |
for (int i = 0; i < SIZE; ++i) { |
108 |
< |
assertEquals(ints[i], q.poll()); |
109 |
< |
} |
110 |
< |
} finally { |
101 |
> |
Integer[] ints = new Integer[SIZE]; |
102 |
> |
for (int i = 0; i < SIZE; ++i) { |
103 |
> |
ints[i] = i; |
104 |
> |
} |
105 |
> |
List intList = Arrays.asList(ints); |
106 |
> |
LinkedTransferQueue q |
107 |
> |
= new LinkedTransferQueue(intList); |
108 |
> |
assertEquals(q.size(), intList.size()); |
109 |
> |
assertEquals(q.toString(), intList.toString()); |
110 |
> |
assertTrue(Arrays.equals(q.toArray(), |
111 |
> |
intList.toArray())); |
112 |
> |
assertTrue(Arrays.equals(q.toArray(new Object[0]), |
113 |
> |
intList.toArray(new Object[0]))); |
114 |
> |
assertTrue(Arrays.equals(q.toArray(new Object[SIZE]), |
115 |
> |
intList.toArray(new Object[SIZE]))); |
116 |
> |
for (int i = 0; i < SIZE; ++i) { |
117 |
> |
assertEquals(ints[i], q.poll()); |
118 |
|
} |
119 |
|
} |
120 |
|
|
121 |
|
/** |
122 |
< |
* Remaining capacity never decrease nor increase on add or remove |
122 |
> |
* remainingCapacity() always returns Integer.MAX_VALUE |
123 |
|
*/ |
124 |
|
public void testRemainingCapacity() { |
125 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
103 |
< |
int remainingCapacity = q.remainingCapacity(); |
125 |
> |
BlockingQueue q = populatedQueue(SIZE); |
126 |
|
for (int i = 0; i < SIZE; ++i) { |
127 |
< |
assertEquals(remainingCapacity, q.remainingCapacity()); |
127 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
128 |
|
assertEquals(SIZE - i, q.size()); |
129 |
< |
q.remove(); |
129 |
> |
assertEquals(i, q.remove()); |
130 |
|
} |
131 |
|
for (int i = 0; i < SIZE; ++i) { |
132 |
< |
assertEquals(remainingCapacity, q.remainingCapacity()); |
132 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
133 |
|
assertEquals(i, q.size()); |
134 |
< |
q.add(new Integer(i)); |
113 |
< |
} |
114 |
< |
} |
115 |
< |
|
116 |
< |
/** |
117 |
< |
* offer(null) throws NPE |
118 |
< |
*/ |
119 |
< |
public void testOfferNull() { |
120 |
< |
try { |
121 |
< |
LinkedTransferQueue q = new LinkedTransferQueue(); |
122 |
< |
q.offer(null); |
123 |
< |
shouldThrow(); |
124 |
< |
} catch (NullPointerException success) { |
134 |
> |
assertTrue(q.add(i)); |
135 |
|
} |
136 |
|
} |
137 |
|
|
138 |
|
/** |
139 |
< |
* add(null) throws NPE |
130 |
< |
*/ |
131 |
< |
public void testAddNull() { |
132 |
< |
try { |
133 |
< |
LinkedTransferQueue q = new LinkedTransferQueue(); |
134 |
< |
q.add(null); |
135 |
< |
shouldThrow(); |
136 |
< |
} catch (NullPointerException success) { |
137 |
< |
} |
138 |
< |
} |
139 |
< |
|
140 |
< |
/** |
141 |
< |
* addAll(null) throws NPE |
142 |
< |
*/ |
143 |
< |
public void testAddAll1() { |
144 |
< |
try { |
145 |
< |
LinkedTransferQueue q = new LinkedTransferQueue(); |
146 |
< |
q.addAll(null); |
147 |
< |
shouldThrow(); |
148 |
< |
} catch (NullPointerException success) { |
149 |
< |
} |
150 |
< |
} |
151 |
< |
|
152 |
< |
/** |
153 |
< |
* addAll(this) throws IAE |
139 |
> |
* addAll(this) throws IllegalArgumentException |
140 |
|
*/ |
141 |
|
public void testAddAllSelf() { |
142 |
+ |
LinkedTransferQueue q = populatedQueue(SIZE); |
143 |
|
try { |
157 |
– |
LinkedTransferQueue q = populatedQueue(SIZE); |
144 |
|
q.addAll(q); |
145 |
|
shouldThrow(); |
146 |
< |
} catch (IllegalArgumentException success) { |
161 |
< |
} |
162 |
< |
} |
163 |
< |
|
164 |
< |
/** |
165 |
< |
* addAll of a collection with null elements throws NPE |
166 |
< |
*/ |
167 |
< |
public void testAddAll2() { |
168 |
< |
try { |
169 |
< |
LinkedTransferQueue q = new LinkedTransferQueue(); |
170 |
< |
Integer[] ints = new Integer[SIZE]; |
171 |
< |
q.addAll(Arrays.asList(ints)); |
172 |
< |
shouldThrow(); |
173 |
< |
} catch (NullPointerException success) { |
174 |
< |
} |
146 |
> |
} catch (IllegalArgumentException success) {} |
147 |
|
} |
148 |
|
|
149 |
|
/** |
150 |
< |
* addAll of a collection with any null elements throws NPE after |
151 |
< |
* possibly adding some elements |
150 |
> |
* addAll of a collection with any null elements throws |
151 |
> |
* NullPointerException after possibly adding some elements |
152 |
|
*/ |
153 |
|
public void testAddAll3() { |
154 |
+ |
LinkedTransferQueue q = new LinkedTransferQueue(); |
155 |
+ |
Integer[] ints = new Integer[SIZE]; |
156 |
+ |
for (int i = 0; i < SIZE - 1; ++i) |
157 |
+ |
ints[i] = i; |
158 |
|
try { |
183 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
184 |
– |
Integer[] ints = new Integer[SIZE]; |
185 |
– |
for (int i = 0; i < SIZE - 1; ++i) { |
186 |
– |
ints[i] = new Integer(i); |
187 |
– |
} |
159 |
|
q.addAll(Arrays.asList(ints)); |
160 |
|
shouldThrow(); |
161 |
< |
} catch (NullPointerException success) { |
191 |
< |
} |
161 |
> |
} catch (NullPointerException success) {} |
162 |
|
} |
163 |
|
|
164 |
|
/** |
165 |
|
* Queue contains all elements, in traversal order, of successful addAll |
166 |
|
*/ |
167 |
|
public void testAddAll5() { |
168 |
< |
try { |
169 |
< |
Integer[] empty = new Integer[0]; |
170 |
< |
Integer[] ints = new Integer[SIZE]; |
171 |
< |
for (int i = 0; i < SIZE; ++i) { |
202 |
< |
ints[i] = new Integer(i); |
203 |
< |
} |
204 |
< |
LinkedTransferQueue q = new LinkedTransferQueue(); |
205 |
< |
assertFalse(q.addAll(Arrays.asList(empty))); |
206 |
< |
assertTrue(q.addAll(Arrays.asList(ints))); |
207 |
< |
for (int i = 0; i < SIZE; ++i) { |
208 |
< |
assertEquals(ints[i], q.poll()); |
209 |
< |
} |
210 |
< |
} finally { |
168 |
> |
Integer[] empty = new Integer[0]; |
169 |
> |
Integer[] ints = new Integer[SIZE]; |
170 |
> |
for (int i = 0; i < SIZE; ++i) { |
171 |
> |
ints[i] = i; |
172 |
|
} |
173 |
< |
} |
174 |
< |
|
175 |
< |
/** |
176 |
< |
* put(null) throws NPE |
177 |
< |
*/ |
217 |
< |
public void testPutNull() { |
218 |
< |
try { |
219 |
< |
LinkedTransferQueue q = new LinkedTransferQueue(); |
220 |
< |
q.put(null); |
221 |
< |
shouldThrow(); |
222 |
< |
} catch (NullPointerException success) { |
223 |
< |
} catch (Exception ie) { |
224 |
< |
unexpectedException(); |
173 |
> |
LinkedTransferQueue q = new LinkedTransferQueue(); |
174 |
> |
assertFalse(q.addAll(Arrays.asList(empty))); |
175 |
> |
assertTrue(q.addAll(Arrays.asList(ints))); |
176 |
> |
for (int i = 0; i < SIZE; ++i) { |
177 |
> |
assertEquals(ints[i], q.poll()); |
178 |
|
} |
179 |
|
} |
180 |
|
|
182 |
|
* all elements successfully put are contained |
183 |
|
*/ |
184 |
|
public void testPut() { |
185 |
< |
try { |
186 |
< |
LinkedTransferQueue q = new LinkedTransferQueue(); |
187 |
< |
for (int i = 0; i < SIZE; ++i) { |
188 |
< |
Integer I = new Integer(i); |
189 |
< |
q.put(I); |
237 |
< |
assertTrue(q.contains(I)); |
238 |
< |
} |
239 |
< |
} catch (Exception ie) { |
240 |
< |
unexpectedException(); |
185 |
> |
LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
186 |
> |
for (int i = 0; i < SIZE; ++i) { |
187 |
> |
assertEquals(i, q.size()); |
188 |
> |
q.put(i); |
189 |
> |
assertTrue(q.contains(i)); |
190 |
|
} |
191 |
|
} |
192 |
|
|
193 |
|
/** |
194 |
|
* take retrieves elements in FIFO order |
195 |
|
*/ |
196 |
< |
public void testTake() { |
197 |
< |
try { |
198 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
199 |
< |
for (int i = 0; i < SIZE; ++i) { |
251 |
< |
assertEquals(i, ((Integer) q.take()).intValue()); |
252 |
< |
} |
253 |
< |
} catch (InterruptedException e) { |
254 |
< |
unexpectedException(); |
196 |
> |
public void testTake() throws InterruptedException { |
197 |
> |
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
198 |
> |
for (int i = 0; i < SIZE; ++i) { |
199 |
> |
assertEquals(i, (int) q.take()); |
200 |
|
} |
201 |
|
} |
202 |
|
|
203 |
|
/** |
204 |
< |
* take blocks interruptibly when empty |
204 |
> |
* take removes existing elements until empty, then blocks interruptibly |
205 |
|
*/ |
206 |
< |
public void testTakeFromEmpty() { |
207 |
< |
final LinkedTransferQueue q = new LinkedTransferQueue(); |
208 |
< |
Thread t = new Thread(new Runnable() { |
206 |
> |
public void testBlockingTake() throws InterruptedException { |
207 |
> |
final BlockingQueue q = populatedQueue(SIZE); |
208 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
209 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
210 |
> |
public void realRun() throws InterruptedException { |
211 |
> |
for (int i = 0; i < SIZE; ++i) { |
212 |
> |
assertEquals(i, q.take()); |
213 |
> |
} |
214 |
|
|
215 |
< |
public void run() { |
215 |
> |
Thread.currentThread().interrupt(); |
216 |
|
try { |
217 |
|
q.take(); |
218 |
< |
threadShouldThrow(); |
219 |
< |
} catch (InterruptedException success) { |
220 |
< |
} |
271 |
< |
} |
272 |
< |
}); |
273 |
< |
try { |
274 |
< |
t.start(); |
275 |
< |
Thread.sleep(SHORT_DELAY_MS); |
276 |
< |
t.interrupt(); |
277 |
< |
t.join(); |
278 |
< |
} catch (Exception e) { |
279 |
< |
unexpectedException(); |
280 |
< |
} |
281 |
< |
} |
282 |
< |
/* |
283 |
< |
* Take removes existing elements until empty, then blocks interruptibly |
284 |
< |
*/ |
285 |
< |
|
286 |
< |
public void testBlockingTake() { |
287 |
< |
Thread t = new Thread(new Runnable() { |
218 |
> |
shouldThrow(); |
219 |
> |
} catch (InterruptedException success) {} |
220 |
> |
assertFalse(Thread.interrupted()); |
221 |
|
|
222 |
< |
public void run() { |
222 |
> |
pleaseInterrupt.countDown(); |
223 |
|
try { |
291 |
– |
LinkedTransferQueue q = populatedQueue(SIZE); |
292 |
– |
for (int i = 0; i < SIZE; ++i) { |
293 |
– |
assertEquals(i, ((Integer) q.take()).intValue()); |
294 |
– |
} |
224 |
|
q.take(); |
225 |
< |
threadShouldThrow(); |
226 |
< |
} catch (InterruptedException success) { |
227 |
< |
} |
228 |
< |
} |
229 |
< |
}); |
230 |
< |
t.start(); |
231 |
< |
try { |
232 |
< |
Thread.sleep(SHORT_DELAY_MS); |
233 |
< |
t.interrupt(); |
305 |
< |
t.join(); |
306 |
< |
} catch (InterruptedException ie) { |
307 |
< |
unexpectedException(); |
308 |
< |
} |
225 |
> |
shouldThrow(); |
226 |
> |
} catch (InterruptedException success) {} |
227 |
> |
assertFalse(Thread.interrupted()); |
228 |
> |
}}); |
229 |
> |
|
230 |
> |
await(pleaseInterrupt); |
231 |
> |
assertThreadStaysAlive(t); |
232 |
> |
t.interrupt(); |
233 |
> |
awaitTermination(t); |
234 |
|
} |
235 |
|
|
236 |
|
/** |
237 |
|
* poll succeeds unless empty |
238 |
|
*/ |
239 |
< |
public void testPoll() { |
240 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
239 |
> |
public void testPoll() throws InterruptedException { |
240 |
> |
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
241 |
|
for (int i = 0; i < SIZE; ++i) { |
242 |
< |
assertEquals(i, ((Integer) q.poll()).intValue()); |
242 |
> |
assertEquals(i, (int) q.poll()); |
243 |
|
} |
244 |
|
assertNull(q.poll()); |
245 |
+ |
checkEmpty(q); |
246 |
|
} |
247 |
|
|
248 |
|
/** |
249 |
< |
* timed pool with zero timeout succeeds when non-empty, else times out |
249 |
> |
* timed poll with zero timeout succeeds when non-empty, else times out |
250 |
|
*/ |
251 |
< |
public void testTimedPoll0() { |
252 |
< |
try { |
253 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
254 |
< |
for (int i = 0; i < SIZE; ++i) { |
329 |
< |
assertEquals(i, ((Integer) q.poll(0, TimeUnit.MILLISECONDS)).intValue()); |
330 |
< |
} |
331 |
< |
assertNull(q.poll(0, TimeUnit.MILLISECONDS)); |
332 |
< |
} catch (InterruptedException e) { |
333 |
< |
unexpectedException(); |
251 |
> |
public void testTimedPoll0() throws InterruptedException { |
252 |
> |
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
253 |
> |
for (int i = 0; i < SIZE; ++i) { |
254 |
> |
assertEquals(i, (int) q.poll(0, MILLISECONDS)); |
255 |
|
} |
256 |
+ |
assertNull(q.poll(0, MILLISECONDS)); |
257 |
+ |
checkEmpty(q); |
258 |
|
} |
259 |
|
|
260 |
|
/** |
261 |
< |
* timed pool with nonzero timeout succeeds when non-empty, else times out |
261 |
> |
* timed poll with nonzero timeout succeeds when non-empty, else times out |
262 |
|
*/ |
263 |
< |
public void testTimedPoll() { |
264 |
< |
try { |
265 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
266 |
< |
for (int i = 0; i < SIZE; ++i) { |
267 |
< |
assertEquals(i, ((Integer) q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue()); |
268 |
< |
} |
269 |
< |
assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
270 |
< |
} catch (InterruptedException e) { |
271 |
< |
unexpectedException(); |
272 |
< |
} |
263 |
> |
public void testTimedPoll() throws InterruptedException { |
264 |
> |
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
265 |
> |
long startTime = System.nanoTime(); |
266 |
> |
for (int i = 0; i < SIZE; ++i) |
267 |
> |
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
268 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
269 |
> |
|
270 |
> |
startTime = System.nanoTime(); |
271 |
> |
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
272 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
273 |
> |
checkEmpty(q); |
274 |
|
} |
275 |
|
|
276 |
|
/** |
277 |
|
* Interrupted timed poll throws InterruptedException instead of |
278 |
|
* returning timeout status |
279 |
|
*/ |
280 |
< |
public void testInterruptedTimedPoll() { |
281 |
< |
Thread t = new Thread(new Runnable() { |
282 |
< |
|
283 |
< |
public void run() { |
280 |
> |
public void testInterruptedTimedPoll() throws InterruptedException { |
281 |
> |
final BlockingQueue<Integer> q = populatedQueue(SIZE); |
282 |
> |
final CountDownLatch aboutToWait = new CountDownLatch(1); |
283 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
284 |
> |
public void realRun() throws InterruptedException { |
285 |
> |
long startTime = System.nanoTime(); |
286 |
> |
for (int i = 0; i < SIZE; ++i) |
287 |
> |
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
288 |
> |
aboutToWait.countDown(); |
289 |
|
try { |
290 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
291 |
< |
for (int i = 0; i < SIZE; ++i) { |
292 |
< |
threadAssertEquals(i, ((Integer) q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue()); |
293 |
< |
} |
294 |
< |
threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
295 |
< |
} catch (InterruptedException success) { |
296 |
< |
} |
297 |
< |
} |
298 |
< |
}); |
299 |
< |
t.start(); |
300 |
< |
try { |
372 |
< |
Thread.sleep(SHORT_DELAY_MS); |
373 |
< |
t.interrupt(); |
374 |
< |
t.join(); |
375 |
< |
} catch (InterruptedException ie) { |
376 |
< |
unexpectedException(); |
377 |
< |
} |
290 |
> |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
291 |
> |
shouldThrow(); |
292 |
> |
} catch (InterruptedException success) {} |
293 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
294 |
> |
}}); |
295 |
> |
|
296 |
> |
aboutToWait.await(); |
297 |
> |
waitForThreadToEnterWaitState(t); |
298 |
> |
t.interrupt(); |
299 |
> |
awaitTermination(t); |
300 |
> |
checkEmpty(q); |
301 |
|
} |
302 |
|
|
303 |
|
/** |
304 |
< |
* timed poll before a delayed offer fails; after offer succeeds; |
305 |
< |
* on interruption throws |
306 |
< |
*/ |
307 |
< |
public void testTimedPollWithOffer() { |
308 |
< |
final LinkedTransferQueue q = new LinkedTransferQueue(); |
309 |
< |
Thread t = new Thread(new Runnable() { |
310 |
< |
|
311 |
< |
public void run() { |
304 |
> |
* timed poll after thread interrupted throws InterruptedException |
305 |
> |
* instead of returning timeout status |
306 |
> |
*/ |
307 |
> |
public void testTimedPollAfterInterrupt() throws InterruptedException { |
308 |
> |
final BlockingQueue<Integer> q = populatedQueue(SIZE); |
309 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
310 |
> |
public void realRun() throws InterruptedException { |
311 |
> |
long startTime = System.nanoTime(); |
312 |
> |
Thread.currentThread().interrupt(); |
313 |
> |
for (int i = 0; i < SIZE; ++i) |
314 |
> |
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
315 |
|
try { |
316 |
< |
threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
317 |
< |
q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS); |
318 |
< |
q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS); |
319 |
< |
threadShouldThrow(); |
320 |
< |
} catch (InterruptedException success) { |
321 |
< |
} |
322 |
< |
} |
323 |
< |
}); |
398 |
< |
try { |
399 |
< |
t.start(); |
400 |
< |
Thread.sleep(SMALL_DELAY_MS); |
401 |
< |
assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
402 |
< |
t.interrupt(); |
403 |
< |
t.join(); |
404 |
< |
} catch (Exception e) { |
405 |
< |
unexpectedException(); |
406 |
< |
} |
316 |
> |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
317 |
> |
shouldThrow(); |
318 |
> |
} catch (InterruptedException success) {} |
319 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
320 |
> |
}}); |
321 |
> |
|
322 |
> |
awaitTermination(t); |
323 |
> |
checkEmpty(q); |
324 |
|
} |
325 |
|
|
326 |
|
/** |
327 |
|
* peek returns next element, or null if empty |
328 |
|
*/ |
329 |
< |
public void testPeek() { |
330 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
329 |
> |
public void testPeek() throws InterruptedException { |
330 |
> |
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
331 |
|
for (int i = 0; i < SIZE; ++i) { |
332 |
< |
assertEquals(i, ((Integer) q.peek()).intValue()); |
333 |
< |
q.poll(); |
332 |
> |
assertEquals(i, (int) q.peek()); |
333 |
> |
assertEquals(i, (int) q.poll()); |
334 |
|
assertTrue(q.peek() == null || |
335 |
< |
i != ((Integer) q.peek()).intValue()); |
335 |
> |
i != (int) q.peek()); |
336 |
|
} |
337 |
|
assertNull(q.peek()); |
338 |
+ |
checkEmpty(q); |
339 |
|
} |
340 |
|
|
341 |
|
/** |
342 |
< |
* element returns next element, or throws NSEE if empty |
342 |
> |
* element returns next element, or throws NoSuchElementException if empty |
343 |
|
*/ |
344 |
< |
public void testElement() { |
345 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
344 |
> |
public void testElement() throws InterruptedException { |
345 |
> |
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
346 |
|
for (int i = 0; i < SIZE; ++i) { |
347 |
< |
assertEquals(i, ((Integer) q.element()).intValue()); |
348 |
< |
q.poll(); |
347 |
> |
assertEquals(i, (int) q.element()); |
348 |
> |
assertEquals(i, (int) q.poll()); |
349 |
|
} |
350 |
|
try { |
351 |
|
q.element(); |
352 |
|
shouldThrow(); |
353 |
< |
} catch (NoSuchElementException success) { |
354 |
< |
} |
353 |
> |
} catch (NoSuchElementException success) {} |
354 |
> |
checkEmpty(q); |
355 |
|
} |
356 |
|
|
357 |
|
/** |
358 |
< |
* remove removes next element, or throws NSEE if empty |
358 |
> |
* remove removes next element, or throws NoSuchElementException if empty |
359 |
|
*/ |
360 |
< |
public void testRemove() { |
361 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
360 |
> |
public void testRemove() throws InterruptedException { |
361 |
> |
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
362 |
|
for (int i = 0; i < SIZE; ++i) { |
363 |
< |
assertEquals(i, ((Integer) q.remove()).intValue()); |
363 |
> |
assertEquals(i, (int) q.remove()); |
364 |
|
} |
365 |
|
try { |
366 |
|
q.remove(); |
367 |
|
shouldThrow(); |
368 |
< |
} catch (NoSuchElementException success) { |
369 |
< |
} |
452 |
< |
} |
453 |
< |
|
454 |
< |
/** |
455 |
< |
* remove(x) removes x and returns true if present |
456 |
< |
*/ |
457 |
< |
public void testRemoveElement() { |
458 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
459 |
< |
for (int i = 1; i < SIZE; i += 2) { |
460 |
< |
assertTrue(q.remove(new Integer(i))); |
461 |
< |
} |
462 |
< |
for (int i = 0; i < SIZE; i += 2) { |
463 |
< |
assertTrue(q.remove(new Integer(i))); |
464 |
< |
assertFalse(q.remove(new Integer(i + 1))); |
465 |
< |
} |
466 |
< |
assertTrue(q.isEmpty()); |
368 |
> |
} catch (NoSuchElementException success) {} |
369 |
> |
checkEmpty(q); |
370 |
|
} |
371 |
|
|
372 |
|
/** |
373 |
|
* An add following remove(x) succeeds |
374 |
|
*/ |
375 |
< |
public void testRemoveElementAndAdd() { |
376 |
< |
try { |
377 |
< |
LinkedTransferQueue q = new LinkedTransferQueue(); |
378 |
< |
assertTrue(q.add(new Integer(1))); |
379 |
< |
assertTrue(q.add(new Integer(2))); |
380 |
< |
assertTrue(q.remove(new Integer(1))); |
381 |
< |
assertTrue(q.remove(new Integer(2))); |
382 |
< |
assertTrue(q.add(new Integer(3))); |
480 |
< |
assertTrue(q.take() != null); |
481 |
< |
} catch (Exception e) { |
482 |
< |
unexpectedException(); |
483 |
< |
} |
375 |
> |
public void testRemoveElementAndAdd() throws InterruptedException { |
376 |
> |
LinkedTransferQueue q = new LinkedTransferQueue(); |
377 |
> |
assertTrue(q.add(one)); |
378 |
> |
assertTrue(q.add(two)); |
379 |
> |
assertTrue(q.remove(one)); |
380 |
> |
assertTrue(q.remove(two)); |
381 |
> |
assertTrue(q.add(three)); |
382 |
> |
assertSame(q.take(), three); |
383 |
|
} |
384 |
|
|
385 |
|
/** |
386 |
|
* contains(x) reports true when elements added but not yet removed |
387 |
|
*/ |
388 |
|
public void testContains() { |
389 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
389 |
> |
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
390 |
|
for (int i = 0; i < SIZE; ++i) { |
391 |
< |
assertTrue(q.contains(new Integer(i))); |
392 |
< |
q.poll(); |
393 |
< |
assertFalse(q.contains(new Integer(i))); |
391 |
> |
assertTrue(q.contains(i)); |
392 |
> |
assertEquals(i, (int) q.poll()); |
393 |
> |
assertFalse(q.contains(i)); |
394 |
|
} |
395 |
|
} |
396 |
|
|
397 |
|
/** |
398 |
|
* clear removes all elements |
399 |
|
*/ |
400 |
< |
public void testClear() { |
400 |
> |
public void testClear() throws InterruptedException { |
401 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
503 |
– |
int remainingCapacity = q.remainingCapacity(); |
402 |
|
q.clear(); |
403 |
< |
assertTrue(q.isEmpty()); |
404 |
< |
assertEquals(0, q.size()); |
507 |
< |
assertEquals(remainingCapacity, q.remainingCapacity()); |
403 |
> |
checkEmpty(q); |
404 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
405 |
|
q.add(one); |
406 |
|
assertFalse(q.isEmpty()); |
407 |
+ |
assertEquals(1, q.size()); |
408 |
|
assertTrue(q.contains(one)); |
409 |
|
q.clear(); |
410 |
< |
assertTrue(q.isEmpty()); |
410 |
> |
checkEmpty(q); |
411 |
|
} |
412 |
|
|
413 |
|
/** |
414 |
|
* containsAll(c) is true when c contains a subset of elements |
415 |
|
*/ |
416 |
|
public void testContainsAll() { |
417 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
418 |
< |
LinkedTransferQueue p = new LinkedTransferQueue(); |
417 |
> |
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
418 |
> |
LinkedTransferQueue<Integer> p = new LinkedTransferQueue<>(); |
419 |
|
for (int i = 0; i < SIZE; ++i) { |
420 |
|
assertTrue(q.containsAll(p)); |
421 |
|
assertFalse(p.containsAll(q)); |
422 |
< |
p.add(new Integer(i)); |
422 |
> |
p.add(i); |
423 |
|
} |
424 |
|
assertTrue(p.containsAll(q)); |
425 |
|
} |
426 |
|
|
427 |
|
/** |
428 |
< |
* retainAll(c) retains only those elements of c and reports true if changed |
428 |
> |
* retainAll(c) retains only those elements of c and reports true |
429 |
> |
* if changed |
430 |
|
*/ |
431 |
|
public void testRetainAll() { |
432 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
445 |
|
} |
446 |
|
|
447 |
|
/** |
448 |
< |
* removeAll(c) removes only those elements of c and reports true if changed |
448 |
> |
* removeAll(c) removes only those elements of c and reports true |
449 |
> |
* if changed |
450 |
|
*/ |
451 |
|
public void testRemoveAll() { |
452 |
|
for (int i = 1; i < SIZE; ++i) { |
455 |
|
assertTrue(q.removeAll(p)); |
456 |
|
assertEquals(SIZE - i, q.size()); |
457 |
|
for (int j = 0; j < i; ++j) { |
458 |
< |
Integer I = (Integer) (p.remove()); |
559 |
< |
assertFalse(q.contains(I)); |
458 |
> |
assertFalse(q.contains(p.remove())); |
459 |
|
} |
460 |
|
} |
461 |
|
} |
462 |
|
|
463 |
|
/** |
464 |
< |
* toArray contains all elements |
464 |
> |
* toArray() contains all elements in FIFO order |
465 |
|
*/ |
466 |
|
public void testToArray() { |
467 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
468 |
|
Object[] o = q.toArray(); |
469 |
< |
try { |
470 |
< |
for (int i = 0; i < o.length; i++) { |
572 |
< |
assertEquals(o[i], q.take()); |
573 |
< |
} |
574 |
< |
} catch (InterruptedException e) { |
575 |
< |
unexpectedException(); |
469 |
> |
for (int i = 0; i < o.length; i++) { |
470 |
> |
assertSame(o[i], q.poll()); |
471 |
|
} |
472 |
|
} |
473 |
|
|
474 |
|
/** |
475 |
< |
* toArray(a) contains all elements |
475 |
> |
* toArray(a) contains all elements in FIFO order |
476 |
|
*/ |
477 |
|
public void testToArray2() { |
478 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
478 |
> |
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
479 |
|
Integer[] ints = new Integer[SIZE]; |
480 |
< |
ints = (Integer[]) q.toArray(ints); |
481 |
< |
try { |
482 |
< |
for (int i = 0; i < ints.length; i++) { |
483 |
< |
assertEquals(ints[i], q.take()); |
589 |
< |
} |
590 |
< |
} catch (InterruptedException e) { |
591 |
< |
unexpectedException(); |
592 |
< |
} |
593 |
< |
} |
594 |
< |
|
595 |
< |
/** |
596 |
< |
* toArray(null) throws NPE |
597 |
< |
*/ |
598 |
< |
public void testToArray_BadArg() { |
599 |
< |
try { |
600 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
601 |
< |
Object o[] = q.toArray(null); |
602 |
< |
shouldThrow(); |
603 |
< |
} catch (NullPointerException success) { |
480 |
> |
Integer[] array = q.toArray(ints); |
481 |
> |
assertSame(ints, array); |
482 |
> |
for (int i = 0; i < ints.length; i++) { |
483 |
> |
assertSame(ints[i], q.poll()); |
484 |
|
} |
485 |
|
} |
486 |
|
|
487 |
|
/** |
488 |
< |
* toArray with incompatible array type throws CCE |
488 |
> |
* toArray(incompatible array type) throws ArrayStoreException |
489 |
|
*/ |
490 |
|
public void testToArray1_BadArg() { |
491 |
+ |
LinkedTransferQueue q = populatedQueue(SIZE); |
492 |
|
try { |
493 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
613 |
< |
Object o[] = q.toArray(new String[10]); |
493 |
> |
q.toArray(new String[10]); |
494 |
|
shouldThrow(); |
495 |
< |
} catch (ArrayStoreException success) { |
616 |
< |
} |
495 |
> |
} catch (ArrayStoreException success) {} |
496 |
|
} |
497 |
|
|
498 |
|
/** |
499 |
|
* iterator iterates through all elements |
500 |
|
*/ |
501 |
< |
public void testIterator() { |
501 |
> |
public void testIterator() throws InterruptedException { |
502 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
503 |
|
Iterator it = q.iterator(); |
504 |
< |
try { |
505 |
< |
while (it.hasNext()) { |
506 |
< |
assertEquals(it.next(), q.take()); |
507 |
< |
} |
508 |
< |
} catch (InterruptedException e) { |
509 |
< |
unexpectedException(); |
510 |
< |
} |
504 |
> |
int i; |
505 |
> |
for (i = 0; it.hasNext(); i++) |
506 |
> |
assertTrue(q.contains(it.next())); |
507 |
> |
assertEquals(i, SIZE); |
508 |
> |
assertIteratorExhausted(it); |
509 |
> |
|
510 |
> |
it = q.iterator(); |
511 |
> |
for (i = 0; it.hasNext(); i++) |
512 |
> |
assertEquals(it.next(), q.take()); |
513 |
> |
assertEquals(i, SIZE); |
514 |
> |
assertIteratorExhausted(it); |
515 |
|
} |
516 |
|
|
517 |
|
/** |
518 |
< |
* iterator.remove removes current element |
518 |
> |
* iterator of empty collection has no elements |
519 |
> |
*/ |
520 |
> |
public void testEmptyIterator() { |
521 |
> |
assertIteratorExhausted(new LinkedTransferQueue().iterator()); |
522 |
> |
} |
523 |
> |
|
524 |
> |
/** |
525 |
> |
* iterator.remove() removes current element |
526 |
|
*/ |
527 |
|
public void testIteratorRemove() { |
528 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
535 |
|
it.remove(); |
536 |
|
|
537 |
|
it = q.iterator(); |
538 |
< |
assertEquals(it.next(), one); |
539 |
< |
assertEquals(it.next(), three); |
538 |
> |
assertSame(it.next(), one); |
539 |
> |
assertSame(it.next(), three); |
540 |
|
assertFalse(it.hasNext()); |
541 |
|
} |
542 |
|
|
544 |
|
* iterator ordering is FIFO |
545 |
|
*/ |
546 |
|
public void testIteratorOrdering() { |
547 |
< |
final LinkedTransferQueue q = new LinkedTransferQueue(); |
548 |
< |
int remainingCapacity = q.remainingCapacity(); |
547 |
> |
final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
548 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
549 |
|
q.add(one); |
550 |
|
q.add(two); |
551 |
|
q.add(three); |
552 |
< |
assertEquals(remainingCapacity, q.remainingCapacity()); |
552 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
553 |
|
int k = 0; |
554 |
< |
for (Iterator it = q.iterator(); it.hasNext();) { |
555 |
< |
int i = ((Integer) (it.next())).intValue(); |
666 |
< |
assertEquals(++k, i); |
554 |
> |
for (Integer n : q) { |
555 |
> |
assertEquals(++k, (int) n); |
556 |
|
} |
557 |
|
assertEquals(3, k); |
558 |
|
} |
565 |
|
q.add(one); |
566 |
|
q.add(two); |
567 |
|
q.add(three); |
568 |
< |
try { |
569 |
< |
for (Iterator it = q.iterator(); it.hasNext();) { |
570 |
< |
q.remove(); |
682 |
< |
it.next(); |
683 |
< |
} |
684 |
< |
} catch (ConcurrentModificationException e) { |
685 |
< |
unexpectedException(); |
568 |
> |
for (Iterator it = q.iterator(); it.hasNext();) { |
569 |
> |
q.remove(); |
570 |
> |
it.next(); |
571 |
|
} |
572 |
|
assertEquals(0, q.size()); |
573 |
|
} |
579 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
580 |
|
String s = q.toString(); |
581 |
|
for (int i = 0; i < SIZE; ++i) { |
582 |
< |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
582 |
> |
assertTrue(s.contains(String.valueOf(i))); |
583 |
|
} |
584 |
|
} |
585 |
|
|
588 |
|
*/ |
589 |
|
public void testOfferInExecutor() { |
590 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
591 |
< |
q.add(one); |
592 |
< |
q.add(two); |
593 |
< |
ExecutorService executor = Executors.newFixedThreadPool(2); |
709 |
< |
executor.execute(new Runnable() { |
591 |
> |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
592 |
> |
final ExecutorService executor = Executors.newFixedThreadPool(2); |
593 |
> |
try (PoolCleaner cleaner = cleaner(executor)) { |
594 |
|
|
595 |
< |
public void run() { |
596 |
< |
try { |
597 |
< |
threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS)); |
598 |
< |
} catch (Exception e) { |
599 |
< |
threadUnexpectedException(); |
600 |
< |
} |
601 |
< |
} |
718 |
< |
}); |
719 |
< |
|
720 |
< |
executor.execute(new Runnable() { |
721 |
< |
|
722 |
< |
public void run() { |
723 |
< |
try { |
724 |
< |
Thread.sleep(SMALL_DELAY_MS); |
725 |
< |
threadAssertEquals(one, q.take()); |
726 |
< |
} catch (InterruptedException e) { |
727 |
< |
threadUnexpectedException(); |
728 |
< |
} |
729 |
< |
} |
730 |
< |
}); |
595 |
> |
executor.execute(new CheckedRunnable() { |
596 |
> |
public void realRun() throws InterruptedException { |
597 |
> |
threadsStarted.await(); |
598 |
> |
long startTime = System.nanoTime(); |
599 |
> |
assertTrue(q.offer(one, LONG_DELAY_MS, MILLISECONDS)); |
600 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
601 |
> |
}}); |
602 |
|
|
603 |
< |
joinPool(executor); |
603 |
> |
executor.execute(new CheckedRunnable() { |
604 |
> |
public void realRun() throws InterruptedException { |
605 |
> |
threadsStarted.await(); |
606 |
> |
assertSame(one, q.take()); |
607 |
> |
checkEmpty(q); |
608 |
> |
}}); |
609 |
> |
} |
610 |
|
} |
611 |
|
|
612 |
|
/** |
613 |
< |
* poll retrieves elements across Executor threads |
613 |
> |
* timed poll retrieves elements across Executor threads |
614 |
|
*/ |
615 |
|
public void testPollInExecutor() { |
616 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
617 |
< |
ExecutorService executor = Executors.newFixedThreadPool(2); |
618 |
< |
executor.execute(new Runnable() { |
619 |
< |
|
620 |
< |
public void run() { |
621 |
< |
threadAssertNull(q.poll()); |
622 |
< |
try { |
623 |
< |
threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS)); |
624 |
< |
threadAssertTrue(q.isEmpty()); |
625 |
< |
} catch (InterruptedException e) { |
626 |
< |
threadUnexpectedException(); |
627 |
< |
} |
628 |
< |
} |
629 |
< |
}); |
630 |
< |
|
631 |
< |
executor.execute(new Runnable() { |
632 |
< |
|
633 |
< |
public void run() { |
757 |
< |
try { |
758 |
< |
Thread.sleep(SMALL_DELAY_MS); |
617 |
> |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
618 |
> |
final ExecutorService executor = Executors.newFixedThreadPool(2); |
619 |
> |
try (PoolCleaner cleaner = cleaner(executor)) { |
620 |
> |
|
621 |
> |
executor.execute(new CheckedRunnable() { |
622 |
> |
public void realRun() throws InterruptedException { |
623 |
> |
assertNull(q.poll()); |
624 |
> |
threadsStarted.await(); |
625 |
> |
long startTime = System.nanoTime(); |
626 |
> |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
627 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
628 |
> |
checkEmpty(q); |
629 |
> |
}}); |
630 |
> |
|
631 |
> |
executor.execute(new CheckedRunnable() { |
632 |
> |
public void realRun() throws InterruptedException { |
633 |
> |
threadsStarted.await(); |
634 |
|
q.put(one); |
635 |
< |
} catch (InterruptedException e) { |
761 |
< |
threadUnexpectedException(); |
762 |
< |
} |
763 |
< |
} |
764 |
< |
}); |
765 |
< |
|
766 |
< |
joinPool(executor); |
767 |
< |
} |
768 |
< |
|
769 |
< |
/** |
770 |
< |
* A deserialized serialized queue has same elements in same order |
771 |
< |
*/ |
772 |
< |
public void testSerialization() { |
773 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
774 |
< |
|
775 |
< |
try { |
776 |
< |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
777 |
< |
ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout)); |
778 |
< |
out.writeObject(q); |
779 |
< |
out.close(); |
780 |
< |
|
781 |
< |
ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray()); |
782 |
< |
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); |
783 |
< |
LinkedTransferQueue r = (LinkedTransferQueue) in.readObject(); |
784 |
< |
|
785 |
< |
assertEquals(q.size(), r.size()); |
786 |
< |
while (!q.isEmpty()) { |
787 |
< |
assertEquals(q.remove(), r.remove()); |
788 |
< |
} |
789 |
< |
} catch (Exception e) { |
790 |
< |
unexpectedException(); |
635 |
> |
}}); |
636 |
|
} |
637 |
|
} |
638 |
|
|
639 |
|
/** |
640 |
< |
* drainTo(null) throws NPE |
796 |
< |
*/ |
797 |
< |
public void testDrainToNull() { |
798 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
799 |
< |
try { |
800 |
< |
q.drainTo(null); |
801 |
< |
shouldThrow(); |
802 |
< |
} catch (NullPointerException success) { |
803 |
< |
} |
804 |
< |
} |
805 |
< |
|
806 |
< |
/** |
807 |
< |
* drainTo(this) throws IAE |
640 |
> |
* A deserialized serialized queue has same elements in same order |
641 |
|
*/ |
642 |
< |
public void testDrainToSelf() { |
643 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
644 |
< |
try { |
645 |
< |
q.drainTo(q); |
646 |
< |
shouldThrow(); |
647 |
< |
} catch (IllegalArgumentException success) { |
642 |
> |
public void testSerialization() throws Exception { |
643 |
> |
Queue x = populatedQueue(SIZE); |
644 |
> |
Queue y = serialClone(x); |
645 |
> |
|
646 |
> |
assertNotSame(y, x); |
647 |
> |
assertEquals(x.size(), y.size()); |
648 |
> |
assertEquals(x.toString(), y.toString()); |
649 |
> |
assertTrue(Arrays.equals(x.toArray(), y.toArray())); |
650 |
> |
while (!x.isEmpty()) { |
651 |
> |
assertFalse(y.isEmpty()); |
652 |
> |
assertEquals(x.remove(), y.remove()); |
653 |
|
} |
654 |
+ |
assertTrue(y.isEmpty()); |
655 |
|
} |
656 |
|
|
657 |
|
/** |
661 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
662 |
|
ArrayList l = new ArrayList(); |
663 |
|
q.drainTo(l); |
664 |
< |
assertEquals(q.size(), 0); |
665 |
< |
assertEquals(l.size(), SIZE); |
664 |
> |
assertEquals(0, q.size()); |
665 |
> |
assertEquals(SIZE, l.size()); |
666 |
|
for (int i = 0; i < SIZE; ++i) { |
667 |
< |
assertEquals(l.get(i), new Integer(i)); |
667 |
> |
assertEquals(i, l.get(i)); |
668 |
|
} |
669 |
|
q.add(zero); |
670 |
|
q.add(one); |
673 |
|
assertTrue(q.contains(one)); |
674 |
|
l.clear(); |
675 |
|
q.drainTo(l); |
676 |
< |
assertEquals(q.size(), 0); |
677 |
< |
assertEquals(l.size(), 2); |
676 |
> |
assertEquals(0, q.size()); |
677 |
> |
assertEquals(2, l.size()); |
678 |
|
for (int i = 0; i < 2; ++i) { |
679 |
< |
assertEquals(l.get(i), new Integer(i)); |
679 |
> |
assertEquals(i, l.get(i)); |
680 |
|
} |
681 |
|
} |
682 |
|
|
683 |
|
/** |
684 |
< |
* drainTo empties full queue, unblocking a waiting put. |
684 |
> |
* drainTo(c) empties full queue, unblocking a waiting put. |
685 |
|
*/ |
686 |
< |
public void testDrainToWithActivePut() { |
686 |
> |
public void testDrainToWithActivePut() throws InterruptedException { |
687 |
|
final LinkedTransferQueue q = populatedQueue(SIZE); |
688 |
< |
Thread t = new Thread(new Runnable() { |
689 |
< |
|
690 |
< |
public void run() { |
691 |
< |
try { |
692 |
< |
q.put(new Integer(SIZE + 1)); |
693 |
< |
} catch (Exception ie) { |
694 |
< |
threadUnexpectedException(); |
695 |
< |
} |
696 |
< |
} |
697 |
< |
}); |
698 |
< |
try { |
860 |
< |
t.start(); |
861 |
< |
ArrayList l = new ArrayList(); |
862 |
< |
q.drainTo(l); |
863 |
< |
assertTrue(l.size() >= SIZE); |
864 |
< |
for (int i = 0; i < SIZE; ++i) { |
865 |
< |
assertEquals(l.get(i), new Integer(i)); |
866 |
< |
} |
867 |
< |
t.join(); |
868 |
< |
assertTrue(q.size() + l.size() >= SIZE); |
869 |
< |
} catch (Exception e) { |
870 |
< |
unexpectedException(); |
871 |
< |
} |
872 |
< |
} |
873 |
< |
|
874 |
< |
/** |
875 |
< |
* drainTo(null, n) throws NPE |
876 |
< |
*/ |
877 |
< |
public void testDrainToNullN() { |
878 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
879 |
< |
try { |
880 |
< |
q.drainTo(null, 0); |
881 |
< |
shouldThrow(); |
882 |
< |
} catch (NullPointerException success) { |
883 |
< |
} |
884 |
< |
} |
885 |
< |
|
886 |
< |
/** |
887 |
< |
* drainTo(this, n) throws IAE |
888 |
< |
*/ |
889 |
< |
public void testDrainToSelfN() { |
890 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
891 |
< |
try { |
892 |
< |
q.drainTo(q, 0); |
893 |
< |
shouldThrow(); |
894 |
< |
} catch (IllegalArgumentException success) { |
895 |
< |
} |
688 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
689 |
> |
public void realRun() { |
690 |
> |
q.put(SIZE + 1); |
691 |
> |
}}); |
692 |
> |
ArrayList l = new ArrayList(); |
693 |
> |
q.drainTo(l); |
694 |
> |
assertTrue(l.size() >= SIZE); |
695 |
> |
for (int i = 0; i < SIZE; ++i) |
696 |
> |
assertEquals(i, l.get(i)); |
697 |
> |
awaitTermination(t); |
698 |
> |
assertTrue(q.size() + l.size() >= SIZE); |
699 |
|
} |
700 |
|
|
701 |
|
/** |
702 |
< |
* drainTo(c, n) empties first max {n, size} elements of queue into c |
702 |
> |
* drainTo(c, n) empties first min(n, size) elements of queue into c |
703 |
|
*/ |
704 |
|
public void testDrainToN() { |
705 |
|
LinkedTransferQueue q = new LinkedTransferQueue(); |
706 |
|
for (int i = 0; i < SIZE + 2; ++i) { |
707 |
|
for (int j = 0; j < SIZE; j++) { |
708 |
< |
assertTrue(q.offer(new Integer(j))); |
708 |
> |
assertTrue(q.offer(j)); |
709 |
|
} |
710 |
|
ArrayList l = new ArrayList(); |
711 |
|
q.drainTo(l, i); |
712 |
|
int k = (i < SIZE) ? i : SIZE; |
713 |
< |
assertEquals(l.size(), k); |
714 |
< |
assertEquals(q.size(), SIZE - k); |
715 |
< |
for (int j = 0; j < k; ++j) { |
716 |
< |
assertEquals(l.get(j), new Integer(j)); |
717 |
< |
} |
915 |
< |
while (q.poll() != null); |
713 |
> |
assertEquals(k, l.size()); |
714 |
> |
assertEquals(SIZE - k, q.size()); |
715 |
> |
for (int j = 0; j < k; ++j) |
716 |
> |
assertEquals(j, l.get(j)); |
717 |
> |
do {} while (q.poll() != null); |
718 |
|
} |
719 |
|
} |
720 |
|
|
721 |
< |
/* |
722 |
< |
* poll and take should decrement the waiting consumer count |
721 |
> |
/** |
722 |
> |
* timed poll() or take() increments the waiting consumer count; |
723 |
> |
* offer(e) decrements the waiting consumer count |
724 |
|
*/ |
725 |
< |
public void testWaitingConsumer() { |
726 |
< |
try { |
727 |
< |
final LinkedTransferQueue q = new LinkedTransferQueue(); |
728 |
< |
final ConsumerObserver waiting = new ConsumerObserver(); |
729 |
< |
new Thread(new Runnable() { |
927 |
< |
|
928 |
< |
public void run() { |
929 |
< |
try { |
930 |
< |
threadAssertTrue(q.hasWaitingConsumer()); |
931 |
< |
waiting.setWaitingConsumer(q.getWaitingConsumerCount()); |
932 |
< |
threadAssertTrue(q.offer(new Object())); |
933 |
< |
} catch (Exception ex) { |
934 |
< |
threadUnexpectedException(); |
935 |
< |
} |
725 |
> |
public void testWaitingConsumer() throws InterruptedException { |
726 |
> |
final LinkedTransferQueue q = new LinkedTransferQueue(); |
727 |
> |
assertEquals(0, q.getWaitingConsumerCount()); |
728 |
> |
assertFalse(q.hasWaitingConsumer()); |
729 |
> |
final CountDownLatch threadStarted = new CountDownLatch(1); |
730 |
|
|
731 |
< |
} |
732 |
< |
}).start(); |
733 |
< |
assertTrue(q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS) != null); |
734 |
< |
assertTrue(q.getWaitingConsumerCount() < waiting.getWaitingConsumers()); |
735 |
< |
} catch (Exception ex) { |
736 |
< |
this.unexpectedException(); |
737 |
< |
} |
731 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
732 |
> |
public void realRun() throws InterruptedException { |
733 |
> |
threadStarted.countDown(); |
734 |
> |
long startTime = System.nanoTime(); |
735 |
> |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
736 |
> |
assertEquals(0, q.getWaitingConsumerCount()); |
737 |
> |
assertFalse(q.hasWaitingConsumer()); |
738 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
739 |
> |
}}); |
740 |
> |
|
741 |
> |
threadStarted.await(); |
742 |
> |
waitForThreadToEnterWaitState(t); |
743 |
> |
assertEquals(1, q.getWaitingConsumerCount()); |
744 |
> |
assertTrue(q.hasWaitingConsumer()); |
745 |
> |
|
746 |
> |
assertTrue(q.offer(one)); |
747 |
> |
assertEquals(0, q.getWaitingConsumerCount()); |
748 |
> |
assertFalse(q.hasWaitingConsumer()); |
749 |
> |
|
750 |
> |
awaitTermination(t); |
751 |
|
} |
945 |
– |
/* |
946 |
– |
* Inserts null into transfer throws NPE |
947 |
– |
*/ |
752 |
|
|
753 |
< |
public void testTransfer1() { |
753 |
> |
/** |
754 |
> |
* transfer(null) throws NullPointerException |
755 |
> |
*/ |
756 |
> |
public void testTransfer1() throws InterruptedException { |
757 |
|
try { |
758 |
|
LinkedTransferQueue q = new LinkedTransferQueue(); |
759 |
|
q.transfer(null); |
760 |
|
shouldThrow(); |
761 |
< |
} catch (NullPointerException ex) { |
955 |
< |
} catch (Exception ex) { |
956 |
< |
this.unexpectedException(); |
957 |
< |
} |
761 |
> |
} catch (NullPointerException success) {} |
762 |
|
} |
763 |
|
|
764 |
< |
/* |
765 |
< |
* transfer attempts to insert into the queue then wait until that |
766 |
< |
* object is removed via take or poll. |
764 |
> |
/** |
765 |
> |
* transfer waits until a poll occurs. The transfered element |
766 |
> |
* is returned by this associated poll. |
767 |
|
*/ |
768 |
< |
public void testTransfer2() { |
769 |
< |
final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>(); |
770 |
< |
new Thread(new Runnable() { |
768 |
> |
public void testTransfer2() throws InterruptedException { |
769 |
> |
final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
770 |
> |
final CountDownLatch threadStarted = new CountDownLatch(1); |
771 |
|
|
772 |
< |
public void run() { |
773 |
< |
try { |
774 |
< |
q.transfer(new Integer(SIZE)); |
775 |
< |
threadAssertTrue(q.isEmpty()); |
776 |
< |
} catch (Exception ex) { |
777 |
< |
threadUnexpectedException(); |
974 |
< |
} |
975 |
< |
} |
976 |
< |
}).start(); |
772 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
773 |
> |
public void realRun() throws InterruptedException { |
774 |
> |
threadStarted.countDown(); |
775 |
> |
q.transfer(five); |
776 |
> |
checkEmpty(q); |
777 |
> |
}}); |
778 |
|
|
779 |
< |
try { |
780 |
< |
Thread.sleep(SHORT_DELAY_MS); |
781 |
< |
assertEquals(1, q.size()); |
782 |
< |
q.poll(); |
783 |
< |
assertTrue(q.isEmpty()); |
784 |
< |
} catch (Exception ex) { |
785 |
< |
this.unexpectedException(); |
786 |
< |
} |
787 |
< |
} |
788 |
< |
/* |
789 |
< |
* transfer will attempt to transfer in fifo order and continue waiting if |
790 |
< |
* the element being transfered is not polled or taken |
791 |
< |
*/ |
792 |
< |
|
793 |
< |
public void testTransfer3() { |
794 |
< |
final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>(); |
795 |
< |
new Thread(new Runnable() { |
796 |
< |
public void run() { |
797 |
< |
try { |
798 |
< |
Integer i; |
799 |
< |
q.transfer((i = new Integer(SIZE + 1))); |
800 |
< |
threadAssertTrue(!q.contains(i)); |
801 |
< |
threadAssertEquals(1, q.size()); |
802 |
< |
} catch (Exception ex) { |
803 |
< |
threadUnexpectedException(); |
804 |
< |
} |
805 |
< |
} |
806 |
< |
}).start(); |
807 |
< |
Thread interruptedThread = |
808 |
< |
new Thread(new Runnable() { |
809 |
< |
public void run() { |
810 |
< |
try { |
811 |
< |
q.transfer(new Integer(SIZE)); |
812 |
< |
threadShouldThrow(); |
813 |
< |
} catch (InterruptedException ex) { |
814 |
< |
} |
815 |
< |
} |
816 |
< |
}); |
1016 |
< |
interruptedThread.start(); |
1017 |
< |
try { |
1018 |
< |
Thread.sleep(LONG_DELAY_MS); |
1019 |
< |
assertEquals(2, q.size()); |
1020 |
< |
q.poll(); |
1021 |
< |
Thread.sleep(LONG_DELAY_MS); |
1022 |
< |
interruptedThread.interrupt(); |
1023 |
< |
assertEquals(1, q.size()); |
1024 |
< |
} catch (Exception ex) { |
1025 |
< |
this.unexpectedException(); |
1026 |
< |
} |
779 |
> |
threadStarted.await(); |
780 |
> |
waitForThreadToEnterWaitState(t); |
781 |
> |
assertEquals(1, q.size()); |
782 |
> |
assertSame(five, q.poll()); |
783 |
> |
checkEmpty(q); |
784 |
> |
awaitTermination(t); |
785 |
> |
} |
786 |
> |
|
787 |
> |
/** |
788 |
> |
* transfer waits until a poll occurs, and then transfers in fifo order |
789 |
> |
*/ |
790 |
> |
public void testTransfer3() throws InterruptedException { |
791 |
> |
final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
792 |
> |
|
793 |
> |
Thread first = newStartedThread(new CheckedRunnable() { |
794 |
> |
public void realRun() throws InterruptedException { |
795 |
> |
q.transfer(four); |
796 |
> |
assertTrue(!q.contains(four)); |
797 |
> |
assertEquals(1, q.size()); |
798 |
> |
}}); |
799 |
> |
|
800 |
> |
Thread interruptedThread = newStartedThread( |
801 |
> |
new CheckedInterruptedRunnable() { |
802 |
> |
public void realRun() throws InterruptedException { |
803 |
> |
while (q.isEmpty()) |
804 |
> |
Thread.yield(); |
805 |
> |
q.transfer(five); |
806 |
> |
}}); |
807 |
> |
|
808 |
> |
while (q.size() < 2) |
809 |
> |
Thread.yield(); |
810 |
> |
assertEquals(2, q.size()); |
811 |
> |
assertSame(four, q.poll()); |
812 |
> |
first.join(); |
813 |
> |
assertEquals(1, q.size()); |
814 |
> |
interruptedThread.interrupt(); |
815 |
> |
interruptedThread.join(); |
816 |
> |
checkEmpty(q); |
817 |
|
} |
818 |
|
|
819 |
|
/** |
820 |
< |
* transfer will wait as long as a poll or take occurs if one does occur |
821 |
< |
* the waiting is finished and the thread that tries to poll/take |
1032 |
< |
* wins in retrieving the element |
820 |
> |
* transfer waits until a poll occurs, at which point the polling |
821 |
> |
* thread returns the element |
822 |
|
*/ |
823 |
< |
public void testTransfer4() { |
823 |
> |
public void testTransfer4() throws InterruptedException { |
824 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
1036 |
– |
new Thread(new Runnable() { |
825 |
|
|
826 |
< |
public void run() { |
827 |
< |
try { |
828 |
< |
q.transfer(new Integer(four)); |
829 |
< |
threadAssertFalse(q.contains(new Integer(four))); |
830 |
< |
threadAssertEquals(new Integer(three), q.poll()); |
831 |
< |
} catch (Exception ex) { |
832 |
< |
threadUnexpectedException(); |
833 |
< |
} |
834 |
< |
} |
835 |
< |
}).start(); |
836 |
< |
try { |
837 |
< |
Thread.sleep(MEDIUM_DELAY_MS); |
838 |
< |
assertTrue(q.offer(three)); |
839 |
< |
assertEquals(new Integer(four), q.poll()); |
1052 |
< |
} catch (Exception ex) { |
1053 |
< |
this.unexpectedException(); |
1054 |
< |
} |
826 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
827 |
> |
public void realRun() throws InterruptedException { |
828 |
> |
q.transfer(four); |
829 |
> |
assertFalse(q.contains(four)); |
830 |
> |
assertSame(three, q.poll()); |
831 |
> |
}}); |
832 |
> |
|
833 |
> |
while (q.isEmpty()) |
834 |
> |
Thread.yield(); |
835 |
> |
assertFalse(q.isEmpty()); |
836 |
> |
assertEquals(1, q.size()); |
837 |
> |
assertTrue(q.offer(three)); |
838 |
> |
assertSame(four, q.poll()); |
839 |
> |
awaitTermination(t); |
840 |
|
} |
841 |
< |
/* |
842 |
< |
* Insert null into trTransfer throws NPE |
841 |
> |
|
842 |
> |
/** |
843 |
> |
* transfer waits until a take occurs. The transfered element |
844 |
> |
* is returned by this associated take. |
845 |
|
*/ |
846 |
+ |
public void testTransfer5() throws InterruptedException { |
847 |
+ |
final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
848 |
|
|
849 |
+ |
Thread t = newStartedThread(new CheckedRunnable() { |
850 |
+ |
public void realRun() throws InterruptedException { |
851 |
+ |
q.transfer(four); |
852 |
+ |
checkEmpty(q); |
853 |
+ |
}}); |
854 |
+ |
|
855 |
+ |
while (q.isEmpty()) |
856 |
+ |
Thread.yield(); |
857 |
+ |
assertFalse(q.isEmpty()); |
858 |
+ |
assertEquals(1, q.size()); |
859 |
+ |
assertSame(four, q.take()); |
860 |
+ |
checkEmpty(q); |
861 |
+ |
awaitTermination(t); |
862 |
+ |
} |
863 |
+ |
|
864 |
+ |
/** |
865 |
+ |
* tryTransfer(null) throws NullPointerException |
866 |
+ |
*/ |
867 |
|
public void testTryTransfer1() { |
868 |
+ |
final LinkedTransferQueue q = new LinkedTransferQueue(); |
869 |
|
try { |
1062 |
– |
final LinkedTransferQueue q = new LinkedTransferQueue(); |
870 |
|
q.tryTransfer(null); |
871 |
< |
this.shouldThrow(); |
872 |
< |
} catch (NullPointerException ex) { |
1066 |
< |
} catch (Exception ex) { |
1067 |
< |
this.unexpectedException(); |
1068 |
< |
} |
871 |
> |
shouldThrow(); |
872 |
> |
} catch (NullPointerException success) {} |
873 |
|
} |
1070 |
– |
/* |
1071 |
– |
* tryTransfer returns false and does not enqueue if there are no consumers |
1072 |
– |
* waiting to poll or take. |
1073 |
– |
*/ |
874 |
|
|
875 |
< |
public void testTryTransfer2() { |
876 |
< |
try { |
877 |
< |
final LinkedTransferQueue q = new LinkedTransferQueue(); |
878 |
< |
assertFalse(q.tryTransfer(new Object())); |
879 |
< |
assertEquals(0, q.size()); |
880 |
< |
} catch (Exception ex) { |
881 |
< |
this.unexpectedException(); |
882 |
< |
} |
875 |
> |
/** |
876 |
> |
* tryTransfer returns false and does not enqueue if there are no |
877 |
> |
* consumers waiting to poll or take. |
878 |
> |
*/ |
879 |
> |
public void testTryTransfer2() throws InterruptedException { |
880 |
> |
final LinkedTransferQueue q = new LinkedTransferQueue(); |
881 |
> |
assertFalse(q.tryTransfer(new Object())); |
882 |
> |
assertFalse(q.hasWaitingConsumer()); |
883 |
> |
checkEmpty(q); |
884 |
|
} |
885 |
< |
/* |
886 |
< |
* if there is a consumer waiting poll or take tryTransfer returns |
887 |
< |
* true while enqueueing object |
885 |
> |
|
886 |
> |
/** |
887 |
> |
* If there is a consumer waiting in timed poll, tryTransfer |
888 |
> |
* returns true while successfully transfering object. |
889 |
|
*/ |
890 |
+ |
public void testTryTransfer3() throws InterruptedException { |
891 |
+ |
final Object hotPotato = new Object(); |
892 |
+ |
final LinkedTransferQueue q = new LinkedTransferQueue(); |
893 |
|
|
894 |
< |
public void testTryTransfer3() { |
895 |
< |
try { |
896 |
< |
final LinkedTransferQueue q = new LinkedTransferQueue(); |
897 |
< |
new Thread(new Runnable() { |
894 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
895 |
> |
public void realRun() { |
896 |
> |
while (! q.hasWaitingConsumer()) |
897 |
> |
Thread.yield(); |
898 |
> |
assertTrue(q.hasWaitingConsumer()); |
899 |
> |
checkEmpty(q); |
900 |
> |
assertTrue(q.tryTransfer(hotPotato)); |
901 |
> |
}}); |
902 |
> |
|
903 |
> |
long startTime = System.nanoTime(); |
904 |
> |
assertSame(hotPotato, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
905 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
906 |
> |
checkEmpty(q); |
907 |
> |
awaitTermination(t); |
908 |
> |
} |
909 |
> |
|
910 |
> |
/** |
911 |
> |
* If there is a consumer waiting in take, tryTransfer returns |
912 |
> |
* true while successfully transfering object. |
913 |
> |
*/ |
914 |
> |
public void testTryTransfer4() throws InterruptedException { |
915 |
> |
final Object hotPotato = new Object(); |
916 |
> |
final LinkedTransferQueue q = new LinkedTransferQueue(); |
917 |
|
|
918 |
< |
public void run() { |
919 |
< |
try { |
920 |
< |
threadAssertTrue(q.hasWaitingConsumer()); |
921 |
< |
threadAssertTrue(q.tryTransfer(new Object())); |
922 |
< |
} catch (Exception ex) { |
923 |
< |
threadUnexpectedException(); |
924 |
< |
} |
918 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
919 |
> |
public void realRun() { |
920 |
> |
while (! q.hasWaitingConsumer()) |
921 |
> |
Thread.yield(); |
922 |
> |
assertTrue(q.hasWaitingConsumer()); |
923 |
> |
checkEmpty(q); |
924 |
> |
assertTrue(q.tryTransfer(hotPotato)); |
925 |
> |
}}); |
926 |
|
|
927 |
< |
} |
928 |
< |
}).start(); |
929 |
< |
assertTrue(q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS) != null); |
1105 |
< |
assertTrue(q.isEmpty()); |
1106 |
< |
} catch (Exception ex) { |
1107 |
< |
this.unexpectedException(); |
1108 |
< |
} |
927 |
> |
assertSame(q.take(), hotPotato); |
928 |
> |
checkEmpty(q); |
929 |
> |
awaitTermination(t); |
930 |
|
} |
931 |
|
|
932 |
< |
/* |
933 |
< |
* tryTransfer waits the amount given if interrupted, show an |
1113 |
< |
* interrupted exception |
932 |
> |
/** |
933 |
> |
* tryTransfer blocks interruptibly if no takers |
934 |
|
*/ |
935 |
< |
public void testTryTransfer4() { |
935 |
> |
public void testTryTransfer5() throws InterruptedException { |
936 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
937 |
< |
Thread toInterrupt = new Thread(new Runnable() { |
937 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
938 |
> |
assertTrue(q.isEmpty()); |
939 |
|
|
940 |
< |
public void run() { |
940 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
941 |
> |
public void realRun() throws InterruptedException { |
942 |
> |
long startTime = System.nanoTime(); |
943 |
> |
Thread.currentThread().interrupt(); |
944 |
|
try { |
945 |
< |
q.tryTransfer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS); |
946 |
< |
threadShouldThrow(); |
947 |
< |
} catch (InterruptedException ex) { |
948 |
< |
} |
949 |
< |
} |
950 |
< |
}); |
951 |
< |
try { |
952 |
< |
toInterrupt.start(); |
953 |
< |
Thread.sleep(SMALL_DELAY_MS); |
954 |
< |
toInterrupt.interrupt(); |
955 |
< |
} catch (Exception ex) { |
956 |
< |
this.unexpectedException(); |
957 |
< |
} |
945 |
> |
q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS); |
946 |
> |
shouldThrow(); |
947 |
> |
} catch (InterruptedException success) {} |
948 |
> |
assertFalse(Thread.interrupted()); |
949 |
> |
|
950 |
> |
pleaseInterrupt.countDown(); |
951 |
> |
try { |
952 |
> |
q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS); |
953 |
> |
shouldThrow(); |
954 |
> |
} catch (InterruptedException success) {} |
955 |
> |
assertFalse(Thread.interrupted()); |
956 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
957 |
> |
}}); |
958 |
> |
|
959 |
> |
await(pleaseInterrupt); |
960 |
> |
assertThreadStaysAlive(t); |
961 |
> |
t.interrupt(); |
962 |
> |
awaitTermination(t); |
963 |
> |
checkEmpty(q); |
964 |
|
} |
965 |
|
|
966 |
< |
/* |
967 |
< |
* tryTransfer gives up after the timeout and return false |
966 |
> |
/** |
967 |
> |
* tryTransfer gives up after the timeout and returns false |
968 |
|
*/ |
969 |
< |
public void testTryTransfer5() { |
969 |
> |
public void testTryTransfer6() throws InterruptedException { |
970 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
1141 |
– |
try { |
1142 |
– |
new Thread(new Runnable() { |
971 |
|
|
972 |
< |
public void run() { |
973 |
< |
try { |
974 |
< |
threadAssertFalse(q.tryTransfer(new Object(), SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
975 |
< |
} catch (InterruptedException ex) { |
976 |
< |
threadUnexpectedException(); |
977 |
< |
} |
978 |
< |
} |
979 |
< |
}).start(); |
980 |
< |
Thread.sleep(LONG_DELAY_MS); |
981 |
< |
assertTrue(q.isEmpty()); |
982 |
< |
} catch (Exception ex) { |
1155 |
< |
this.unexpectedException(); |
1156 |
< |
} |
972 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
973 |
> |
public void realRun() throws InterruptedException { |
974 |
> |
long startTime = System.nanoTime(); |
975 |
> |
assertFalse(q.tryTransfer(new Object(), |
976 |
> |
timeoutMillis(), MILLISECONDS)); |
977 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
978 |
> |
checkEmpty(q); |
979 |
> |
}}); |
980 |
> |
|
981 |
> |
awaitTermination(t); |
982 |
> |
checkEmpty(q); |
983 |
|
} |
984 |
|
|
985 |
< |
/* |
985 |
> |
/** |
986 |
|
* tryTransfer waits for any elements previously in to be removed |
987 |
|
* before transfering to a poll or take |
988 |
|
*/ |
989 |
< |
public void testTryTransfer6() { |
989 |
> |
public void testTryTransfer7() throws InterruptedException { |
990 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
991 |
< |
q.offer(new Integer(four)); |
1166 |
< |
new Thread(new Runnable() { |
991 |
> |
assertTrue(q.offer(four)); |
992 |
|
|
993 |
< |
public void run() { |
994 |
< |
try { |
995 |
< |
threadAssertTrue(q.tryTransfer(new Integer(five), LONG_DELAY_MS, TimeUnit.MILLISECONDS)); |
996 |
< |
threadAssertTrue(q.isEmpty()); |
997 |
< |
} catch (InterruptedException ex) { |
998 |
< |
threadUnexpectedException(); |
999 |
< |
} |
1000 |
< |
} |
1001 |
< |
}).start(); |
1002 |
< |
try { |
1003 |
< |
Thread.sleep(SHORT_DELAY_MS); |
1004 |
< |
assertEquals(2, q.size()); |
1005 |
< |
assertEquals(new Integer(four), q.poll()); |
1006 |
< |
assertEquals(new Integer(five), q.poll()); |
1007 |
< |
assertTrue(q.isEmpty()); |
1183 |
< |
} catch (Exception ex) { |
1184 |
< |
this.unexpectedException(); |
1185 |
< |
} |
993 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
994 |
> |
public void realRun() throws InterruptedException { |
995 |
> |
long startTime = System.nanoTime(); |
996 |
> |
assertTrue(q.tryTransfer(five, LONG_DELAY_MS, MILLISECONDS)); |
997 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
998 |
> |
checkEmpty(q); |
999 |
> |
}}); |
1000 |
> |
|
1001 |
> |
while (q.size() != 2) |
1002 |
> |
Thread.yield(); |
1003 |
> |
assertEquals(2, q.size()); |
1004 |
> |
assertSame(four, q.poll()); |
1005 |
> |
assertSame(five, q.poll()); |
1006 |
> |
checkEmpty(q); |
1007 |
> |
awaitTermination(t); |
1008 |
|
} |
1009 |
|
|
1010 |
< |
/* |
1011 |
< |
* tryTransfer attempts to enqueue into the q and fails returning false not |
1012 |
< |
* enqueueing and the successing poll is null |
1010 |
> |
/** |
1011 |
> |
* tryTransfer attempts to enqueue into the queue and fails |
1012 |
> |
* returning false not enqueueing and the successive poll is null |
1013 |
|
*/ |
1014 |
< |
public void testTryTransfer7() { |
1014 |
> |
public void testTryTransfer8() throws InterruptedException { |
1015 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
1016 |
< |
q.offer(new Integer(four)); |
1017 |
< |
new Thread(new Runnable() { |
1018 |
< |
|
1019 |
< |
public void run() { |
1020 |
< |
try { |
1021 |
< |
threadAssertFalse(q.tryTransfer(new Integer(five), SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
1022 |
< |
threadAssertTrue(q.isEmpty()); |
1023 |
< |
} catch (InterruptedException ex) { |
1024 |
< |
threadUnexpectedException(); |
1203 |
< |
} |
1204 |
< |
} |
1205 |
< |
}).start(); |
1206 |
< |
try { |
1207 |
< |
assertEquals(1, q.size()); |
1208 |
< |
assertEquals(new Integer(four), q.poll()); |
1209 |
< |
Thread.sleep(MEDIUM_DELAY_MS); |
1210 |
< |
assertNull(q.poll()); |
1211 |
< |
} catch (Exception ex) { |
1212 |
< |
this.unexpectedException(); |
1213 |
< |
} |
1016 |
> |
assertTrue(q.offer(four)); |
1017 |
> |
assertEquals(1, q.size()); |
1018 |
> |
long startTime = System.nanoTime(); |
1019 |
> |
assertFalse(q.tryTransfer(five, timeoutMillis(), MILLISECONDS)); |
1020 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
1021 |
> |
assertEquals(1, q.size()); |
1022 |
> |
assertSame(four, q.poll()); |
1023 |
> |
assertNull(q.poll()); |
1024 |
> |
checkEmpty(q); |
1025 |
|
} |
1026 |
|
|
1027 |
< |
private LinkedTransferQueue populatedQueue( |
1028 |
< |
int n) { |
1029 |
< |
LinkedTransferQueue q = new LinkedTransferQueue(); |
1030 |
< |
assertTrue(q.isEmpty()); |
1031 |
< |
int remainingCapacity = q.remainingCapacity(); |
1221 |
< |
for (int i = 0; i < |
1222 |
< |
n; i++) { |
1027 |
> |
private LinkedTransferQueue<Integer> populatedQueue(int n) { |
1028 |
> |
LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
1029 |
> |
checkEmpty(q); |
1030 |
> |
for (int i = 0; i < n; i++) { |
1031 |
> |
assertEquals(i, q.size()); |
1032 |
|
assertTrue(q.offer(i)); |
1033 |
+ |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
1034 |
|
} |
1225 |
– |
|
1035 |
|
assertFalse(q.isEmpty()); |
1227 |
– |
assertEquals(remainingCapacity, q.remainingCapacity()); |
1228 |
– |
assertEquals(n, q.size()); |
1036 |
|
return q; |
1037 |
|
} |
1038 |
|
|
1039 |
< |
private static class ConsumerObserver { |
1040 |
< |
|
1041 |
< |
private int waitingConsumers; |
1042 |
< |
|
1043 |
< |
private ConsumerObserver() { |
1044 |
< |
} |
1045 |
< |
|
1046 |
< |
private void setWaitingConsumer(int i) { |
1047 |
< |
this.waitingConsumers = i; |
1048 |
< |
} |
1049 |
< |
|
1050 |
< |
private int getWaitingConsumers() { |
1244 |
< |
return waitingConsumers; |
1039 |
> |
/** |
1040 |
> |
* remove(null), contains(null) always return false |
1041 |
> |
*/ |
1042 |
> |
public void testNeverContainsNull() { |
1043 |
> |
Collection<?>[] qs = { |
1044 |
> |
new LinkedTransferQueue<Object>(), |
1045 |
> |
populatedQueue(2), |
1046 |
> |
}; |
1047 |
> |
|
1048 |
> |
for (Collection<?> q : qs) { |
1049 |
> |
assertFalse(q.contains(null)); |
1050 |
> |
assertFalse(q.remove(null)); |
1051 |
|
} |
1052 |
|
} |
1053 |
|
} |