44 |
|
} |
45 |
|
|
46 |
|
/** |
47 |
< |
* Create a deque of given size containing consecutive |
47 |
> |
* Returns a new deque of given size containing consecutive |
48 |
|
* Integers 0 ... n. |
49 |
|
*/ |
50 |
|
private LinkedBlockingDeque<Integer> populatedDeque(int n) { |
1064 |
|
|
1065 |
|
pleaseInterrupt.countDown(); |
1066 |
|
try { |
1067 |
< |
q.pollFirst(SMALL_DELAY_MS, MILLISECONDS); |
1067 |
> |
q.pollFirst(LONG_DELAY_MS, MILLISECONDS); |
1068 |
|
shouldThrow(); |
1069 |
|
} catch (InterruptedException success) {} |
1070 |
|
assertFalse(Thread.interrupted()); |
1700 |
|
Queue x = populatedDeque(SIZE); |
1701 |
|
Queue y = serialClone(x); |
1702 |
|
|
1703 |
< |
assertTrue(x != y); |
1703 |
> |
assertNotSame(y, x); |
1704 |
|
assertEquals(x.size(), y.size()); |
1705 |
|
assertEquals(x.toString(), y.toString()); |
1706 |
|
assertTrue(Arrays.equals(x.toArray(), y.toArray())); |