39 |
|
* Returns a new deque of given size containing consecutive |
40 |
|
* Integers 0 ... n - 1. |
41 |
|
*/ |
42 |
< |
private ConcurrentLinkedDeque<Integer> populatedDeque(int n) { |
42 |
> |
private static ConcurrentLinkedDeque<Integer> populatedDeque(int n) { |
43 |
|
ConcurrentLinkedDeque<Integer> q = new ConcurrentLinkedDeque<>(); |
44 |
|
assertTrue(q.isEmpty()); |
45 |
|
for (int i = 0; i < n; ++i) |
312 |
|
} |
313 |
|
|
314 |
|
/** |
315 |
< |
* addAll(this) throws IAE |
315 |
> |
* addAll(this) throws IllegalArgumentException |
316 |
|
*/ |
317 |
|
public void testAddAllSelf() { |
318 |
|
ConcurrentLinkedDeque q = populatedDeque(SIZE); |
862 |
|
} |
863 |
|
|
864 |
|
/** |
865 |
< |
* A deserialized serialized deque has same elements in same order |
865 |
> |
* A deserialized/reserialized deque has same elements in same order |
866 |
|
*/ |
867 |
|
public void testSerialization() throws Exception { |
868 |
|
Queue x = populatedDeque(SIZE); |