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