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 |
– |
|
28 |
|
public static class Generic extends BlockingQueueTest { |
29 |
|
protected BlockingQueue emptyCollection() { |
30 |
|
return new LinkedTransferQueue(); |
32 |
|
} |
33 |
|
|
34 |
|
public static void main(String[] args) { |
35 |
< |
junit.textui.TestRunner.run(suite()); |
35 |
> |
main(suite(), args); |
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()); |
47 |
> |
new Generic().testSuite(), |
48 |
> |
CollectionTest.testSuite(new Implementation())); |
49 |
|
} |
50 |
|
|
51 |
|
/** |
86 |
|
*/ |
87 |
|
public void testConstructor4() { |
88 |
|
Integer[] ints = new Integer[SIZE]; |
89 |
< |
for (int i = 0; i < SIZE-1; ++i) |
89 |
> |
for (int i = 0; i < SIZE - 1; ++i) |
90 |
|
ints[i] = i; |
91 |
|
Collection<Integer> elements = Arrays.asList(ints); |
92 |
|
try { |
123 |
|
* remainingCapacity() always returns Integer.MAX_VALUE |
124 |
|
*/ |
125 |
|
public void testRemainingCapacity() { |
126 |
< |
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
126 |
> |
BlockingQueue q = populatedQueue(SIZE); |
127 |
|
for (int i = 0; i < SIZE; ++i) { |
128 |
|
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
129 |
|
assertEquals(SIZE - i, q.size()); |
130 |
< |
q.remove(); |
130 |
> |
assertEquals(i, q.remove()); |
131 |
|
} |
132 |
|
for (int i = 0; i < SIZE; ++i) { |
133 |
|
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
134 |
|
assertEquals(i, q.size()); |
135 |
< |
q.add(i); |
135 |
> |
assertTrue(q.add(i)); |
136 |
|
} |
137 |
|
} |
138 |
|
|
140 |
|
* addAll(this) throws IllegalArgumentException |
141 |
|
*/ |
142 |
|
public void testAddAllSelf() { |
143 |
+ |
LinkedTransferQueue q = populatedQueue(SIZE); |
144 |
|
try { |
136 |
– |
LinkedTransferQueue q = populatedQueue(SIZE); |
145 |
|
q.addAll(q); |
146 |
|
shouldThrow(); |
147 |
|
} catch (IllegalArgumentException success) {} |
152 |
|
* NullPointerException after possibly adding some elements |
153 |
|
*/ |
154 |
|
public void testAddAll3() { |
155 |
+ |
LinkedTransferQueue q = new LinkedTransferQueue(); |
156 |
+ |
Integer[] ints = new Integer[SIZE]; |
157 |
+ |
for (int i = 0; i < SIZE - 1; ++i) |
158 |
+ |
ints[i] = i; |
159 |
|
try { |
148 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
149 |
– |
Integer[] ints = new Integer[SIZE]; |
150 |
– |
for (int i = 0; i < SIZE - 1; ++i) { |
151 |
– |
ints[i] = i; |
152 |
– |
} |
160 |
|
q.addAll(Arrays.asList(ints)); |
161 |
|
shouldThrow(); |
162 |
|
} catch (NullPointerException success) {} |
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) { |
206 |
< |
assertEquals(i, q.take()); |
207 |
< |
} |
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); |
259 |
– |
for (int i = 0; i < SIZE; ++i) { |
260 |
– |
long startTime = System.nanoTime(); |
261 |
– |
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
262 |
– |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
263 |
– |
} |
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); |
281 |
|
final CountDownLatch aboutToWait = new CountDownLatch(1); |
282 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
283 |
|
public void realRun() throws InterruptedException { |
284 |
< |
for (int i = 0; i < SIZE; ++i) { |
285 |
< |
long t0 = System.nanoTime(); |
284 |
> |
long startTime = System.nanoTime(); |
285 |
> |
for (int i = 0; i < SIZE; ++i) |
286 |
|
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
282 |
– |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
283 |
– |
} |
284 |
– |
long t0 = System.nanoTime(); |
287 |
|
aboutToWait.countDown(); |
288 |
|
try { |
289 |
< |
q.poll(MEDIUM_DELAY_MS, MILLISECONDS); |
289 |
> |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
290 |
|
shouldThrow(); |
291 |
< |
} catch (InterruptedException success) { |
292 |
< |
assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS); |
291 |
< |
} |
291 |
> |
} catch (InterruptedException success) {} |
292 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
293 |
|
}}); |
294 |
|
|
295 |
< |
aboutToWait.await(); |
296 |
< |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
295 |
> |
await(aboutToWait); |
296 |
> |
assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
297 |
|
t.interrupt(); |
298 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
298 |
> |
awaitTermination(t); |
299 |
|
checkEmpty(q); |
300 |
|
} |
301 |
|
|
307 |
|
final BlockingQueue<Integer> q = populatedQueue(SIZE); |
308 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
309 |
|
public void realRun() throws InterruptedException { |
310 |
+ |
long startTime = System.nanoTime(); |
311 |
|
Thread.currentThread().interrupt(); |
312 |
< |
for (int i = 0; i < SIZE; ++i) { |
311 |
< |
long t0 = System.nanoTime(); |
312 |
> |
for (int i = 0; i < SIZE; ++i) |
313 |
|
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
313 |
– |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
314 |
– |
} |
314 |
|
try { |
315 |
< |
q.poll(MEDIUM_DELAY_MS, MILLISECONDS); |
315 |
> |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
316 |
|
shouldThrow(); |
317 |
|
} catch (InterruptedException success) {} |
318 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
319 |
|
}}); |
320 |
|
|
321 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
321 |
> |
awaitTermination(t); |
322 |
|
checkEmpty(q); |
323 |
|
} |
324 |
|
|
414 |
|
*/ |
415 |
|
public void testContainsAll() { |
416 |
|
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
417 |
< |
LinkedTransferQueue<Integer> p = new LinkedTransferQueue<Integer>(); |
417 |
> |
LinkedTransferQueue<Integer> p = new LinkedTransferQueue<>(); |
418 |
|
for (int i = 0; i < SIZE; ++i) { |
419 |
|
assertTrue(q.containsAll(p)); |
420 |
|
assertFalse(p.containsAll(q)); |
500 |
|
public void testIterator() throws InterruptedException { |
501 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
502 |
|
Iterator it = q.iterator(); |
503 |
< |
int i = 0; |
504 |
< |
while (it.hasNext()) { |
505 |
< |
assertEquals(it.next(), i++); |
506 |
< |
} |
503 |
> |
int i; |
504 |
> |
for (i = 0; it.hasNext(); i++) |
505 |
> |
assertTrue(q.contains(it.next())); |
506 |
|
assertEquals(i, SIZE); |
507 |
+ |
assertIteratorExhausted(it); |
508 |
+ |
|
509 |
+ |
it = q.iterator(); |
510 |
+ |
for (i = 0; it.hasNext(); i++) |
511 |
+ |
assertEquals(it.next(), q.take()); |
512 |
+ |
assertEquals(i, SIZE); |
513 |
+ |
assertIteratorExhausted(it); |
514 |
+ |
} |
515 |
+ |
|
516 |
+ |
/** |
517 |
+ |
* iterator of empty collection has no elements |
518 |
+ |
*/ |
519 |
+ |
public void testEmptyIterator() { |
520 |
+ |
assertIteratorExhausted(new LinkedTransferQueue().iterator()); |
521 |
|
} |
522 |
|
|
523 |
|
/** |
543 |
|
* iterator ordering is FIFO |
544 |
|
*/ |
545 |
|
public void testIteratorOrdering() { |
546 |
< |
final LinkedTransferQueue<Integer> q |
534 |
< |
= new LinkedTransferQueue<Integer>(); |
546 |
> |
final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
547 |
|
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
548 |
|
q.add(one); |
549 |
|
q.add(two); |
588 |
|
public void testOfferInExecutor() { |
589 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
590 |
|
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
591 |
< |
ExecutorService executor = Executors.newFixedThreadPool(2); |
592 |
< |
|
581 |
< |
executor.execute(new CheckedRunnable() { |
582 |
< |
public void realRun() throws InterruptedException { |
583 |
< |
threadsStarted.await(); |
584 |
< |
assertTrue(q.offer(one, LONG_DELAY_MS, MILLISECONDS)); |
585 |
< |
}}); |
591 |
> |
final ExecutorService executor = Executors.newFixedThreadPool(2); |
592 |
> |
try (PoolCleaner cleaner = cleaner(executor)) { |
593 |
|
|
594 |
< |
executor.execute(new CheckedRunnable() { |
595 |
< |
public void realRun() throws InterruptedException { |
596 |
< |
threadsStarted.await(); |
597 |
< |
assertSame(one, q.take()); |
598 |
< |
checkEmpty(q); |
599 |
< |
}}); |
594 |
> |
executor.execute(new CheckedRunnable() { |
595 |
> |
public void realRun() throws InterruptedException { |
596 |
> |
threadsStarted.await(); |
597 |
> |
long startTime = System.nanoTime(); |
598 |
> |
assertTrue(q.offer(one, LONG_DELAY_MS, MILLISECONDS)); |
599 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
600 |
> |
}}); |
601 |
|
|
602 |
< |
joinPool(executor); |
602 |
> |
executor.execute(new CheckedRunnable() { |
603 |
> |
public void realRun() throws InterruptedException { |
604 |
> |
threadsStarted.await(); |
605 |
> |
assertSame(one, q.take()); |
606 |
> |
checkEmpty(q); |
607 |
> |
}}); |
608 |
> |
} |
609 |
|
} |
610 |
|
|
611 |
|
/** |
614 |
|
public void testPollInExecutor() { |
615 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
616 |
|
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
617 |
< |
ExecutorService executor = Executors.newFixedThreadPool(2); |
617 |
> |
final ExecutorService executor = Executors.newFixedThreadPool(2); |
618 |
> |
try (PoolCleaner cleaner = cleaner(executor)) { |
619 |
|
|
620 |
< |
executor.execute(new CheckedRunnable() { |
621 |
< |
public void realRun() throws InterruptedException { |
622 |
< |
assertNull(q.poll()); |
623 |
< |
threadsStarted.await(); |
624 |
< |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
625 |
< |
checkEmpty(q); |
626 |
< |
}}); |
627 |
< |
|
628 |
< |
executor.execute(new CheckedRunnable() { |
614 |
< |
public void realRun() throws InterruptedException { |
615 |
< |
threadsStarted.await(); |
616 |
< |
q.put(one); |
617 |
< |
}}); |
620 |
> |
executor.execute(new CheckedRunnable() { |
621 |
> |
public void realRun() throws InterruptedException { |
622 |
> |
assertNull(q.poll()); |
623 |
> |
threadsStarted.await(); |
624 |
> |
long startTime = System.nanoTime(); |
625 |
> |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
626 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
627 |
> |
checkEmpty(q); |
628 |
> |
}}); |
629 |
|
|
630 |
< |
joinPool(executor); |
630 |
> |
executor.execute(new CheckedRunnable() { |
631 |
> |
public void realRun() throws InterruptedException { |
632 |
> |
threadsStarted.await(); |
633 |
> |
q.put(one); |
634 |
> |
}}); |
635 |
> |
} |
636 |
|
} |
637 |
|
|
638 |
|
/** |
693 |
|
assertTrue(l.size() >= SIZE); |
694 |
|
for (int i = 0; i < SIZE; ++i) |
695 |
|
assertEquals(i, l.get(i)); |
696 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
696 |
> |
awaitTermination(t); |
697 |
|
assertTrue(q.size() + l.size() >= SIZE); |
698 |
|
} |
699 |
|
|
730 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
731 |
|
public void realRun() throws InterruptedException { |
732 |
|
threadStarted.countDown(); |
733 |
+ |
long startTime = System.nanoTime(); |
734 |
|
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
735 |
|
assertEquals(0, q.getWaitingConsumerCount()); |
736 |
|
assertFalse(q.hasWaitingConsumer()); |
737 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
738 |
|
}}); |
739 |
|
|
740 |
|
threadStarted.await(); |
741 |
< |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
742 |
< |
assertEquals(1, q.getWaitingConsumerCount()); |
743 |
< |
assertTrue(q.hasWaitingConsumer()); |
741 |
> |
Callable<Boolean> oneConsumer |
742 |
> |
= new Callable<Boolean>() { public Boolean call() { |
743 |
> |
return q.hasWaitingConsumer() |
744 |
> |
&& q.getWaitingConsumerCount() == 1; }}; |
745 |
> |
waitForThreadToEnterWaitState(t, oneConsumer); |
746 |
|
|
747 |
|
assertTrue(q.offer(one)); |
748 |
|
assertEquals(0, q.getWaitingConsumerCount()); |
749 |
|
assertFalse(q.hasWaitingConsumer()); |
750 |
|
|
751 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
751 |
> |
awaitTermination(t); |
752 |
|
} |
753 |
|
|
754 |
|
/** |
764 |
|
|
765 |
|
/** |
766 |
|
* transfer waits until a poll occurs. The transfered element |
767 |
< |
* is returned by this associated poll. |
767 |
> |
* is returned by the associated poll. |
768 |
|
*/ |
769 |
|
public void testTransfer2() throws InterruptedException { |
770 |
< |
final LinkedTransferQueue<Integer> q |
751 |
< |
= new LinkedTransferQueue<Integer>(); |
770 |
> |
final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
771 |
|
final CountDownLatch threadStarted = new CountDownLatch(1); |
772 |
|
|
773 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
778 |
|
}}); |
779 |
|
|
780 |
|
threadStarted.await(); |
781 |
< |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
782 |
< |
assertEquals(1, q.size()); |
781 |
> |
Callable<Boolean> oneElement |
782 |
> |
= new Callable<Boolean>() { public Boolean call() { |
783 |
> |
return !q.isEmpty() && q.size() == 1; }}; |
784 |
> |
waitForThreadToEnterWaitState(t, oneElement); |
785 |
> |
|
786 |
|
assertSame(five, q.poll()); |
787 |
|
checkEmpty(q); |
788 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
788 |
> |
awaitTermination(t); |
789 |
|
} |
790 |
|
|
791 |
|
/** |
792 |
|
* transfer waits until a poll occurs, and then transfers in fifo order |
793 |
|
*/ |
794 |
|
public void testTransfer3() throws InterruptedException { |
795 |
< |
final LinkedTransferQueue<Integer> q |
774 |
< |
= new LinkedTransferQueue<Integer>(); |
795 |
> |
final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
796 |
|
|
797 |
|
Thread first = newStartedThread(new CheckedRunnable() { |
798 |
|
public void realRun() throws InterruptedException { |
799 |
|
q.transfer(four); |
800 |
< |
assertTrue(!q.contains(four)); |
800 |
> |
assertFalse(q.contains(four)); |
801 |
|
assertEquals(1, q.size()); |
802 |
|
}}); |
803 |
|
|
840 |
|
assertEquals(1, q.size()); |
841 |
|
assertTrue(q.offer(three)); |
842 |
|
assertSame(four, q.poll()); |
843 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
843 |
> |
awaitTermination(t); |
844 |
|
} |
845 |
|
|
846 |
|
/** |
847 |
|
* transfer waits until a take occurs. The transfered element |
848 |
< |
* is returned by this associated take. |
848 |
> |
* is returned by the associated take. |
849 |
|
*/ |
850 |
|
public void testTransfer5() throws InterruptedException { |
851 |
< |
final LinkedTransferQueue<Integer> q |
831 |
< |
= new LinkedTransferQueue<Integer>(); |
851 |
> |
final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
852 |
|
|
853 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
854 |
|
public void realRun() throws InterruptedException { |
862 |
|
assertEquals(1, q.size()); |
863 |
|
assertSame(four, q.take()); |
864 |
|
checkEmpty(q); |
865 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
865 |
> |
awaitTermination(t); |
866 |
|
} |
867 |
|
|
868 |
|
/** |
869 |
|
* tryTransfer(null) throws NullPointerException |
870 |
|
*/ |
871 |
|
public void testTryTransfer1() { |
872 |
+ |
final LinkedTransferQueue q = new LinkedTransferQueue(); |
873 |
|
try { |
853 |
– |
final LinkedTransferQueue q = new LinkedTransferQueue(); |
874 |
|
q.tryTransfer(null); |
875 |
|
shouldThrow(); |
876 |
|
} catch (NullPointerException success) {} |
904 |
|
assertTrue(q.tryTransfer(hotPotato)); |
905 |
|
}}); |
906 |
|
|
907 |
< |
assertSame(hotPotato, q.poll(MEDIUM_DELAY_MS, MILLISECONDS)); |
907 |
> |
long startTime = System.nanoTime(); |
908 |
> |
assertSame(hotPotato, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
909 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
910 |
|
checkEmpty(q); |
911 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
911 |
> |
awaitTermination(t); |
912 |
|
} |
913 |
|
|
914 |
|
/** |
930 |
|
|
931 |
|
assertSame(q.take(), hotPotato); |
932 |
|
checkEmpty(q); |
933 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
933 |
> |
awaitTermination(t); |
934 |
|
} |
935 |
|
|
936 |
|
/** |
943 |
|
|
944 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
945 |
|
public void realRun() throws InterruptedException { |
946 |
+ |
long startTime = System.nanoTime(); |
947 |
|
Thread.currentThread().interrupt(); |
948 |
|
try { |
949 |
|
q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS); |
957 |
|
shouldThrow(); |
958 |
|
} catch (InterruptedException success) {} |
959 |
|
assertFalse(Thread.interrupted()); |
960 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
961 |
|
}}); |
962 |
|
|
963 |
|
await(pleaseInterrupt); |
975 |
|
|
976 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
977 |
|
public void realRun() throws InterruptedException { |
978 |
< |
long t0 = System.nanoTime(); |
978 |
> |
long startTime = System.nanoTime(); |
979 |
|
assertFalse(q.tryTransfer(new Object(), |
980 |
|
timeoutMillis(), MILLISECONDS)); |
981 |
< |
assertTrue(millisElapsedSince(t0) >= timeoutMillis()); |
981 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
982 |
|
checkEmpty(q); |
983 |
|
}}); |
984 |
|
|
996 |
|
|
997 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
998 |
|
public void realRun() throws InterruptedException { |
999 |
< |
assertTrue(q.tryTransfer(five, MEDIUM_DELAY_MS, MILLISECONDS)); |
999 |
> |
long startTime = System.nanoTime(); |
1000 |
> |
assertTrue(q.tryTransfer(five, LONG_DELAY_MS, MILLISECONDS)); |
1001 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
1002 |
|
checkEmpty(q); |
1003 |
|
}}); |
1004 |
|
|
1008 |
|
assertSame(four, q.poll()); |
1009 |
|
assertSame(five, q.poll()); |
1010 |
|
checkEmpty(q); |
1011 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
1011 |
> |
awaitTermination(t); |
1012 |
|
} |
1013 |
|
|
1014 |
|
/** |
1019 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
1020 |
|
assertTrue(q.offer(four)); |
1021 |
|
assertEquals(1, q.size()); |
1022 |
< |
long t0 = System.nanoTime(); |
1022 |
> |
long startTime = System.nanoTime(); |
1023 |
|
assertFalse(q.tryTransfer(five, timeoutMillis(), MILLISECONDS)); |
1024 |
< |
assertTrue(millisElapsedSince(t0) >= timeoutMillis()); |
1024 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
1025 |
|
assertEquals(1, q.size()); |
1026 |
|
assertSame(four, q.poll()); |
1027 |
|
assertNull(q.poll()); |
1029 |
|
} |
1030 |
|
|
1031 |
|
private LinkedTransferQueue<Integer> populatedQueue(int n) { |
1032 |
< |
LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>(); |
1032 |
> |
LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
1033 |
|
checkEmpty(q); |
1034 |
|
for (int i = 0; i < n; i++) { |
1035 |
|
assertEquals(i, q.size()); |