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 |
|
|
46 |
– |
private static final int NOCAP = Integer.MAX_VALUE; |
47 |
– |
|
46 |
|
/** |
47 |
|
* A delayed implementation for testing. |
48 |
|
* Most tests use Pseudodelays, where delays are all elapsed |
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 |
|
/** |
156 |
|
*/ |
157 |
|
public void testConstructor4() { |
158 |
|
try { |
159 |
< |
PDelay[] ints = new PDelay[SIZE]; |
162 |
< |
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]; |
173 |
< |
for (int i = 0; i < SIZE-1; ++i) |
174 |
< |
ints[i] = new PDelay(i); |
175 |
< |
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, |
209 |
< |
* 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()); |
211 |
< |
assertEquals(SIZE-i, q.size()); |
212 |
< |
q.remove(); |
210 |
> |
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
211 |
> |
assertEquals(SIZE - i, q.size()); |
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 { |
250 |
– |
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(); |
263 |
< |
PDelay[] ints = new PDelay[SIZE]; |
264 |
< |
for (int i = 0; i < SIZE-1; ++i) |
265 |
< |
ints[i] = new PDelay(i); |
266 |
< |
q.addAll(Arrays.asList(ints)); |
262 |
> |
q.addAll(Arrays.asList(a)); |
263 |
|
shouldThrow(); |
264 |
|
} catch (NullPointerException success) {} |
265 |
|
} |
270 |
|
public void testAddAll5() { |
271 |
|
PDelay[] empty = new PDelay[0]; |
272 |
|
PDelay[] ints = new PDelay[SIZE]; |
273 |
< |
for (int i = SIZE-1; i >= 0; --i) |
273 |
> |
for (int i = SIZE - 1; i >= 0; --i) |
274 |
|
ints[i] = new PDelay(i); |
275 |
|
DelayQueue q = new DelayQueue(); |
276 |
|
assertFalse(q.addAll(Arrays.asList(empty))); |
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()); |
542 |
|
assertTrue(changed); |
543 |
|
|
544 |
|
assertTrue(q.containsAll(p)); |
545 |
< |
assertEquals(SIZE-i, q.size()); |
545 |
> |
assertEquals(SIZE - i, q.size()); |
546 |
|
p.remove(); |
547 |
|
} |
548 |
|
} |
555 |
|
DelayQueue q = populatedQueue(SIZE); |
556 |
|
DelayQueue p = populatedQueue(i); |
557 |
|
assertTrue(q.removeAll(p)); |
558 |
< |
assertEquals(SIZE-i, q.size()); |
558 |
> |
assertEquals(SIZE - i, q.size()); |
559 |
|
for (int j = 0; j < i; ++j) { |
560 |
|
PDelay x = (PDelay)(p.remove()); |
561 |
|
assertFalse(q.contains(x)); |
753 |
|
final DelayQueue q = populatedQueue(SIZE); |
754 |
|
Thread t = new Thread(new CheckedRunnable() { |
755 |
|
public void realRun() { |
756 |
< |
q.put(new PDelay(SIZE+1)); |
756 |
> |
q.put(new PDelay(SIZE + 1)); |
757 |
|
}}); |
758 |
|
|
759 |
|
t.start(); |
773 |
|
ArrayList l = new ArrayList(); |
774 |
|
q.drainTo(l, i); |
775 |
|
int k = (i < SIZE) ? i : SIZE; |
776 |
< |
assertEquals(SIZE-k, q.size()); |
776 |
> |
assertEquals(SIZE - k, q.size()); |
777 |
|
assertEquals(k, l.size()); |
778 |
|
} |
779 |
|
} |