13 |
|
import java.io.ObjectOutputStream; |
14 |
|
import java.util.ArrayList; |
15 |
|
import java.util.Arrays; |
16 |
– |
import java.util.ConcurrentModificationException; |
16 |
|
import java.util.Iterator; |
17 |
+ |
import java.util.List; |
18 |
|
import java.util.NoSuchElementException; |
19 |
|
import java.util.concurrent.*; |
20 |
|
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
32 |
|
return new TestSuite(LinkedTransferQueueTest.class); |
33 |
|
} |
34 |
|
|
35 |
+ |
void checkEmpty(LinkedTransferQueue q) throws InterruptedException { |
36 |
+ |
assertTrue(q.isEmpty()); |
37 |
+ |
assertEquals(0, q.size()); |
38 |
+ |
assertNull(q.peek()); |
39 |
+ |
assertNull(q.poll()); |
40 |
+ |
assertNull(q.poll(0, MILLISECONDS)); |
41 |
+ |
assertEquals(q.toString(), "[]"); |
42 |
+ |
assertTrue(Arrays.equals(q.toArray(), new Object[0])); |
43 |
+ |
assertFalse(q.iterator().hasNext()); |
44 |
+ |
try { |
45 |
+ |
q.element(); |
46 |
+ |
shouldThrow(); |
47 |
+ |
} catch (NoSuchElementException success) { |
48 |
+ |
} |
49 |
+ |
try { |
50 |
+ |
q.iterator().next(); |
51 |
+ |
shouldThrow(); |
52 |
+ |
} catch (NoSuchElementException success) { |
53 |
+ |
} |
54 |
+ |
try { |
55 |
+ |
q.remove(); |
56 |
+ |
shouldThrow(); |
57 |
+ |
} catch (NoSuchElementException success) { |
58 |
+ |
} |
59 |
+ |
} |
60 |
+ |
|
61 |
|
/** |
62 |
|
* Constructor builds new queue with size being zero and empty |
63 |
|
* being true |
112 |
|
* Queue contains all elements of the collection it is initialized by |
113 |
|
*/ |
114 |
|
public void testConstructor5() { |
115 |
< |
try { |
116 |
< |
Integer[] ints = new Integer[SIZE]; |
117 |
< |
for (int i = 0; i < SIZE; ++i) { |
118 |
< |
ints[i] = i; |
119 |
< |
} |
120 |
< |
LinkedTransferQueue q |
121 |
< |
= new LinkedTransferQueue(Arrays.asList(ints)); |
122 |
< |
for (int i = 0; i < SIZE; ++i) { |
123 |
< |
assertEquals(ints[i], q.poll()); |
124 |
< |
} |
125 |
< |
} finally { |
115 |
> |
Integer[] ints = new Integer[SIZE]; |
116 |
> |
for (int i = 0; i < SIZE; ++i) { |
117 |
> |
ints[i] = i; |
118 |
> |
} |
119 |
> |
List intList = Arrays.asList(ints); |
120 |
> |
LinkedTransferQueue q |
121 |
> |
= new LinkedTransferQueue(intList); |
122 |
> |
assertEquals(q.size(), intList.size()); |
123 |
> |
assertEquals(q.toString(), intList.toString()); |
124 |
> |
assertTrue(Arrays.equals(q.toArray(), |
125 |
> |
intList.toArray())); |
126 |
> |
assertTrue(Arrays.equals(q.toArray(new Object[0]), |
127 |
> |
intList.toArray(new Object[0]))); |
128 |
> |
assertTrue(Arrays.equals(q.toArray(new Object[SIZE]), |
129 |
> |
intList.toArray(new Object[SIZE]))); |
130 |
> |
for (int i = 0; i < SIZE; ++i) { |
131 |
> |
assertEquals(ints[i], q.poll()); |
132 |
|
} |
133 |
|
} |
134 |
|
|
135 |
|
/** |
136 |
< |
* Remaining capacity never decrease nor increase on add or remove |
136 |
> |
* remainingCapacity() always returns Integer.MAX_VALUE |
137 |
|
*/ |
138 |
|
public void testRemainingCapacity() { |
139 |
|
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
261 |
|
public void testPut() { |
262 |
|
LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>(); |
263 |
|
for (int i = 0; i < SIZE; ++i) { |
264 |
+ |
assertEquals(q.size(), i); |
265 |
|
q.put(i); |
266 |
|
assertTrue(q.contains(i)); |
267 |
|
} |
235 |
– |
assertEquals(q.size(), SIZE); |
268 |
|
} |
269 |
|
|
270 |
|
/** |
295 |
|
* Take removes existing elements until empty, then blocks interruptibly |
296 |
|
*/ |
297 |
|
public void testBlockingTake() throws InterruptedException { |
298 |
+ |
final LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
299 |
|
Thread t = newStartedThread(new CheckedInterruptedRunnable() { |
300 |
|
void realRun() throws InterruptedException { |
268 |
– |
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
301 |
|
for (int i = 0; i < SIZE; ++i) { |
302 |
|
threadAssertEquals(i, (int) q.take()); |
303 |
|
} |
304 |
|
q.take(); |
305 |
|
}}); |
306 |
< |
Thread.sleep(SHORT_DELAY_MS); |
306 |
> |
Thread.sleep(SMALL_DELAY_MS); |
307 |
|
t.interrupt(); |
308 |
|
t.join(); |
309 |
+ |
checkEmpty(q); |
310 |
|
} |
311 |
|
|
312 |
|
/** |
313 |
|
* poll succeeds unless empty |
314 |
|
*/ |
315 |
< |
public void testPoll() { |
315 |
> |
public void testPoll() throws InterruptedException { |
316 |
|
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
317 |
|
for (int i = 0; i < SIZE; ++i) { |
318 |
|
assertEquals(i, (int) q.poll()); |
319 |
|
} |
320 |
|
assertNull(q.poll()); |
321 |
+ |
checkEmpty(q); |
322 |
|
} |
323 |
|
|
324 |
|
/** |
330 |
|
assertEquals(i, (int) q.poll(0, MILLISECONDS)); |
331 |
|
} |
332 |
|
assertNull(q.poll(0, MILLISECONDS)); |
333 |
+ |
checkEmpty(q); |
334 |
|
} |
335 |
|
|
336 |
|
/** |
339 |
|
public void testTimedPoll() throws InterruptedException { |
340 |
|
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
341 |
|
for (int i = 0; i < SIZE; ++i) { |
342 |
< |
assertEquals(i, (int) q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
342 |
> |
long t0 = System.nanoTime(); |
343 |
> |
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
344 |
> |
long millisElapsed = (System.nanoTime() - t0)/(1024 * 1024); |
345 |
> |
assertTrue(millisElapsed < SMALL_DELAY_MS); |
346 |
|
} |
347 |
|
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
348 |
+ |
checkEmpty(q); |
349 |
|
} |
350 |
|
|
351 |
|
/** |
354 |
|
*/ |
355 |
|
public void testInterruptedTimedPoll() throws InterruptedException { |
356 |
|
final LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
357 |
< |
Thread t = newStartedThread(new CheckedInterruptedRunnable() { |
357 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
358 |
|
void realRun() throws InterruptedException { |
359 |
|
for (int i = 0; i < SIZE; ++i) { |
360 |
+ |
long t0 = System.nanoTime(); |
361 |
|
threadAssertEquals(i, (int) q.poll(LONG_DELAY_MS, |
362 |
|
MILLISECONDS)); |
363 |
+ |
long millisElapsed = (System.nanoTime() - t0)/(1024 * 1024); |
364 |
+ |
assertTrue(millisElapsed < SMALL_DELAY_MS); |
365 |
|
} |
366 |
< |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
366 |
> |
try { |
367 |
> |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
368 |
> |
} catch (InterruptedException success) {} |
369 |
|
}}); |
370 |
|
Thread.sleep(SMALL_DELAY_MS); |
371 |
|
t.interrupt(); |
372 |
|
t.join(); |
373 |
< |
assertEquals(q.size(), 0); |
330 |
< |
assertNull(q.poll()); |
373 |
> |
checkEmpty(q); |
374 |
|
} |
375 |
|
|
376 |
|
/** |
394 |
|
/** |
395 |
|
* peek returns next element, or null if empty |
396 |
|
*/ |
397 |
< |
public void testPeek() { |
397 |
> |
public void testPeek() throws InterruptedException { |
398 |
|
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
399 |
|
for (int i = 0; i < SIZE; ++i) { |
400 |
|
assertEquals(i, (int) q.peek()); |
403 |
|
i != (int) q.peek()); |
404 |
|
} |
405 |
|
assertNull(q.peek()); |
406 |
+ |
checkEmpty(q); |
407 |
|
} |
408 |
|
|
409 |
|
/** |
410 |
|
* element returns next element, or throws NoSuchElementException if empty |
411 |
|
*/ |
412 |
< |
public void testElement() { |
412 |
> |
public void testElement() throws InterruptedException { |
413 |
|
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
414 |
|
for (int i = 0; i < SIZE; ++i) { |
415 |
|
assertEquals(i, (int) q.element()); |
420 |
|
shouldThrow(); |
421 |
|
} catch (NoSuchElementException success) { |
422 |
|
} |
423 |
+ |
checkEmpty(q); |
424 |
|
} |
425 |
|
|
426 |
|
/** |
427 |
|
* remove removes next element, or throws NoSuchElementException if empty |
428 |
|
*/ |
429 |
< |
public void testRemove() { |
429 |
> |
public void testRemove() throws InterruptedException { |
430 |
|
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
431 |
|
for (int i = 0; i < SIZE; ++i) { |
432 |
|
assertEquals(i, (int) q.remove()); |
436 |
|
shouldThrow(); |
437 |
|
} catch (NoSuchElementException success) { |
438 |
|
} |
439 |
+ |
checkEmpty(q); |
440 |
|
} |
441 |
|
|
442 |
|
/** |
443 |
|
* remove(x) removes x and returns true if present |
444 |
|
*/ |
445 |
< |
public void testRemoveElement() { |
445 |
> |
public void testRemoveElement() throws InterruptedException { |
446 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
447 |
|
for (int i = 1; i < SIZE; i += 2) { |
448 |
|
assertTrue(q.remove(i)); |
451 |
|
assertTrue(q.remove(i)); |
452 |
|
assertFalse(q.remove(i + 1)); |
453 |
|
} |
454 |
< |
assertTrue(q.isEmpty()); |
454 |
> |
checkEmpty(q); |
455 |
|
} |
456 |
|
|
457 |
|
/** |
464 |
|
assertTrue(q.remove(one)); |
465 |
|
assertTrue(q.remove(two)); |
466 |
|
assertTrue(q.add(three)); |
467 |
< |
assertTrue(q.take() != null); |
467 |
> |
assertTrue(q.take() == three); |
468 |
|
} |
469 |
|
|
470 |
|
/** |
482 |
|
/** |
483 |
|
* clear removes all elements |
484 |
|
*/ |
485 |
< |
public void testClear() { |
485 |
> |
public void testClear() throws InterruptedException { |
486 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
487 |
|
q.clear(); |
488 |
< |
assertTrue(q.isEmpty()); |
443 |
< |
assertEquals(0, q.size()); |
488 |
> |
checkEmpty(q); |
489 |
|
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
490 |
|
q.add(one); |
491 |
|
assertFalse(q.isEmpty()); |
492 |
+ |
assertEquals(1, q.size()); |
493 |
|
assertTrue(q.contains(one)); |
494 |
|
q.clear(); |
495 |
< |
assertTrue(q.isEmpty()); |
495 |
> |
checkEmpty(q); |
496 |
|
} |
497 |
|
|
498 |
|
/** |
546 |
|
} |
547 |
|
|
548 |
|
/** |
549 |
< |
* toArray contains all elements |
549 |
> |
* toArray() contains all elements |
550 |
|
*/ |
551 |
|
public void testToArray() throws InterruptedException { |
552 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
581 |
|
} |
582 |
|
|
583 |
|
/** |
584 |
< |
* toArray with incompatible array type throws CCE |
584 |
> |
* toArray(incompatible array type) throws CCE |
585 |
|
*/ |
586 |
|
public void testToArray1_BadArg() { |
587 |
|
try { |
606 |
|
} |
607 |
|
|
608 |
|
/** |
609 |
< |
* iterator.remove removes current element |
609 |
> |
* iterator.remove() removes current element |
610 |
|
*/ |
611 |
|
public void testIteratorRemove() { |
612 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
693 |
|
} |
694 |
|
|
695 |
|
/** |
696 |
< |
* poll retrieves elements across Executor threads |
696 |
> |
* timed poll retrieves elements across Executor threads |
697 |
|
*/ |
698 |
|
public void testPollInExecutor() { |
699 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
791 |
|
} |
792 |
|
|
793 |
|
/** |
794 |
< |
* drainTo empties full queue, unblocking a waiting put. |
794 |
> |
* drainTo(c) empties full queue, unblocking a waiting put. |
795 |
|
*/ |
796 |
|
public void testDrainToWithActivePut() throws InterruptedException { |
797 |
|
final LinkedTransferQueue q = populatedQueue(SIZE); |
815 |
|
public void testDrainToNullN() { |
816 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
817 |
|
try { |
818 |
< |
q.drainTo(null, 0); |
818 |
> |
q.drainTo(null, SIZE); |
819 |
|
shouldThrow(); |
820 |
|
} catch (NullPointerException success) { |
821 |
|
} |
827 |
|
public void testDrainToSelfN() { |
828 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
829 |
|
try { |
830 |
< |
q.drainTo(q, 0); |
830 |
> |
q.drainTo(q, SIZE); |
831 |
|
shouldThrow(); |
832 |
|
} catch (IllegalArgumentException success) { |
833 |
|
} |
856 |
|
} |
857 |
|
|
858 |
|
/** |
859 |
< |
* poll and take decrement the waiting consumer count |
859 |
> |
* timed poll() or take() increments the waiting consumer count; |
860 |
> |
* offer(e) decrements the waiting consumer count |
861 |
|
*/ |
862 |
|
public void testWaitingConsumer() throws InterruptedException { |
863 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
864 |
< |
final ConsumerObserver waiting = new ConsumerObserver(); |
864 |
> |
assertEquals(q.getWaitingConsumerCount(), 0); |
865 |
> |
assertFalse(q.hasWaitingConsumer()); |
866 |
|
|
867 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
868 |
|
void realRun() throws InterruptedException { |
869 |
|
Thread.sleep(SMALL_DELAY_MS); |
870 |
|
threadAssertTrue(q.hasWaitingConsumer()); |
871 |
< |
waiting.setWaitingConsumer(q.getWaitingConsumerCount()); |
871 |
> |
threadAssertEquals(q.getWaitingConsumerCount(), 1); |
872 |
|
threadAssertTrue(q.offer(new Object())); |
873 |
+ |
threadAssertFalse(q.hasWaitingConsumer()); |
874 |
+ |
threadAssertEquals(q.getWaitingConsumerCount(), 0); |
875 |
|
}}); |
876 |
|
|
877 |
|
assertTrue(q.poll(LONG_DELAY_MS, MILLISECONDS) != null); |
878 |
< |
assertTrue(q.getWaitingConsumerCount() |
879 |
< |
< waiting.getWaitingConsumers()); |
878 |
> |
assertEquals(q.getWaitingConsumerCount(), 0); |
879 |
> |
assertFalse(q.hasWaitingConsumer()); |
880 |
|
t.join(); |
881 |
|
} |
882 |
|
|
888 |
|
LinkedTransferQueue q = new LinkedTransferQueue(); |
889 |
|
q.transfer(null); |
890 |
|
shouldThrow(); |
891 |
< |
} catch (NullPointerException ex) { |
842 |
< |
} |
891 |
> |
} catch (NullPointerException success) {} |
892 |
|
} |
893 |
|
|
894 |
|
/** |
978 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
979 |
|
void realRun() throws InterruptedException { |
980 |
|
q.transfer(SIZE); |
981 |
< |
threadAssertTrue(q.isEmpty()); |
981 |
> |
checkEmpty(q); |
982 |
|
}}); |
983 |
|
|
984 |
|
Thread.sleep(SHORT_DELAY_MS); |
985 |
|
assertEquals(SIZE, (int) q.take()); |
986 |
< |
assertTrue(q.isEmpty()); |
986 |
> |
checkEmpty(q); |
987 |
|
t.join(); |
988 |
|
} |
989 |
|
|
995 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
996 |
|
q.tryTransfer(null); |
997 |
|
shouldThrow(); |
998 |
< |
} catch (NullPointerException ex) { |
950 |
< |
} |
998 |
> |
} catch (NullPointerException success) {} |
999 |
|
} |
1000 |
|
|
1001 |
|
/** |
1002 |
|
* tryTransfer returns false and does not enqueue if there are no |
1003 |
|
* consumers waiting to poll or take. |
1004 |
|
*/ |
1005 |
< |
public void testTryTransfer2() { |
1005 |
> |
public void testTryTransfer2() throws InterruptedException { |
1006 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
1007 |
|
assertFalse(q.tryTransfer(new Object())); |
1008 |
|
assertFalse(q.hasWaitingConsumer()); |
1009 |
< |
assertTrue(q.isEmpty()); |
962 |
< |
assertEquals(0, q.size()); |
1009 |
> |
checkEmpty(q); |
1010 |
|
} |
1011 |
|
|
1012 |
|
/** |
1028 |
|
}}); |
1029 |
|
|
1030 |
|
assertTrue(q.poll(MEDIUM_DELAY_MS, MILLISECONDS) == hotPotato); |
1031 |
< |
assertTrue(q.isEmpty()); |
1031 |
> |
checkEmpty(q); |
1032 |
|
t.join(); |
1033 |
|
} |
1034 |
|
|
1051 |
|
}}); |
1052 |
|
|
1053 |
|
assertTrue(q.take() == hotPotato); |
1054 |
< |
assertTrue(q.isEmpty()); |
1054 |
> |
checkEmpty(q); |
1055 |
|
t.join(); |
1056 |
|
} |
1057 |
|
|
1086 |
|
}}); |
1087 |
|
|
1088 |
|
Thread.sleep(SMALL_DELAY_MS); |
1089 |
< |
assertTrue(q.isEmpty()); |
1089 |
> |
checkEmpty(q); |
1090 |
|
t.join(); |
1091 |
|
} |
1092 |
|
|
1109 |
|
assertEquals(2, q.size()); |
1110 |
|
assertEquals(four, q.poll()); |
1111 |
|
assertEquals(five, q.poll()); |
1112 |
< |
assertTrue(q.isEmpty()); |
1112 |
> |
checkEmpty(q); |
1113 |
|
t.join(); |
1114 |
|
} |
1115 |
|
|
1124 |
|
assertFalse(q.tryTransfer(five, SHORT_DELAY_MS, MILLISECONDS)); |
1125 |
|
assertEquals(1, q.size()); |
1126 |
|
assertEquals(four, q.poll()); |
1080 |
– |
threadAssertTrue(q.isEmpty()); |
1127 |
|
assertNull(q.poll()); |
1128 |
+ |
checkEmpty(q); |
1129 |
|
} |
1130 |
|
|
1131 |
|
private LinkedTransferQueue<Integer> populatedQueue(int n) { |
1139 |
|
assertFalse(q.isEmpty()); |
1140 |
|
return q; |
1141 |
|
} |
1095 |
– |
|
1096 |
– |
private static class ConsumerObserver { |
1097 |
– |
|
1098 |
– |
private int waitingConsumers; |
1099 |
– |
|
1100 |
– |
private ConsumerObserver() { |
1101 |
– |
} |
1102 |
– |
|
1103 |
– |
private void setWaitingConsumer(int i) { |
1104 |
– |
this.waitingConsumers = i; |
1105 |
– |
} |
1106 |
– |
|
1107 |
– |
private int getWaitingConsumers() { |
1108 |
– |
return waitingConsumers; |
1109 |
– |
} |
1110 |
– |
} |
1142 |
|
} |