6 |
|
* Pat Fisher, Mike Judd. |
7 |
|
*/ |
8 |
|
|
9 |
< |
import junit.framework.*; |
10 |
< |
import java.util.Arrays; |
9 |
> |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
10 |
> |
|
11 |
|
import java.util.ArrayList; |
12 |
+ |
import java.util.Arrays; |
13 |
|
import java.util.Collection; |
14 |
|
import java.util.Iterator; |
15 |
|
import java.util.NoSuchElementException; |
20 |
|
import java.util.concurrent.Executors; |
21 |
|
import java.util.concurrent.ExecutorService; |
22 |
|
import java.util.concurrent.TimeUnit; |
23 |
< |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
23 |
> |
|
24 |
> |
import junit.framework.Test; |
25 |
|
|
26 |
|
public class DelayQueueTest extends JSR166TestCase { |
27 |
|
|
35 |
|
} |
36 |
|
|
37 |
|
public static void main(String[] args) { |
38 |
< |
junit.textui.TestRunner.run(suite()); |
38 |
> |
main(suite(), args); |
39 |
|
} |
40 |
|
|
41 |
|
public static Test suite() { |
43 |
|
new Generic().testSuite()); |
44 |
|
} |
45 |
|
|
44 |
– |
private static final int NOCAP = Integer.MAX_VALUE; |
45 |
– |
|
46 |
|
/** |
47 |
|
* A delayed implementation for testing. |
48 |
|
* Most tests use Pseudodelays, where delays are all elapsed |
124 |
|
private DelayQueue<PDelay> populatedQueue(int n) { |
125 |
|
DelayQueue<PDelay> q = new DelayQueue<PDelay>(); |
126 |
|
assertTrue(q.isEmpty()); |
127 |
< |
for (int i = n-1; i >= 0; i-=2) |
127 |
> |
for (int i = n-1; i >= 0; i -= 2) |
128 |
|
assertTrue(q.offer(new PDelay(i))); |
129 |
< |
for (int i = (n & 1); i < n; i+=2) |
129 |
> |
for (int i = (n & 1); i < n; i += 2) |
130 |
|
assertTrue(q.offer(new PDelay(i))); |
131 |
|
assertFalse(q.isEmpty()); |
132 |
< |
assertEquals(NOCAP, q.remainingCapacity()); |
132 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
133 |
|
assertEquals(n, q.size()); |
134 |
|
return q; |
135 |
|
} |
138 |
|
* A new queue has unbounded capacity |
139 |
|
*/ |
140 |
|
public void testConstructor1() { |
141 |
< |
assertEquals(NOCAP, new DelayQueue().remainingCapacity()); |
141 |
> |
assertEquals(Integer.MAX_VALUE, new DelayQueue().remainingCapacity()); |
142 |
|
} |
143 |
|
|
144 |
|
/** |
146 |
|
*/ |
147 |
|
public void testConstructor3() { |
148 |
|
try { |
149 |
< |
DelayQueue q = new DelayQueue(null); |
149 |
> |
new DelayQueue(null); |
150 |
|
shouldThrow(); |
151 |
|
} catch (NullPointerException success) {} |
152 |
|
} |
156 |
|
*/ |
157 |
|
public void testConstructor4() { |
158 |
|
try { |
159 |
< |
PDelay[] ints = new PDelay[SIZE]; |
160 |
< |
DelayQueue q = new DelayQueue(Arrays.asList(ints)); |
159 |
> |
new DelayQueue(Arrays.asList(new PDelay[SIZE])); |
160 |
|
shouldThrow(); |
161 |
|
} catch (NullPointerException success) {} |
162 |
|
} |
165 |
|
* Initializing from Collection with some null elements throws NPE |
166 |
|
*/ |
167 |
|
public void testConstructor5() { |
168 |
+ |
PDelay[] a = new PDelay[SIZE]; |
169 |
+ |
for (int i = 0; i < SIZE-1; ++i) |
170 |
+ |
a[i] = new PDelay(i); |
171 |
|
try { |
172 |
< |
PDelay[] ints = new PDelay[SIZE]; |
171 |
< |
for (int i = 0; i < SIZE-1; ++i) |
172 |
< |
ints[i] = new PDelay(i); |
173 |
< |
DelayQueue q = new DelayQueue(Arrays.asList(ints)); |
172 |
> |
new DelayQueue(Arrays.asList(a)); |
173 |
|
shouldThrow(); |
174 |
|
} catch (NullPointerException success) {} |
175 |
|
} |
192 |
|
public void testEmpty() { |
193 |
|
DelayQueue q = new DelayQueue(); |
194 |
|
assertTrue(q.isEmpty()); |
195 |
< |
assertEquals(NOCAP, q.remainingCapacity()); |
195 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
196 |
|
q.add(new PDelay(1)); |
197 |
|
assertFalse(q.isEmpty()); |
198 |
|
q.add(new PDelay(2)); |
202 |
|
} |
203 |
|
|
204 |
|
/** |
205 |
< |
* remainingCapacity does not change when elements added or removed, |
207 |
< |
* but size does |
205 |
> |
* remainingCapacity() always returns Integer.MAX_VALUE |
206 |
|
*/ |
207 |
|
public void testRemainingCapacity() { |
208 |
< |
DelayQueue q = populatedQueue(SIZE); |
208 |
> |
BlockingQueue q = populatedQueue(SIZE); |
209 |
|
for (int i = 0; i < SIZE; ++i) { |
210 |
< |
assertEquals(NOCAP, q.remainingCapacity()); |
210 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
211 |
|
assertEquals(SIZE-i, q.size()); |
212 |
< |
q.remove(); |
212 |
> |
assertTrue(q.remove() instanceof PDelay); |
213 |
|
} |
214 |
|
for (int i = 0; i < SIZE; ++i) { |
215 |
< |
assertEquals(NOCAP, q.remainingCapacity()); |
215 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
216 |
|
assertEquals(i, q.size()); |
217 |
< |
q.add(new PDelay(i)); |
217 |
> |
assertTrue(q.add(new PDelay(i))); |
218 |
|
} |
219 |
|
} |
220 |
|
|
242 |
|
* addAll(this) throws IAE |
243 |
|
*/ |
244 |
|
public void testAddAllSelf() { |
245 |
+ |
DelayQueue q = populatedQueue(SIZE); |
246 |
|
try { |
248 |
– |
DelayQueue q = populatedQueue(SIZE); |
247 |
|
q.addAll(q); |
248 |
|
shouldThrow(); |
249 |
|
} catch (IllegalArgumentException success) {} |
254 |
|
* possibly adding some elements |
255 |
|
*/ |
256 |
|
public void testAddAll3() { |
257 |
+ |
DelayQueue q = new DelayQueue(); |
258 |
+ |
PDelay[] a = new PDelay[SIZE]; |
259 |
+ |
for (int i = 0; i < SIZE-1; ++i) |
260 |
+ |
a[i] = new PDelay(i); |
261 |
|
try { |
262 |
< |
DelayQueue q = new DelayQueue(); |
261 |
< |
PDelay[] ints = new PDelay[SIZE]; |
262 |
< |
for (int i = 0; i < SIZE-1; ++i) |
263 |
< |
ints[i] = new PDelay(i); |
264 |
< |
q.addAll(Arrays.asList(ints)); |
262 |
> |
q.addAll(Arrays.asList(a)); |
263 |
|
shouldThrow(); |
264 |
|
} catch (NullPointerException success) {} |
265 |
|
} |
285 |
|
public void testPut() { |
286 |
|
DelayQueue q = new DelayQueue(); |
287 |
|
for (int i = 0; i < SIZE; ++i) { |
288 |
< |
PDelay I = new PDelay(i); |
289 |
< |
q.put(I); |
290 |
< |
assertTrue(q.contains(I)); |
288 |
> |
PDelay x = new PDelay(i); |
289 |
> |
q.put(x); |
290 |
> |
assertTrue(q.contains(x)); |
291 |
|
} |
292 |
|
assertEquals(SIZE, q.size()); |
293 |
|
} |
331 |
|
public void testTake() throws InterruptedException { |
332 |
|
DelayQueue q = populatedQueue(SIZE); |
333 |
|
for (int i = 0; i < SIZE; ++i) { |
334 |
< |
assertEquals(new PDelay(i), ((PDelay)q.take())); |
334 |
> |
assertEquals(new PDelay(i), q.take()); |
335 |
|
} |
336 |
|
} |
337 |
|
|
374 |
|
public void testPoll() { |
375 |
|
DelayQueue q = populatedQueue(SIZE); |
376 |
|
for (int i = 0; i < SIZE; ++i) { |
377 |
< |
assertEquals(new PDelay(i), ((PDelay)q.poll())); |
377 |
> |
assertEquals(new PDelay(i), q.poll()); |
378 |
|
} |
379 |
|
assertNull(q.poll()); |
380 |
|
} |
385 |
|
public void testTimedPoll0() throws InterruptedException { |
386 |
|
DelayQueue q = populatedQueue(SIZE); |
387 |
|
for (int i = 0; i < SIZE; ++i) { |
388 |
< |
assertEquals(new PDelay(i), ((PDelay)q.poll(0, MILLISECONDS))); |
388 |
> |
assertEquals(new PDelay(i), q.poll(0, MILLISECONDS)); |
389 |
|
} |
390 |
|
assertNull(q.poll(0, MILLISECONDS)); |
391 |
|
} |
397 |
|
DelayQueue q = populatedQueue(SIZE); |
398 |
|
for (int i = 0; i < SIZE; ++i) { |
399 |
|
long startTime = System.nanoTime(); |
400 |
< |
assertEquals(new PDelay(i), ((PDelay)q.poll(LONG_DELAY_MS, MILLISECONDS))); |
400 |
> |
assertEquals(new PDelay(i), q.poll(LONG_DELAY_MS, MILLISECONDS)); |
401 |
|
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
402 |
|
} |
403 |
|
long startTime = System.nanoTime(); |
446 |
|
public void testPeek() { |
447 |
|
DelayQueue q = populatedQueue(SIZE); |
448 |
|
for (int i = 0; i < SIZE; ++i) { |
449 |
< |
assertEquals(new PDelay(i), ((PDelay)q.peek())); |
450 |
< |
assertEquals(new PDelay(i), ((PDelay)q.poll())); |
449 |
> |
assertEquals(new PDelay(i), q.peek()); |
450 |
> |
assertEquals(new PDelay(i), q.poll()); |
451 |
|
if (q.isEmpty()) |
452 |
|
assertNull(q.peek()); |
453 |
|
else |
462 |
|
public void testElement() { |
463 |
|
DelayQueue q = populatedQueue(SIZE); |
464 |
|
for (int i = 0; i < SIZE; ++i) { |
465 |
< |
assertEquals(new PDelay(i), ((PDelay)q.element())); |
465 |
> |
assertEquals(new PDelay(i), q.element()); |
466 |
|
q.poll(); |
467 |
|
} |
468 |
|
try { |
477 |
|
public void testRemove() { |
478 |
|
DelayQueue q = populatedQueue(SIZE); |
479 |
|
for (int i = 0; i < SIZE; ++i) { |
480 |
< |
assertEquals(new PDelay(i), ((PDelay)q.remove())); |
480 |
> |
assertEquals(new PDelay(i), q.remove()); |
481 |
|
} |
482 |
|
try { |
483 |
|
q.remove(); |
505 |
|
q.clear(); |
506 |
|
assertTrue(q.isEmpty()); |
507 |
|
assertEquals(0, q.size()); |
508 |
< |
assertEquals(NOCAP, q.remainingCapacity()); |
508 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
509 |
|
PDelay x = new PDelay(1); |
510 |
|
q.add(x); |
511 |
|
assertFalse(q.isEmpty()); |
557 |
|
assertTrue(q.removeAll(p)); |
558 |
|
assertEquals(SIZE-i, q.size()); |
559 |
|
for (int j = 0; j < i; ++j) { |
560 |
< |
PDelay I = (PDelay)(p.remove()); |
561 |
< |
assertFalse(q.contains(I)); |
560 |
> |
PDelay x = (PDelay)(p.remove()); |
561 |
> |
assertFalse(q.contains(x)); |
562 |
|
} |
563 |
|
} |
564 |
|
} |
610 |
|
++i; |
611 |
|
} |
612 |
|
assertEquals(i, SIZE); |
613 |
+ |
assertIteratorExhausted(it); |
614 |
+ |
} |
615 |
+ |
|
616 |
+ |
/** |
617 |
+ |
* iterator of empty collection has no elements |
618 |
+ |
*/ |
619 |
+ |
public void testEmptyIterator() { |
620 |
+ |
assertIteratorExhausted(new DelayQueue().iterator()); |
621 |
|
} |
622 |
|
|
623 |
|
/** |