24 |
|
|
25 |
|
@SuppressWarnings({"unchecked", "rawtypes"}) |
26 |
|
public class LinkedTransferQueueTest extends JSR166TestCase { |
27 |
– |
static class Implementation implements CollectionImplementation { |
28 |
– |
public Class<?> klazz() { return LinkedTransferQueue.class; } |
29 |
– |
public Collection emptyCollection() { return new LinkedTransferQueue(); } |
30 |
– |
public Object makeElement(int i) { return i; } |
31 |
– |
public boolean isConcurrent() { return true; } |
32 |
– |
public boolean permitsNulls() { return false; } |
33 |
– |
} |
34 |
– |
|
27 |
|
public static class Generic extends BlockingQueueTest { |
28 |
|
protected BlockingQueue emptyCollection() { |
29 |
|
return new LinkedTransferQueue(); |
35 |
|
} |
36 |
|
|
37 |
|
public static Test suite() { |
38 |
+ |
class Implementation implements CollectionImplementation { |
39 |
+ |
public Class<?> klazz() { return LinkedTransferQueue.class; } |
40 |
+ |
public Collection emptyCollection() { return new LinkedTransferQueue(); } |
41 |
+ |
public Object makeElement(int i) { return i; } |
42 |
+ |
public boolean isConcurrent() { return true; } |
43 |
+ |
public boolean permitsNulls() { return false; } |
44 |
+ |
} |
45 |
|
return newTestSuite(LinkedTransferQueueTest.class, |
46 |
|
new Generic().testSuite(), |
47 |
|
CollectionTest.testSuite(new Implementation())); |
182 |
|
* all elements successfully put are contained |
183 |
|
*/ |
184 |
|
public void testPut() { |
185 |
< |
LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>(); |
185 |
> |
LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
186 |
|
for (int i = 0; i < SIZE; ++i) { |
187 |
|
assertEquals(i, q.size()); |
188 |
|
q.put(i); |
262 |
|
*/ |
263 |
|
public void testTimedPoll() throws InterruptedException { |
264 |
|
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
266 |
– |
for (int i = 0; i < SIZE; ++i) { |
267 |
– |
long startTime = System.nanoTime(); |
268 |
– |
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
269 |
– |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
270 |
– |
} |
265 |
|
long startTime = System.nanoTime(); |
266 |
+ |
for (int i = 0; i < SIZE; ++i) |
267 |
+ |
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
268 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
269 |
+ |
|
270 |
+ |
startTime = System.nanoTime(); |
271 |
|
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
272 |
|
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
273 |
|
checkEmpty(q); |
282 |
|
final CountDownLatch aboutToWait = new CountDownLatch(1); |
283 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
284 |
|
public void realRun() throws InterruptedException { |
285 |
< |
for (int i = 0; i < SIZE; ++i) { |
286 |
< |
long t0 = System.nanoTime(); |
285 |
> |
long startTime = System.nanoTime(); |
286 |
> |
for (int i = 0; i < SIZE; ++i) |
287 |
|
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
289 |
– |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
290 |
– |
} |
291 |
– |
long t0 = System.nanoTime(); |
288 |
|
aboutToWait.countDown(); |
289 |
|
try { |
290 |
< |
q.poll(MEDIUM_DELAY_MS, MILLISECONDS); |
290 |
> |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
291 |
|
shouldThrow(); |
292 |
< |
} catch (InterruptedException success) { |
293 |
< |
assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS); |
298 |
< |
} |
292 |
> |
} catch (InterruptedException success) {} |
293 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
294 |
|
}}); |
295 |
|
|
296 |
|
aboutToWait.await(); |
297 |
< |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
297 |
> |
waitForThreadToEnterWaitState(t); |
298 |
|
t.interrupt(); |
299 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
299 |
> |
awaitTermination(t); |
300 |
|
checkEmpty(q); |
301 |
|
} |
302 |
|
|
308 |
|
final BlockingQueue<Integer> q = populatedQueue(SIZE); |
309 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
310 |
|
public void realRun() throws InterruptedException { |
311 |
+ |
long startTime = System.nanoTime(); |
312 |
|
Thread.currentThread().interrupt(); |
313 |
< |
for (int i = 0; i < SIZE; ++i) { |
318 |
< |
long t0 = System.nanoTime(); |
313 |
> |
for (int i = 0; i < SIZE; ++i) |
314 |
|
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
320 |
– |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
321 |
– |
} |
315 |
|
try { |
316 |
< |
q.poll(MEDIUM_DELAY_MS, MILLISECONDS); |
316 |
> |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
317 |
|
shouldThrow(); |
318 |
|
} catch (InterruptedException success) {} |
319 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
320 |
|
}}); |
321 |
|
|
322 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
322 |
> |
awaitTermination(t); |
323 |
|
checkEmpty(q); |
324 |
|
} |
325 |
|
|
415 |
|
*/ |
416 |
|
public void testContainsAll() { |
417 |
|
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
418 |
< |
LinkedTransferQueue<Integer> p = new LinkedTransferQueue<Integer>(); |
418 |
> |
LinkedTransferQueue<Integer> p = new LinkedTransferQueue<>(); |
419 |
|
for (int i = 0; i < SIZE; ++i) { |
420 |
|
assertTrue(q.containsAll(p)); |
421 |
|
assertFalse(p.containsAll(q)); |
544 |
|
* iterator ordering is FIFO |
545 |
|
*/ |
546 |
|
public void testIteratorOrdering() { |
547 |
< |
final LinkedTransferQueue<Integer> q |
554 |
< |
= new LinkedTransferQueue<Integer>(); |
547 |
> |
final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
548 |
|
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
549 |
|
q.add(one); |
550 |
|
q.add(two); |
595 |
|
executor.execute(new CheckedRunnable() { |
596 |
|
public void realRun() throws InterruptedException { |
597 |
|
threadsStarted.await(); |
598 |
+ |
long startTime = System.nanoTime(); |
599 |
|
assertTrue(q.offer(one, LONG_DELAY_MS, MILLISECONDS)); |
600 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
601 |
|
}}); |
602 |
|
|
603 |
|
executor.execute(new CheckedRunnable() { |
622 |
|
public void realRun() throws InterruptedException { |
623 |
|
assertNull(q.poll()); |
624 |
|
threadsStarted.await(); |
625 |
+ |
long startTime = System.nanoTime(); |
626 |
|
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
627 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
628 |
|
checkEmpty(q); |
629 |
|
}}); |
630 |
|
|
694 |
|
assertTrue(l.size() >= SIZE); |
695 |
|
for (int i = 0; i < SIZE; ++i) |
696 |
|
assertEquals(i, l.get(i)); |
697 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
697 |
> |
awaitTermination(t); |
698 |
|
assertTrue(q.size() + l.size() >= SIZE); |
699 |
|
} |
700 |
|
|
731 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
732 |
|
public void realRun() throws InterruptedException { |
733 |
|
threadStarted.countDown(); |
734 |
+ |
long startTime = System.nanoTime(); |
735 |
|
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
736 |
|
assertEquals(0, q.getWaitingConsumerCount()); |
737 |
|
assertFalse(q.hasWaitingConsumer()); |
738 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
739 |
|
}}); |
740 |
|
|
741 |
|
threadStarted.await(); |
742 |
< |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
742 |
> |
waitForThreadToEnterWaitState(t); |
743 |
|
assertEquals(1, q.getWaitingConsumerCount()); |
744 |
|
assertTrue(q.hasWaitingConsumer()); |
745 |
|
|
747 |
|
assertEquals(0, q.getWaitingConsumerCount()); |
748 |
|
assertFalse(q.hasWaitingConsumer()); |
749 |
|
|
750 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
750 |
> |
awaitTermination(t); |
751 |
|
} |
752 |
|
|
753 |
|
/** |
763 |
|
|
764 |
|
/** |
765 |
|
* transfer waits until a poll occurs. The transfered element |
766 |
< |
* is returned by this associated poll. |
766 |
> |
* is returned by the associated poll. |
767 |
|
*/ |
768 |
|
public void testTransfer2() throws InterruptedException { |
769 |
< |
final LinkedTransferQueue<Integer> q |
771 |
< |
= new LinkedTransferQueue<Integer>(); |
769 |
> |
final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
770 |
|
final CountDownLatch threadStarted = new CountDownLatch(1); |
771 |
|
|
772 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
777 |
|
}}); |
778 |
|
|
779 |
|
threadStarted.await(); |
780 |
< |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
780 |
> |
waitForThreadToEnterWaitState(t); |
781 |
|
assertEquals(1, q.size()); |
782 |
|
assertSame(five, q.poll()); |
783 |
|
checkEmpty(q); |
784 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
784 |
> |
awaitTermination(t); |
785 |
|
} |
786 |
|
|
787 |
|
/** |
788 |
|
* transfer waits until a poll occurs, and then transfers in fifo order |
789 |
|
*/ |
790 |
|
public void testTransfer3() throws InterruptedException { |
791 |
< |
final LinkedTransferQueue<Integer> q |
794 |
< |
= new LinkedTransferQueue<Integer>(); |
791 |
> |
final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
792 |
|
|
793 |
|
Thread first = newStartedThread(new CheckedRunnable() { |
794 |
|
public void realRun() throws InterruptedException { |
836 |
|
assertEquals(1, q.size()); |
837 |
|
assertTrue(q.offer(three)); |
838 |
|
assertSame(four, q.poll()); |
839 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
839 |
> |
awaitTermination(t); |
840 |
|
} |
841 |
|
|
842 |
|
/** |
843 |
|
* transfer waits until a take occurs. The transfered element |
844 |
< |
* is returned by this associated take. |
844 |
> |
* is returned by the associated take. |
845 |
|
*/ |
846 |
|
public void testTransfer5() throws InterruptedException { |
847 |
< |
final LinkedTransferQueue<Integer> q |
851 |
< |
= new LinkedTransferQueue<Integer>(); |
847 |
> |
final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
848 |
|
|
849 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
850 |
|
public void realRun() throws InterruptedException { |
858 |
|
assertEquals(1, q.size()); |
859 |
|
assertSame(four, q.take()); |
860 |
|
checkEmpty(q); |
861 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
861 |
> |
awaitTermination(t); |
862 |
|
} |
863 |
|
|
864 |
|
/** |
900 |
|
assertTrue(q.tryTransfer(hotPotato)); |
901 |
|
}}); |
902 |
|
|
903 |
< |
assertSame(hotPotato, q.poll(MEDIUM_DELAY_MS, MILLISECONDS)); |
903 |
> |
long startTime = System.nanoTime(); |
904 |
> |
assertSame(hotPotato, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
905 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
906 |
|
checkEmpty(q); |
907 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
907 |
> |
awaitTermination(t); |
908 |
|
} |
909 |
|
|
910 |
|
/** |
926 |
|
|
927 |
|
assertSame(q.take(), hotPotato); |
928 |
|
checkEmpty(q); |
929 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
929 |
> |
awaitTermination(t); |
930 |
|
} |
931 |
|
|
932 |
|
/** |
939 |
|
|
940 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
941 |
|
public void realRun() throws InterruptedException { |
942 |
+ |
long startTime = System.nanoTime(); |
943 |
|
Thread.currentThread().interrupt(); |
944 |
|
try { |
945 |
|
q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS); |
953 |
|
shouldThrow(); |
954 |
|
} catch (InterruptedException success) {} |
955 |
|
assertFalse(Thread.interrupted()); |
956 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
957 |
|
}}); |
958 |
|
|
959 |
|
await(pleaseInterrupt); |
971 |
|
|
972 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
973 |
|
public void realRun() throws InterruptedException { |
974 |
< |
long t0 = System.nanoTime(); |
974 |
> |
long startTime = System.nanoTime(); |
975 |
|
assertFalse(q.tryTransfer(new Object(), |
976 |
|
timeoutMillis(), MILLISECONDS)); |
977 |
< |
assertTrue(millisElapsedSince(t0) >= timeoutMillis()); |
977 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
978 |
|
checkEmpty(q); |
979 |
|
}}); |
980 |
|
|
992 |
|
|
993 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
994 |
|
public void realRun() throws InterruptedException { |
995 |
< |
assertTrue(q.tryTransfer(five, MEDIUM_DELAY_MS, MILLISECONDS)); |
995 |
> |
long startTime = System.nanoTime(); |
996 |
> |
assertTrue(q.tryTransfer(five, LONG_DELAY_MS, MILLISECONDS)); |
997 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
998 |
|
checkEmpty(q); |
999 |
|
}}); |
1000 |
|
|
1004 |
|
assertSame(four, q.poll()); |
1005 |
|
assertSame(five, q.poll()); |
1006 |
|
checkEmpty(q); |
1007 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
1007 |
> |
awaitTermination(t); |
1008 |
|
} |
1009 |
|
|
1010 |
|
/** |
1015 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
1016 |
|
assertTrue(q.offer(four)); |
1017 |
|
assertEquals(1, q.size()); |
1018 |
< |
long t0 = System.nanoTime(); |
1018 |
> |
long startTime = System.nanoTime(); |
1019 |
|
assertFalse(q.tryTransfer(five, timeoutMillis(), MILLISECONDS)); |
1020 |
< |
assertTrue(millisElapsedSince(t0) >= timeoutMillis()); |
1020 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
1021 |
|
assertEquals(1, q.size()); |
1022 |
|
assertSame(four, q.poll()); |
1023 |
|
assertNull(q.poll()); |
1025 |
|
} |
1026 |
|
|
1027 |
|
private LinkedTransferQueue<Integer> populatedQueue(int n) { |
1028 |
< |
LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>(); |
1028 |
> |
LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
1029 |
|
checkEmpty(q); |
1030 |
|
for (int i = 0; i < n; i++) { |
1031 |
|
assertEquals(i, q.size()); |