52 |
|
implements Deque<E>, Cloneable, Serializable |
53 |
|
{ |
54 |
|
/** |
55 |
< |
* The array in which the elements of in the deque are stored. |
55 |
> |
* The array in which the elements of the deque are stored. |
56 |
|
* The capacity of the deque is the length of this array, which is |
57 |
|
* always a power of two. The array is never allowed to become |
58 |
|
* full, except transiently within an addX method where it is |
147 |
|
} |
148 |
|
|
149 |
|
/** |
150 |
< |
* Constructs an empty array deque with the an initial capacity |
150 |
> |
* Constructs an empty array deque with an initial capacity |
151 |
|
* sufficient to hold 16 elements. |
152 |
|
*/ |
153 |
|
public ArrayDeque() { |