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); |
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 |
548 |
< |
= 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); |
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() { |
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 { |
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 { |
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()); |