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