44 |
|
} |
45 |
|
|
46 |
|
/** |
47 |
< |
* Create a deque of given size containing consecutive |
47 |
> |
* Creates a deque of given size containing consecutive |
48 |
|
* Integers 0 ... n. |
49 |
|
*/ |
50 |
|
private LinkedBlockingDeque<Integer> populatedDeque(int n) { |
622 |
|
}}); |
623 |
|
|
624 |
|
await(pleaseTake); |
625 |
< |
assertEquals(q.remainingCapacity(), 0); |
625 |
> |
assertEquals(0, q.remainingCapacity()); |
626 |
|
assertEquals(0, q.take()); |
627 |
|
|
628 |
|
await(pleaseInterrupt); |
629 |
|
assertThreadStaysAlive(t); |
630 |
|
t.interrupt(); |
631 |
|
awaitTermination(t); |
632 |
< |
assertEquals(q.remainingCapacity(), 0); |
632 |
> |
assertEquals(0, q.remainingCapacity()); |
633 |
|
} |
634 |
|
|
635 |
|
/** |
854 |
|
}}); |
855 |
|
|
856 |
|
await(pleaseTake); |
857 |
< |
assertEquals(q.remainingCapacity(), 0); |
857 |
> |
assertEquals(0, q.remainingCapacity()); |
858 |
|
assertEquals(capacity - 1, q.take()); |
859 |
|
|
860 |
|
await(pleaseInterrupt); |
861 |
|
assertThreadStaysAlive(t); |
862 |
|
t.interrupt(); |
863 |
|
awaitTermination(t); |
864 |
< |
assertEquals(q.remainingCapacity(), 0); |
864 |
> |
assertEquals(0, q.remainingCapacity()); |
865 |
|
} |
866 |
|
|
867 |
|
/** |
1201 |
|
}}); |
1202 |
|
|
1203 |
|
await(pleaseTake); |
1204 |
< |
assertEquals(q.remainingCapacity(), 0); |
1204 |
> |
assertEquals(0, q.remainingCapacity()); |
1205 |
|
assertEquals(0, q.take()); |
1206 |
|
|
1207 |
|
await(pleaseInterrupt); |
1208 |
|
assertThreadStaysAlive(t); |
1209 |
|
t.interrupt(); |
1210 |
|
awaitTermination(t); |
1211 |
< |
assertEquals(q.remainingCapacity(), 0); |
1211 |
> |
assertEquals(0, q.remainingCapacity()); |
1212 |
|
} |
1213 |
|
|
1214 |
|
/** |
1479 |
|
/** |
1480 |
|
* toArray contains all elements in FIFO order |
1481 |
|
*/ |
1482 |
< |
public void testToArray() throws InterruptedException{ |
1482 |
> |
public void testToArray() throws InterruptedException { |
1483 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
1484 |
|
Object[] o = q.toArray(); |
1485 |
|
for (int i = 0; i < o.length; i++) |
1718 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
1719 |
|
ArrayList l = new ArrayList(); |
1720 |
|
q.drainTo(l); |
1721 |
< |
assertEquals(q.size(), 0); |
1722 |
< |
assertEquals(l.size(), SIZE); |
1721 |
> |
assertEquals(0, q.size()); |
1722 |
> |
assertEquals(SIZE, l.size()); |
1723 |
|
for (int i = 0; i < SIZE; ++i) |
1724 |
|
assertEquals(l.get(i), new Integer(i)); |
1725 |
|
q.add(zero); |
1729 |
|
assertTrue(q.contains(one)); |
1730 |
|
l.clear(); |
1731 |
|
q.drainTo(l); |
1732 |
< |
assertEquals(q.size(), 0); |
1733 |
< |
assertEquals(l.size(), 2); |
1732 |
> |
assertEquals(0, q.size()); |
1733 |
> |
assertEquals(2, l.size()); |
1734 |
|
for (int i = 0; i < 2; ++i) |
1735 |
|
assertEquals(l.get(i), new Integer(i)); |
1736 |
|
} |
1766 |
|
ArrayList l = new ArrayList(); |
1767 |
|
q.drainTo(l, i); |
1768 |
|
int k = (i < SIZE) ? i : SIZE; |
1769 |
< |
assertEquals(l.size(), k); |
1770 |
< |
assertEquals(q.size(), SIZE-k); |
1769 |
> |
assertEquals(k, l.size()); |
1770 |
> |
assertEquals(SIZE-k, q.size()); |
1771 |
|
for (int j = 0; j < k; ++j) |
1772 |
|
assertEquals(l.get(j), new Integer(j)); |
1773 |
|
while (q.poll() != null) ; |