15 |
|
import java.util.NoSuchElementException; |
16 |
|
import java.util.Queue; |
17 |
|
import java.util.concurrent.BlockingQueue; |
18 |
+ |
import java.util.concurrent.Callable; |
19 |
|
import java.util.concurrent.CountDownLatch; |
20 |
|
import java.util.concurrent.Executors; |
21 |
|
import java.util.concurrent.ExecutorService; |
25 |
|
|
26 |
|
@SuppressWarnings({"unchecked", "rawtypes"}) |
27 |
|
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 |
– |
|
28 |
|
public static class Generic extends BlockingQueueTest { |
29 |
|
protected BlockingQueue emptyCollection() { |
30 |
|
return new LinkedTransferQueue(); |
36 |
|
} |
37 |
|
|
38 |
|
public static Test suite() { |
39 |
+ |
class Implementation implements CollectionImplementation { |
40 |
+ |
public Class<?> klazz() { return LinkedTransferQueue.class; } |
41 |
+ |
public Collection emptyCollection() { return new LinkedTransferQueue(); } |
42 |
+ |
public Object makeElement(int i) { return i; } |
43 |
+ |
public boolean isConcurrent() { return true; } |
44 |
+ |
public boolean permitsNulls() { return false; } |
45 |
+ |
} |
46 |
|
return newTestSuite(LinkedTransferQueueTest.class, |
47 |
|
new Generic().testSuite(), |
48 |
|
CollectionTest.testSuite(new Implementation())); |
183 |
|
* all elements successfully put are contained |
184 |
|
*/ |
185 |
|
public void testPut() { |
186 |
< |
LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>(); |
186 |
> |
LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
187 |
|
for (int i = 0; i < SIZE; ++i) { |
188 |
|
assertEquals(i, q.size()); |
189 |
|
q.put(i); |
209 |
|
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
210 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
211 |
|
public void realRun() throws InterruptedException { |
212 |
< |
for (int i = 0; i < SIZE; ++i) { |
213 |
< |
assertEquals(i, q.take()); |
214 |
< |
} |
212 |
> |
for (int i = 0; i < SIZE; i++) assertEquals(i, q.take()); |
213 |
|
|
214 |
|
Thread.currentThread().interrupt(); |
215 |
|
try { |
227 |
|
}}); |
228 |
|
|
229 |
|
await(pleaseInterrupt); |
230 |
< |
assertThreadStaysAlive(t); |
230 |
> |
assertThreadBlocks(t, Thread.State.WAITING); |
231 |
|
t.interrupt(); |
232 |
|
awaitTermination(t); |
233 |
|
} |
261 |
|
*/ |
262 |
|
public void testTimedPoll() throws InterruptedException { |
263 |
|
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 |
– |
} |
264 |
|
long startTime = System.nanoTime(); |
265 |
+ |
for (int i = 0; i < SIZE; ++i) |
266 |
+ |
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
267 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
268 |
+ |
|
269 |
+ |
startTime = System.nanoTime(); |
270 |
|
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
271 |
|
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
272 |
|
checkEmpty(q); |
278 |
|
*/ |
279 |
|
public void testInterruptedTimedPoll() throws InterruptedException { |
280 |
|
final BlockingQueue<Integer> q = populatedQueue(SIZE); |
281 |
< |
final CountDownLatch aboutToWait = new CountDownLatch(1); |
281 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
282 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
283 |
|
public void realRun() throws InterruptedException { |
284 |
|
long startTime = System.nanoTime(); |
285 |
< |
for (int i = 0; i < SIZE; ++i) { |
285 |
> |
for (int i = 0; i < SIZE; ++i) |
286 |
|
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
287 |
< |
} |
288 |
< |
aboutToWait.countDown(); |
287 |
> |
|
288 |
> |
pleaseInterrupt.countDown(); |
289 |
|
try { |
290 |
|
q.poll(LONG_DELAY_MS, MILLISECONDS); |
291 |
|
shouldThrow(); |
292 |
< |
} catch (InterruptedException success) { |
293 |
< |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
294 |
< |
} |
292 |
> |
} catch (InterruptedException success) {} |
293 |
> |
assertFalse(Thread.interrupted()); |
294 |
> |
|
295 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
296 |
|
}}); |
297 |
|
|
298 |
< |
aboutToWait.await(); |
299 |
< |
waitForThreadToEnterWaitState(t, LONG_DELAY_MS); |
298 |
> |
await(pleaseInterrupt); |
299 |
> |
assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
300 |
|
t.interrupt(); |
301 |
|
awaitTermination(t); |
302 |
|
checkEmpty(q); |
310 |
|
final BlockingQueue<Integer> q = populatedQueue(SIZE); |
311 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
312 |
|
public void realRun() throws InterruptedException { |
313 |
+ |
long startTime = System.nanoTime(); |
314 |
|
Thread.currentThread().interrupt(); |
315 |
< |
for (int i = 0; i < SIZE; ++i) { |
316 |
< |
long t0 = System.nanoTime(); |
315 |
> |
for (int i = 0; i < SIZE; ++i) |
316 |
|
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
318 |
– |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
319 |
– |
} |
317 |
|
try { |
318 |
< |
q.poll(MEDIUM_DELAY_MS, MILLISECONDS); |
318 |
> |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
319 |
|
shouldThrow(); |
320 |
|
} catch (InterruptedException success) {} |
321 |
+ |
assertFalse(Thread.interrupted()); |
322 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
323 |
|
}}); |
324 |
|
|
325 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
325 |
> |
awaitTermination(t); |
326 |
|
checkEmpty(q); |
327 |
|
} |
328 |
|
|
418 |
|
*/ |
419 |
|
public void testContainsAll() { |
420 |
|
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
421 |
< |
LinkedTransferQueue<Integer> p = new LinkedTransferQueue<Integer>(); |
421 |
> |
LinkedTransferQueue<Integer> p = new LinkedTransferQueue<>(); |
422 |
|
for (int i = 0; i < SIZE; ++i) { |
423 |
|
assertTrue(q.containsAll(p)); |
424 |
|
assertFalse(p.containsAll(q)); |
547 |
|
* iterator ordering is FIFO |
548 |
|
*/ |
549 |
|
public void testIteratorOrdering() { |
550 |
< |
final LinkedTransferQueue<Integer> q |
552 |
< |
= new LinkedTransferQueue<Integer>(); |
550 |
> |
final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
551 |
|
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
552 |
|
q.add(one); |
553 |
|
q.add(two); |
598 |
|
executor.execute(new CheckedRunnable() { |
599 |
|
public void realRun() throws InterruptedException { |
600 |
|
threadsStarted.await(); |
601 |
+ |
long startTime = System.nanoTime(); |
602 |
|
assertTrue(q.offer(one, LONG_DELAY_MS, MILLISECONDS)); |
603 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
604 |
|
}}); |
605 |
|
|
606 |
|
executor.execute(new CheckedRunnable() { |
625 |
|
public void realRun() throws InterruptedException { |
626 |
|
assertNull(q.poll()); |
627 |
|
threadsStarted.await(); |
628 |
+ |
long startTime = System.nanoTime(); |
629 |
|
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
630 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
631 |
|
checkEmpty(q); |
632 |
|
}}); |
633 |
|
|
697 |
|
assertTrue(l.size() >= SIZE); |
698 |
|
for (int i = 0; i < SIZE; ++i) |
699 |
|
assertEquals(i, l.get(i)); |
700 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
700 |
> |
awaitTermination(t); |
701 |
|
assertTrue(q.size() + l.size() >= SIZE); |
702 |
|
} |
703 |
|
|
734 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
735 |
|
public void realRun() throws InterruptedException { |
736 |
|
threadStarted.countDown(); |
737 |
+ |
long startTime = System.nanoTime(); |
738 |
|
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
739 |
|
assertEquals(0, q.getWaitingConsumerCount()); |
740 |
|
assertFalse(q.hasWaitingConsumer()); |
741 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
742 |
|
}}); |
743 |
|
|
744 |
|
threadStarted.await(); |
745 |
< |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
746 |
< |
assertEquals(1, q.getWaitingConsumerCount()); |
747 |
< |
assertTrue(q.hasWaitingConsumer()); |
745 |
> |
Callable<Boolean> oneConsumer |
746 |
> |
= new Callable<Boolean>() { public Boolean call() { |
747 |
> |
return q.hasWaitingConsumer() |
748 |
> |
&& q.getWaitingConsumerCount() == 1; }}; |
749 |
> |
waitForThreadToEnterWaitState(t, oneConsumer); |
750 |
|
|
751 |
|
assertTrue(q.offer(one)); |
752 |
|
assertEquals(0, q.getWaitingConsumerCount()); |
753 |
|
assertFalse(q.hasWaitingConsumer()); |
754 |
|
|
755 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
755 |
> |
awaitTermination(t); |
756 |
|
} |
757 |
|
|
758 |
|
/** |
768 |
|
|
769 |
|
/** |
770 |
|
* transfer waits until a poll occurs. The transfered element |
771 |
< |
* is returned by this associated poll. |
771 |
> |
* is returned by the associated poll. |
772 |
|
*/ |
773 |
|
public void testTransfer2() throws InterruptedException { |
774 |
< |
final LinkedTransferQueue<Integer> q |
769 |
< |
= new LinkedTransferQueue<Integer>(); |
774 |
> |
final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
775 |
|
final CountDownLatch threadStarted = new CountDownLatch(1); |
776 |
|
|
777 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
782 |
|
}}); |
783 |
|
|
784 |
|
threadStarted.await(); |
785 |
< |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
786 |
< |
assertEquals(1, q.size()); |
785 |
> |
Callable<Boolean> oneElement |
786 |
> |
= new Callable<Boolean>() { public Boolean call() { |
787 |
> |
return !q.isEmpty() && q.size() == 1; }}; |
788 |
> |
waitForThreadToEnterWaitState(t, oneElement); |
789 |
> |
|
790 |
|
assertSame(five, q.poll()); |
791 |
|
checkEmpty(q); |
792 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
792 |
> |
awaitTermination(t); |
793 |
|
} |
794 |
|
|
795 |
|
/** |
796 |
|
* transfer waits until a poll occurs, and then transfers in fifo order |
797 |
|
*/ |
798 |
|
public void testTransfer3() throws InterruptedException { |
799 |
< |
final LinkedTransferQueue<Integer> q |
792 |
< |
= new LinkedTransferQueue<Integer>(); |
799 |
> |
final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
800 |
|
|
801 |
|
Thread first = newStartedThread(new CheckedRunnable() { |
802 |
|
public void realRun() throws InterruptedException { |
803 |
|
q.transfer(four); |
804 |
< |
assertTrue(!q.contains(four)); |
804 |
> |
assertFalse(q.contains(four)); |
805 |
|
assertEquals(1, q.size()); |
806 |
|
}}); |
807 |
|
|
844 |
|
assertEquals(1, q.size()); |
845 |
|
assertTrue(q.offer(three)); |
846 |
|
assertSame(four, q.poll()); |
847 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
847 |
> |
awaitTermination(t); |
848 |
|
} |
849 |
|
|
850 |
|
/** |
851 |
|
* transfer waits until a take occurs. The transfered element |
852 |
< |
* is returned by this associated take. |
852 |
> |
* is returned by the associated take. |
853 |
|
*/ |
854 |
|
public void testTransfer5() throws InterruptedException { |
855 |
< |
final LinkedTransferQueue<Integer> q |
849 |
< |
= new LinkedTransferQueue<Integer>(); |
855 |
> |
final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
856 |
|
|
857 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
858 |
|
public void realRun() throws InterruptedException { |
866 |
|
assertEquals(1, q.size()); |
867 |
|
assertSame(four, q.take()); |
868 |
|
checkEmpty(q); |
869 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
869 |
> |
awaitTermination(t); |
870 |
|
} |
871 |
|
|
872 |
|
/** |
908 |
|
assertTrue(q.tryTransfer(hotPotato)); |
909 |
|
}}); |
910 |
|
|
911 |
< |
assertSame(hotPotato, q.poll(MEDIUM_DELAY_MS, MILLISECONDS)); |
911 |
> |
long startTime = System.nanoTime(); |
912 |
> |
assertSame(hotPotato, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
913 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
914 |
|
checkEmpty(q); |
915 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
915 |
> |
awaitTermination(t); |
916 |
|
} |
917 |
|
|
918 |
|
/** |
934 |
|
|
935 |
|
assertSame(q.take(), hotPotato); |
936 |
|
checkEmpty(q); |
937 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
937 |
> |
awaitTermination(t); |
938 |
|
} |
939 |
|
|
940 |
|
/** |
947 |
|
|
948 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
949 |
|
public void realRun() throws InterruptedException { |
950 |
+ |
long startTime = System.nanoTime(); |
951 |
|
Thread.currentThread().interrupt(); |
952 |
|
try { |
953 |
|
q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS); |
961 |
|
shouldThrow(); |
962 |
|
} catch (InterruptedException success) {} |
963 |
|
assertFalse(Thread.interrupted()); |
964 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
965 |
|
}}); |
966 |
|
|
967 |
|
await(pleaseInterrupt); |
968 |
< |
assertThreadStaysAlive(t); |
968 |
> |
assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
969 |
|
t.interrupt(); |
970 |
|
awaitTermination(t); |
971 |
|
checkEmpty(q); |
979 |
|
|
980 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
981 |
|
public void realRun() throws InterruptedException { |
982 |
< |
long t0 = System.nanoTime(); |
982 |
> |
long startTime = System.nanoTime(); |
983 |
|
assertFalse(q.tryTransfer(new Object(), |
984 |
|
timeoutMillis(), MILLISECONDS)); |
985 |
< |
assertTrue(millisElapsedSince(t0) >= timeoutMillis()); |
985 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
986 |
|
checkEmpty(q); |
987 |
|
}}); |
988 |
|
|
1000 |
|
|
1001 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
1002 |
|
public void realRun() throws InterruptedException { |
1003 |
< |
assertTrue(q.tryTransfer(five, MEDIUM_DELAY_MS, MILLISECONDS)); |
1003 |
> |
long startTime = System.nanoTime(); |
1004 |
> |
assertTrue(q.tryTransfer(five, LONG_DELAY_MS, MILLISECONDS)); |
1005 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
1006 |
|
checkEmpty(q); |
1007 |
|
}}); |
1008 |
|
|
1012 |
|
assertSame(four, q.poll()); |
1013 |
|
assertSame(five, q.poll()); |
1014 |
|
checkEmpty(q); |
1015 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
1015 |
> |
awaitTermination(t); |
1016 |
|
} |
1017 |
|
|
1018 |
|
/** |
1023 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
1024 |
|
assertTrue(q.offer(four)); |
1025 |
|
assertEquals(1, q.size()); |
1026 |
< |
long t0 = System.nanoTime(); |
1026 |
> |
long startTime = System.nanoTime(); |
1027 |
|
assertFalse(q.tryTransfer(five, timeoutMillis(), MILLISECONDS)); |
1028 |
< |
assertTrue(millisElapsedSince(t0) >= timeoutMillis()); |
1028 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
1029 |
|
assertEquals(1, q.size()); |
1030 |
|
assertSame(four, q.poll()); |
1031 |
|
assertNull(q.poll()); |
1033 |
|
} |
1034 |
|
|
1035 |
|
private LinkedTransferQueue<Integer> populatedQueue(int n) { |
1036 |
< |
LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>(); |
1036 |
> |
LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
1037 |
|
checkEmpty(q); |
1038 |
|
for (int i = 0; i < n; i++) { |
1039 |
|
assertEquals(i, q.size()); |