1 |
|
/* |
2 |
< |
* Written by members of JCP JSR-166 Expert Group and released to the |
3 |
< |
* public domain. Use, modify, and redistribute this code in any way |
4 |
< |
* without acknowledgement. Other contributors include Andrew Wright, |
5 |
< |
* Jeffrey Hayes, Pat Fischer, Mike Judd. |
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/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.*; |
12 |
< |
import java.io.*; |
9 |
> |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
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.Queue; |
17 |
> |
import java.util.concurrent.ArrayBlockingQueue; |
18 |
> |
import java.util.concurrent.BlockingQueue; |
19 |
> |
import java.util.concurrent.CountDownLatch; |
20 |
> |
import java.util.concurrent.Executors; |
21 |
> |
import java.util.concurrent.ExecutorService; |
22 |
> |
|
23 |
> |
import junit.framework.Test; |
24 |
|
|
25 |
|
public class ArrayBlockingQueueTest extends JSR166TestCase { |
26 |
|
|
27 |
+ |
public static class Fair extends BlockingQueueTest { |
28 |
+ |
protected BlockingQueue emptyCollection() { |
29 |
+ |
return new ArrayBlockingQueue(SIZE, true); |
30 |
+ |
} |
31 |
+ |
} |
32 |
+ |
|
33 |
+ |
public static class NonFair extends BlockingQueueTest { |
34 |
+ |
protected BlockingQueue emptyCollection() { |
35 |
+ |
return new ArrayBlockingQueue(SIZE, false); |
36 |
+ |
} |
37 |
+ |
} |
38 |
+ |
|
39 |
|
public static void main(String[] args) { |
40 |
< |
junit.textui.TestRunner.run (suite()); |
40 |
> |
main(suite(), args); |
41 |
|
} |
42 |
|
|
43 |
|
public static Test suite() { |
44 |
< |
return new TestSuite(ArrayBlockingQueueTest.class); |
44 |
> |
return newTestSuite(ArrayBlockingQueueTest.class, |
45 |
> |
new Fair().testSuite(), |
46 |
> |
new NonFair().testSuite()); |
47 |
|
} |
48 |
|
|
49 |
|
/** |
50 |
< |
* Create a queue of given size containing consecutive |
50 |
> |
* Returns a new queue of given size containing consecutive |
51 |
|
* Integers 0 ... n. |
52 |
|
*/ |
53 |
< |
private ArrayBlockingQueue populatedQueue(int n) { |
54 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(n); |
53 |
> |
private ArrayBlockingQueue<Integer> populatedQueue(int n) { |
54 |
> |
ArrayBlockingQueue<Integer> q = new ArrayBlockingQueue<Integer>(n); |
55 |
|
assertTrue(q.isEmpty()); |
56 |
< |
for(int i = 0; i < n; i++) |
57 |
< |
assertTrue(q.offer(new Integer(i))); |
56 |
> |
for (int i = 0; i < n; i++) |
57 |
> |
assertTrue(q.offer(new Integer(i))); |
58 |
|
assertFalse(q.isEmpty()); |
59 |
|
assertEquals(0, q.remainingCapacity()); |
60 |
< |
assertEquals(n, q.size()); |
60 |
> |
assertEquals(n, q.size()); |
61 |
|
return q; |
62 |
|
} |
63 |
< |
|
64 |
< |
public void testConstructor1(){ |
63 |
> |
|
64 |
> |
/** |
65 |
> |
* A new queue has the indicated capacity |
66 |
> |
*/ |
67 |
> |
public void testConstructor1() { |
68 |
|
assertEquals(SIZE, new ArrayBlockingQueue(SIZE).remainingCapacity()); |
69 |
|
} |
70 |
|
|
71 |
< |
public void testConstructor2(){ |
71 |
> |
/** |
72 |
> |
* Constructor throws IAE if capacity argument nonpositive |
73 |
> |
*/ |
74 |
> |
public void testConstructor2() { |
75 |
|
try { |
76 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(0); |
77 |
< |
fail("Cannot make zero-sized"); |
78 |
< |
} |
47 |
< |
catch (IllegalArgumentException success) {} |
76 |
> |
new ArrayBlockingQueue(0); |
77 |
> |
shouldThrow(); |
78 |
> |
} catch (IllegalArgumentException success) {} |
79 |
|
} |
80 |
|
|
81 |
< |
public void testConstructor3(){ |
82 |
< |
|
81 |
> |
/** |
82 |
> |
* Initializing from null Collection throws NPE |
83 |
> |
*/ |
84 |
> |
public void testConstructor3() { |
85 |
|
try { |
86 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(1, true, null); |
87 |
< |
fail("Cannot make from null collection"); |
88 |
< |
} |
56 |
< |
catch (NullPointerException success) {} |
86 |
> |
new ArrayBlockingQueue(1, true, null); |
87 |
> |
shouldThrow(); |
88 |
> |
} catch (NullPointerException success) {} |
89 |
|
} |
90 |
|
|
91 |
< |
public void testConstructor4(){ |
91 |
> |
/** |
92 |
> |
* Initializing from Collection of null elements throws NPE |
93 |
> |
*/ |
94 |
> |
public void testConstructor4() { |
95 |
> |
Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); |
96 |
|
try { |
97 |
< |
Integer[] ints = new Integer[SIZE]; |
98 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints)); |
99 |
< |
fail("Cannot make with null elements"); |
64 |
< |
} |
65 |
< |
catch (NullPointerException success) {} |
97 |
> |
new ArrayBlockingQueue(SIZE, false, elements); |
98 |
> |
shouldThrow(); |
99 |
> |
} catch (NullPointerException success) {} |
100 |
|
} |
101 |
|
|
102 |
< |
public void testConstructor5(){ |
103 |
< |
try { |
104 |
< |
Integer[] ints = new Integer[SIZE]; |
105 |
< |
for (int i = 0; i < SIZE-1; ++i) |
106 |
< |
ints[i] = new Integer(i); |
107 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints)); |
108 |
< |
fail("Cannot make with null elements"); |
109 |
< |
} |
110 |
< |
catch (NullPointerException success) {} |
102 |
> |
/** |
103 |
> |
* Initializing from Collection with some null elements throws NPE |
104 |
> |
*/ |
105 |
> |
public void testConstructor5() { |
106 |
> |
Integer[] ints = new Integer[SIZE]; |
107 |
> |
for (int i = 0; i < SIZE - 1; ++i) |
108 |
> |
ints[i] = i; |
109 |
> |
Collection<Integer> elements = Arrays.asList(ints); |
110 |
> |
try { |
111 |
> |
new ArrayBlockingQueue(SIZE, false, elements); |
112 |
> |
shouldThrow(); |
113 |
> |
} catch (NullPointerException success) {} |
114 |
|
} |
115 |
|
|
116 |
< |
public void testConstructor6(){ |
117 |
< |
try { |
118 |
< |
Integer[] ints = new Integer[SIZE]; |
119 |
< |
for (int i = 0; i < SIZE; ++i) |
120 |
< |
ints[i] = new Integer(i); |
121 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(1, false, Arrays.asList(ints)); |
122 |
< |
fail("Cannot make with insufficient capacity"); |
123 |
< |
} |
124 |
< |
catch (IllegalArgumentException success) {} |
116 |
> |
/** |
117 |
> |
* Initializing from too large collection throws IAE |
118 |
> |
*/ |
119 |
> |
public void testConstructor6() { |
120 |
> |
Integer[] ints = new Integer[SIZE]; |
121 |
> |
for (int i = 0; i < SIZE; ++i) |
122 |
> |
ints[i] = i; |
123 |
> |
Collection<Integer> elements = Arrays.asList(ints); |
124 |
> |
try { |
125 |
> |
new ArrayBlockingQueue(SIZE - 1, false, elements); |
126 |
> |
shouldThrow(); |
127 |
> |
} catch (IllegalArgumentException success) {} |
128 |
|
} |
129 |
|
|
130 |
< |
public void testConstructor7(){ |
131 |
< |
try { |
132 |
< |
Integer[] ints = new Integer[SIZE]; |
133 |
< |
for (int i = 0; i < SIZE; ++i) |
134 |
< |
ints[i] = new Integer(i); |
135 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, true, Arrays.asList(ints)); |
136 |
< |
for (int i = 0; i < SIZE; ++i) |
137 |
< |
assertEquals(ints[i], q.poll()); |
138 |
< |
} |
139 |
< |
finally {} |
130 |
> |
/** |
131 |
> |
* Queue contains all elements of collection used to initialize |
132 |
> |
*/ |
133 |
> |
public void testConstructor7() { |
134 |
> |
Integer[] ints = new Integer[SIZE]; |
135 |
> |
for (int i = 0; i < SIZE; ++i) |
136 |
> |
ints[i] = i; |
137 |
> |
Collection<Integer> elements = Arrays.asList(ints); |
138 |
> |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, true, elements); |
139 |
> |
for (int i = 0; i < SIZE; ++i) |
140 |
> |
assertEquals(ints[i], q.poll()); |
141 |
|
} |
142 |
|
|
143 |
+ |
/** |
144 |
+ |
* Queue transitions from empty to full when elements added |
145 |
+ |
*/ |
146 |
|
public void testEmptyFull() { |
147 |
|
ArrayBlockingQueue q = new ArrayBlockingQueue(2); |
148 |
|
assertTrue(q.isEmpty()); |
149 |
< |
assertEquals("should have room for 2", 2, q.remainingCapacity()); |
149 |
> |
assertEquals(2, q.remainingCapacity()); |
150 |
|
q.add(one); |
151 |
|
assertFalse(q.isEmpty()); |
152 |
|
q.add(two); |
153 |
|
assertFalse(q.isEmpty()); |
154 |
< |
assertEquals("queue should be full", 0, q.remainingCapacity()); |
155 |
< |
assertFalse("offer should be rejected", q.offer(three)); |
154 |
> |
assertEquals(0, q.remainingCapacity()); |
155 |
> |
assertFalse(q.offer(three)); |
156 |
|
} |
157 |
|
|
158 |
< |
public void testRemainingCapacity(){ |
159 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
158 |
> |
/** |
159 |
> |
* remainingCapacity decreases on add, increases on remove |
160 |
> |
*/ |
161 |
> |
public void testRemainingCapacity() { |
162 |
> |
BlockingQueue q = populatedQueue(SIZE); |
163 |
|
for (int i = 0; i < SIZE; ++i) { |
164 |
|
assertEquals(i, q.remainingCapacity()); |
165 |
< |
assertEquals(SIZE-i, q.size()); |
166 |
< |
q.remove(); |
165 |
> |
assertEquals(SIZE, q.size() + q.remainingCapacity()); |
166 |
> |
assertEquals(i, q.remove()); |
167 |
|
} |
168 |
|
for (int i = 0; i < SIZE; ++i) { |
169 |
< |
assertEquals(SIZE-i, q.remainingCapacity()); |
170 |
< |
assertEquals(i, q.size()); |
171 |
< |
q.add(new Integer(i)); |
169 |
> |
assertEquals(SIZE - i, q.remainingCapacity()); |
170 |
> |
assertEquals(SIZE, q.size() + q.remainingCapacity()); |
171 |
> |
assertTrue(q.add(i)); |
172 |
|
} |
173 |
|
} |
174 |
|
|
175 |
< |
public void testOfferNull(){ |
176 |
< |
try { |
177 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(1); |
178 |
< |
q.offer(null); |
132 |
< |
fail("should throw NPE"); |
133 |
< |
} catch (NullPointerException success) { } |
134 |
< |
} |
135 |
< |
|
136 |
< |
public void testOffer(){ |
175 |
> |
/** |
176 |
> |
* Offer succeeds if not full; fails if full |
177 |
> |
*/ |
178 |
> |
public void testOffer() { |
179 |
|
ArrayBlockingQueue q = new ArrayBlockingQueue(1); |
180 |
|
assertTrue(q.offer(zero)); |
181 |
|
assertFalse(q.offer(one)); |
182 |
|
} |
183 |
|
|
184 |
< |
public void testAdd(){ |
185 |
< |
try { |
186 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
187 |
< |
for (int i = 0; i < SIZE; ++i) { |
188 |
< |
assertTrue(q.add(new Integer(i))); |
189 |
< |
} |
190 |
< |
assertEquals(0, q.remainingCapacity()); |
184 |
> |
/** |
185 |
> |
* add succeeds if not full; throws ISE if full |
186 |
> |
*/ |
187 |
> |
public void testAdd() { |
188 |
> |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
189 |
> |
for (int i = 0; i < SIZE; ++i) { |
190 |
> |
assertTrue(q.add(new Integer(i))); |
191 |
> |
} |
192 |
> |
assertEquals(0, q.remainingCapacity()); |
193 |
> |
try { |
194 |
|
q.add(new Integer(SIZE)); |
195 |
< |
} catch (IllegalStateException success){ |
196 |
< |
} |
195 |
> |
shouldThrow(); |
196 |
> |
} catch (IllegalStateException success) {} |
197 |
|
} |
198 |
|
|
199 |
< |
public void testAddAll1(){ |
200 |
< |
try { |
201 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(1); |
202 |
< |
q.addAll(null); |
203 |
< |
fail("Cannot add null collection"); |
159 |
< |
} |
160 |
< |
catch (NullPointerException success) {} |
161 |
< |
} |
162 |
< |
public void testAddAll2(){ |
199 |
> |
/** |
200 |
> |
* addAll(this) throws IAE |
201 |
> |
*/ |
202 |
> |
public void testAddAllSelf() { |
203 |
> |
ArrayBlockingQueue q = populatedQueue(SIZE); |
204 |
|
try { |
205 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
206 |
< |
Integer[] ints = new Integer[SIZE]; |
207 |
< |
q.addAll(Arrays.asList(ints)); |
167 |
< |
fail("Cannot add null elements"); |
168 |
< |
} |
169 |
< |
catch (NullPointerException success) {} |
205 |
> |
q.addAll(q); |
206 |
> |
shouldThrow(); |
207 |
> |
} catch (IllegalArgumentException success) {} |
208 |
|
} |
209 |
< |
public void testAddAll3(){ |
209 |
> |
|
210 |
> |
/** |
211 |
> |
* addAll of a collection with any null elements throws NPE after |
212 |
> |
* possibly adding some elements |
213 |
> |
*/ |
214 |
> |
public void testAddAll3() { |
215 |
> |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
216 |
> |
Integer[] ints = new Integer[SIZE]; |
217 |
> |
for (int i = 0; i < SIZE - 1; ++i) |
218 |
> |
ints[i] = new Integer(i); |
219 |
|
try { |
173 |
– |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
174 |
– |
Integer[] ints = new Integer[SIZE]; |
175 |
– |
for (int i = 0; i < SIZE-1; ++i) |
176 |
– |
ints[i] = new Integer(i); |
220 |
|
q.addAll(Arrays.asList(ints)); |
221 |
< |
fail("Cannot add null elements"); |
222 |
< |
} |
180 |
< |
catch (NullPointerException success) {} |
221 |
> |
shouldThrow(); |
222 |
> |
} catch (NullPointerException success) {} |
223 |
|
} |
224 |
< |
public void testAddAll4(){ |
224 |
> |
|
225 |
> |
/** |
226 |
> |
* addAll throws ISE if not enough room |
227 |
> |
*/ |
228 |
> |
public void testAddAll4() { |
229 |
> |
ArrayBlockingQueue q = new ArrayBlockingQueue(1); |
230 |
> |
Integer[] ints = new Integer[SIZE]; |
231 |
> |
for (int i = 0; i < SIZE; ++i) |
232 |
> |
ints[i] = new Integer(i); |
233 |
|
try { |
184 |
– |
ArrayBlockingQueue q = new ArrayBlockingQueue(1); |
185 |
– |
Integer[] ints = new Integer[SIZE]; |
186 |
– |
for (int i = 0; i < SIZE; ++i) |
187 |
– |
ints[i] = new Integer(i); |
234 |
|
q.addAll(Arrays.asList(ints)); |
235 |
< |
fail("Cannot add with insufficient capacity"); |
236 |
< |
} |
191 |
< |
catch (IllegalStateException success) {} |
192 |
< |
} |
193 |
< |
public void testAddAll5(){ |
194 |
< |
try { |
195 |
< |
Integer[] empty = new Integer[0]; |
196 |
< |
Integer[] ints = new Integer[SIZE]; |
197 |
< |
for (int i = 0; i < SIZE; ++i) |
198 |
< |
ints[i] = new Integer(i); |
199 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
200 |
< |
assertFalse(q.addAll(Arrays.asList(empty))); |
201 |
< |
assertTrue(q.addAll(Arrays.asList(ints))); |
202 |
< |
for (int i = 0; i < SIZE; ++i) |
203 |
< |
assertEquals(ints[i], q.poll()); |
204 |
< |
} |
205 |
< |
finally {} |
206 |
< |
} |
207 |
< |
|
208 |
< |
public void testPutNull() { |
209 |
< |
try { |
210 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
211 |
< |
q.put(null); |
212 |
< |
fail("put should throw NPE"); |
213 |
< |
} |
214 |
< |
catch (NullPointerException success){ |
215 |
< |
} |
216 |
< |
catch (InterruptedException ie) { |
217 |
< |
fail("Unexpected exception"); |
218 |
< |
} |
219 |
< |
} |
220 |
< |
|
221 |
< |
public void testPut() { |
222 |
< |
try { |
223 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
224 |
< |
for (int i = 0; i < SIZE; ++i) { |
225 |
< |
Integer I = new Integer(i); |
226 |
< |
q.put(I); |
227 |
< |
assertTrue(q.contains(I)); |
228 |
< |
} |
229 |
< |
assertEquals(0, q.remainingCapacity()); |
230 |
< |
} |
231 |
< |
catch (InterruptedException ie) { |
232 |
< |
fail("Unexpected exception"); |
233 |
< |
} |
235 |
> |
shouldThrow(); |
236 |
> |
} catch (IllegalStateException success) {} |
237 |
|
} |
238 |
|
|
239 |
< |
public void testBlockingPut(){ |
240 |
< |
Thread t = new Thread(new Runnable() { |
241 |
< |
public void run() { |
242 |
< |
int added = 0; |
243 |
< |
try { |
244 |
< |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
245 |
< |
for (int i = 0; i < SIZE; ++i) { |
246 |
< |
q.put(new Integer(i)); |
247 |
< |
++added; |
248 |
< |
} |
249 |
< |
q.put(new Integer(SIZE)); |
250 |
< |
threadFail("put should block"); |
251 |
< |
} catch (InterruptedException ie){ |
249 |
< |
threadAssertEquals(added, SIZE); |
250 |
< |
} |
251 |
< |
}}); |
252 |
< |
try { |
253 |
< |
t.start(); |
254 |
< |
Thread.sleep(SHORT_DELAY_MS); |
255 |
< |
t.interrupt(); |
256 |
< |
t.join(); |
257 |
< |
} |
258 |
< |
catch (InterruptedException ie) { |
259 |
< |
fail("Unexpected exception"); |
260 |
< |
} |
239 |
> |
/** |
240 |
> |
* Queue contains all elements, in traversal order, of successful addAll |
241 |
> |
*/ |
242 |
> |
public void testAddAll5() { |
243 |
> |
Integer[] empty = new Integer[0]; |
244 |
> |
Integer[] ints = new Integer[SIZE]; |
245 |
> |
for (int i = 0; i < SIZE; ++i) |
246 |
> |
ints[i] = new Integer(i); |
247 |
> |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
248 |
> |
assertFalse(q.addAll(Arrays.asList(empty))); |
249 |
> |
assertTrue(q.addAll(Arrays.asList(ints))); |
250 |
> |
for (int i = 0; i < SIZE; ++i) |
251 |
> |
assertEquals(ints[i], q.poll()); |
252 |
|
} |
253 |
|
|
254 |
< |
public void testPutWithTake() { |
255 |
< |
final ArrayBlockingQueue q = new ArrayBlockingQueue(2); |
256 |
< |
Thread t = new Thread(new Runnable() { |
257 |
< |
public void run(){ |
258 |
< |
int added = 0; |
259 |
< |
try { |
260 |
< |
q.put(new Object()); |
261 |
< |
++added; |
262 |
< |
q.put(new Object()); |
272 |
< |
++added; |
273 |
< |
q.put(new Object()); |
274 |
< |
++added; |
275 |
< |
q.put(new Object()); |
276 |
< |
++added; |
277 |
< |
threadFail("Should block"); |
278 |
< |
} catch (InterruptedException e){ |
279 |
< |
threadAssertTrue(added >= 2); |
280 |
< |
} |
281 |
< |
} |
282 |
< |
}); |
283 |
< |
try { |
284 |
< |
t.start(); |
285 |
< |
Thread.sleep(SHORT_DELAY_MS); |
286 |
< |
q.take(); |
287 |
< |
t.interrupt(); |
288 |
< |
t.join(); |
289 |
< |
} catch (Exception e){ |
290 |
< |
fail("Unexpected exception"); |
254 |
> |
/** |
255 |
> |
* all elements successfully put are contained |
256 |
> |
*/ |
257 |
> |
public void testPut() throws InterruptedException { |
258 |
> |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
259 |
> |
for (int i = 0; i < SIZE; ++i) { |
260 |
> |
Integer x = new Integer(i); |
261 |
> |
q.put(x); |
262 |
> |
assertTrue(q.contains(x)); |
263 |
|
} |
264 |
+ |
assertEquals(0, q.remainingCapacity()); |
265 |
|
} |
266 |
|
|
267 |
< |
public void testTimedOffer() { |
268 |
< |
final ArrayBlockingQueue q = new ArrayBlockingQueue(2); |
269 |
< |
Thread t = new Thread(new Runnable() { |
270 |
< |
public void run(){ |
271 |
< |
try { |
272 |
< |
q.put(new Object()); |
273 |
< |
q.put(new Object()); |
274 |
< |
threadAssertFalse(q.offer(new Object(), SHORT_DELAY_MS/2, TimeUnit.MILLISECONDS)); |
275 |
< |
q.offer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS); |
276 |
< |
threadFail("Should block"); |
277 |
< |
} catch (InterruptedException success){} |
278 |
< |
} |
279 |
< |
}); |
280 |
< |
|
281 |
< |
try { |
282 |
< |
t.start(); |
283 |
< |
Thread.sleep(SHORT_DELAY_MS); |
284 |
< |
t.interrupt(); |
285 |
< |
t.join(); |
286 |
< |
} catch (Exception e){ |
287 |
< |
fail("Unexpected exception"); |
288 |
< |
} |
267 |
> |
/** |
268 |
> |
* put blocks interruptibly if full |
269 |
> |
*/ |
270 |
> |
public void testBlockingPut() throws InterruptedException { |
271 |
> |
final ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
272 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
273 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
274 |
> |
public void realRun() throws InterruptedException { |
275 |
> |
for (int i = 0; i < SIZE; ++i) |
276 |
> |
q.put(i); |
277 |
> |
assertEquals(SIZE, q.size()); |
278 |
> |
assertEquals(0, q.remainingCapacity()); |
279 |
> |
|
280 |
> |
Thread.currentThread().interrupt(); |
281 |
> |
try { |
282 |
> |
q.put(99); |
283 |
> |
shouldThrow(); |
284 |
> |
} catch (InterruptedException success) {} |
285 |
> |
assertFalse(Thread.interrupted()); |
286 |
> |
|
287 |
> |
pleaseInterrupt.countDown(); |
288 |
> |
try { |
289 |
> |
q.put(99); |
290 |
> |
shouldThrow(); |
291 |
> |
} catch (InterruptedException success) {} |
292 |
> |
assertFalse(Thread.interrupted()); |
293 |
> |
}}); |
294 |
> |
|
295 |
> |
await(pleaseInterrupt); |
296 |
> |
assertThreadStaysAlive(t); |
297 |
> |
t.interrupt(); |
298 |
> |
awaitTermination(t); |
299 |
> |
assertEquals(SIZE, q.size()); |
300 |
> |
assertEquals(0, q.remainingCapacity()); |
301 |
|
} |
302 |
|
|
303 |
< |
public void testTake(){ |
304 |
< |
try { |
305 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
306 |
< |
for (int i = 0; i < SIZE; ++i) { |
307 |
< |
assertEquals(i, ((Integer)q.take()).intValue()); |
308 |
< |
} |
309 |
< |
} catch (InterruptedException e){ |
310 |
< |
fail("Unexpected exception"); |
311 |
< |
} |
303 |
> |
/** |
304 |
> |
* put blocks interruptibly waiting for take when full |
305 |
> |
*/ |
306 |
> |
public void testPutWithTake() throws InterruptedException { |
307 |
> |
final int capacity = 2; |
308 |
> |
final ArrayBlockingQueue q = new ArrayBlockingQueue(capacity); |
309 |
> |
final CountDownLatch pleaseTake = new CountDownLatch(1); |
310 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
311 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
312 |
> |
public void realRun() throws InterruptedException { |
313 |
> |
for (int i = 0; i < capacity; i++) |
314 |
> |
q.put(i); |
315 |
> |
pleaseTake.countDown(); |
316 |
> |
q.put(86); |
317 |
> |
|
318 |
> |
pleaseInterrupt.countDown(); |
319 |
> |
try { |
320 |
> |
q.put(99); |
321 |
> |
shouldThrow(); |
322 |
> |
} catch (InterruptedException success) {} |
323 |
> |
assertFalse(Thread.interrupted()); |
324 |
> |
}}); |
325 |
> |
|
326 |
> |
await(pleaseTake); |
327 |
> |
assertEquals(0, q.remainingCapacity()); |
328 |
> |
assertEquals(0, q.take()); |
329 |
> |
|
330 |
> |
await(pleaseInterrupt); |
331 |
> |
assertThreadStaysAlive(t); |
332 |
> |
t.interrupt(); |
333 |
> |
awaitTermination(t); |
334 |
> |
assertEquals(0, q.remainingCapacity()); |
335 |
|
} |
336 |
|
|
337 |
< |
public void testTakeFromEmpty() { |
337 |
> |
/** |
338 |
> |
* timed offer times out if full and elements not taken |
339 |
> |
*/ |
340 |
> |
public void testTimedOffer() throws InterruptedException { |
341 |
|
final ArrayBlockingQueue q = new ArrayBlockingQueue(2); |
342 |
< |
Thread t = new Thread(new Runnable() { |
343 |
< |
public void run(){ |
344 |
< |
try { |
345 |
< |
q.take(); |
346 |
< |
threadFail("Should block"); |
347 |
< |
} catch (InterruptedException success){ } |
348 |
< |
} |
349 |
< |
}); |
350 |
< |
try { |
351 |
< |
t.start(); |
352 |
< |
Thread.sleep(SHORT_DELAY_MS); |
353 |
< |
t.interrupt(); |
354 |
< |
t.join(); |
355 |
< |
} catch (Exception e){ |
356 |
< |
fail("Unexpected exception"); |
357 |
< |
} |
342 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
343 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
344 |
> |
public void realRun() throws InterruptedException { |
345 |
> |
q.put(new Object()); |
346 |
> |
q.put(new Object()); |
347 |
> |
long startTime = System.nanoTime(); |
348 |
> |
assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS)); |
349 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
350 |
> |
pleaseInterrupt.countDown(); |
351 |
> |
try { |
352 |
> |
q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS); |
353 |
> |
shouldThrow(); |
354 |
> |
} catch (InterruptedException success) {} |
355 |
> |
}}); |
356 |
> |
|
357 |
> |
await(pleaseInterrupt); |
358 |
> |
assertThreadStaysAlive(t); |
359 |
> |
t.interrupt(); |
360 |
> |
awaitTermination(t); |
361 |
|
} |
362 |
|
|
363 |
< |
public void testBlockingTake(){ |
364 |
< |
Thread t = new Thread(new Runnable() { |
365 |
< |
public void run() { |
366 |
< |
try { |
367 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
368 |
< |
for (int i = 0; i < SIZE; ++i) { |
369 |
< |
threadAssertEquals(i, ((Integer)q.take()).intValue()); |
356 |
< |
} |
357 |
< |
q.take(); |
358 |
< |
threadFail("take should block"); |
359 |
< |
} catch (InterruptedException success){ |
360 |
< |
} |
361 |
< |
}}); |
362 |
< |
try { |
363 |
< |
t.start(); |
364 |
< |
Thread.sleep(SHORT_DELAY_MS); |
365 |
< |
t.interrupt(); |
366 |
< |
t.join(); |
367 |
< |
} |
368 |
< |
catch (InterruptedException ie) { |
369 |
< |
fail("Unexpected exception"); |
363 |
> |
/** |
364 |
> |
* take retrieves elements in FIFO order |
365 |
> |
*/ |
366 |
> |
public void testTake() throws InterruptedException { |
367 |
> |
ArrayBlockingQueue q = populatedQueue(SIZE); |
368 |
> |
for (int i = 0; i < SIZE; ++i) { |
369 |
> |
assertEquals(i, q.take()); |
370 |
|
} |
371 |
|
} |
372 |
|
|
373 |
+ |
/** |
374 |
+ |
* Take removes existing elements until empty, then blocks interruptibly |
375 |
+ |
*/ |
376 |
+ |
public void testBlockingTake() throws InterruptedException { |
377 |
+ |
final ArrayBlockingQueue q = populatedQueue(SIZE); |
378 |
+ |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
379 |
+ |
Thread t = newStartedThread(new CheckedRunnable() { |
380 |
+ |
public void realRun() throws InterruptedException { |
381 |
+ |
for (int i = 0; i < SIZE; ++i) { |
382 |
+ |
assertEquals(i, q.take()); |
383 |
+ |
} |
384 |
+ |
|
385 |
+ |
Thread.currentThread().interrupt(); |
386 |
+ |
try { |
387 |
+ |
q.take(); |
388 |
+ |
shouldThrow(); |
389 |
+ |
} catch (InterruptedException success) {} |
390 |
+ |
assertFalse(Thread.interrupted()); |
391 |
|
|
392 |
< |
public void testPoll(){ |
392 |
> |
pleaseInterrupt.countDown(); |
393 |
> |
try { |
394 |
> |
q.take(); |
395 |
> |
shouldThrow(); |
396 |
> |
} catch (InterruptedException success) {} |
397 |
> |
assertFalse(Thread.interrupted()); |
398 |
> |
}}); |
399 |
> |
|
400 |
> |
await(pleaseInterrupt); |
401 |
> |
assertThreadStaysAlive(t); |
402 |
> |
t.interrupt(); |
403 |
> |
awaitTermination(t); |
404 |
> |
} |
405 |
> |
|
406 |
> |
/** |
407 |
> |
* poll succeeds unless empty |
408 |
> |
*/ |
409 |
> |
public void testPoll() { |
410 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
411 |
|
for (int i = 0; i < SIZE; ++i) { |
412 |
< |
assertEquals(i, ((Integer)q.poll()).intValue()); |
412 |
> |
assertEquals(i, q.poll()); |
413 |
|
} |
414 |
< |
assertNull(q.poll()); |
414 |
> |
assertNull(q.poll()); |
415 |
|
} |
416 |
|
|
417 |
< |
public void testTimedPoll0() { |
418 |
< |
try { |
419 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
420 |
< |
for (int i = 0; i < SIZE; ++i) { |
421 |
< |
assertEquals(i, ((Integer)q.poll(0, TimeUnit.MILLISECONDS)).intValue()); |
422 |
< |
} |
423 |
< |
assertNull(q.poll(0, TimeUnit.MILLISECONDS)); |
424 |
< |
} catch (InterruptedException e){ |
425 |
< |
fail("Unexpected exception"); |
426 |
< |
} |
417 |
> |
/** |
418 |
> |
* timed poll with zero timeout succeeds when non-empty, else times out |
419 |
> |
*/ |
420 |
> |
public void testTimedPoll0() throws InterruptedException { |
421 |
> |
ArrayBlockingQueue q = populatedQueue(SIZE); |
422 |
> |
for (int i = 0; i < SIZE; ++i) { |
423 |
> |
assertEquals(i, q.poll(0, MILLISECONDS)); |
424 |
> |
} |
425 |
> |
assertNull(q.poll(0, MILLISECONDS)); |
426 |
> |
checkEmpty(q); |
427 |
|
} |
428 |
|
|
429 |
< |
public void testTimedPoll() { |
430 |
< |
try { |
431 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
432 |
< |
for (int i = 0; i < SIZE; ++i) { |
433 |
< |
assertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue()); |
434 |
< |
} |
435 |
< |
assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
436 |
< |
} catch (InterruptedException e){ |
437 |
< |
fail("Unexpected exception"); |
438 |
< |
} |
439 |
< |
} |
440 |
< |
|
441 |
< |
public void testInterruptedTimedPoll(){ |
442 |
< |
Thread t = new Thread(new Runnable() { |
408 |
< |
public void run() { |
409 |
< |
try { |
410 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
411 |
< |
for (int i = 0; i < SIZE; ++i) { |
412 |
< |
threadAssertEquals(i, ((Integer)q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)).intValue()); |
413 |
< |
} |
414 |
< |
threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
415 |
< |
} catch (InterruptedException success){ |
416 |
< |
} |
417 |
< |
}}); |
418 |
< |
try { |
419 |
< |
t.start(); |
420 |
< |
Thread.sleep(SHORT_DELAY_MS); |
421 |
< |
t.interrupt(); |
422 |
< |
t.join(); |
423 |
< |
} |
424 |
< |
catch (InterruptedException ie) { |
425 |
< |
fail("Unexpected exception"); |
426 |
< |
} |
429 |
> |
/** |
430 |
> |
* timed poll with nonzero timeout succeeds when non-empty, else times out |
431 |
> |
*/ |
432 |
> |
public void testTimedPoll() throws InterruptedException { |
433 |
> |
ArrayBlockingQueue q = populatedQueue(SIZE); |
434 |
> |
for (int i = 0; i < SIZE; ++i) { |
435 |
> |
long startTime = System.nanoTime(); |
436 |
> |
assertEquals(i, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
437 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
438 |
> |
} |
439 |
> |
long startTime = System.nanoTime(); |
440 |
> |
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
441 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
442 |
> |
checkEmpty(q); |
443 |
|
} |
444 |
|
|
445 |
< |
public void testTimedPollWithOffer(){ |
446 |
< |
final ArrayBlockingQueue q = new ArrayBlockingQueue(2); |
447 |
< |
Thread t = new Thread(new Runnable() { |
448 |
< |
public void run(){ |
449 |
< |
try { |
450 |
< |
threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
451 |
< |
q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS); |
452 |
< |
q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS); |
453 |
< |
threadFail("Should block"); |
454 |
< |
} catch (InterruptedException success) { } |
445 |
> |
/** |
446 |
> |
* Interrupted timed poll throws InterruptedException instead of |
447 |
> |
* returning timeout status |
448 |
> |
*/ |
449 |
> |
public void testInterruptedTimedPoll() throws InterruptedException { |
450 |
> |
final BlockingQueue<Integer> q = populatedQueue(SIZE); |
451 |
> |
final CountDownLatch aboutToWait = new CountDownLatch(1); |
452 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
453 |
> |
public void realRun() throws InterruptedException { |
454 |
> |
for (int i = 0; i < SIZE; ++i) { |
455 |
> |
long startTime = System.nanoTime(); |
456 |
> |
assertEquals(i, (int) q.poll(2*LONG_DELAY_MS, MILLISECONDS)); |
457 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
458 |
|
} |
459 |
< |
}); |
460 |
< |
try { |
461 |
< |
t.start(); |
462 |
< |
Thread.sleep(SMALL_DELAY_MS); |
463 |
< |
assertTrue(q.offer(zero, SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
464 |
< |
t.interrupt(); |
465 |
< |
t.join(); |
466 |
< |
} catch (Exception e){ |
467 |
< |
fail("Unexpected exception"); |
468 |
< |
} |
469 |
< |
} |
470 |
< |
|
459 |
> |
long startTime = System.nanoTime(); |
460 |
> |
aboutToWait.countDown(); |
461 |
> |
try { |
462 |
> |
q.poll(2*LONG_DELAY_MS, MILLISECONDS); |
463 |
> |
shouldThrow(); |
464 |
> |
} catch (InterruptedException success) { |
465 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
466 |
> |
} |
467 |
> |
}}); |
468 |
> |
|
469 |
> |
await(aboutToWait); |
470 |
> |
waitForThreadToEnterWaitState(t, LONG_DELAY_MS); |
471 |
> |
t.interrupt(); |
472 |
> |
awaitTermination(t, LONG_DELAY_MS); |
473 |
> |
checkEmpty(q); |
474 |
> |
} |
475 |
|
|
476 |
< |
public void testPeek(){ |
476 |
> |
/** |
477 |
> |
* peek returns next element, or null if empty |
478 |
> |
*/ |
479 |
> |
public void testPeek() { |
480 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
481 |
|
for (int i = 0; i < SIZE; ++i) { |
482 |
< |
assertEquals(i, ((Integer)q.peek()).intValue()); |
483 |
< |
q.poll(); |
482 |
> |
assertEquals(i, q.peek()); |
483 |
> |
assertEquals(i, q.poll()); |
484 |
|
assertTrue(q.peek() == null || |
485 |
< |
i != ((Integer)q.peek()).intValue()); |
485 |
> |
!q.peek().equals(i)); |
486 |
|
} |
487 |
< |
assertNull(q.peek()); |
487 |
> |
assertNull(q.peek()); |
488 |
|
} |
489 |
|
|
490 |
< |
public void testElement(){ |
490 |
> |
/** |
491 |
> |
* element returns next element, or throws NSEE if empty |
492 |
> |
*/ |
493 |
> |
public void testElement() { |
494 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
495 |
|
for (int i = 0; i < SIZE; ++i) { |
496 |
< |
assertEquals(i, ((Integer)q.element()).intValue()); |
497 |
< |
q.poll(); |
496 |
> |
assertEquals(i, q.element()); |
497 |
> |
assertEquals(i, q.poll()); |
498 |
|
} |
499 |
|
try { |
500 |
|
q.element(); |
501 |
< |
fail("no such element"); |
502 |
< |
} |
474 |
< |
catch (NoSuchElementException success) {} |
501 |
> |
shouldThrow(); |
502 |
> |
} catch (NoSuchElementException success) {} |
503 |
|
} |
504 |
|
|
505 |
< |
public void testRemove(){ |
505 |
> |
/** |
506 |
> |
* remove removes next element, or throws NSEE if empty |
507 |
> |
*/ |
508 |
> |
public void testRemove() { |
509 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
510 |
|
for (int i = 0; i < SIZE; ++i) { |
511 |
< |
assertEquals(i, ((Integer)q.remove()).intValue()); |
511 |
> |
assertEquals(i, q.remove()); |
512 |
|
} |
513 |
|
try { |
514 |
|
q.remove(); |
515 |
< |
fail("remove should throw"); |
516 |
< |
} catch (NoSuchElementException success){ |
486 |
< |
} |
515 |
> |
shouldThrow(); |
516 |
> |
} catch (NoSuchElementException success) {} |
517 |
|
} |
518 |
|
|
519 |
< |
public void testRemoveElement(){ |
520 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
521 |
< |
for (int i = 1; i < SIZE; i+=2) { |
522 |
< |
assertTrue(q.remove(new Integer(i))); |
493 |
< |
} |
494 |
< |
for (int i = 0; i < SIZE; i+=2) { |
495 |
< |
assertTrue(q.remove(new Integer(i))); |
496 |
< |
assertFalse(q.remove(new Integer(i+1))); |
497 |
< |
} |
498 |
< |
assertTrue(q.isEmpty()); |
499 |
< |
} |
500 |
< |
|
501 |
< |
public void testContains(){ |
519 |
> |
/** |
520 |
> |
* contains(x) reports true when elements added but not yet removed |
521 |
> |
*/ |
522 |
> |
public void testContains() { |
523 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
524 |
|
for (int i = 0; i < SIZE; ++i) { |
525 |
|
assertTrue(q.contains(new Integer(i))); |
526 |
< |
q.poll(); |
526 |
> |
assertEquals(i, q.poll()); |
527 |
|
assertFalse(q.contains(new Integer(i))); |
528 |
|
} |
529 |
|
} |
530 |
|
|
531 |
< |
public void testClear(){ |
531 |
> |
/** |
532 |
> |
* clear removes all elements |
533 |
> |
*/ |
534 |
> |
public void testClear() { |
535 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
536 |
|
q.clear(); |
537 |
|
assertTrue(q.isEmpty()); |
539 |
|
assertEquals(SIZE, q.remainingCapacity()); |
540 |
|
q.add(one); |
541 |
|
assertFalse(q.isEmpty()); |
542 |
+ |
assertTrue(q.contains(one)); |
543 |
|
q.clear(); |
544 |
|
assertTrue(q.isEmpty()); |
545 |
|
} |
546 |
|
|
547 |
< |
public void testContainsAll(){ |
547 |
> |
/** |
548 |
> |
* containsAll(c) is true when c contains a subset of elements |
549 |
> |
*/ |
550 |
> |
public void testContainsAll() { |
551 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
552 |
|
ArrayBlockingQueue p = new ArrayBlockingQueue(SIZE); |
553 |
|
for (int i = 0; i < SIZE; ++i) { |
558 |
|
assertTrue(p.containsAll(q)); |
559 |
|
} |
560 |
|
|
561 |
< |
public void testRetainAll(){ |
561 |
> |
/** |
562 |
> |
* retainAll(c) retains only those elements of c and reports true if changed |
563 |
> |
*/ |
564 |
> |
public void testRetainAll() { |
565 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
566 |
|
ArrayBlockingQueue p = populatedQueue(SIZE); |
567 |
|
for (int i = 0; i < SIZE; ++i) { |
572 |
|
assertTrue(changed); |
573 |
|
|
574 |
|
assertTrue(q.containsAll(p)); |
575 |
< |
assertEquals(SIZE-i, q.size()); |
575 |
> |
assertEquals(SIZE - i, q.size()); |
576 |
|
p.remove(); |
577 |
|
} |
578 |
|
} |
579 |
|
|
580 |
< |
public void testRemoveAll(){ |
580 |
> |
/** |
581 |
> |
* removeAll(c) removes only those elements of c and reports true if changed |
582 |
> |
*/ |
583 |
> |
public void testRemoveAll() { |
584 |
|
for (int i = 1; i < SIZE; ++i) { |
585 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
586 |
|
ArrayBlockingQueue p = populatedQueue(i); |
587 |
|
assertTrue(q.removeAll(p)); |
588 |
< |
assertEquals(SIZE-i, q.size()); |
588 |
> |
assertEquals(SIZE - i, q.size()); |
589 |
|
for (int j = 0; j < i; ++j) { |
590 |
< |
Integer I = (Integer)(p.remove()); |
591 |
< |
assertFalse(q.contains(I)); |
590 |
> |
Integer x = (Integer)(p.remove()); |
591 |
> |
assertFalse(q.contains(x)); |
592 |
> |
} |
593 |
> |
} |
594 |
> |
} |
595 |
> |
|
596 |
> |
void checkToArray(ArrayBlockingQueue q) { |
597 |
> |
int size = q.size(); |
598 |
> |
Object[] o = q.toArray(); |
599 |
> |
assertEquals(size, o.length); |
600 |
> |
Iterator it = q.iterator(); |
601 |
> |
for (int i = 0; i < size; i++) { |
602 |
> |
Integer x = (Integer) it.next(); |
603 |
> |
assertEquals((Integer)o[0] + i, (int) x); |
604 |
> |
assertSame(o[i], x); |
605 |
> |
} |
606 |
> |
} |
607 |
> |
|
608 |
> |
/** |
609 |
> |
* toArray() contains all elements in FIFO order |
610 |
> |
*/ |
611 |
> |
public void testToArray() { |
612 |
> |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
613 |
> |
for (int i = 0; i < SIZE; i++) { |
614 |
> |
checkToArray(q); |
615 |
> |
q.add(i); |
616 |
> |
} |
617 |
> |
// Provoke wraparound |
618 |
> |
for (int i = 0; i < SIZE; i++) { |
619 |
> |
checkToArray(q); |
620 |
> |
assertEquals(i, q.poll()); |
621 |
> |
checkToArray(q); |
622 |
> |
q.add(SIZE + i); |
623 |
> |
} |
624 |
> |
for (int i = 0; i < SIZE; i++) { |
625 |
> |
checkToArray(q); |
626 |
> |
assertEquals(SIZE + i, q.poll()); |
627 |
> |
} |
628 |
> |
} |
629 |
> |
|
630 |
> |
void checkToArray2(ArrayBlockingQueue q) { |
631 |
> |
int size = q.size(); |
632 |
> |
Integer[] a1 = (size == 0) ? null : new Integer[size - 1]; |
633 |
> |
Integer[] a2 = new Integer[size]; |
634 |
> |
Integer[] a3 = new Integer[size + 2]; |
635 |
> |
if (size > 0) Arrays.fill(a1, 42); |
636 |
> |
Arrays.fill(a2, 42); |
637 |
> |
Arrays.fill(a3, 42); |
638 |
> |
Integer[] b1 = (size == 0) ? null : (Integer[]) q.toArray(a1); |
639 |
> |
Integer[] b2 = (Integer[]) q.toArray(a2); |
640 |
> |
Integer[] b3 = (Integer[]) q.toArray(a3); |
641 |
> |
assertSame(a2, b2); |
642 |
> |
assertSame(a3, b3); |
643 |
> |
Iterator it = q.iterator(); |
644 |
> |
for (int i = 0; i < size; i++) { |
645 |
> |
Integer x = (Integer) it.next(); |
646 |
> |
assertSame(b1[i], x); |
647 |
> |
assertEquals(b1[0] + i, (int) x); |
648 |
> |
assertSame(b2[i], x); |
649 |
> |
assertSame(b3[i], x); |
650 |
> |
} |
651 |
> |
assertNull(a3[size]); |
652 |
> |
assertEquals(42, (int) a3[size + 1]); |
653 |
> |
if (size > 0) { |
654 |
> |
assertNotSame(a1, b1); |
655 |
> |
assertEquals(size, b1.length); |
656 |
> |
for (int i = 0; i < a1.length; i++) { |
657 |
> |
assertEquals(42, (int) a1[i]); |
658 |
|
} |
659 |
|
} |
660 |
|
} |
661 |
|
|
662 |
+ |
/** |
663 |
+ |
* toArray(a) contains all elements in FIFO order |
664 |
+ |
*/ |
665 |
+ |
public void testToArray2() { |
666 |
+ |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE); |
667 |
+ |
for (int i = 0; i < SIZE; i++) { |
668 |
+ |
checkToArray2(q); |
669 |
+ |
q.add(i); |
670 |
+ |
} |
671 |
+ |
// Provoke wraparound |
672 |
+ |
for (int i = 0; i < SIZE; i++) { |
673 |
+ |
checkToArray2(q); |
674 |
+ |
assertEquals(i, q.poll()); |
675 |
+ |
checkToArray2(q); |
676 |
+ |
q.add(SIZE + i); |
677 |
+ |
} |
678 |
+ |
for (int i = 0; i < SIZE; i++) { |
679 |
+ |
checkToArray2(q); |
680 |
+ |
assertEquals(SIZE + i, q.poll()); |
681 |
+ |
} |
682 |
+ |
} |
683 |
|
|
684 |
< |
public void testToArray(){ |
684 |
> |
/** |
685 |
> |
* toArray(incompatible array type) throws ArrayStoreException |
686 |
> |
*/ |
687 |
> |
public void testToArray1_BadArg() { |
688 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
689 |
< |
Object[] o = q.toArray(); |
690 |
< |
try { |
691 |
< |
for(int i = 0; i < o.length; i++) |
692 |
< |
assertEquals(o[i], q.take()); |
569 |
< |
} catch (InterruptedException e){ |
570 |
< |
fail("Unexpected exception"); |
571 |
< |
} |
572 |
< |
} |
573 |
< |
|
574 |
< |
public void testToArray2(){ |
575 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
576 |
< |
Integer[] ints = new Integer[SIZE]; |
577 |
< |
ints = (Integer[])q.toArray(ints); |
578 |
< |
try { |
579 |
< |
for(int i = 0; i < ints.length; i++) |
580 |
< |
assertEquals(ints[i], q.take()); |
581 |
< |
} catch (InterruptedException e){ |
582 |
< |
fail("Unexpected exception"); |
583 |
< |
} |
584 |
< |
} |
585 |
< |
|
586 |
< |
public void testIterator(){ |
587 |
< |
ArrayBlockingQueue q = populatedQueue(SIZE); |
588 |
< |
Iterator it = q.iterator(); |
589 |
< |
try { |
590 |
< |
while(it.hasNext()){ |
591 |
< |
assertEquals(it.next(), q.take()); |
592 |
< |
} |
593 |
< |
} catch (InterruptedException e){ |
594 |
< |
fail("Unexpected exception"); |
595 |
< |
} |
689 |
> |
try { |
690 |
> |
q.toArray(new String[10]); |
691 |
> |
shouldThrow(); |
692 |
> |
} catch (ArrayStoreException success) {} |
693 |
|
} |
694 |
|
|
695 |
< |
public void testIteratorOrdering() { |
695 |
> |
/** |
696 |
> |
* iterator iterates through all elements |
697 |
> |
*/ |
698 |
> |
public void testIterator() throws InterruptedException { |
699 |
> |
ArrayBlockingQueue q = populatedQueue(SIZE); |
700 |
> |
Iterator it = q.iterator(); |
701 |
> |
int i; |
702 |
> |
for (i = 0; it.hasNext(); i++) |
703 |
> |
assertTrue(q.contains(it.next())); |
704 |
> |
assertEquals(i, SIZE); |
705 |
> |
assertIteratorExhausted(it); |
706 |
> |
|
707 |
> |
it = q.iterator(); |
708 |
> |
for (i = 0; it.hasNext(); i++) |
709 |
> |
assertEquals(it.next(), q.take()); |
710 |
> |
assertEquals(i, SIZE); |
711 |
> |
assertIteratorExhausted(it); |
712 |
> |
} |
713 |
> |
|
714 |
> |
/** |
715 |
> |
* iterator of empty collection has no elements |
716 |
> |
*/ |
717 |
> |
public void testEmptyIterator() { |
718 |
> |
assertIteratorExhausted(new ArrayBlockingQueue(SIZE).iterator()); |
719 |
> |
} |
720 |
|
|
721 |
+ |
/** |
722 |
+ |
* iterator.remove removes current element |
723 |
+ |
*/ |
724 |
+ |
public void testIteratorRemove() { |
725 |
|
final ArrayBlockingQueue q = new ArrayBlockingQueue(3); |
726 |
+ |
q.add(two); |
727 |
+ |
q.add(one); |
728 |
+ |
q.add(three); |
729 |
+ |
|
730 |
+ |
Iterator it = q.iterator(); |
731 |
+ |
it.next(); |
732 |
+ |
it.remove(); |
733 |
+ |
|
734 |
+ |
it = q.iterator(); |
735 |
+ |
assertSame(it.next(), one); |
736 |
+ |
assertSame(it.next(), three); |
737 |
+ |
assertFalse(it.hasNext()); |
738 |
+ |
} |
739 |
|
|
740 |
+ |
/** |
741 |
+ |
* iterator ordering is FIFO |
742 |
+ |
*/ |
743 |
+ |
public void testIteratorOrdering() { |
744 |
+ |
final ArrayBlockingQueue q = new ArrayBlockingQueue(3); |
745 |
|
q.add(one); |
746 |
|
q.add(two); |
747 |
|
q.add(three); |
750 |
|
|
751 |
|
int k = 0; |
752 |
|
for (Iterator it = q.iterator(); it.hasNext();) { |
753 |
< |
int i = ((Integer)(it.next())).intValue(); |
611 |
< |
assertEquals("items should come out in order", ++k, i); |
753 |
> |
assertEquals(++k, it.next()); |
754 |
|
} |
755 |
< |
|
614 |
< |
assertEquals("should go through 3 elements", 3, k); |
755 |
> |
assertEquals(3, k); |
756 |
|
} |
757 |
|
|
758 |
< |
public void testWeaklyConsistentIteration () { |
759 |
< |
|
758 |
> |
/** |
759 |
> |
* Modifications do not cause iterators to fail |
760 |
> |
*/ |
761 |
> |
public void testWeaklyConsistentIteration() { |
762 |
|
final ArrayBlockingQueue q = new ArrayBlockingQueue(3); |
620 |
– |
|
763 |
|
q.add(one); |
764 |
|
q.add(two); |
765 |
|
q.add(three); |
766 |
< |
|
767 |
< |
try { |
768 |
< |
for (Iterator it = q.iterator(); it.hasNext();) { |
627 |
< |
q.remove(); |
628 |
< |
it.next(); |
629 |
< |
} |
630 |
< |
} |
631 |
< |
catch (ConcurrentModificationException e) { |
632 |
< |
fail("weakly consistent iterator; should not get CME"); |
766 |
> |
for (Iterator it = q.iterator(); it.hasNext();) { |
767 |
> |
q.remove(); |
768 |
> |
it.next(); |
769 |
|
} |
770 |
< |
|
635 |
< |
assertEquals("queue should be empty again", 0, q.size()); |
770 |
> |
assertEquals(0, q.size()); |
771 |
|
} |
772 |
|
|
773 |
< |
|
774 |
< |
public void testToString(){ |
773 |
> |
/** |
774 |
> |
* toString contains toStrings of elements |
775 |
> |
*/ |
776 |
> |
public void testToString() { |
777 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
778 |
|
String s = q.toString(); |
779 |
|
for (int i = 0; i < SIZE; ++i) { |
780 |
< |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
780 |
> |
assertTrue(s.contains(String.valueOf(i))); |
781 |
|
} |
782 |
< |
} |
646 |
< |
|
782 |
> |
} |
783 |
|
|
784 |
+ |
/** |
785 |
+ |
* offer transfers elements across Executor tasks |
786 |
+ |
*/ |
787 |
|
public void testOfferInExecutor() { |
649 |
– |
|
788 |
|
final ArrayBlockingQueue q = new ArrayBlockingQueue(2); |
651 |
– |
|
789 |
|
q.add(one); |
790 |
|
q.add(two); |
791 |
+ |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
792 |
+ |
final ExecutorService executor = Executors.newFixedThreadPool(2); |
793 |
+ |
try (PoolCleaner cleaner = cleaner(executor)) { |
794 |
+ |
executor.execute(new CheckedRunnable() { |
795 |
+ |
public void realRun() throws InterruptedException { |
796 |
+ |
assertFalse(q.offer(three)); |
797 |
+ |
threadsStarted.await(); |
798 |
+ |
assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS)); |
799 |
+ |
assertEquals(0, q.remainingCapacity()); |
800 |
+ |
}}); |
801 |
|
|
802 |
< |
ExecutorService executor = Executors.newFixedThreadPool(2); |
803 |
< |
|
804 |
< |
executor.execute(new Runnable() { |
805 |
< |
public void run() { |
806 |
< |
threadAssertFalse(q.offer(three)); |
807 |
< |
try { |
808 |
< |
threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS)); |
662 |
< |
threadAssertEquals(0, q.remainingCapacity()); |
663 |
< |
} |
664 |
< |
catch (InterruptedException e) { |
665 |
< |
threadFail("should not be interrupted"); |
666 |
< |
} |
667 |
< |
} |
668 |
< |
}); |
669 |
< |
|
670 |
< |
executor.execute(new Runnable() { |
671 |
< |
public void run() { |
672 |
< |
try { |
673 |
< |
Thread.sleep(SMALL_DELAY_MS); |
674 |
< |
threadAssertEquals(one, q.take()); |
675 |
< |
} |
676 |
< |
catch (InterruptedException e) { |
677 |
< |
threadFail("should not be interrupted"); |
678 |
< |
} |
679 |
< |
} |
680 |
< |
}); |
681 |
< |
|
682 |
< |
joinPool(executor); |
683 |
< |
|
802 |
> |
executor.execute(new CheckedRunnable() { |
803 |
> |
public void realRun() throws InterruptedException { |
804 |
> |
threadsStarted.await(); |
805 |
> |
assertEquals(0, q.remainingCapacity()); |
806 |
> |
assertSame(one, q.take()); |
807 |
> |
}}); |
808 |
> |
} |
809 |
|
} |
810 |
|
|
811 |
+ |
/** |
812 |
+ |
* timed poll retrieves elements across Executor threads |
813 |
+ |
*/ |
814 |
|
public void testPollInExecutor() { |
687 |
– |
|
815 |
|
final ArrayBlockingQueue q = new ArrayBlockingQueue(2); |
816 |
+ |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
817 |
+ |
final ExecutorService executor = Executors.newFixedThreadPool(2); |
818 |
+ |
try (PoolCleaner cleaner = cleaner(executor)) { |
819 |
+ |
executor.execute(new CheckedRunnable() { |
820 |
+ |
public void realRun() throws InterruptedException { |
821 |
+ |
assertNull(q.poll()); |
822 |
+ |
threadsStarted.await(); |
823 |
+ |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
824 |
+ |
checkEmpty(q); |
825 |
+ |
}}); |
826 |
|
|
827 |
< |
ExecutorService executor = Executors.newFixedThreadPool(2); |
828 |
< |
|
829 |
< |
executor.execute(new Runnable() { |
693 |
< |
public void run() { |
694 |
< |
threadAssertNull(q.poll()); |
695 |
< |
try { |
696 |
< |
threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, TimeUnit.MILLISECONDS)); |
697 |
< |
threadAssertTrue(q.isEmpty()); |
698 |
< |
} |
699 |
< |
catch (InterruptedException e) { |
700 |
< |
threadFail("should not be interrupted"); |
701 |
< |
} |
702 |
< |
} |
703 |
< |
}); |
704 |
< |
|
705 |
< |
executor.execute(new Runnable() { |
706 |
< |
public void run() { |
707 |
< |
try { |
708 |
< |
Thread.sleep(SMALL_DELAY_MS); |
827 |
> |
executor.execute(new CheckedRunnable() { |
828 |
> |
public void realRun() throws InterruptedException { |
829 |
> |
threadsStarted.await(); |
830 |
|
q.put(one); |
831 |
< |
} |
832 |
< |
catch (InterruptedException e) { |
833 |
< |
threadFail("should not be interrupted"); |
713 |
< |
} |
714 |
< |
} |
715 |
< |
}); |
716 |
< |
|
717 |
< |
joinPool(executor); |
831 |
> |
}}); |
832 |
> |
} |
833 |
> |
} |
834 |
|
|
835 |
+ |
/** |
836 |
+ |
* A deserialized serialized queue has same elements in same order |
837 |
+ |
*/ |
838 |
+ |
public void testSerialization() throws Exception { |
839 |
+ |
Queue x = populatedQueue(SIZE); |
840 |
+ |
Queue y = serialClone(x); |
841 |
+ |
|
842 |
+ |
assertNotSame(x, y); |
843 |
+ |
assertEquals(x.size(), y.size()); |
844 |
+ |
assertEquals(x.toString(), y.toString()); |
845 |
+ |
assertTrue(Arrays.equals(x.toArray(), y.toArray())); |
846 |
+ |
while (!x.isEmpty()) { |
847 |
+ |
assertFalse(y.isEmpty()); |
848 |
+ |
assertEquals(x.remove(), y.remove()); |
849 |
+ |
} |
850 |
+ |
assertTrue(y.isEmpty()); |
851 |
|
} |
852 |
|
|
853 |
< |
public void testSerialization() { |
853 |
> |
/** |
854 |
> |
* drainTo(c) empties queue into another collection c |
855 |
> |
*/ |
856 |
> |
public void testDrainTo() { |
857 |
|
ArrayBlockingQueue q = populatedQueue(SIZE); |
858 |
+ |
ArrayList l = new ArrayList(); |
859 |
+ |
q.drainTo(l); |
860 |
+ |
assertEquals(0, q.size()); |
861 |
+ |
assertEquals(SIZE, l.size()); |
862 |
+ |
for (int i = 0; i < SIZE; ++i) |
863 |
+ |
assertEquals(l.get(i), new Integer(i)); |
864 |
+ |
q.add(zero); |
865 |
+ |
q.add(one); |
866 |
+ |
assertFalse(q.isEmpty()); |
867 |
+ |
assertTrue(q.contains(zero)); |
868 |
+ |
assertTrue(q.contains(one)); |
869 |
+ |
l.clear(); |
870 |
+ |
q.drainTo(l); |
871 |
+ |
assertEquals(0, q.size()); |
872 |
+ |
assertEquals(2, l.size()); |
873 |
+ |
for (int i = 0; i < 2; ++i) |
874 |
+ |
assertEquals(l.get(i), new Integer(i)); |
875 |
+ |
} |
876 |
|
|
877 |
< |
try { |
878 |
< |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
879 |
< |
ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout)); |
880 |
< |
out.writeObject(q); |
881 |
< |
out.close(); |
877 |
> |
/** |
878 |
> |
* drainTo empties full queue, unblocking a waiting put. |
879 |
> |
*/ |
880 |
> |
public void testDrainToWithActivePut() throws InterruptedException { |
881 |
> |
final ArrayBlockingQueue q = populatedQueue(SIZE); |
882 |
> |
Thread t = new Thread(new CheckedRunnable() { |
883 |
> |
public void realRun() throws InterruptedException { |
884 |
> |
q.put(new Integer(SIZE + 1)); |
885 |
> |
}}); |
886 |
> |
|
887 |
> |
t.start(); |
888 |
> |
ArrayList l = new ArrayList(); |
889 |
> |
q.drainTo(l); |
890 |
> |
assertTrue(l.size() >= SIZE); |
891 |
> |
for (int i = 0; i < SIZE; ++i) |
892 |
> |
assertEquals(l.get(i), new Integer(i)); |
893 |
> |
t.join(); |
894 |
> |
assertTrue(q.size() + l.size() >= SIZE); |
895 |
> |
} |
896 |
|
|
897 |
< |
ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray()); |
898 |
< |
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); |
899 |
< |
ArrayBlockingQueue r = (ArrayBlockingQueue)in.readObject(); |
900 |
< |
assertEquals(q.size(), r.size()); |
901 |
< |
while (!q.isEmpty()) |
902 |
< |
assertEquals(q.remove(), r.remove()); |
903 |
< |
} catch(Exception e){ |
904 |
< |
fail("unexpected exception"); |
897 |
> |
/** |
898 |
> |
* drainTo(c, n) empties first min(n, size) elements of queue into c |
899 |
> |
*/ |
900 |
> |
public void testDrainToN() { |
901 |
> |
ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE * 2); |
902 |
> |
for (int i = 0; i < SIZE + 2; ++i) { |
903 |
> |
for (int j = 0; j < SIZE; j++) |
904 |
> |
assertTrue(q.offer(new Integer(j))); |
905 |
> |
ArrayList l = new ArrayList(); |
906 |
> |
q.drainTo(l, i); |
907 |
> |
int k = (i < SIZE) ? i : SIZE; |
908 |
> |
assertEquals(k, l.size()); |
909 |
> |
assertEquals(SIZE - k, q.size()); |
910 |
> |
for (int j = 0; j < k; ++j) |
911 |
> |
assertEquals(l.get(j), new Integer(j)); |
912 |
> |
do {} while (q.poll() != null); |
913 |
|
} |
914 |
|
} |
915 |
|
|
916 |
< |
|
916 |
> |
/** |
917 |
> |
* remove(null), contains(null) always return false |
918 |
> |
*/ |
919 |
> |
public void testNeverContainsNull() { |
920 |
> |
Collection<?>[] qs = { |
921 |
> |
new ArrayBlockingQueue<Object>(10), |
922 |
> |
populatedQueue(2), |
923 |
> |
}; |
924 |
> |
|
925 |
> |
for (Collection<?> q : qs) { |
926 |
> |
assertFalse(q.contains(null)); |
927 |
> |
assertFalse(q.remove(null)); |
928 |
> |
} |
929 |
> |
} |
930 |
|
} |