48 |
|
|
49 |
|
/** |
50 |
|
* Returns a new deque of given size containing consecutive |
51 |
< |
* Integers 0 ... n. |
51 |
> |
* Integers 0 ... n - 1. |
52 |
|
*/ |
53 |
|
private LinkedBlockingDeque<Integer> populatedDeque(int n) { |
54 |
|
LinkedBlockingDeque<Integer> q = |
59 |
|
assertFalse(q.isEmpty()); |
60 |
|
assertEquals(0, q.remainingCapacity()); |
61 |
|
assertEquals(n, q.size()); |
62 |
+ |
assertEquals((Integer) 0, q.peekFirst()); |
63 |
+ |
assertEquals((Integer) (n - 1), q.peekLast()); |
64 |
|
return q; |
65 |
|
} |
66 |
|
|
767 |
|
}}); |
768 |
|
|
769 |
|
aboutToWait.await(); |
770 |
< |
waitForThreadToEnterWaitState(t, LONG_DELAY_MS); |
770 |
> |
waitForThreadToEnterWaitState(t); |
771 |
|
t.interrupt(); |
772 |
|
awaitTermination(t); |
773 |
|
checkEmpty(q); |