25 |
|
* <tt>Deque</tt> implementations; in most implementations, insert |
26 |
|
* operations cannot fail. |
27 |
|
* |
28 |
< |
* <p>The twelve methods described above are are summarized in the |
28 |
> |
* <p>The twelve methods described above are are summarized in the |
29 |
|
* follwoing table:<p> |
30 |
< |
* |
30 |
> |
* |
31 |
|
* <table BORDER CELLPADDING=3 CELLSPACING=1> |
32 |
|
* <tr> |
33 |
|
* <td></td> |
145 |
|
* take advantage of the ability to insert nulls. This is so because |
146 |
|
* <tt>null</tt> is used as a special return value by various methods |
147 |
|
* to indicated that the deque is empty. |
148 |
< |
* |
148 |
> |
* |
149 |
|
* <p><tt>Deque</tt> implementations generally do not define |
150 |
|
* element-based versions of the <tt>equals</tt> and <tt>hashCode</tt> |
151 |
|
* methods, but instead inherit the identity-based versions from class |
339 |
|
/** |
340 |
|
* Inserts the specified element into the queue represented by this |
341 |
|
* deque unless it would violate capacity restrictions. In other words, |
342 |
< |
* inserts the specified element as the last element of this deque. |
342 |
> |
* inserts the specified element as the last element of this deque. |
343 |
|
* |
344 |
|
* <p>This method is equivalent to {@link #addLast}. |
345 |
|
* |
435 |
|
/** |
436 |
|
* Returns an iterator over the elements in this deque. The elements |
437 |
|
* will be ordered from first (head) to last (tail). |
438 |
< |
* |
438 |
> |
* |
439 |
|
* @return an <tt>Iterator</tt> over the elements in this deque |
440 |
|
*/ |
441 |
|
Iterator<E> iterator(); |