7 |
|
* Pat Fisher, Mike Judd. |
8 |
|
*/ |
9 |
|
|
10 |
< |
import junit.framework.*; |
10 |
> |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
11 |
> |
|
12 |
> |
import java.util.ArrayList; |
13 |
|
import java.util.Arrays; |
14 |
|
import java.util.Collection; |
15 |
|
import java.util.Queue; |
16 |
|
import java.util.concurrent.BlockingQueue; |
17 |
|
import java.util.concurrent.CountDownLatch; |
18 |
< |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
18 |
> |
|
19 |
> |
import junit.framework.Test; |
20 |
> |
import junit.framework.TestSuite; |
21 |
|
|
22 |
|
/** |
23 |
|
* Contains "contract" tests applicable to all BlockingQueue implementations. |
43 |
|
//---------------------------------------------------------------- |
44 |
|
// Configuration methods |
45 |
|
//---------------------------------------------------------------- |
46 |
< |
|
46 |
> |
|
47 |
|
/** Returns an empty instance of the implementation class. */ |
48 |
|
protected abstract BlockingQueue emptyCollection(); |
49 |
|
|
58 |
|
//---------------------------------------------------------------- |
59 |
|
// Tests |
60 |
|
//---------------------------------------------------------------- |
61 |
< |
|
61 |
> |
|
62 |
|
/** |
63 |
|
* offer(null) throws NullPointerException |
64 |
|
*/ |
106 |
|
} |
107 |
|
|
108 |
|
/** |
109 |
< |
* put(null) throws NullPointerException |
109 |
> |
* addAll(null) throws NullPointerException |
110 |
|
*/ |
111 |
|
public void testAddAllNull() throws InterruptedException { |
112 |
|
final Collection q = emptyCollection(); |
184 |
|
} |
185 |
|
|
186 |
|
/** |
187 |
+ |
* drainTo(c, n) returns 0 and does nothing when n <= 0 |
188 |
+ |
*/ |
189 |
+ |
public void testDrainToNonPositiveMaxElements() { |
190 |
+ |
final BlockingQueue q = emptyCollection(); |
191 |
+ |
final int[] ns = { 0, -1, -42, Integer.MIN_VALUE }; |
192 |
+ |
for (int n : ns) |
193 |
+ |
assertEquals(0, q.drainTo(new ArrayList(), n)); |
194 |
+ |
if (q.remainingCapacity() > 0) { |
195 |
+ |
// Not SynchronousQueue, that is |
196 |
+ |
Object one = makeElement(1); |
197 |
+ |
q.add(one); |
198 |
+ |
ArrayList c = new ArrayList(); |
199 |
+ |
for (int n : ns) |
200 |
+ |
assertEquals(0, q.drainTo(new ArrayList(), n)); |
201 |
+ |
assertEquals(1, q.size()); |
202 |
+ |
assertSame(one, q.poll()); |
203 |
+ |
assertTrue(c.isEmpty()); |
204 |
+ |
} |
205 |
+ |
} |
206 |
+ |
|
207 |
+ |
/** |
208 |
|
* timed poll before a delayed offer times out; after offer succeeds; |
209 |
|
* on interruption throws |
210 |
|
*/ |
235 |
|
shouldThrow(); |
236 |
|
} catch (InterruptedException success) {} |
237 |
|
assertFalse(Thread.interrupted()); |
238 |
+ |
|
239 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
240 |
|
}}); |
241 |
|
|
242 |
|
barrier.await(); |
245 |
|
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
246 |
|
|
247 |
|
barrier.await(); |
248 |
< |
assertThreadStaysAlive(t); |
248 |
> |
assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
249 |
|
t.interrupt(); |
250 |
|
awaitTermination(t); |
251 |
|
} |
267 |
|
}}); |
268 |
|
|
269 |
|
await(threadStarted); |
270 |
< |
assertThreadStaysAlive(t); |
270 |
> |
assertThreadBlocks(t, Thread.State.WAITING); |
271 |
|
t.interrupt(); |
272 |
|
awaitTermination(t); |
273 |
|
} |
308 |
|
}}); |
309 |
|
|
310 |
|
await(threadStarted); |
311 |
< |
assertThreadStaysAlive(t); |
311 |
> |
assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
312 |
|
t.interrupt(); |
313 |
|
awaitTermination(t); |
314 |
|
} |
332 |
|
awaitTermination(t); |
333 |
|
} |
334 |
|
|
335 |
+ |
/** |
336 |
+ |
* remove(x) removes x and returns true if present |
337 |
+ |
* TODO: move to superclass CollectionTest.java |
338 |
+ |
*/ |
339 |
+ |
public void testRemoveElement() { |
340 |
+ |
final BlockingQueue q = emptyCollection(); |
341 |
+ |
final int size = Math.min(q.remainingCapacity(), SIZE); |
342 |
+ |
final Object[] elts = new Object[size]; |
343 |
+ |
assertFalse(q.contains(makeElement(99))); |
344 |
+ |
assertFalse(q.remove(makeElement(99))); |
345 |
+ |
checkEmpty(q); |
346 |
+ |
for (int i = 0; i < size; i++) |
347 |
+ |
q.add(elts[i] = makeElement(i)); |
348 |
+ |
for (int i = 1; i < size; i += 2) { |
349 |
+ |
for (int pass = 0; pass < 2; pass++) { |
350 |
+ |
assertEquals((pass == 0), q.contains(elts[i])); |
351 |
+ |
assertEquals((pass == 0), q.remove(elts[i])); |
352 |
+ |
assertFalse(q.contains(elts[i])); |
353 |
+ |
assertTrue(q.contains(elts[i - 1])); |
354 |
+ |
if (i < size - 1) |
355 |
+ |
assertTrue(q.contains(elts[i + 1])); |
356 |
+ |
} |
357 |
+ |
} |
358 |
+ |
if (size > 0) |
359 |
+ |
assertTrue(q.contains(elts[0])); |
360 |
+ |
for (int i = size - 2; i >= 0; i -= 2) { |
361 |
+ |
assertTrue(q.contains(elts[i])); |
362 |
+ |
assertFalse(q.contains(elts[i + 1])); |
363 |
+ |
assertTrue(q.remove(elts[i])); |
364 |
+ |
assertFalse(q.contains(elts[i])); |
365 |
+ |
assertFalse(q.remove(elts[i + 1])); |
366 |
+ |
assertFalse(q.contains(elts[i + 1])); |
367 |
+ |
} |
368 |
+ |
checkEmpty(q); |
369 |
+ |
} |
370 |
+ |
|
371 |
|
/** For debugging. */ |
372 |
|
public void XXXXtestFails() { |
373 |
|
fail(emptyCollection().getClass().toString()); |