1 |
dl |
1.1 |
/* |
2 |
dl |
1.8 |
* Written by Doug Lea with assistance from members of JCP JSR-166 |
3 |
|
|
* Expert Group and released to the public domain, as explained at |
4 |
|
|
* http://creativecommons.org/licenses/publicdomain |
5 |
jsr166 |
1.12 |
* Other contributors include Andrew Wright, Jeffrey Hayes, |
6 |
|
|
* Pat Fisher, Mike Judd. |
7 |
dl |
1.1 |
*/ |
8 |
|
|
|
9 |
|
|
import junit.framework.*; |
10 |
|
|
import java.util.*; |
11 |
|
|
import java.util.concurrent.*; |
12 |
jsr166 |
1.17 |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
13 |
dl |
1.2 |
import java.io.*; |
14 |
dl |
1.1 |
|
15 |
dl |
1.3 |
public class PriorityBlockingQueueTest extends JSR166TestCase { |
16 |
jsr166 |
1.29 |
|
17 |
|
|
public static class Generic extends BlockingQueueTest { |
18 |
|
|
protected BlockingQueue emptyCollection() { |
19 |
|
|
return new PriorityBlockingQueue(); |
20 |
|
|
} |
21 |
|
|
} |
22 |
|
|
|
23 |
|
|
public static class InitialCapacity extends BlockingQueueTest { |
24 |
|
|
protected BlockingQueue emptyCollection() { |
25 |
|
|
return new PriorityBlockingQueue(20); |
26 |
|
|
} |
27 |
|
|
} |
28 |
|
|
|
29 |
dl |
1.1 |
public static void main(String[] args) { |
30 |
jsr166 |
1.26 |
junit.textui.TestRunner.run(suite()); |
31 |
dl |
1.1 |
} |
32 |
jsr166 |
1.29 |
|
33 |
dl |
1.1 |
public static Test suite() { |
34 |
jsr166 |
1.29 |
return newTestSuite(PriorityBlockingQueueTest.class, |
35 |
|
|
new Generic().testSuite(), |
36 |
|
|
new InitialCapacity().testSuite()); |
37 |
dl |
1.1 |
} |
38 |
|
|
|
39 |
dl |
1.3 |
private static final int NOCAP = Integer.MAX_VALUE; |
40 |
|
|
|
41 |
|
|
/** Sample Comparator */ |
42 |
jsr166 |
1.12 |
static class MyReverseComparator implements Comparator { |
43 |
dl |
1.1 |
public int compare(Object x, Object y) { |
44 |
jsr166 |
1.24 |
return ((Comparable)y).compareTo(x); |
45 |
dl |
1.1 |
} |
46 |
|
|
} |
47 |
|
|
|
48 |
|
|
/** |
49 |
|
|
* Create a queue of given size containing consecutive |
50 |
|
|
* Integers 0 ... n. |
51 |
|
|
*/ |
52 |
jsr166 |
1.38 |
private PriorityBlockingQueue<Integer> populatedQueue(int n) { |
53 |
|
|
PriorityBlockingQueue<Integer> q = |
54 |
|
|
new PriorityBlockingQueue<Integer>(n); |
55 |
dl |
1.1 |
assertTrue(q.isEmpty()); |
56 |
jsr166 |
1.16 |
for (int i = n-1; i >= 0; i-=2) |
57 |
|
|
assertTrue(q.offer(new Integer(i))); |
58 |
|
|
for (int i = (n & 1); i < n; i+=2) |
59 |
|
|
assertTrue(q.offer(new Integer(i))); |
60 |
dl |
1.1 |
assertFalse(q.isEmpty()); |
61 |
|
|
assertEquals(NOCAP, q.remainingCapacity()); |
62 |
jsr166 |
1.16 |
assertEquals(n, q.size()); |
63 |
dl |
1.1 |
return q; |
64 |
|
|
} |
65 |
jsr166 |
1.12 |
|
66 |
dl |
1.5 |
/** |
67 |
dl |
1.6 |
* A new queue has unbounded capacity |
68 |
dl |
1.5 |
*/ |
69 |
|
|
public void testConstructor1() { |
70 |
dl |
1.3 |
assertEquals(NOCAP, new PriorityBlockingQueue(SIZE).remainingCapacity()); |
71 |
dl |
1.1 |
} |
72 |
|
|
|
73 |
dl |
1.5 |
/** |
74 |
jsr166 |
1.19 |
* Constructor throws IAE if capacity argument nonpositive |
75 |
dl |
1.5 |
*/ |
76 |
|
|
public void testConstructor2() { |
77 |
dl |
1.1 |
try { |
78 |
|
|
PriorityBlockingQueue q = new PriorityBlockingQueue(0); |
79 |
dl |
1.5 |
shouldThrow(); |
80 |
jsr166 |
1.15 |
} catch (IllegalArgumentException success) {} |
81 |
dl |
1.1 |
} |
82 |
|
|
|
83 |
dl |
1.5 |
/** |
84 |
dl |
1.6 |
* Initializing from null Collection throws NPE |
85 |
dl |
1.5 |
*/ |
86 |
|
|
public void testConstructor3() { |
87 |
dl |
1.1 |
try { |
88 |
|
|
PriorityBlockingQueue q = new PriorityBlockingQueue(null); |
89 |
dl |
1.5 |
shouldThrow(); |
90 |
jsr166 |
1.15 |
} catch (NullPointerException success) {} |
91 |
dl |
1.1 |
} |
92 |
|
|
|
93 |
dl |
1.5 |
/** |
94 |
dl |
1.6 |
* Initializing from Collection of null elements throws NPE |
95 |
dl |
1.5 |
*/ |
96 |
|
|
public void testConstructor4() { |
97 |
dl |
1.1 |
try { |
98 |
dl |
1.3 |
Integer[] ints = new Integer[SIZE]; |
99 |
dl |
1.1 |
PriorityBlockingQueue q = new PriorityBlockingQueue(Arrays.asList(ints)); |
100 |
dl |
1.5 |
shouldThrow(); |
101 |
jsr166 |
1.15 |
} catch (NullPointerException success) {} |
102 |
dl |
1.1 |
} |
103 |
|
|
|
104 |
dl |
1.5 |
/** |
105 |
dl |
1.6 |
* Initializing from Collection with some null elements throws NPE |
106 |
dl |
1.5 |
*/ |
107 |
|
|
public void testConstructor5() { |
108 |
dl |
1.1 |
try { |
109 |
dl |
1.3 |
Integer[] ints = new Integer[SIZE]; |
110 |
|
|
for (int i = 0; i < SIZE-1; ++i) |
111 |
dl |
1.1 |
ints[i] = new Integer(i); |
112 |
|
|
PriorityBlockingQueue q = new PriorityBlockingQueue(Arrays.asList(ints)); |
113 |
dl |
1.5 |
shouldThrow(); |
114 |
jsr166 |
1.15 |
} catch (NullPointerException success) {} |
115 |
dl |
1.1 |
} |
116 |
|
|
|
117 |
dl |
1.5 |
/** |
118 |
dl |
1.6 |
* Queue contains all elements of collection used to initialize |
119 |
dl |
1.5 |
*/ |
120 |
|
|
public void testConstructor6() { |
121 |
jsr166 |
1.15 |
Integer[] ints = new Integer[SIZE]; |
122 |
|
|
for (int i = 0; i < SIZE; ++i) |
123 |
|
|
ints[i] = new Integer(i); |
124 |
|
|
PriorityBlockingQueue q = new PriorityBlockingQueue(Arrays.asList(ints)); |
125 |
|
|
for (int i = 0; i < SIZE; ++i) |
126 |
|
|
assertEquals(ints[i], q.poll()); |
127 |
dl |
1.1 |
} |
128 |
|
|
|
129 |
dl |
1.5 |
/** |
130 |
dl |
1.6 |
* The comparator used in constructor is used |
131 |
dl |
1.5 |
*/ |
132 |
|
|
public void testConstructor7() { |
133 |
jsr166 |
1.15 |
MyReverseComparator cmp = new MyReverseComparator(); |
134 |
|
|
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE, cmp); |
135 |
|
|
assertEquals(cmp, q.comparator()); |
136 |
|
|
Integer[] ints = new Integer[SIZE]; |
137 |
|
|
for (int i = 0; i < SIZE; ++i) |
138 |
|
|
ints[i] = new Integer(i); |
139 |
|
|
q.addAll(Arrays.asList(ints)); |
140 |
|
|
for (int i = SIZE-1; i >= 0; --i) |
141 |
|
|
assertEquals(ints[i], q.poll()); |
142 |
dl |
1.1 |
} |
143 |
|
|
|
144 |
dl |
1.5 |
/** |
145 |
dl |
1.6 |
* isEmpty is true before add, false after |
146 |
dl |
1.5 |
*/ |
147 |
dl |
1.1 |
public void testEmpty() { |
148 |
|
|
PriorityBlockingQueue q = new PriorityBlockingQueue(2); |
149 |
|
|
assertTrue(q.isEmpty()); |
150 |
|
|
assertEquals(NOCAP, q.remainingCapacity()); |
151 |
dl |
1.6 |
q.add(one); |
152 |
dl |
1.1 |
assertFalse(q.isEmpty()); |
153 |
dl |
1.6 |
q.add(two); |
154 |
dl |
1.1 |
q.remove(); |
155 |
|
|
q.remove(); |
156 |
|
|
assertTrue(q.isEmpty()); |
157 |
|
|
} |
158 |
|
|
|
159 |
dl |
1.5 |
/** |
160 |
dl |
1.9 |
* remainingCapacity does not change when elements added or removed, |
161 |
dl |
1.6 |
* but size does |
162 |
dl |
1.5 |
*/ |
163 |
|
|
public void testRemainingCapacity() { |
164 |
dl |
1.3 |
PriorityBlockingQueue q = populatedQueue(SIZE); |
165 |
|
|
for (int i = 0; i < SIZE; ++i) { |
166 |
dl |
1.1 |
assertEquals(NOCAP, q.remainingCapacity()); |
167 |
dl |
1.3 |
assertEquals(SIZE-i, q.size()); |
168 |
dl |
1.1 |
q.remove(); |
169 |
|
|
} |
170 |
dl |
1.3 |
for (int i = 0; i < SIZE; ++i) { |
171 |
dl |
1.1 |
assertEquals(NOCAP, q.remainingCapacity()); |
172 |
|
|
assertEquals(i, q.size()); |
173 |
|
|
q.add(new Integer(i)); |
174 |
|
|
} |
175 |
|
|
} |
176 |
|
|
|
177 |
dl |
1.5 |
/** |
178 |
dl |
1.6 |
* offer(null) throws NPE |
179 |
dl |
1.5 |
*/ |
180 |
|
|
public void testOfferNull() { |
181 |
jsr166 |
1.16 |
try { |
182 |
dl |
1.1 |
PriorityBlockingQueue q = new PriorityBlockingQueue(1); |
183 |
|
|
q.offer(null); |
184 |
dl |
1.5 |
shouldThrow(); |
185 |
jsr166 |
1.15 |
} catch (NullPointerException success) {} |
186 |
dl |
1.1 |
} |
187 |
|
|
|
188 |
dl |
1.5 |
/** |
189 |
dl |
1.7 |
* add(null) throws NPE |
190 |
|
|
*/ |
191 |
|
|
public void testAddNull() { |
192 |
jsr166 |
1.16 |
try { |
193 |
dl |
1.7 |
PriorityBlockingQueue q = new PriorityBlockingQueue(1); |
194 |
|
|
q.add(null); |
195 |
|
|
shouldThrow(); |
196 |
jsr166 |
1.15 |
} catch (NullPointerException success) {} |
197 |
dl |
1.7 |
} |
198 |
|
|
|
199 |
|
|
/** |
200 |
dl |
1.6 |
* Offer of comparable element succeeds |
201 |
dl |
1.5 |
*/ |
202 |
dl |
1.1 |
public void testOffer() { |
203 |
|
|
PriorityBlockingQueue q = new PriorityBlockingQueue(1); |
204 |
dl |
1.6 |
assertTrue(q.offer(zero)); |
205 |
|
|
assertTrue(q.offer(one)); |
206 |
dl |
1.1 |
} |
207 |
|
|
|
208 |
dl |
1.5 |
/** |
209 |
dl |
1.6 |
* Offer of non-Comparable throws CCE |
210 |
dl |
1.5 |
*/ |
211 |
dl |
1.1 |
public void testOfferNonComparable() { |
212 |
|
|
try { |
213 |
|
|
PriorityBlockingQueue q = new PriorityBlockingQueue(1); |
214 |
|
|
q.offer(new Object()); |
215 |
|
|
q.offer(new Object()); |
216 |
|
|
q.offer(new Object()); |
217 |
dl |
1.5 |
shouldThrow(); |
218 |
jsr166 |
1.15 |
} catch (ClassCastException success) {} |
219 |
dl |
1.1 |
} |
220 |
|
|
|
221 |
dl |
1.5 |
/** |
222 |
dl |
1.6 |
* add of comparable succeeds |
223 |
dl |
1.5 |
*/ |
224 |
|
|
public void testAdd() { |
225 |
dl |
1.3 |
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE); |
226 |
|
|
for (int i = 0; i < SIZE; ++i) { |
227 |
dl |
1.1 |
assertEquals(i, q.size()); |
228 |
|
|
assertTrue(q.add(new Integer(i))); |
229 |
|
|
} |
230 |
|
|
} |
231 |
|
|
|
232 |
dl |
1.5 |
/** |
233 |
dl |
1.6 |
* addAll(null) throws NPE |
234 |
dl |
1.5 |
*/ |
235 |
|
|
public void testAddAll1() { |
236 |
dl |
1.1 |
try { |
237 |
|
|
PriorityBlockingQueue q = new PriorityBlockingQueue(1); |
238 |
|
|
q.addAll(null); |
239 |
dl |
1.5 |
shouldThrow(); |
240 |
jsr166 |
1.15 |
} catch (NullPointerException success) {} |
241 |
dl |
1.1 |
} |
242 |
dl |
1.7 |
|
243 |
|
|
/** |
244 |
|
|
* addAll(this) throws IAE |
245 |
|
|
*/ |
246 |
|
|
public void testAddAllSelf() { |
247 |
|
|
try { |
248 |
|
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
249 |
|
|
q.addAll(q); |
250 |
|
|
shouldThrow(); |
251 |
jsr166 |
1.15 |
} catch (IllegalArgumentException success) {} |
252 |
dl |
1.7 |
} |
253 |
|
|
|
254 |
dl |
1.5 |
/** |
255 |
dl |
1.6 |
* addAll of a collection with null elements throws NPE |
256 |
dl |
1.5 |
*/ |
257 |
|
|
public void testAddAll2() { |
258 |
dl |
1.1 |
try { |
259 |
dl |
1.3 |
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE); |
260 |
|
|
Integer[] ints = new Integer[SIZE]; |
261 |
dl |
1.1 |
q.addAll(Arrays.asList(ints)); |
262 |
dl |
1.5 |
shouldThrow(); |
263 |
jsr166 |
1.15 |
} catch (NullPointerException success) {} |
264 |
dl |
1.1 |
} |
265 |
jsr166 |
1.27 |
|
266 |
dl |
1.5 |
/** |
267 |
dl |
1.6 |
* addAll of a collection with any null elements throws NPE after |
268 |
|
|
* possibly adding some elements |
269 |
dl |
1.5 |
*/ |
270 |
|
|
public void testAddAll3() { |
271 |
dl |
1.1 |
try { |
272 |
dl |
1.3 |
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE); |
273 |
|
|
Integer[] ints = new Integer[SIZE]; |
274 |
|
|
for (int i = 0; i < SIZE-1; ++i) |
275 |
dl |
1.1 |
ints[i] = new Integer(i); |
276 |
|
|
q.addAll(Arrays.asList(ints)); |
277 |
dl |
1.5 |
shouldThrow(); |
278 |
jsr166 |
1.15 |
} catch (NullPointerException success) {} |
279 |
dl |
1.1 |
} |
280 |
|
|
|
281 |
dl |
1.5 |
/** |
282 |
dl |
1.6 |
* Queue contains all elements of successful addAll |
283 |
dl |
1.5 |
*/ |
284 |
|
|
public void testAddAll5() { |
285 |
jsr166 |
1.15 |
Integer[] empty = new Integer[0]; |
286 |
|
|
Integer[] ints = new Integer[SIZE]; |
287 |
|
|
for (int i = SIZE-1; i >= 0; --i) |
288 |
|
|
ints[i] = new Integer(i); |
289 |
|
|
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE); |
290 |
|
|
assertFalse(q.addAll(Arrays.asList(empty))); |
291 |
|
|
assertTrue(q.addAll(Arrays.asList(ints))); |
292 |
|
|
for (int i = 0; i < SIZE; ++i) |
293 |
|
|
assertEquals(ints[i], q.poll()); |
294 |
dl |
1.1 |
} |
295 |
|
|
|
296 |
dl |
1.5 |
/** |
297 |
dl |
1.6 |
* put(null) throws NPE |
298 |
dl |
1.5 |
*/ |
299 |
dl |
1.1 |
public void testPutNull() { |
300 |
jsr166 |
1.16 |
try { |
301 |
dl |
1.3 |
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE); |
302 |
dl |
1.1 |
q.put(null); |
303 |
dl |
1.5 |
shouldThrow(); |
304 |
jsr166 |
1.15 |
} catch (NullPointerException success) {} |
305 |
dl |
1.1 |
} |
306 |
|
|
|
307 |
dl |
1.5 |
/** |
308 |
dl |
1.6 |
* all elements successfully put are contained |
309 |
dl |
1.5 |
*/ |
310 |
dl |
1.1 |
public void testPut() { |
311 |
jsr166 |
1.15 |
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE); |
312 |
|
|
for (int i = 0; i < SIZE; ++i) { |
313 |
|
|
Integer I = new Integer(i); |
314 |
|
|
q.put(I); |
315 |
|
|
assertTrue(q.contains(I)); |
316 |
dl |
1.1 |
} |
317 |
jsr166 |
1.15 |
assertEquals(SIZE, q.size()); |
318 |
dl |
1.1 |
} |
319 |
|
|
|
320 |
dl |
1.5 |
/** |
321 |
dl |
1.6 |
* put doesn't block waiting for take |
322 |
dl |
1.5 |
*/ |
323 |
jsr166 |
1.15 |
public void testPutWithTake() throws InterruptedException { |
324 |
dl |
1.1 |
final PriorityBlockingQueue q = new PriorityBlockingQueue(2); |
325 |
jsr166 |
1.15 |
final int size = 4; |
326 |
|
|
Thread t = new Thread(new CheckedRunnable() { |
327 |
|
|
public void realRun() { |
328 |
|
|
for (int i = 0; i < size; i++) |
329 |
|
|
q.put(new Integer(0)); |
330 |
|
|
}}); |
331 |
|
|
|
332 |
|
|
t.start(); |
333 |
|
|
Thread.sleep(SHORT_DELAY_MS); |
334 |
|
|
assertEquals(q.size(), size); |
335 |
|
|
q.take(); |
336 |
|
|
t.interrupt(); |
337 |
|
|
t.join(); |
338 |
dl |
1.1 |
} |
339 |
|
|
|
340 |
dl |
1.5 |
/** |
341 |
dl |
1.6 |
* timed offer does not time out |
342 |
dl |
1.5 |
*/ |
343 |
jsr166 |
1.15 |
public void testTimedOffer() throws InterruptedException { |
344 |
dl |
1.1 |
final PriorityBlockingQueue q = new PriorityBlockingQueue(2); |
345 |
jsr166 |
1.18 |
Thread t = new Thread(new CheckedRunnable() { |
346 |
|
|
public void realRun() { |
347 |
|
|
q.put(new Integer(0)); |
348 |
|
|
q.put(new Integer(0)); |
349 |
jsr166 |
1.22 |
assertTrue(q.offer(new Integer(0), SHORT_DELAY_MS, MILLISECONDS)); |
350 |
|
|
assertTrue(q.offer(new Integer(0), LONG_DELAY_MS, MILLISECONDS)); |
351 |
jsr166 |
1.18 |
}}); |
352 |
jsr166 |
1.12 |
|
353 |
jsr166 |
1.15 |
t.start(); |
354 |
|
|
Thread.sleep(SMALL_DELAY_MS); |
355 |
|
|
t.interrupt(); |
356 |
|
|
t.join(); |
357 |
dl |
1.1 |
} |
358 |
|
|
|
359 |
dl |
1.5 |
/** |
360 |
dl |
1.6 |
* take retrieves elements in priority order |
361 |
dl |
1.5 |
*/ |
362 |
jsr166 |
1.15 |
public void testTake() throws InterruptedException { |
363 |
|
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
364 |
|
|
for (int i = 0; i < SIZE; ++i) { |
365 |
jsr166 |
1.24 |
assertEquals(i, q.take()); |
366 |
jsr166 |
1.15 |
} |
367 |
dl |
1.1 |
} |
368 |
|
|
|
369 |
dl |
1.5 |
/** |
370 |
dl |
1.6 |
* Take removes existing elements until empty, then blocks interruptibly |
371 |
dl |
1.5 |
*/ |
372 |
jsr166 |
1.15 |
public void testBlockingTake() throws InterruptedException { |
373 |
jsr166 |
1.23 |
final PriorityBlockingQueue q = populatedQueue(SIZE); |
374 |
|
|
Thread t = new Thread(new CheckedRunnable() { |
375 |
jsr166 |
1.15 |
public void realRun() throws InterruptedException { |
376 |
|
|
for (int i = 0; i < SIZE; ++i) { |
377 |
jsr166 |
1.23 |
assertEquals(i, q.take()); |
378 |
jsr166 |
1.15 |
} |
379 |
jsr166 |
1.23 |
try { |
380 |
|
|
q.take(); |
381 |
|
|
shouldThrow(); |
382 |
|
|
} catch (InterruptedException success) {} |
383 |
jsr166 |
1.15 |
}}); |
384 |
|
|
|
385 |
dl |
1.1 |
t.start(); |
386 |
jsr166 |
1.15 |
Thread.sleep(SHORT_DELAY_MS); |
387 |
|
|
t.interrupt(); |
388 |
|
|
t.join(); |
389 |
dl |
1.1 |
} |
390 |
|
|
|
391 |
|
|
|
392 |
dl |
1.5 |
/** |
393 |
dl |
1.6 |
* poll succeeds unless empty |
394 |
dl |
1.5 |
*/ |
395 |
|
|
public void testPoll() { |
396 |
dl |
1.3 |
PriorityBlockingQueue q = populatedQueue(SIZE); |
397 |
|
|
for (int i = 0; i < SIZE; ++i) { |
398 |
jsr166 |
1.24 |
assertEquals(i, q.poll()); |
399 |
dl |
1.1 |
} |
400 |
jsr166 |
1.16 |
assertNull(q.poll()); |
401 |
dl |
1.1 |
} |
402 |
|
|
|
403 |
dl |
1.5 |
/** |
404 |
jsr166 |
1.34 |
* timed poll with zero timeout succeeds when non-empty, else times out |
405 |
dl |
1.5 |
*/ |
406 |
jsr166 |
1.15 |
public void testTimedPoll0() throws InterruptedException { |
407 |
|
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
408 |
|
|
for (int i = 0; i < SIZE; ++i) { |
409 |
jsr166 |
1.24 |
assertEquals(i, q.poll(0, MILLISECONDS)); |
410 |
jsr166 |
1.15 |
} |
411 |
jsr166 |
1.17 |
assertNull(q.poll(0, MILLISECONDS)); |
412 |
dl |
1.1 |
} |
413 |
|
|
|
414 |
dl |
1.5 |
/** |
415 |
jsr166 |
1.34 |
* timed poll with nonzero timeout succeeds when non-empty, else times out |
416 |
dl |
1.5 |
*/ |
417 |
jsr166 |
1.15 |
public void testTimedPoll() throws InterruptedException { |
418 |
|
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
419 |
|
|
for (int i = 0; i < SIZE; ++i) { |
420 |
jsr166 |
1.24 |
assertEquals(i, q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
421 |
jsr166 |
1.15 |
} |
422 |
jsr166 |
1.17 |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
423 |
dl |
1.1 |
} |
424 |
|
|
|
425 |
dl |
1.5 |
/** |
426 |
dl |
1.6 |
* Interrupted timed poll throws InterruptedException instead of |
427 |
|
|
* returning timeout status |
428 |
dl |
1.5 |
*/ |
429 |
jsr166 |
1.15 |
public void testInterruptedTimedPoll() throws InterruptedException { |
430 |
|
|
Thread t = new Thread(new CheckedRunnable() { |
431 |
|
|
public void realRun() throws InterruptedException { |
432 |
|
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
433 |
|
|
for (int i = 0; i < SIZE; ++i) { |
434 |
jsr166 |
1.24 |
assertEquals(i, q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
435 |
jsr166 |
1.15 |
} |
436 |
|
|
try { |
437 |
jsr166 |
1.20 |
q.poll(SMALL_DELAY_MS, MILLISECONDS); |
438 |
jsr166 |
1.18 |
shouldThrow(); |
439 |
jsr166 |
1.15 |
} catch (InterruptedException success) {} |
440 |
|
|
}}); |
441 |
|
|
|
442 |
dl |
1.1 |
t.start(); |
443 |
jsr166 |
1.15 |
Thread.sleep(SHORT_DELAY_MS); |
444 |
|
|
t.interrupt(); |
445 |
|
|
t.join(); |
446 |
dl |
1.1 |
} |
447 |
|
|
|
448 |
dl |
1.5 |
/** |
449 |
dl |
1.6 |
* peek returns next element, or null if empty |
450 |
dl |
1.5 |
*/ |
451 |
|
|
public void testPeek() { |
452 |
dl |
1.3 |
PriorityBlockingQueue q = populatedQueue(SIZE); |
453 |
|
|
for (int i = 0; i < SIZE; ++i) { |
454 |
jsr166 |
1.24 |
assertEquals(i, q.peek()); |
455 |
|
|
assertEquals(i, q.poll()); |
456 |
dl |
1.1 |
assertTrue(q.peek() == null || |
457 |
jsr166 |
1.24 |
!q.peek().equals(i)); |
458 |
dl |
1.1 |
} |
459 |
jsr166 |
1.16 |
assertNull(q.peek()); |
460 |
dl |
1.1 |
} |
461 |
|
|
|
462 |
dl |
1.5 |
/** |
463 |
dl |
1.6 |
* element returns next element, or throws NSEE if empty |
464 |
dl |
1.5 |
*/ |
465 |
|
|
public void testElement() { |
466 |
dl |
1.3 |
PriorityBlockingQueue q = populatedQueue(SIZE); |
467 |
|
|
for (int i = 0; i < SIZE; ++i) { |
468 |
jsr166 |
1.24 |
assertEquals(i, q.element()); |
469 |
|
|
assertEquals(i, q.poll()); |
470 |
dl |
1.1 |
} |
471 |
|
|
try { |
472 |
|
|
q.element(); |
473 |
dl |
1.5 |
shouldThrow(); |
474 |
jsr166 |
1.15 |
} catch (NoSuchElementException success) {} |
475 |
dl |
1.1 |
} |
476 |
|
|
|
477 |
dl |
1.5 |
/** |
478 |
dl |
1.6 |
* remove removes next element, or throws NSEE if empty |
479 |
dl |
1.5 |
*/ |
480 |
|
|
public void testRemove() { |
481 |
dl |
1.3 |
PriorityBlockingQueue q = populatedQueue(SIZE); |
482 |
|
|
for (int i = 0; i < SIZE; ++i) { |
483 |
jsr166 |
1.24 |
assertEquals(i, q.remove()); |
484 |
dl |
1.1 |
} |
485 |
|
|
try { |
486 |
|
|
q.remove(); |
487 |
dl |
1.5 |
shouldThrow(); |
488 |
jsr166 |
1.15 |
} catch (NoSuchElementException success) {} |
489 |
dl |
1.1 |
} |
490 |
|
|
|
491 |
dl |
1.5 |
/** |
492 |
dl |
1.6 |
* remove(x) removes x and returns true if present |
493 |
dl |
1.5 |
*/ |
494 |
|
|
public void testRemoveElement() { |
495 |
dl |
1.3 |
PriorityBlockingQueue q = populatedQueue(SIZE); |
496 |
|
|
for (int i = 1; i < SIZE; i+=2) { |
497 |
jsr166 |
1.39 |
assertTrue(q.contains(i)); |
498 |
|
|
assertTrue(q.remove(i)); |
499 |
|
|
assertFalse(q.contains(i)); |
500 |
|
|
assertTrue(q.contains(i-1)); |
501 |
dl |
1.1 |
} |
502 |
dl |
1.3 |
for (int i = 0; i < SIZE; i+=2) { |
503 |
jsr166 |
1.39 |
assertTrue(q.contains(i)); |
504 |
|
|
assertTrue(q.remove(i)); |
505 |
|
|
assertFalse(q.contains(i)); |
506 |
|
|
assertFalse(q.remove(i+1)); |
507 |
|
|
assertFalse(q.contains(i+1)); |
508 |
dl |
1.1 |
} |
509 |
dl |
1.2 |
assertTrue(q.isEmpty()); |
510 |
dl |
1.1 |
} |
511 |
jsr166 |
1.12 |
|
512 |
dl |
1.5 |
/** |
513 |
dl |
1.6 |
* contains(x) reports true when elements added but not yet removed |
514 |
dl |
1.5 |
*/ |
515 |
|
|
public void testContains() { |
516 |
dl |
1.3 |
PriorityBlockingQueue q = populatedQueue(SIZE); |
517 |
|
|
for (int i = 0; i < SIZE; ++i) { |
518 |
dl |
1.1 |
assertTrue(q.contains(new Integer(i))); |
519 |
|
|
q.poll(); |
520 |
|
|
assertFalse(q.contains(new Integer(i))); |
521 |
|
|
} |
522 |
|
|
} |
523 |
|
|
|
524 |
dl |
1.5 |
/** |
525 |
dl |
1.6 |
* clear removes all elements |
526 |
dl |
1.5 |
*/ |
527 |
|
|
public void testClear() { |
528 |
dl |
1.3 |
PriorityBlockingQueue q = populatedQueue(SIZE); |
529 |
dl |
1.1 |
q.clear(); |
530 |
|
|
assertTrue(q.isEmpty()); |
531 |
|
|
assertEquals(0, q.size()); |
532 |
dl |
1.11 |
q.add(one); |
533 |
dl |
1.1 |
assertFalse(q.isEmpty()); |
534 |
dl |
1.11 |
assertTrue(q.contains(one)); |
535 |
dl |
1.1 |
q.clear(); |
536 |
|
|
assertTrue(q.isEmpty()); |
537 |
|
|
} |
538 |
|
|
|
539 |
dl |
1.5 |
/** |
540 |
dl |
1.6 |
* containsAll(c) is true when c contains a subset of elements |
541 |
dl |
1.5 |
*/ |
542 |
|
|
public void testContainsAll() { |
543 |
dl |
1.3 |
PriorityBlockingQueue q = populatedQueue(SIZE); |
544 |
|
|
PriorityBlockingQueue p = new PriorityBlockingQueue(SIZE); |
545 |
|
|
for (int i = 0; i < SIZE; ++i) { |
546 |
dl |
1.1 |
assertTrue(q.containsAll(p)); |
547 |
|
|
assertFalse(p.containsAll(q)); |
548 |
|
|
p.add(new Integer(i)); |
549 |
|
|
} |
550 |
|
|
assertTrue(p.containsAll(q)); |
551 |
|
|
} |
552 |
|
|
|
553 |
dl |
1.5 |
/** |
554 |
dl |
1.6 |
* retainAll(c) retains only those elements of c and reports true if changed |
555 |
dl |
1.5 |
*/ |
556 |
|
|
public void testRetainAll() { |
557 |
dl |
1.3 |
PriorityBlockingQueue q = populatedQueue(SIZE); |
558 |
|
|
PriorityBlockingQueue p = populatedQueue(SIZE); |
559 |
|
|
for (int i = 0; i < SIZE; ++i) { |
560 |
dl |
1.1 |
boolean changed = q.retainAll(p); |
561 |
|
|
if (i == 0) |
562 |
|
|
assertFalse(changed); |
563 |
|
|
else |
564 |
|
|
assertTrue(changed); |
565 |
|
|
|
566 |
|
|
assertTrue(q.containsAll(p)); |
567 |
dl |
1.3 |
assertEquals(SIZE-i, q.size()); |
568 |
dl |
1.1 |
p.remove(); |
569 |
|
|
} |
570 |
|
|
} |
571 |
|
|
|
572 |
dl |
1.5 |
/** |
573 |
dl |
1.6 |
* removeAll(c) removes only those elements of c and reports true if changed |
574 |
dl |
1.5 |
*/ |
575 |
|
|
public void testRemoveAll() { |
576 |
dl |
1.3 |
for (int i = 1; i < SIZE; ++i) { |
577 |
|
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
578 |
|
|
PriorityBlockingQueue p = populatedQueue(i); |
579 |
dl |
1.1 |
assertTrue(q.removeAll(p)); |
580 |
dl |
1.3 |
assertEquals(SIZE-i, q.size()); |
581 |
dl |
1.1 |
for (int j = 0; j < i; ++j) { |
582 |
|
|
Integer I = (Integer)(p.remove()); |
583 |
|
|
assertFalse(q.contains(I)); |
584 |
|
|
} |
585 |
|
|
} |
586 |
|
|
} |
587 |
|
|
|
588 |
dl |
1.5 |
/** |
589 |
jsr166 |
1.30 |
* toArray contains all elements |
590 |
dl |
1.5 |
*/ |
591 |
jsr166 |
1.15 |
public void testToArray() throws InterruptedException { |
592 |
dl |
1.3 |
PriorityBlockingQueue q = populatedQueue(SIZE); |
593 |
jsr166 |
1.16 |
Object[] o = q.toArray(); |
594 |
dl |
1.1 |
Arrays.sort(o); |
595 |
jsr166 |
1.16 |
for (int i = 0; i < o.length; i++) |
596 |
jsr166 |
1.37 |
assertSame(o[i], q.take()); |
597 |
dl |
1.1 |
} |
598 |
|
|
|
599 |
dl |
1.5 |
/** |
600 |
dl |
1.6 |
* toArray(a) contains all elements |
601 |
dl |
1.5 |
*/ |
602 |
jsr166 |
1.15 |
public void testToArray2() throws InterruptedException { |
603 |
jsr166 |
1.38 |
PriorityBlockingQueue<Integer> q = populatedQueue(SIZE); |
604 |
jsr166 |
1.16 |
Integer[] ints = new Integer[SIZE]; |
605 |
jsr166 |
1.38 |
Integer[] array = q.toArray(ints); |
606 |
|
|
assertSame(ints, array); |
607 |
dl |
1.1 |
Arrays.sort(ints); |
608 |
jsr166 |
1.15 |
for (int i = 0; i < ints.length; i++) |
609 |
jsr166 |
1.37 |
assertSame(ints[i], q.take()); |
610 |
dl |
1.1 |
} |
611 |
dl |
1.7 |
|
612 |
|
|
/** |
613 |
jsr166 |
1.36 |
* toArray(null) throws NullPointerException |
614 |
dl |
1.7 |
*/ |
615 |
jsr166 |
1.36 |
public void testToArray_NullArg() { |
616 |
jsr166 |
1.24 |
PriorityBlockingQueue q = populatedQueue(SIZE); |
617 |
jsr166 |
1.16 |
try { |
618 |
jsr166 |
1.36 |
q.toArray(null); |
619 |
jsr166 |
1.16 |
shouldThrow(); |
620 |
|
|
} catch (NullPointerException success) {} |
621 |
dl |
1.7 |
} |
622 |
|
|
|
623 |
|
|
/** |
624 |
jsr166 |
1.35 |
* toArray(incompatible array type) throws ArrayStoreException |
625 |
dl |
1.7 |
*/ |
626 |
|
|
public void testToArray1_BadArg() { |
627 |
jsr166 |
1.24 |
PriorityBlockingQueue q = populatedQueue(SIZE); |
628 |
jsr166 |
1.16 |
try { |
629 |
jsr166 |
1.35 |
q.toArray(new String[10]); |
630 |
jsr166 |
1.16 |
shouldThrow(); |
631 |
jsr166 |
1.19 |
} catch (ArrayStoreException success) {} |
632 |
dl |
1.7 |
} |
633 |
jsr166 |
1.12 |
|
634 |
dl |
1.5 |
/** |
635 |
dl |
1.6 |
* iterator iterates through all elements |
636 |
dl |
1.5 |
*/ |
637 |
|
|
public void testIterator() { |
638 |
dl |
1.3 |
PriorityBlockingQueue q = populatedQueue(SIZE); |
639 |
dl |
1.1 |
int i = 0; |
640 |
jsr166 |
1.16 |
Iterator it = q.iterator(); |
641 |
jsr166 |
1.13 |
while (it.hasNext()) { |
642 |
dl |
1.1 |
assertTrue(q.contains(it.next())); |
643 |
|
|
++i; |
644 |
|
|
} |
645 |
dl |
1.3 |
assertEquals(i, SIZE); |
646 |
dl |
1.1 |
} |
647 |
|
|
|
648 |
dl |
1.5 |
/** |
649 |
dl |
1.6 |
* iterator.remove removes current element |
650 |
dl |
1.5 |
*/ |
651 |
jsr166 |
1.26 |
public void testIteratorRemove() { |
652 |
dl |
1.1 |
final PriorityBlockingQueue q = new PriorityBlockingQueue(3); |
653 |
|
|
q.add(new Integer(2)); |
654 |
|
|
q.add(new Integer(1)); |
655 |
|
|
q.add(new Integer(3)); |
656 |
|
|
|
657 |
|
|
Iterator it = q.iterator(); |
658 |
|
|
it.next(); |
659 |
|
|
it.remove(); |
660 |
|
|
|
661 |
|
|
it = q.iterator(); |
662 |
|
|
assertEquals(it.next(), new Integer(2)); |
663 |
|
|
assertEquals(it.next(), new Integer(3)); |
664 |
|
|
assertFalse(it.hasNext()); |
665 |
|
|
} |
666 |
|
|
|
667 |
|
|
|
668 |
dl |
1.5 |
/** |
669 |
dl |
1.6 |
* toString contains toStrings of elements |
670 |
dl |
1.5 |
*/ |
671 |
|
|
public void testToString() { |
672 |
dl |
1.3 |
PriorityBlockingQueue q = populatedQueue(SIZE); |
673 |
dl |
1.1 |
String s = q.toString(); |
674 |
dl |
1.3 |
for (int i = 0; i < SIZE; ++i) { |
675 |
dl |
1.1 |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
676 |
|
|
} |
677 |
jsr166 |
1.12 |
} |
678 |
dl |
1.1 |
|
679 |
dl |
1.5 |
/** |
680 |
dl |
1.6 |
* offer transfers elements across Executor tasks |
681 |
dl |
1.5 |
*/ |
682 |
dl |
1.1 |
public void testPollInExecutor() { |
683 |
|
|
final PriorityBlockingQueue q = new PriorityBlockingQueue(2); |
684 |
|
|
ExecutorService executor = Executors.newFixedThreadPool(2); |
685 |
jsr166 |
1.15 |
executor.execute(new CheckedRunnable() { |
686 |
|
|
public void realRun() throws InterruptedException { |
687 |
jsr166 |
1.25 |
assertNull(q.poll()); |
688 |
|
|
assertSame(one, q.poll(MEDIUM_DELAY_MS, MILLISECONDS)); |
689 |
|
|
assertTrue(q.isEmpty()); |
690 |
jsr166 |
1.15 |
}}); |
691 |
|
|
|
692 |
|
|
executor.execute(new CheckedRunnable() { |
693 |
|
|
public void realRun() throws InterruptedException { |
694 |
|
|
Thread.sleep(SMALL_DELAY_MS); |
695 |
jsr166 |
1.25 |
q.put(one); |
696 |
jsr166 |
1.15 |
}}); |
697 |
jsr166 |
1.12 |
|
698 |
dl |
1.3 |
joinPool(executor); |
699 |
dl |
1.2 |
} |
700 |
|
|
|
701 |
dl |
1.5 |
/** |
702 |
jsr166 |
1.12 |
* A deserialized serialized queue has same elements |
703 |
dl |
1.5 |
*/ |
704 |
jsr166 |
1.15 |
public void testSerialization() throws Exception { |
705 |
dl |
1.3 |
PriorityBlockingQueue q = populatedQueue(SIZE); |
706 |
jsr166 |
1.15 |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
707 |
|
|
ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout)); |
708 |
|
|
out.writeObject(q); |
709 |
|
|
out.close(); |
710 |
|
|
|
711 |
|
|
ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray()); |
712 |
|
|
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); |
713 |
|
|
PriorityBlockingQueue r = (PriorityBlockingQueue)in.readObject(); |
714 |
|
|
assertEquals(q.size(), r.size()); |
715 |
|
|
while (!q.isEmpty()) |
716 |
|
|
assertEquals(q.remove(), r.remove()); |
717 |
dl |
1.1 |
} |
718 |
dl |
1.7 |
|
719 |
|
|
/** |
720 |
|
|
* drainTo(null) throws NPE |
721 |
jsr166 |
1.12 |
*/ |
722 |
dl |
1.7 |
public void testDrainToNull() { |
723 |
|
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
724 |
|
|
try { |
725 |
|
|
q.drainTo(null); |
726 |
|
|
shouldThrow(); |
727 |
jsr166 |
1.15 |
} catch (NullPointerException success) {} |
728 |
dl |
1.7 |
} |
729 |
|
|
|
730 |
|
|
/** |
731 |
|
|
* drainTo(this) throws IAE |
732 |
jsr166 |
1.12 |
*/ |
733 |
dl |
1.7 |
public void testDrainToSelf() { |
734 |
|
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
735 |
|
|
try { |
736 |
|
|
q.drainTo(q); |
737 |
|
|
shouldThrow(); |
738 |
jsr166 |
1.15 |
} catch (IllegalArgumentException success) {} |
739 |
dl |
1.7 |
} |
740 |
|
|
|
741 |
|
|
/** |
742 |
|
|
* drainTo(c) empties queue into another collection c |
743 |
jsr166 |
1.12 |
*/ |
744 |
dl |
1.7 |
public void testDrainTo() { |
745 |
|
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
746 |
|
|
ArrayList l = new ArrayList(); |
747 |
|
|
q.drainTo(l); |
748 |
|
|
assertEquals(q.size(), 0); |
749 |
|
|
assertEquals(l.size(), SIZE); |
750 |
jsr166 |
1.12 |
for (int i = 0; i < SIZE; ++i) |
751 |
dl |
1.7 |
assertEquals(l.get(i), new Integer(i)); |
752 |
dl |
1.11 |
q.add(zero); |
753 |
|
|
q.add(one); |
754 |
|
|
assertFalse(q.isEmpty()); |
755 |
|
|
assertTrue(q.contains(zero)); |
756 |
|
|
assertTrue(q.contains(one)); |
757 |
|
|
l.clear(); |
758 |
|
|
q.drainTo(l); |
759 |
|
|
assertEquals(q.size(), 0); |
760 |
|
|
assertEquals(l.size(), 2); |
761 |
jsr166 |
1.12 |
for (int i = 0; i < 2; ++i) |
762 |
dl |
1.11 |
assertEquals(l.get(i), new Integer(i)); |
763 |
dl |
1.7 |
} |
764 |
|
|
|
765 |
|
|
/** |
766 |
|
|
* drainTo empties queue |
767 |
jsr166 |
1.12 |
*/ |
768 |
jsr166 |
1.15 |
public void testDrainToWithActivePut() throws InterruptedException { |
769 |
dl |
1.7 |
final PriorityBlockingQueue q = populatedQueue(SIZE); |
770 |
jsr166 |
1.15 |
Thread t = new Thread(new CheckedRunnable() { |
771 |
|
|
public void realRun() { |
772 |
|
|
q.put(new Integer(SIZE+1)); |
773 |
|
|
}}); |
774 |
|
|
|
775 |
|
|
t.start(); |
776 |
|
|
ArrayList l = new ArrayList(); |
777 |
|
|
q.drainTo(l); |
778 |
|
|
assertTrue(l.size() >= SIZE); |
779 |
|
|
for (int i = 0; i < SIZE; ++i) |
780 |
|
|
assertEquals(l.get(i), new Integer(i)); |
781 |
|
|
t.join(); |
782 |
|
|
assertTrue(q.size() + l.size() >= SIZE); |
783 |
dl |
1.7 |
} |
784 |
|
|
|
785 |
|
|
/** |
786 |
|
|
* drainTo(null, n) throws NPE |
787 |
jsr166 |
1.12 |
*/ |
788 |
dl |
1.7 |
public void testDrainToNullN() { |
789 |
|
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
790 |
|
|
try { |
791 |
|
|
q.drainTo(null, 0); |
792 |
|
|
shouldThrow(); |
793 |
jsr166 |
1.15 |
} catch (NullPointerException success) {} |
794 |
dl |
1.7 |
} |
795 |
|
|
|
796 |
|
|
/** |
797 |
|
|
* drainTo(this, n) throws IAE |
798 |
jsr166 |
1.12 |
*/ |
799 |
dl |
1.7 |
public void testDrainToSelfN() { |
800 |
|
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
801 |
|
|
try { |
802 |
|
|
q.drainTo(q, 0); |
803 |
|
|
shouldThrow(); |
804 |
jsr166 |
1.15 |
} catch (IllegalArgumentException success) {} |
805 |
dl |
1.7 |
} |
806 |
|
|
|
807 |
|
|
/** |
808 |
jsr166 |
1.31 |
* drainTo(c, n) empties first min(n, size) elements of queue into c |
809 |
jsr166 |
1.12 |
*/ |
810 |
dl |
1.7 |
public void testDrainToN() { |
811 |
dl |
1.11 |
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE*2); |
812 |
dl |
1.7 |
for (int i = 0; i < SIZE + 2; ++i) { |
813 |
jsr166 |
1.13 |
for (int j = 0; j < SIZE; j++) |
814 |
dl |
1.11 |
assertTrue(q.offer(new Integer(j))); |
815 |
dl |
1.7 |
ArrayList l = new ArrayList(); |
816 |
|
|
q.drainTo(l, i); |
817 |
jsr166 |
1.32 |
int k = (i < SIZE) ? i : SIZE; |
818 |
dl |
1.11 |
assertEquals(l.size(), k); |
819 |
dl |
1.7 |
assertEquals(q.size(), SIZE-k); |
820 |
jsr166 |
1.12 |
for (int j = 0; j < k; ++j) |
821 |
dl |
1.11 |
assertEquals(l.get(j), new Integer(j)); |
822 |
|
|
while (q.poll() != null) ; |
823 |
dl |
1.7 |
} |
824 |
|
|
} |
825 |
|
|
|
826 |
dl |
1.1 |
} |